TSTP Solution File: FLD068-2 by SATCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SATCoP---0.1
% Problem : FLD068-2 : TPTP v8.1.0. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : satcop --statistics %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:26:42 EDT 2022
% Result : Unsatisfiable 79.99s 10.52s
% Output : Proof 79.99s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(g0,plain,
equalish(add(b,additive_inverse(a)),u),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',add_equals_u_4)]) ).
cnf(g1,plain,
less_or_equal(additive_identity,u),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less_or_equal_5)]) ).
cnf(g2,plain,
~ less_or_equal(a,b),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',not_less_or_equal_6)]) ).
cnf(g3,plain,
( ~ defined(b)
| ~ defined(a)
| less_or_equal(b,a)
| less_or_equal(a,b) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',totality_of_order_relation)]) ).
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(additive_inverse(a))
| ~ less_or_equal(b,a)
| less_or_equal(add(b,additive_inverse(a)),add(a,additive_inverse(a))) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',compatibility_of_order_relation_and_addition)]) ).
cnf(g6,plain,
( ~ equalish(add(b,additive_inverse(a)),u)
| ~ equalish(u,additive_identity)
| equalish(add(b,additive_inverse(a)),additive_identity) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',transitivity_of_equality)]) ).
cnf(g7,plain,
defined(b),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',b_is_defined)]) ).
cnf(g8,plain,
defined(a),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_is_defined)]) ).
cnf(g9,plain,
( ~ defined(a)
| equalish(add(additive_identity,a),a) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',existence_of_identity_addition)]) ).
cnf(g10,plain,
( ~ less_or_equal(u,add(a,additive_inverse(a)))
| ~ less_or_equal(add(a,additive_inverse(a)),u)
| equalish(u,add(a,additive_inverse(a))) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',antisymmetry_of_order_relation)]) ).
cnf(g11,plain,
( ~ equalish(b,a)
| ~ less_or_equal(b,b)
| less_or_equal(a,b) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',compatibility_of_equality_and_order_relation)]) ).
cnf(g12,plain,
( ~ defined(b)
| ~ defined(b)
| less_or_equal(b,b)
| less_or_equal(b,b) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',totality_of_order_relation)]) ).
cnf(g13,plain,
( ~ equalish(add(b,additive_inverse(a)),u)
| ~ less_or_equal(add(b,additive_inverse(a)),add(b,additive_inverse(a)))
| less_or_equal(u,add(b,additive_inverse(a))) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',compatibility_of_equality_and_order_relation)]) ).
cnf(g14,plain,
( ~ less_or_equal(u,add(b,additive_inverse(a)))
| ~ less_or_equal(add(b,additive_inverse(a)),add(a,additive_inverse(a)))
| less_or_equal(u,add(a,additive_inverse(a))) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',transitivity_of_order_relation)]) ).
cnf(g15,plain,
( ~ equalish(multiply(multiplicative_identity,b),b)
| ~ defined(additive_inverse(a))
| equalish(add(multiply(multiplicative_identity,b),additive_inverse(a)),add(b,additive_inverse(a))) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',compatibility_of_equality_and_addition)]) ).
cnf(g16,plain,
( ~ defined(b)
| equalish(multiply(multiplicative_identity,b),b) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',existence_of_identity_multiplication)]) ).
cnf(g17,plain,
( ~ defined(additive_inverse(a))
| ~ less_or_equal(b,b)
| less_or_equal(add(b,additive_inverse(a)),add(b,additive_inverse(a))) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',compatibility_of_order_relation_and_addition)]) ).
cnf(g18,plain,
( ~ equalish(additive_identity,add(a,additive_inverse(a)))
| ~ less_or_equal(additive_identity,u)
| less_or_equal(add(a,additive_inverse(a)),u) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',compatibility_of_equality_and_order_relation)]) ).
cnf(g19,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(g20,plain,
( ~ defined(a)
| equalish(add(a,additive_inverse(a)),additive_identity) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',existence_of_inverse_addition)]) ).
cnf(g21,plain,
( ~ equalish(multiply(multiplicative_identity,b),b)
| equalish(b,multiply(multiplicative_identity,b)) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',symmetry_of_equality)]) ).
cnf(g22,plain,
defined(multiplicative_identity),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',well_definedness_of_multiplicative_identity)]) ).
cnf(g23,plain,
( ~ defined(multiplicative_identity)
| ~ defined(b)
| equalish(multiply(multiplicative_identity,b),multiply(b,multiplicative_identity)) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',commutativity_multiplication)]) ).
cnf(g24,plain,
( ~ equalish(b,multiply(multiplicative_identity,b))
| ~ equalish(multiply(multiplicative_identity,b),a)
| equalish(b,a) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',transitivity_of_equality)]) ).
cnf(g25,plain,
( ~ defined(b)
| ~ defined(multiplicative_identity)
| equalish(multiply(b,multiplicative_identity),multiply(multiplicative_identity,b)) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',commutativity_multiplication)]) ).
cnf(g26,plain,
( ~ defined(b)
| ~ defined(multiplicative_identity)
| defined(multiply(b,multiplicative_identity)) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',well_definedness_of_multiplication)]) ).
cnf(g27,plain,
( ~ equalish(multiply(multiplicative_identity,b),multiply(b,multiplicative_identity))
| ~ equalish(multiply(b,multiplicative_identity),a)
| equalish(multiply(multiplicative_identity,b),a) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',transitivity_of_equality)]) ).
cnf(g28,plain,
( ~ equalish(a,multiply(b,multiplicative_identity))
| equalish(multiply(b,multiplicative_identity),a) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',symmetry_of_equality)]) ).
cnf(g29,plain,
( ~ equalish(u,add(a,additive_inverse(a)))
| ~ equalish(add(a,additive_inverse(a)),additive_identity)
| equalish(u,additive_identity) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',transitivity_of_equality)]) ).
cnf(g30,plain,
( ~ equalish(a,add(additive_identity,multiply(b,multiplicative_identity)))
| ~ equalish(add(additive_identity,multiply(b,multiplicative_identity)),multiply(b,multiplicative_identity))
| equalish(a,multiply(b,multiplicative_identity)) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',transitivity_of_equality)]) ).
cnf(g31,plain,
( ~ defined(multiply(b,multiplicative_identity))
| equalish(add(additive_identity,multiply(b,multiplicative_identity)),multiply(b,multiplicative_identity)) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',existence_of_identity_addition)]) ).
cnf(g32,plain,
( ~ equalish(add(additive_identity,multiply(b,multiplicative_identity)),a)
| equalish(a,add(additive_identity,multiply(b,multiplicative_identity))) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',symmetry_of_equality)]) ).
cnf(g33,plain,
( ~ equalish(multiply(b,multiplicative_identity),multiply(multiplicative_identity,b))
| ~ defined(additive_inverse(a))
| equalish(add(multiply(b,multiplicative_identity),additive_inverse(a)),add(multiply(multiplicative_identity,b),additive_inverse(a))) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',compatibility_of_equality_and_addition)]) ).
cnf(g34,plain,
( ~ equalish(add(additive_identity,multiply(b,multiplicative_identity)),add(add(a,additive_inverse(a)),multiply(b,multiplicative_identity)))
| ~ equalish(add(add(a,additive_inverse(a)),multiply(b,multiplicative_identity)),a)
| equalish(add(additive_identity,multiply(b,multiplicative_identity)),a) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',transitivity_of_equality)]) ).
cnf(g35,plain,
( ~ equalish(additive_identity,add(a,additive_inverse(a)))
| ~ defined(multiply(b,multiplicative_identity))
| equalish(add(additive_identity,multiply(b,multiplicative_identity)),add(add(a,additive_inverse(a)),multiply(b,multiplicative_identity))) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',compatibility_of_equality_and_addition)]) ).
cnf(g36,plain,
( ~ equalish(add(add(a,additive_inverse(a)),multiply(b,multiplicative_identity)),add(a,add(additive_inverse(a),multiply(b,multiplicative_identity))))
| ~ equalish(add(a,add(additive_inverse(a),multiply(b,multiplicative_identity))),a)
| equalish(add(add(a,additive_inverse(a)),multiply(b,multiplicative_identity)),a) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',transitivity_of_equality)]) ).
cnf(g37,plain,
( ~ equalish(add(a,add(additive_inverse(a),multiply(b,multiplicative_identity))),add(add(a,additive_inverse(a)),multiply(b,multiplicative_identity)))
| equalish(add(add(a,additive_inverse(a)),multiply(b,multiplicative_identity)),add(a,add(additive_inverse(a),multiply(b,multiplicative_identity)))) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',symmetry_of_equality)]) ).
cnf(g38,plain,
( ~ defined(a)
| ~ defined(additive_inverse(a))
| ~ defined(multiply(b,multiplicative_identity))
| equalish(add(a,add(additive_inverse(a),multiply(b,multiplicative_identity))),add(add(a,additive_inverse(a)),multiply(b,multiplicative_identity))) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',associativity_addition)]) ).
cnf(g39,plain,
( ~ equalish(add(a,add(additive_inverse(a),multiply(b,multiplicative_identity))),add(add(additive_inverse(a),multiply(b,multiplicative_identity)),a))
| ~ equalish(add(add(additive_inverse(a),multiply(b,multiplicative_identity)),a),a)
| equalish(add(a,add(additive_inverse(a),multiply(b,multiplicative_identity))),a) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',transitivity_of_equality)]) ).
cnf(g40,plain,
( ~ defined(a)
| ~ defined(add(additive_inverse(a),multiply(b,multiplicative_identity)))
| equalish(add(a,add(additive_inverse(a),multiply(b,multiplicative_identity))),add(add(additive_inverse(a),multiply(b,multiplicative_identity)),a)) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',commutativity_addition)]) ).
cnf(g41,plain,
( ~ equalish(add(multiply(b,multiplicative_identity),additive_inverse(a)),add(multiply(multiplicative_identity,b),additive_inverse(a)))
| ~ equalish(add(multiply(multiplicative_identity,b),additive_inverse(a)),add(b,additive_inverse(a)))
| equalish(add(multiply(b,multiplicative_identity),additive_inverse(a)),add(b,additive_inverse(a))) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',transitivity_of_equality)]) ).
cnf(g42,plain,
( ~ defined(additive_inverse(a))
| ~ defined(multiply(b,multiplicative_identity))
| equalish(add(additive_inverse(a),multiply(b,multiplicative_identity)),add(multiply(b,multiplicative_identity),additive_inverse(a))) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',commutativity_addition)]) ).
cnf(g43,plain,
( ~ defined(additive_inverse(a))
| ~ defined(multiply(b,multiplicative_identity))
| defined(add(additive_inverse(a),multiply(b,multiplicative_identity))) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',well_definedness_of_addition)]) ).
cnf(g44,plain,
( ~ equalish(add(additive_inverse(a),multiply(b,multiplicative_identity)),add(b,additive_inverse(a)))
| ~ equalish(add(b,additive_inverse(a)),additive_identity)
| equalish(add(additive_inverse(a),multiply(b,multiplicative_identity)),additive_identity) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',transitivity_of_equality)]) ).
cnf(g45,plain,
( ~ equalish(add(additive_inverse(a),multiply(b,multiplicative_identity)),add(multiply(b,multiplicative_identity),additive_inverse(a)))
| ~ equalish(add(multiply(b,multiplicative_identity),additive_inverse(a)),add(b,additive_inverse(a)))
| equalish(add(additive_inverse(a),multiply(b,multiplicative_identity)),add(b,additive_inverse(a))) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',transitivity_of_equality)]) ).
cnf(g46,plain,
( ~ equalish(add(additive_inverse(a),multiply(b,multiplicative_identity)),additive_identity)
| equalish(additive_identity,add(additive_inverse(a),multiply(b,multiplicative_identity))) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',symmetry_of_equality)]) ).
cnf(g47,plain,
( ~ equalish(additive_identity,add(additive_inverse(a),multiply(b,multiplicative_identity)))
| ~ defined(a)
| equalish(add(additive_identity,a),add(add(additive_inverse(a),multiply(b,multiplicative_identity)),a)) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',compatibility_of_equality_and_addition)]) ).
cnf(g48,plain,
( ~ equalish(add(additive_identity,a),add(add(additive_inverse(a),multiply(b,multiplicative_identity)),a))
| equalish(add(add(additive_inverse(a),multiply(b,multiplicative_identity)),a),add(additive_identity,a)) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',symmetry_of_equality)]) ).
cnf(g49,plain,
( ~ equalish(add(add(additive_inverse(a),multiply(b,multiplicative_identity)),a),add(additive_identity,a))
| ~ equalish(add(additive_identity,a),a)
| equalish(add(add(additive_inverse(a),multiply(b,multiplicative_identity)),a),a) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',transitivity_of_equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : FLD068-2 : TPTP v8.1.0. Bugfixed v2.1.0.
% 0.08/0.15 % Command : satcop --statistics %s
% 0.16/0.37 % Computer : n029.cluster.edu
% 0.16/0.37 % Model : x86_64 x86_64
% 0.16/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37 % Memory : 8042.1875MB
% 0.16/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37 % CPULimit : 300
% 0.16/0.37 % WCLimit : 600
% 0.16/0.37 % DateTime : Tue Jun 7 03:11:05 EDT 2022
% 0.16/0.37 % CPUTime :
% 79.99/10.52 % symbols: 14
% 79.99/10.52 % clauses: 33
% 79.99/10.52 % start clauses: 3
% 79.99/10.52 % iterative deepening steps: 3344
% 79.99/10.52 % maximum path limit: 6
% 79.99/10.52 % literal attempts: 9324010
% 79.99/10.52 % depth failures: 6293841
% 79.99/10.52 % regularity failures: 525311
% 79.99/10.52 % tautology failures: 1694387
% 79.99/10.52 % reductions: 723816
% 79.99/10.52 % extensions: 8597942
% 79.99/10.52 % SAT variables: 340414
% 79.99/10.52 % SAT clauses: 599815
% 79.99/10.52 % WalkSAT solutions: 598173
% 79.99/10.52 % CDCL solutions: 1636
% 79.99/10.52 % SZS status Unsatisfiable for theBenchmark
% 79.99/10.52 % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------