%------------------------------------------------------------------------------
% File : SATCoP---0.1
% Problem : FLD004-1 : TPTP v8.1.0. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : satcop --statistics %s
% Computer : n032.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:15 EDT 2022
% Result : Unsatisfiable 0.15s 0.32s
% Output : Proof 0.15s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(g0,plain,
~ equalish(b,additive_identity),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',b_not_equal_to_additive_identity_3)]) ).
cnf(g1,plain,
~ equalish(multiply(a,multiply(b,multiplicative_inverse(b))),a),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiply_not_equal_to_a_4)]) ).
cnf(g2,plain,
( ~ defined(b)
| equalish(b,additive_identity)
| defined(multiplicative_inverse(b)) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',well_definedness_of_multiplicative_inverse)]) ).
cnf(g3,plain,
( ~ defined(b)
| equalish(b,additive_identity)
| equalish(multiply(b,multiplicative_inverse(b)),multiplicative_identity) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',existence_of_inverse_multiplication)]) ).
cnf(g4,plain,
defined(b),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',b_is_defined)]) ).
cnf(g5,plain,
( ~ defined(b)
| ~ defined(multiplicative_inverse(b))
| defined(multiply(b,multiplicative_inverse(b))) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',well_definedness_of_multiplication)]) ).
cnf(g6,plain,
( ~ equalish(multiply(a,multiply(b,multiplicative_inverse(b))),multiply(multiplicative_identity,a))
| ~ equalish(multiply(multiplicative_identity,a),a)
| equalish(multiply(a,multiply(b,multiplicative_inverse(b))),a) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',transitivity_of_equality)]) ).
cnf(g7,plain,
( ~ defined(a)
| equalish(multiply(multiplicative_identity,a),a) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',existence_of_identity_multiplication)]) ).
cnf(g8,plain,
( ~ defined(a)
| ~ defined(multiply(b,multiplicative_inverse(b)))
| equalish(multiply(a,multiply(b,multiplicative_inverse(b))),multiply(multiply(b,multiplicative_inverse(b)),a)) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',commutativity_multiplication)]) ).
cnf(g9,plain,
defined(a),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_is_defined)]) ).
cnf(g10,plain,
( ~ equalish(multiply(a,multiply(b,multiplicative_inverse(b))),multiply(multiply(b,multiplicative_inverse(b)),a))
| ~ equalish(multiply(multiply(b,multiplicative_inverse(b)),a),multiply(multiplicative_identity,a))
| equalish(multiply(a,multiply(b,multiplicative_inverse(b))),multiply(multiplicative_identity,a)) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',transitivity_of_equality)]) ).
cnf(g11,plain,
( ~ equalish(multiply(b,multiplicative_inverse(b)),multiplicative_identity)
| ~ defined(a)
| equalish(multiply(multiply(b,multiplicative_inverse(b)),a),multiply(multiplicative_identity,a)) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',compatibility_of_equality_and_multiplication)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.10 % Problem : FLD004-1 : TPTP v8.1.0. Bugfixed v2.1.0.
% 0.08/0.10 % Command : satcop --statistics %s
% 0.11/0.29 % Computer : n032.cluster.edu
% 0.11/0.29 % Model : x86_64 x86_64
% 0.11/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.29 % Memory : 8042.1875MB
% 0.11/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.29 % CPULimit : 300
% 0.11/0.29 % WCLimit : 600
% 0.11/0.29 % DateTime : Mon Jun 6 12:39:19 EDT 2022
% 0.11/0.29 % CPUTime :
% 0.15/0.32 % symbols: 13
% 0.15/0.32 % clauses: 31
% 0.15/0.32 % start clauses: 2
% 0.15/0.32 % iterative deepening steps: 89
% 0.15/0.32 % maximum path limit: 3
% 0.15/0.32 % literal attempts: 18313
% 0.15/0.32 % depth failures: 14600
% 0.15/0.32 % regularity failures: 539
% 0.15/0.32 % tautology failures: 1243
% 0.15/0.32 % reductions: 357
% 0.15/0.32 % extensions: 17804
% 0.15/0.32 % SAT variables: 4102
% 0.15/0.32 % SAT clauses: 4790
% 0.15/0.32 % WalkSAT solutions: 4785
% 0.15/0.32 % CDCL solutions: 0
% 0.15/0.32 % SZS status Unsatisfiable for theBenchmark
% 0.15/0.32 % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------