↑ Up

SPASS---3.9.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : FLD060-2 : TPTP v8.1.0. Bugfixed v2.1.0.
% Transfm  : none
% Format   : tptp
% Command  : run_spass %d %s

% Computer : n017.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 600s
% DateTime : Sat Jul 16 02:28:35 EDT 2022

% Result   : Unsatisfiable 183.24s 183.61s
% Output   : Refutation 183.24s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.15  % Problem  : FLD060-2 : TPTP v8.1.0. Bugfixed v2.1.0.
% 0.05/0.16  % Command  : run_spass %d %s
% 0.14/0.38  % Computer : n017.cluster.edu
% 0.14/0.38  % Model    : x86_64 x86_64
% 0.14/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.38  % Memory   : 8042.1875MB
% 0.14/0.38  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.38  % CPULimit : 300
% 0.14/0.38  % WCLimit  : 600
% 0.14/0.38  % DateTime : Tue Jun  7 00:17:47 EDT 2022
% 0.14/0.38  % CPUTime  : 
% 183.24/183.61  
% 183.24/183.61  SPASS V 3.9 
% 183.24/183.61  SPASS beiseite: Proof found.
% 183.24/183.61  % SZS status Theorem
% 183.24/183.61  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 183.24/183.61  SPASS derived 27793 clauses, backtracked 0 clauses, performed 0 splits and kept 19062 clauses.
% 183.24/183.61  SPASS allocated 103847 KBytes.
% 183.24/183.61  SPASS spent	0:03:01.10 on the problem.
% 183.24/183.61  		0:00:00.04 for the input.
% 183.24/183.61  		0:00:00.00 for the FLOTTER CNF translation.
% 183.24/183.61  		0:00:00.53 for inferences.
% 183.24/183.61  		0:00:00.00 for the backtracking.
% 183.24/183.61  		0:03:00.14 for the reduction.
% 183.24/183.61  
% 183.24/183.61  
% 183.24/183.61  Here is a proof with depth 4, length 31 :
% 183.24/183.61  % SZS output start Refutation
% 183.24/183.61  1[0:Inp] ||  -> defined(a)*.
% 183.24/183.61  2[0:Inp] ||  -> defined(b)*.
% 183.24/183.61  4[0:Inp] ||  -> defined(v__dfg)*.
% 183.24/183.61  5[0:Inp] ||  -> equalish(add(a,a),u__dfg)*l.
% 183.24/183.61  6[0:Inp] ||  -> equalish(add(b,b),v__dfg)*l.
% 183.24/183.61  7[0:Inp] ||  -> less_or_equal(a,b)*l.
% 183.24/183.61  8[0:Inp] || less_or_equal(u__dfg,v__dfg)*l -> .
% 183.24/183.61  12[0:Inp] defined(u) defined(v) ||  -> equalish(add(v,u),add(u,v))*.
% 183.24/183.61  25[0:Inp] || less_or_equal(u,v)* less_or_equal(v,w)* -> less_or_equal(u,w)*.
% 183.24/183.61  26[0:Inp] defined(u) defined(v) ||  -> less_or_equal(u,v)* less_or_equal(v,u)*.
% 183.24/183.61  27[0:Inp] defined(u) || less_or_equal(v,w) -> less_or_equal(add(v,u),add(w,u))*.
% 183.24/183.61  30[0:Inp] || equalish(u,v)* -> equalish(v,u).
% 183.24/183.61  34[0:Inp] || equalish(u,v)*+ less_or_equal(u,w)* -> less_or_equal(v,w)*.
% 183.24/183.61  39[0:Res:7.0,27.1] defined(u) ||  -> less_or_equal(add(a,u),add(b,u))*l.
% 183.24/183.61  43[0:Res:6.0,30.0] ||  -> equalish(v__dfg,add(b,b))*r.
% 183.24/183.61  48[0:Res:5.0,34.1] || less_or_equal(add(a,a),u)* -> less_or_equal(u__dfg,u).
% 183.24/183.61  52[0:Res:48.1,8.0] || less_or_equal(add(a,a),v__dfg)*l -> .
% 183.24/183.61  66[0:NCh:25.2,25.0,39.1,52.0] defined(a) || less_or_equal(add(b,a),v__dfg)*l -> .
% 183.24/183.61  67[0:SSi:66.0,1.0] || less_or_equal(add(b,a),v__dfg)*l -> .
% 183.24/183.61  183[0:Fac:26.2,26.3] defined(u) defined(u) ||  -> less_or_equal(u,u)*.
% 183.24/183.61  244[0:Obv:183.0] defined(u) ||  -> less_or_equal(u,u)*.
% 183.24/183.61  641[0:Res:12.2,34.0] defined(u) defined(v) || less_or_equal(add(v,u),w)*+ -> less_or_equal(add(u,v),w)*.
% 183.24/183.61  649[0:Res:43.0,34.0] || less_or_equal(v__dfg,u)*+ -> less_or_equal(add(b,b),u)*.
% 183.24/183.61  6201[0:Res:39.1,641.2] defined(u) defined(u) defined(a) ||  -> less_or_equal(add(u,a),add(b,u))*.
% 183.24/183.61  6232[0:Obv:6201.0] defined(u) defined(a) ||  -> less_or_equal(add(u,a),add(b,u))*.
% 183.24/183.61  6233[0:SSi:6232.1,1.0] defined(u) ||  -> less_or_equal(add(u,a),add(b,u))*.
% 183.24/183.61  29699[0:NCh:25.2,25.0,6233.1,67.0] defined(b) || less_or_equal(add(b,b),v__dfg)*l -> .
% 183.24/183.61  29768[0:SSi:29699.0,2.0] || less_or_equal(add(b,b),v__dfg)*l -> .
% 183.24/183.61  35593[0:Res:244.1,649.0] defined(v__dfg) ||  -> less_or_equal(add(b,b),v__dfg)*l.
% 183.24/183.61  35717[0:SSi:35593.0,4.0] ||  -> less_or_equal(add(b,b),v__dfg)*l.
% 183.24/183.61  35718[0:MRR:35717.0,29768.0] ||  -> .
% 183.24/183.61  % SZS output end Refutation
% 183.24/183.61  Formulae used in the proof : a_is_defined b_is_defined v_is_defined add_equals_u_5 add_equals_v_6 less_or_equal_7 not_less_or_equal_8 commutativity_addition transitivity_of_order_relation totality_of_order_relation compatibility_of_order_relation_and_addition symmetry_of_equality compatibility_of_equality_and_order_relation
% 183.24/183.61  
%------------------------------------------------------------------------------