TSTP Solution File: FLD013-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : FLD013-1 : TPTP v8.1.0. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n019.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:16 EDT 2022
% Result : Unsatisfiable 0.19s 0.44s
% Output : Refutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : FLD013-1 : TPTP v8.1.0. Bugfixed v2.1.0.
% 0.03/0.13 % Command : run_spass %d %s
% 0.12/0.34 % Computer : n019.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Mon Jun 6 11:34:10 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.44
% 0.19/0.44 SPASS V 3.9
% 0.19/0.44 SPASS beiseite: Proof found.
% 0.19/0.44 % SZS status Theorem
% 0.19/0.44 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.44 SPASS derived 176 clauses, backtracked 0 clauses, performed 0 splits and kept 141 clauses.
% 0.19/0.44 SPASS allocated 75870 KBytes.
% 0.19/0.44 SPASS spent 0:00:00.09 on the problem.
% 0.19/0.44 0:00:00.04 for the input.
% 0.19/0.44 0:00:00.00 for the FLOTTER CNF translation.
% 0.19/0.44 0:00:00.01 for inferences.
% 0.19/0.44 0:00:00.00 for the backtracking.
% 0.19/0.44 0:00:00.02 for the reduction.
% 0.19/0.44
% 0.19/0.44
% 0.19/0.44 Here is a proof with depth 4, length 16 :
% 0.19/0.44 % SZS output start Refutation
% 0.19/0.44 2[0:Inp] || -> defined(b)*.
% 0.19/0.44 3[0:Inp] || -> defined(c)*.
% 0.19/0.44 5[0:Inp] || -> equalish(a,b)*l.
% 0.19/0.44 6[0:Inp] || -> equalish(c,d)*l.
% 0.19/0.44 7[0:Inp] || equalish(add(a,c),add(d,b))*l -> .
% 0.19/0.44 11[0:Inp] defined(u) defined(v) || -> equalish(add(v,u),add(u,v))*.
% 0.19/0.44 30[0:Inp] || equalish(u,v)* equalish(v,w)* -> equalish(u,w)*.
% 0.19/0.44 31[0:Inp] defined(u) || equalish(v,w) -> equalish(add(v,u),add(w,u))*.
% 0.19/0.44 37[0:Res:6.0,31.1] defined(u) || -> equalish(add(c,u),add(d,u))*l.
% 0.19/0.44 41[0:Res:5.0,31.1] defined(u) || -> equalish(add(a,u),add(b,u))*l.
% 0.19/0.44 57[0:NCh:30.2,30.0,41.1,7.0] defined(c) || equalish(add(b,c),add(d,b))*l -> .
% 0.19/0.44 58[0:SSi:57.0,3.0] || equalish(add(b,c),add(d,b))*l -> .
% 0.19/0.44 128[0:NCh:30.2,30.0,11.2,58.0] defined(c) defined(b) || equalish(add(c,b),add(d,b))*l -> .
% 0.19/0.44 137[0:SSi:128.1,128.0,2.0,3.0] || equalish(add(c,b),add(d,b))*l -> .
% 0.19/0.44 280[0:Res:37.1,137.0] defined(b) || -> .
% 0.19/0.44 288[0:SSi:280.0,2.0] || -> .
% 0.19/0.44 % SZS output end Refutation
% 0.19/0.44 Formulae used in the proof : b_is_defined c_is_defined a_equals_b_5 c_equals_d_6 add_not_equal_to_add_7 commutativity_addition transitivity_of_equality compatibility_of_equality_and_addition
% 0.19/0.44
%------------------------------------------------------------------------------