TSTP Solution File: FLD014-1 by SATCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SATCoP---0.1
% Problem : FLD014-1 : TPTP v8.1.0. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : satcop --statistics %s
% Computer : n019.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:20 EDT 2022
% Result : Unsatisfiable 4.19s 0.92s
% Output : Proof 4.41s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(g0,plain,
equalish(a,b),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_equals_b_3)]) ).
cnf(g1,plain,
~ equalish(additive_inverse(a),additive_inverse(b)),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',additive_inverse_not_equal_to_additive_inverse_4)]) ).
cnf(g2,plain,
defined(a),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_is_defined)]) ).
cnf(g3,plain,
( ~ defined(additive_inverse(b))
| equalish(add(additive_identity,additive_inverse(b)),additive_inverse(b)) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',existence_of_identity_addition)]) ).
cnf(g4,plain,
( ~ defined(a)
| defined(additive_inverse(a)) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',well_definedness_of_additive_inverse)]) ).
cnf(g5,plain,
( ~ defined(b)
| defined(additive_inverse(b)) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',well_definedness_of_additive_inverse)]) ).
cnf(g6,plain,
( ~ defined(additive_inverse(a))
| equalish(add(additive_identity,additive_inverse(a)),additive_inverse(a)) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',existence_of_identity_addition)]) ).
cnf(g7,plain,
defined(b),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',b_is_defined)]) ).
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(a,b)
| ~ defined(additive_inverse(b))
| equalish(add(a,additive_inverse(b)),add(b,additive_inverse(b))) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',compatibility_of_equality_and_addition)]) ).
cnf(g10,plain,
( ~ equalish(add(a,additive_inverse(b)),add(b,additive_inverse(b)))
| ~ equalish(add(b,additive_inverse(b)),additive_identity)
| equalish(add(a,additive_inverse(b)),additive_identity) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',transitivity_of_equality)]) ).
cnf(g11,plain,
( ~ defined(b)
| equalish(add(b,additive_inverse(b)),additive_identity) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',existence_of_inverse_addition)]) ).
cnf(g12,plain,
defined(additive_identity),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',well_definedness_of_additive_identity)]) ).
cnf(g13,plain,
( ~ equalish(add(additive_inverse(b),a),add(a,additive_inverse(b)))
| ~ equalish(add(a,additive_inverse(b)),additive_identity)
| equalish(add(additive_inverse(b),a),additive_identity) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',transitivity_of_equality)]) ).
cnf(g14,plain,
( ~ defined(additive_inverse(b))
| ~ defined(a)
| equalish(add(additive_inverse(b),a),add(a,additive_inverse(b))) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',commutativity_addition)]) ).
cnf(g15,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(g16,plain,
( ~ equalish(additive_inverse(a),add(add(additive_identity,add(a,additive_inverse(a))),additive_inverse(b)))
| ~ equalish(add(add(additive_identity,add(a,additive_inverse(a))),additive_inverse(b)),additive_inverse(b))
| equalish(additive_inverse(a),additive_inverse(b)) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',transitivity_of_equality)]) ).
cnf(g17,plain,
( ~ equalish(add(add(additive_identity,add(a,additive_inverse(a))),additive_inverse(b)),add(additive_identity,additive_inverse(b)))
| ~ equalish(add(additive_identity,additive_inverse(b)),additive_inverse(b))
| equalish(add(add(additive_identity,add(a,additive_inverse(a))),additive_inverse(b)),additive_inverse(b)) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',transitivity_of_equality)]) ).
cnf(g18,plain,
( ~ equalish(add(additive_identity,add(a,additive_inverse(a))),additive_identity)
| ~ defined(additive_inverse(b))
| equalish(add(add(additive_identity,add(a,additive_inverse(a))),additive_inverse(b)),add(additive_identity,additive_inverse(b))) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',compatibility_of_equality_and_addition)]) ).
cnf(g19,plain,
( ~ equalish(add(additive_identity,add(a,additive_inverse(a))),add(a,additive_inverse(a)))
| ~ equalish(add(a,additive_inverse(a)),additive_identity)
| equalish(add(additive_identity,add(a,additive_inverse(a))),additive_identity) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',transitivity_of_equality)]) ).
cnf(g20,plain,
( ~ defined(add(a,additive_inverse(a)))
| equalish(add(additive_identity,add(a,additive_inverse(a))),add(a,additive_inverse(a))) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',existence_of_identity_addition)]) ).
cnf(g21,plain,
( ~ equalish(additive_inverse(a),add(additive_identity,add(add(a,additive_inverse(a)),additive_inverse(b))))
| ~ equalish(add(additive_identity,add(add(a,additive_inverse(a)),additive_inverse(b))),add(add(additive_identity,add(a,additive_inverse(a))),additive_inverse(b)))
| equalish(additive_inverse(a),add(add(additive_identity,add(a,additive_inverse(a))),additive_inverse(b))) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',transitivity_of_equality)]) ).
cnf(g22,plain,
( ~ defined(additive_identity)
| ~ defined(add(a,additive_inverse(a)))
| ~ defined(additive_inverse(b))
| equalish(add(additive_identity,add(add(a,additive_inverse(a)),additive_inverse(b))),add(add(additive_identity,add(a,additive_inverse(a))),additive_inverse(b))) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',associativity_addition)]) ).
cnf(g23,plain,
( ~ equalish(add(additive_identity,add(add(a,additive_inverse(a)),additive_inverse(b))),additive_inverse(a))
| equalish(additive_inverse(a),add(additive_identity,add(add(a,additive_inverse(a)),additive_inverse(b)))) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',symmetry_of_equality)]) ).
cnf(g24,plain,
( ~ defined(add(a,additive_inverse(a)))
| ~ defined(additive_inverse(b))
| defined(add(add(a,additive_inverse(a)),additive_inverse(b))) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',well_definedness_of_addition)]) ).
cnf(g25,plain,
( ~ equalish(add(additive_identity,add(add(a,additive_inverse(a)),additive_inverse(b))),add(add(a,additive_inverse(a)),additive_inverse(b)))
| ~ equalish(add(add(a,additive_inverse(a)),additive_inverse(b)),additive_inverse(a))
| equalish(add(additive_identity,add(add(a,additive_inverse(a)),additive_inverse(b))),additive_inverse(a)) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',transitivity_of_equality)]) ).
cnf(g26,plain,
( ~ defined(add(add(a,additive_inverse(a)),additive_inverse(b)))
| equalish(add(additive_identity,add(add(a,additive_inverse(a)),additive_inverse(b))),add(add(a,additive_inverse(a)),additive_inverse(b))) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',existence_of_identity_addition)]) ).
cnf(g27,plain,
( ~ defined(add(a,additive_inverse(a)))
| ~ defined(additive_inverse(b))
| equalish(add(add(a,additive_inverse(a)),additive_inverse(b)),add(additive_inverse(b),add(a,additive_inverse(a)))) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',commutativity_addition)]) ).
cnf(g28,plain,
( ~ equalish(add(add(a,additive_inverse(a)),additive_inverse(b)),add(add(additive_inverse(b),a),additive_inverse(a)))
| ~ equalish(add(add(additive_inverse(b),a),additive_inverse(a)),additive_inverse(a))
| equalish(add(add(a,additive_inverse(a)),additive_inverse(b)),additive_inverse(a)) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',transitivity_of_equality)]) ).
cnf(g29,plain,
( ~ equalish(add(add(a,additive_inverse(a)),additive_inverse(b)),add(additive_inverse(b),add(a,additive_inverse(a))))
| ~ equalish(add(additive_inverse(b),add(a,additive_inverse(a))),add(add(additive_inverse(b),a),additive_inverse(a)))
| equalish(add(add(a,additive_inverse(a)),additive_inverse(b)),add(add(additive_inverse(b),a),additive_inverse(a))) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',transitivity_of_equality)]) ).
cnf(g30,plain,
( ~ defined(additive_inverse(b))
| ~ defined(a)
| ~ defined(additive_inverse(a))
| equalish(add(additive_inverse(b),add(a,additive_inverse(a))),add(add(additive_inverse(b),a),additive_inverse(a))) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',associativity_addition)]) ).
cnf(g31,plain,
( ~ equalish(add(add(additive_inverse(b),a),additive_inverse(a)),add(additive_identity,additive_inverse(a)))
| ~ equalish(add(additive_identity,additive_inverse(a)),additive_inverse(a))
| equalish(add(add(additive_inverse(b),a),additive_inverse(a)),additive_inverse(a)) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',transitivity_of_equality)]) ).
cnf(g32,plain,
( ~ equalish(add(additive_inverse(b),a),additive_identity)
| ~ defined(additive_inverse(a))
| equalish(add(add(additive_inverse(b),a),additive_inverse(a)),add(additive_identity,additive_inverse(a))) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',compatibility_of_equality_and_addition)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : FLD014-1 : TPTP v8.1.0. Bugfixed v2.1.0.
% 0.10/0.13 % Command : satcop --statistics %s
% 0.13/0.34 % Computer : n019.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 17:52:40 EDT 2022
% 0.13/0.34 % CPUTime :
% 4.19/0.92 % symbols: 13
% 4.19/0.92 % clauses: 31
% 4.19/0.92 % start clauses: 2
% 4.19/0.92 % iterative deepening steps: 1136
% 4.19/0.92 % maximum path limit: 5
% 4.19/0.92 % literal attempts: 889434
% 4.19/0.92 % depth failures: 582181
% 4.19/0.92 % regularity failures: 61176
% 4.19/0.92 % tautology failures: 115132
% 4.19/0.92 % reductions: 60970
% 4.19/0.92 % extensions: 827493
% 4.19/0.92 % SAT variables: 67447
% 4.19/0.92 % SAT clauses: 109340
% 4.19/0.92 % WalkSAT solutions: 109313
% 4.19/0.92 % CDCL solutions: 25
% 4.19/0.92 % SZS status Unsatisfiable for theBenchmark
% 4.19/0.92 % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------