TSTP Solution File: FLD059-4 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : FLD059-4 : TPTP v8.1.0. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n023.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:34 EDT 2022
% Result : Unsatisfiable 0.19s 0.42s
% Output : Refutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : FLD059-4 : TPTP v8.1.0. Bugfixed v2.1.0.
% 0.11/0.12 % Command : run_spass %d %s
% 0.12/0.33 % Computer : n023.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Mon Jun 6 23:28:39 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.42
% 0.19/0.42 SPASS V 3.9
% 0.19/0.42 SPASS beiseite: Proof found.
% 0.19/0.42 % SZS status Theorem
% 0.19/0.42 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.42 SPASS derived 82 clauses, backtracked 0 clauses, performed 0 splits and kept 89 clauses.
% 0.19/0.42 SPASS allocated 75719 KBytes.
% 0.19/0.42 SPASS spent 0:00:00.07 on the problem.
% 0.19/0.42 0:00:00.03 for the input.
% 0.19/0.42 0:00:00.00 for the FLOTTER CNF translation.
% 0.19/0.42 0:00:00.00 for inferences.
% 0.19/0.42 0:00:00.00 for the backtracking.
% 0.19/0.42 0:00:00.01 for the reduction.
% 0.19/0.42
% 0.19/0.42
% 0.19/0.42 Here is a proof with depth 4, length 13 :
% 0.19/0.42 % SZS output start Refutation
% 0.19/0.42 1[0:Inp] || -> defined(a)*.
% 0.19/0.42 3[0:Inp] || -> less_or_equal(additive_identity,a)*r.
% 0.19/0.42 4[0:Inp] || -> sum__dfg(a,a,u__dfg)*.
% 0.19/0.42 5[0:Inp] || less_or_equal(additive_identity,u__dfg)*r -> .
% 0.19/0.42 8[0:Inp] defined(u) || -> sum__dfg(additive_identity,u,u)*.
% 0.19/0.42 27[0:Inp] || less_or_equal(u,v)* less_or_equal(v,w)* -> less_or_equal(u,w)*.
% 0.19/0.42 29[0:Inp] || less_or_equal(u,v)* sum__dfg(v,w,x)* sum__dfg(u,w,y)* -> less_or_equal(y,x)*.
% 0.19/0.42 46[0:Res:3.0,29.0] || sum__dfg(a,u,v)* sum__dfg(additive_identity,u,w)* -> less_or_equal(w,v)*.
% 0.19/0.42 60[0:Res:4.0,46.1] || sum__dfg(additive_identity,a,u)* -> less_or_equal(u,u__dfg).
% 0.19/0.42 121[0:Res:8.1,60.0] defined(a) || -> less_or_equal(a,u__dfg)*l.
% 0.19/0.42 126[0:SSi:121.0,1.0] || -> less_or_equal(a,u__dfg)*l.
% 0.19/0.42 132[0:OCh:27.1,27.0,126.0,3.0] || -> less_or_equal(additive_identity,u__dfg)*r.
% 0.19/0.42 133[0:MRR:132.0,5.0] || -> .
% 0.19/0.42 % SZS output end Refutation
% 0.19/0.42 Formulae used in the proof : a_is_defined less_or_equal_3 sum_4 not_less_or_equal_5 existence_of_identity_addition transitivity_of_order_relation compatibility_of_order_relation_and_addition
% 0.19/0.42
%------------------------------------------------------------------------------