TSTP Solution File: FLD065-1 by SATCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SATCoP---0.1
% Problem : FLD065-1 : TPTP v8.1.0. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : satcop --statistics %s
% Computer : n025.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:40 EDT 2022
% Result : Unsatisfiable 0.12s 0.38s
% Output : Proof 0.12s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(g0,plain,
less_or_equal(additive_inverse(a),additive_identity),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less_or_equal_2)]) ).
cnf(g1,plain,
~ less_or_equal(additive_identity,a),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',not_less_or_equal_3)]) ).
cnf(g2,plain,
( ~ defined(a)
| ~ less_or_equal(additive_inverse(a),additive_identity)
| less_or_equal(add(additive_inverse(a),a),add(additive_identity,a)) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',compatibility_of_order_relation_and_addition)]) ).
cnf(g3,plain,
defined(a),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_is_defined)]) ).
cnf(g4,plain,
( ~ defined(a)
| ~ defined(a)
| less_or_equal(a,a)
| less_or_equal(a,a) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',totality_of_order_relation)]) ).
cnf(g5,plain,
( ~ equalish(add(a,additive_inverse(a)),additive_identity)
| ~ less_or_equal(add(a,additive_inverse(a)),a)
| less_or_equal(additive_identity,a) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',compatibility_of_equality_and_order_relation)]) ).
cnf(g6,plain,
( ~ defined(a)
| equalish(add(a,additive_inverse(a)),additive_identity) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',existence_of_inverse_addition)]) ).
cnf(g7,plain,
( ~ equalish(a,add(additive_identity,a))
| ~ less_or_equal(a,a)
| less_or_equal(add(additive_identity,a),a) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',compatibility_of_equality_and_order_relation)]) ).
cnf(g8,plain,
( ~ equalish(add(additive_inverse(a),a),add(a,additive_inverse(a)))
| ~ less_or_equal(add(additive_inverse(a),a),add(additive_identity,a))
| less_or_equal(add(a,additive_inverse(a)),add(additive_identity,a)) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',compatibility_of_equality_and_order_relation)]) ).
cnf(g9,plain,
( ~ defined(additive_inverse(a))
| ~ defined(a)
| equalish(add(additive_inverse(a),a),add(a,additive_inverse(a))) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',commutativity_addition)]) ).
cnf(g10,plain,
( ~ defined(a)
| defined(additive_inverse(a)) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',well_definedness_of_additive_inverse)]) ).
cnf(g11,plain,
( ~ defined(a)
| equalish(add(additive_identity,a),a) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',existence_of_identity_addition)]) ).
cnf(g12,plain,
( ~ less_or_equal(add(a,additive_inverse(a)),add(additive_identity,a))
| ~ less_or_equal(add(additive_identity,a),a)
| less_or_equal(add(a,additive_inverse(a)),a) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',transitivity_of_order_relation)]) ).
cnf(g13,plain,
( ~ equalish(add(additive_identity,a),a)
| equalish(a,add(additive_identity,a)) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',symmetry_of_equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : FLD065-1 : TPTP v8.1.0. Bugfixed v2.1.0.
% 0.11/0.12 % Command : satcop --statistics %s
% 0.12/0.33 % Computer : n025.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 : Tue Jun 7 03:21:03 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.38 % symbols: 12
% 0.12/0.38 % clauses: 30
% 0.12/0.38 % start clauses: 2
% 0.12/0.38 % iterative deepening steps: 177
% 0.12/0.38 % maximum path limit: 3
% 0.12/0.38 % literal attempts: 43206
% 0.12/0.38 % depth failures: 27236
% 0.12/0.38 % regularity failures: 3169
% 0.12/0.38 % tautology failures: 5898
% 0.12/0.38 % reductions: 4594
% 0.12/0.38 % extensions: 38364
% 0.12/0.38 % SAT variables: 3932
% 0.12/0.38 % SAT clauses: 5886
% 0.12/0.38 % WalkSAT solutions: 5882
% 0.12/0.38 % CDCL solutions: 0
% 0.12/0.38 % SZS status Unsatisfiable for theBenchmark
% 0.12/0.38 % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------