TSTP Solution File: FLD067-2 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : FLD067-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:37 EDT 2022
% Result : Unsatisfiable 231.21s 231.51s
% Output : Refutation 231.21s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : FLD067-2 : TPTP v8.1.0. Bugfixed v2.1.0.
% 0.03/0.13 % Command : run_spass %d %s
% 0.14/0.34 % Computer : n017.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Mon Jun 6 20:45:02 EDT 2022
% 0.14/0.35 % CPUTime :
% 231.21/231.51
% 231.21/231.51 SPASS V 3.9
% 231.21/231.51 SPASS beiseite: Proof found.
% 231.21/231.51 % SZS status Theorem
% 231.21/231.51 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 231.21/231.51 SPASS derived 30605 clauses, backtracked 2861 clauses, performed 3 splits and kept 23579 clauses.
% 231.21/231.51 SPASS allocated 107083 KBytes.
% 231.21/231.51 SPASS spent 0:3:48.27 on the problem.
% 231.21/231.51 0:00:00.03 for the input.
% 231.21/231.51 0:00:00.00 for the FLOTTER CNF translation.
% 231.21/231.51 0:00:00.52 for inferences.
% 231.21/231.51 0:00:00.74 for the backtracking.
% 231.21/231.51 0:3:46.57 for the reduction.
% 231.21/231.51
% 231.21/231.51
% 231.21/231.51 Here is a proof with depth 3, length 24 :
% 231.21/231.51 % SZS output start Refutation
% 231.21/231.51 1[0:Inp] || -> defined(a)*.
% 231.21/231.51 3[0:Inp] || -> defined(u__dfg)*.
% 231.21/231.51 4[0:Inp] || -> less_or_equal(a,b)*l.
% 231.21/231.51 5[0:Inp] || -> equalish(add(b,additive_inverse(a)),u__dfg)*l.
% 231.21/231.51 6[0:Inp] || less_or_equal(additive_identity,u__dfg)*r -> .
% 231.21/231.51 9[0:Inp] defined(u) || -> equalish(add(u,additive_inverse(u)),additive_identity)*l.
% 231.21/231.51 18[0:Inp] defined(u) || -> defined(additive_inverse(u))*.
% 231.21/231.51 23[0:Inp] || less_or_equal(u,v)* less_or_equal(v,w)* -> less_or_equal(u,w)*.
% 231.21/231.51 24[0:Inp] defined(u) defined(v) || -> less_or_equal(u,v)* less_or_equal(v,u)*.
% 231.21/231.51 25[0:Inp] defined(u) || less_or_equal(v,w) -> less_or_equal(add(v,u),add(w,u))*.
% 231.21/231.51 28[0:Inp] || equalish(u,v)* -> equalish(v,u).
% 231.21/231.51 32[0:Inp] || equalish(u,v)*+ less_or_equal(u,w)* -> less_or_equal(v,w)*.
% 231.21/231.51 37[0:Res:4.0,25.1] defined(u) || -> less_or_equal(add(a,u),add(b,u))*l.
% 231.21/231.51 39[0:Res:32.2,6.0] || equalish(u,additive_identity)*+ less_or_equal(u,u__dfg)* -> .
% 231.21/231.51 41[0:Res:5.0,28.0] || -> equalish(u__dfg,add(b,additive_inverse(a)))*r.
% 231.21/231.51 166[0:Res:9.1,39.0] defined(u) || less_or_equal(add(u,additive_inverse(u)),u__dfg)*l -> .
% 231.21/231.51 186[0:Fac:24.2,24.3] defined(u) defined(u) || -> less_or_equal(u,u)*.
% 231.21/231.51 237[0:Obv:186.0] defined(u) || -> less_or_equal(u,u)*.
% 231.21/231.51 335[0:NCh:23.2,23.0,166.1,37.1] defined(a) defined(additive_inverse(a)) || less_or_equal(add(b,additive_inverse(a)),u__dfg)*l -> .
% 231.21/231.51 339[0:SSi:335.1,335.0,18.0,1.0,1.1] || less_or_equal(add(b,additive_inverse(a)),u__dfg)*l -> .
% 231.21/231.51 593[0:Res:41.0,32.0] || less_or_equal(u__dfg,u)*+ -> less_or_equal(add(b,additive_inverse(a)),u)*.
% 231.21/231.51 38798[0:Res:237.1,593.0] defined(u__dfg) || -> less_or_equal(add(b,additive_inverse(a)),u__dfg)*l.
% 231.21/231.51 39111[0:SSi:38798.0,3.0] || -> less_or_equal(add(b,additive_inverse(a)),u__dfg)*l.
% 231.21/231.51 39112[0:MRR:39111.0,339.0] || -> .
% 231.21/231.51 % SZS output end Refutation
% 231.21/231.51 Formulae used in the proof : a_is_defined u_is_defined less_or_equal_4 add_equals_u_5 not_less_or_equal_6 existence_of_inverse_addition well_definedness_of_additive_inverse transitivity_of_order_relation totality_of_order_relation compatibility_of_order_relation_and_addition symmetry_of_equality compatibility_of_equality_and_order_relation
% 231.21/231.51
%------------------------------------------------------------------------------