TSTP Solution File: FLD020-1 by SATCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SATCoP---0.1
% Problem : FLD020-1 : TPTP v8.1.0. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : satcop --statistics %s
% Computer : n026.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:22 EDT 2022
% Result : Unsatisfiable 4.30s 0.90s
% Output : Proof 4.30s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(g0,plain,
equalish(add(m,a),a),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',add_equals_a_3)]) ).
cnf(g1,plain,
~ equalish(m,additive_identity),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m_not_equal_to_additive_identity_4)]) ).
cnf(g2,plain,
( ~ equalish(add(m,a),a)
| ~ defined(additive_inverse(a))
| equalish(add(add(m,a),additive_inverse(a)),add(a,additive_inverse(a))) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',compatibility_of_equality_and_addition)]) ).
cnf(g3,plain,
( ~ defined(a)
| defined(additive_inverse(a)) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',well_definedness_of_additive_inverse)]) ).
cnf(g4,plain,
defined(a),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_is_defined)]) ).
cnf(g5,plain,
defined(m),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m_is_defined)]) ).
cnf(g6,plain,
( ~ defined(m)
| equalish(add(additive_identity,m),m) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',existence_of_identity_addition)]) ).
cnf(g7,plain,
( ~ equalish(add(add(m,a),additive_inverse(a)),add(a,additive_inverse(a)))
| ~ equalish(add(a,additive_inverse(a)),additive_identity)
| equalish(add(add(m,a),additive_inverse(a)),additive_identity) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',transitivity_of_equality)]) ).
cnf(g8,plain,
( ~ defined(a)
| equalish(add(a,additive_inverse(a)),additive_identity) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',existence_of_inverse_addition)]) ).
cnf(g9,plain,
( ~ equalish(add(additive_identity,m),m)
| equalish(m,add(additive_identity,m)) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',symmetry_of_equality)]) ).
cnf(g10,plain,
( ~ defined(a)
| ~ defined(additive_inverse(a))
| defined(add(a,additive_inverse(a))) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',well_definedness_of_addition)]) ).
cnf(g11,plain,
( ~ equalish(add(a,additive_inverse(a)),additive_identity)
| equalish(additive_identity,add(a,additive_inverse(a))) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',symmetry_of_equality)]) ).
cnf(g12,plain,
( ~ equalish(add(m,add(a,additive_inverse(a))),add(add(m,a),additive_inverse(a)))
| ~ equalish(add(add(m,a),additive_inverse(a)),additive_identity)
| equalish(add(m,add(a,additive_inverse(a))),additive_identity) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',transitivity_of_equality)]) ).
cnf(g13,plain,
( ~ defined(m)
| ~ defined(a)
| ~ defined(additive_inverse(a))
| equalish(add(m,add(a,additive_inverse(a))),add(add(m,a),additive_inverse(a))) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',associativity_addition)]) ).
cnf(g14,plain,
( ~ equalish(add(m,add(a,additive_inverse(a))),additive_identity)
| equalish(additive_identity,add(m,add(a,additive_inverse(a)))) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',symmetry_of_equality)]) ).
cnf(g15,plain,
( ~ equalish(m,add(add(a,additive_inverse(a)),m))
| ~ equalish(add(add(a,additive_inverse(a)),m),additive_identity)
| equalish(m,additive_identity) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',transitivity_of_equality)]) ).
cnf(g16,plain,
( ~ equalish(m,add(additive_identity,m))
| ~ equalish(add(additive_identity,m),add(add(a,additive_inverse(a)),m))
| equalish(m,add(add(a,additive_inverse(a)),m)) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',transitivity_of_equality)]) ).
cnf(g17,plain,
( ~ equalish(additive_identity,add(a,additive_inverse(a)))
| ~ defined(m)
| equalish(add(additive_identity,m),add(add(a,additive_inverse(a)),m)) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',compatibility_of_equality_and_addition)]) ).
cnf(g18,plain,
( ~ equalish(additive_identity,add(add(a,additive_inverse(a)),m))
| equalish(add(add(a,additive_inverse(a)),m),additive_identity) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',symmetry_of_equality)]) ).
cnf(g19,plain,
( ~ equalish(additive_identity,add(m,add(a,additive_inverse(a))))
| ~ equalish(add(m,add(a,additive_inverse(a))),add(add(a,additive_inverse(a)),m))
| equalish(additive_identity,add(add(a,additive_inverse(a)),m)) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',transitivity_of_equality)]) ).
cnf(g20,plain,
( ~ equalish(add(add(a,additive_inverse(a)),m),add(m,add(a,additive_inverse(a))))
| equalish(add(m,add(a,additive_inverse(a))),add(add(a,additive_inverse(a)),m)) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',symmetry_of_equality)]) ).
cnf(g21,plain,
( ~ defined(add(a,additive_inverse(a)))
| ~ defined(m)
| equalish(add(add(a,additive_inverse(a)),m),add(m,add(a,additive_inverse(a)))) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',commutativity_addition)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.11 % Problem : FLD020-1 : TPTP v8.1.0. Bugfixed v2.1.0.
% 0.02/0.12 % Command : satcop --statistics %s
% 0.12/0.33 % Computer : n026.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 12:35:30 EDT 2022
% 0.12/0.33 % CPUTime :
% 4.30/0.90 % symbols: 13
% 4.30/0.90 % clauses: 31
% 4.30/0.90 % start clauses: 2
% 4.30/0.90 % iterative deepening steps: 996
% 4.30/0.90 % maximum path limit: 5
% 4.30/0.90 % literal attempts: 1280708
% 4.30/0.90 % depth failures: 976853
% 4.30/0.90 % regularity failures: 33600
% 4.30/0.90 % tautology failures: 135770
% 4.30/0.90 % reductions: 65268
% 4.30/0.90 % extensions: 1215177
% 4.30/0.90 % SAT variables: 82305
% 4.30/0.90 % SAT clauses: 111716
% 4.30/0.90 % WalkSAT solutions: 111700
% 4.30/0.90 % CDCL solutions: 13
% 4.30/0.90 % SZS status Unsatisfiable for theBenchmark
% 4.30/0.90 % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------