TSTP Solution File: FLD070-4 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : FLD070-4 : TPTP v8.1.0. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n029.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:39 EDT 2022
% Result : Unsatisfiable 0.20s 0.44s
% Output : Refutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : FLD070-4 : TPTP v8.1.0. Bugfixed v2.1.0.
% 0.07/0.13 % Command : run_spass %d %s
% 0.13/0.34 % Computer : n029.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Mon Jun 6 21:52:20 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.44
% 0.20/0.44 SPASS V 3.9
% 0.20/0.44 SPASS beiseite: Proof found.
% 0.20/0.44 % SZS status Theorem
% 0.20/0.44 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.44 SPASS derived 95 clauses, backtracked 0 clauses, performed 0 splits and kept 106 clauses.
% 0.20/0.44 SPASS allocated 75744 KBytes.
% 0.20/0.44 SPASS spent 0:00:00.08 on the problem.
% 0.20/0.44 0:00:00.04 for the input.
% 0.20/0.44 0:00:00.00 for the FLOTTER CNF translation.
% 0.20/0.44 0:00:00.00 for inferences.
% 0.20/0.44 0:00:00.00 for the backtracking.
% 0.20/0.44 0:00:00.01 for the reduction.
% 0.20/0.44
% 0.20/0.44
% 0.20/0.44 Here is a proof with depth 4, length 14 :
% 0.20/0.44 % SZS output start Refutation
% 0.20/0.44 2[0:Inp] || -> defined(b)*.
% 0.20/0.44 4[0:Inp] || -> less_or_equal(additive_identity,a)*r.
% 0.20/0.44 5[0:Inp] || -> less_or_equal(additive_identity,b)*r.
% 0.20/0.44 6[0:Inp] || -> sum__dfg(a,b,c)*.
% 0.20/0.44 7[0:Inp] || less_or_equal(additive_identity,c)*r -> .
% 0.20/0.44 10[0:Inp] defined(u) || -> sum__dfg(additive_identity,u,u)*.
% 0.20/0.44 29[0:Inp] || less_or_equal(u,v)* less_or_equal(v,w)* -> less_or_equal(u,w)*.
% 0.20/0.44 31[0:Inp] || less_or_equal(u,v)* sum__dfg(v,w,x)* sum__dfg(u,w,y)* -> less_or_equal(y,x)*.
% 0.20/0.44 53[0:Res:4.0,31.0] || sum__dfg(a,u,v)* sum__dfg(additive_identity,u,w)* -> less_or_equal(w,v)*.
% 0.20/0.44 65[0:Res:6.0,53.1] || sum__dfg(additive_identity,b,u)* -> less_or_equal(u,c).
% 0.20/0.44 119[0:Res:10.1,65.0] defined(b) || -> less_or_equal(b,c)*l.
% 0.20/0.44 124[0:SSi:119.0,2.0] || -> less_or_equal(b,c)*l.
% 0.20/0.44 145[0:OCh:29.1,29.0,124.0,5.0] || -> less_or_equal(additive_identity,c)*r.
% 0.20/0.44 146[0:MRR:145.0,7.0] || -> .
% 0.20/0.44 % SZS output end Refutation
% 0.20/0.44 Formulae used in the proof : b_is_defined less_or_equal_4 less_or_equal_5 sum_6 not_less_or_equal_7 existence_of_identity_addition transitivity_of_order_relation compatibility_of_order_relation_and_addition
% 0.20/0.44
%------------------------------------------------------------------------------