TSTP Solution File: FLD038-1 by SATCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SATCoP---0.1
% Problem : FLD038-1 : TPTP v8.1.0. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : satcop --statistics %s
% Computer : n023.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:29 EDT 2022
% Result : Unsatisfiable 1.67s 0.64s
% Output : Proof 1.67s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(g0,plain,
~ equalish(a,additive_identity),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_not_equal_to_additive_identity_3)]) ).
cnf(g1,plain,
equalish(multiplicative_identity,multiply(b,multiplicative_inverse(a))),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiplicative_identity_equals_multiply_4)]) ).
cnf(g2,plain,
~ equalish(a,b),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_not_equal_to_b_5)]) ).
cnf(g3,plain,
( ~ defined(a)
| equalish(a,additive_identity)
| defined(multiplicative_inverse(a)) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',well_definedness_of_multiplicative_inverse)]) ).
cnf(g4,plain,
( ~ defined(a)
| equalish(a,additive_identity)
| equalish(multiply(a,multiplicative_inverse(a)),multiplicative_identity) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',existence_of_inverse_multiplication)]) ).
cnf(g5,plain,
( ~ equalish(multiplicative_identity,multiply(b,multiplicative_inverse(a)))
| equalish(multiply(b,multiplicative_inverse(a)),multiplicative_identity) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',symmetry_of_equality)]) ).
cnf(g6,plain,
defined(a),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_is_defined)]) ).
cnf(g7,plain,
( ~ equalish(multiply(b,multiplicative_inverse(a)),multiplicative_identity)
| ~ defined(a)
| equalish(multiply(multiply(b,multiplicative_inverse(a)),a),multiply(multiplicative_identity,a)) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',compatibility_of_equality_and_multiplication)]) ).
cnf(g8,plain,
( ~ defined(b)
| ~ defined(multiplicative_inverse(a))
| equalish(multiply(b,multiplicative_inverse(a)),multiply(multiplicative_inverse(a),b)) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',commutativity_multiplication)]) ).
cnf(g9,plain,
( ~ equalish(multiply(multiply(b,multiplicative_inverse(a)),a),multiply(multiplicative_identity,a))
| ~ equalish(multiply(multiplicative_identity,a),a)
| equalish(multiply(multiply(b,multiplicative_inverse(a)),a),a) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',transitivity_of_equality)]) ).
cnf(g10,plain,
( ~ defined(b)
| equalish(multiply(multiplicative_identity,b),b) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',existence_of_identity_multiplication)]) ).
cnf(g11,plain,
defined(b),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',b_is_defined)]) ).
cnf(g12,plain,
( ~ equalish(multiply(b,multiplicative_inverse(a)),multiply(multiplicative_inverse(a),b))
| ~ defined(a)
| equalish(multiply(multiply(b,multiplicative_inverse(a)),a),multiply(multiply(multiplicative_inverse(a),b),a)) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',compatibility_of_equality_and_multiplication)]) ).
cnf(g13,plain,
( ~ equalish(multiply(multiply(b,multiplicative_inverse(a)),a),a)
| equalish(a,multiply(multiply(b,multiplicative_inverse(a)),a)) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',symmetry_of_equality)]) ).
cnf(g14,plain,
( ~ defined(a)
| equalish(multiply(multiplicative_identity,a),a) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',existence_of_identity_multiplication)]) ).
cnf(g15,plain,
( ~ defined(multiplicative_inverse(a))
| ~ defined(b)
| defined(multiply(multiplicative_inverse(a),b)) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',well_definedness_of_multiplication)]) ).
cnf(g16,plain,
( ~ equalish(a,multiply(multiply(b,multiplicative_inverse(a)),a))
| ~ equalish(multiply(multiply(b,multiplicative_inverse(a)),a),multiply(multiply(multiplicative_inverse(a),b),a))
| equalish(a,multiply(multiply(multiplicative_inverse(a),b),a)) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',transitivity_of_equality)]) ).
cnf(g17,plain,
( ~ equalish(a,multiply(multiply(a,multiplicative_inverse(a)),b))
| ~ equalish(multiply(multiply(a,multiplicative_inverse(a)),b),b)
| equalish(a,b) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',transitivity_of_equality)]) ).
cnf(g18,plain,
( ~ equalish(multiply(multiply(a,multiplicative_inverse(a)),b),multiply(multiplicative_identity,b))
| ~ equalish(multiply(multiplicative_identity,b),b)
| equalish(multiply(multiply(a,multiplicative_inverse(a)),b),b) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',transitivity_of_equality)]) ).
cnf(g19,plain,
( ~ equalish(multiply(a,multiplicative_inverse(a)),multiplicative_identity)
| ~ defined(b)
| equalish(multiply(multiply(a,multiplicative_inverse(a)),b),multiply(multiplicative_identity,b)) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',compatibility_of_equality_and_multiplication)]) ).
cnf(g20,plain,
( ~ equalish(a,multiply(a,multiply(multiplicative_inverse(a),b)))
| ~ equalish(multiply(a,multiply(multiplicative_inverse(a),b)),multiply(multiply(a,multiplicative_inverse(a)),b))
| equalish(a,multiply(multiply(a,multiplicative_inverse(a)),b)) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',transitivity_of_equality)]) ).
cnf(g21,plain,
( ~ defined(a)
| ~ defined(multiplicative_inverse(a))
| ~ defined(b)
| equalish(multiply(a,multiply(multiplicative_inverse(a),b)),multiply(multiply(a,multiplicative_inverse(a)),b)) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',associativity_multiplication)]) ).
cnf(g22,plain,
( ~ equalish(a,multiply(multiply(multiplicative_inverse(a),b),a))
| ~ equalish(multiply(multiply(multiplicative_inverse(a),b),a),multiply(a,multiply(multiplicative_inverse(a),b)))
| equalish(a,multiply(a,multiply(multiplicative_inverse(a),b))) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',transitivity_of_equality)]) ).
cnf(g23,plain,
( ~ defined(multiply(multiplicative_inverse(a),b))
| ~ defined(a)
| equalish(multiply(multiply(multiplicative_inverse(a),b),a),multiply(a,multiply(multiplicative_inverse(a),b))) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',commutativity_multiplication)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : FLD038-1 : TPTP v8.1.0. Bugfixed v2.1.0.
% 0.07/0.12 % Command : satcop --statistics %s
% 0.13/0.33 % Computer : n023.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Tue Jun 7 00:24:24 EDT 2022
% 0.13/0.34 % CPUTime :
% 1.67/0.64 % symbols: 13
% 1.67/0.64 % clauses: 32
% 1.67/0.64 % start clauses: 3
% 1.67/0.64 % iterative deepening steps: 402
% 1.67/0.64 % maximum path limit: 4
% 1.67/0.64 % literal attempts: 319673
% 1.67/0.64 % depth failures: 228770
% 1.67/0.64 % regularity failures: 14222
% 1.67/0.64 % tautology failures: 35246
% 1.67/0.64 % reductions: 17632
% 1.67/0.64 % extensions: 301302
% 1.67/0.64 % SAT variables: 37947
% 1.67/0.64 % SAT clauses: 54759
% 1.67/0.64 % WalkSAT solutions: 54753
% 1.67/0.64 % CDCL solutions: 0
% 1.67/0.64 % SZS status Unsatisfiable for theBenchmark
% 1.67/0.64 % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------