TSTP Solution File: FLD059-2 by SATCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SATCoP---0.1
% Problem : FLD059-2 : TPTP v8.1.0. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : satcop --statistics %s
% Computer : n024.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:26:37 EDT 2022
% Result : Unsatisfiable 0.12s 0.34s
% Output : Proof 0.12s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(g0,plain,
less_or_equal(additive_identity,a),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less_or_equal_3)]) ).
cnf(g1,plain,
equalish(add(a,a),u),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',add_equals_u_4)]) ).
cnf(g2,plain,
~ less_or_equal(additive_identity,u),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',not_less_or_equal_5)]) ).
cnf(g3,plain,
( ~ defined(a)
| ~ less_or_equal(additive_identity,a)
| less_or_equal(add(additive_identity,a),add(a,a)) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',compatibility_of_order_relation_and_addition)]) ).
cnf(g4,plain,
( ~ equalish(add(a,a),u)
| equalish(u,add(a,a)) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',symmetry_of_equality)]) ).
cnf(g5,plain,
( ~ less_or_equal(additive_identity,a)
| ~ less_or_equal(a,u)
| less_or_equal(additive_identity,u) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',transitivity_of_order_relation)]) ).
cnf(g6,plain,
defined(u),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',u_is_defined)]) ).
cnf(g7,plain,
defined(a),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_is_defined)]) ).
cnf(g8,plain,
( ~ equalish(u,add(a,a))
| ~ less_or_equal(u,a)
| less_or_equal(add(a,a),a) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',compatibility_of_equality_and_order_relation)]) ).
cnf(g9,plain,
( ~ equalish(u,add(a,a))
| ~ equalish(add(a,a),a)
| equalish(u,a) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',transitivity_of_equality)]) ).
cnf(g10,plain,
( ~ defined(u)
| ~ defined(a)
| less_or_equal(u,a)
| less_or_equal(a,u) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',totality_of_order_relation)]) ).
cnf(g11,plain,
( ~ defined(u)
| ~ defined(u)
| less_or_equal(u,u)
| less_or_equal(u,u) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',totality_of_order_relation)]) ).
cnf(g12,plain,
( ~ equalish(add(additive_identity,a),a)
| ~ less_or_equal(add(additive_identity,a),add(a,a))
| less_or_equal(a,add(a,a)) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',compatibility_of_equality_and_order_relation)]) ).
cnf(g13,plain,
( ~ less_or_equal(add(a,a),a)
| ~ less_or_equal(a,add(a,a))
| equalish(add(a,a),a) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',antisymmetry_of_order_relation)]) ).
cnf(g14,plain,
( ~ equalish(u,a)
| ~ less_or_equal(u,u)
| less_or_equal(a,u) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',compatibility_of_equality_and_order_relation)]) ).
cnf(g15,plain,
( ~ defined(a)
| equalish(add(additive_identity,a),a) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',existence_of_identity_addition)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : FLD059-2 : TPTP v8.1.0. Bugfixed v2.1.0.
% 0.10/0.12 % Command : satcop --statistics %s
% 0.12/0.32 % Computer : n024.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % 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 12:27:05 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.34 % symbols: 13
% 0.12/0.34 % clauses: 32
% 0.12/0.34 % start clauses: 3
% 0.12/0.34 % iterative deepening steps: 66
% 0.12/0.34 % maximum path limit: 3
% 0.12/0.34 % literal attempts: 7214
% 0.12/0.34 % depth failures: 4938
% 0.12/0.34 % regularity failures: 479
% 0.12/0.34 % tautology failures: 865
% 0.12/0.34 % reductions: 342
% 0.12/0.34 % extensions: 6712
% 0.12/0.34 % SAT variables: 1515
% 0.12/0.34 % SAT clauses: 1956
% 0.12/0.34 % WalkSAT solutions: 1951
% 0.12/0.34 % CDCL solutions: 0
% 0.12/0.34 % SZS status Unsatisfiable for theBenchmark
% 0.12/0.34 % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------