TSTP Solution File: FLD033-1 by SATCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SATCoP---0.1
% Problem : FLD033-1 : TPTP v8.1.0. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : satcop --statistics %s
% Computer : n017.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:27 EDT 2022
% Result : Unsatisfiable 9.48s 1.65s
% Output : Proof 9.48s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(g0,plain,
~ equalish(a,additive_identity),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_not_equal_to_additive_identity_3)]) ).
cnf(g1,plain,
equalish(multiply(m,a),a),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiply_equals_a_4)]) ).
cnf(g2,plain,
~ equalish(m,multiplicative_identity),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',m_not_equal_to_multiplicative_identity_5)]) ).
cnf(g3,plain,
( ~ equalish(multiply(m,a),a)
| equalish(a,multiply(m,a)) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',symmetry_of_equality)]) ).
cnf(g4,plain,
defined(a),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_is_defined)]) ).
cnf(g5,plain,
defined(m),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',m_is_defined)]) ).
cnf(g6,plain,
( ~ defined(m)
| equalish(multiply(multiplicative_identity,m),m) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',existence_of_identity_multiplication)]) ).
cnf(g7,plain,
( ~ equalish(a,multiply(m,a))
| ~ equalish(multiply(m,a),additive_identity)
| equalish(a,additive_identity) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',transitivity_of_equality)]) ).
cnf(g8,plain,
( ~ defined(multiply(m,a))
| equalish(multiply(m,a),additive_identity)
| equalish(multiply(multiply(m,a),multiplicative_inverse(multiply(m,a))),multiplicative_identity) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',existence_of_inverse_multiplication)]) ).
cnf(g9,plain,
( ~ defined(multiply(m,a))
| equalish(multiply(m,a),additive_identity)
| defined(multiplicative_inverse(multiply(m,a))) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',well_definedness_of_multiplicative_inverse)]) ).
cnf(g10,plain,
( ~ defined(m)
| ~ defined(a)
| defined(multiply(m,a)) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',well_definedness_of_multiplication)]) ).
cnf(g11,plain,
( ~ equalish(multiply(multiplicative_identity,m),m)
| equalish(m,multiply(multiplicative_identity,m)) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',symmetry_of_equality)]) ).
cnf(g12,plain,
( ~ defined(a)
| ~ defined(multiplicative_inverse(multiply(m,a)))
| defined(multiply(a,multiplicative_inverse(multiply(m,a)))) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',well_definedness_of_multiplication)]) ).
cnf(g13,plain,
( ~ equalish(a,multiply(m,a))
| ~ defined(multiplicative_inverse(multiply(m,a)))
| equalish(multiply(a,multiplicative_inverse(multiply(m,a))),multiply(multiply(m,a),multiplicative_inverse(multiply(m,a)))) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',compatibility_of_equality_and_multiplication)]) ).
cnf(g14,plain,
( ~ equalish(multiply(a,multiplicative_inverse(multiply(m,a))),multiply(multiply(m,a),multiplicative_inverse(multiply(m,a))))
| ~ equalish(multiply(multiply(m,a),multiplicative_inverse(multiply(m,a))),multiplicative_identity)
| equalish(multiply(a,multiplicative_inverse(multiply(m,a))),multiplicative_identity) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',transitivity_of_equality)]) ).
cnf(g15,plain,
( ~ equalish(multiply(a,multiplicative_inverse(multiply(m,a))),multiplicative_identity)
| equalish(multiplicative_identity,multiply(a,multiplicative_inverse(multiply(m,a)))) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',symmetry_of_equality)]) ).
cnf(g16,plain,
( ~ equalish(m,multiply(multiply(m,a),multiplicative_inverse(multiply(m,a))))
| ~ equalish(multiply(multiply(m,a),multiplicative_inverse(multiply(m,a))),multiplicative_identity)
| equalish(m,multiplicative_identity) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',transitivity_of_equality)]) ).
cnf(g17,plain,
( ~ equalish(m,multiply(m,multiply(a,multiplicative_inverse(multiply(m,a)))))
| ~ equalish(multiply(m,multiply(a,multiplicative_inverse(multiply(m,a)))),multiply(multiply(m,a),multiplicative_inverse(multiply(m,a))))
| equalish(m,multiply(multiply(m,a),multiplicative_inverse(multiply(m,a)))) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',transitivity_of_equality)]) ).
cnf(g18,plain,
( ~ defined(m)
| ~ defined(a)
| ~ defined(multiplicative_inverse(multiply(m,a)))
| equalish(multiply(m,multiply(a,multiplicative_inverse(multiply(m,a)))),multiply(multiply(m,a),multiplicative_inverse(multiply(m,a)))) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',associativity_multiplication)]) ).
cnf(g19,plain,
( ~ equalish(m,multiply(multiplicative_identity,m))
| ~ equalish(multiply(multiplicative_identity,m),multiply(m,multiply(a,multiplicative_inverse(multiply(m,a)))))
| equalish(m,multiply(m,multiply(a,multiplicative_inverse(multiply(m,a))))) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',transitivity_of_equality)]) ).
cnf(g20,plain,
( ~ equalish(multiply(multiplicative_identity,m),multiply(multiply(a,multiplicative_inverse(multiply(m,a))),m))
| ~ equalish(multiply(multiply(a,multiplicative_inverse(multiply(m,a))),m),multiply(m,multiply(a,multiplicative_inverse(multiply(m,a)))))
| equalish(multiply(multiplicative_identity,m),multiply(m,multiply(a,multiplicative_inverse(multiply(m,a))))) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',transitivity_of_equality)]) ).
cnf(g21,plain,
( ~ defined(multiply(a,multiplicative_inverse(multiply(m,a))))
| ~ defined(m)
| equalish(multiply(multiply(a,multiplicative_inverse(multiply(m,a))),m),multiply(m,multiply(a,multiplicative_inverse(multiply(m,a))))) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',commutativity_multiplication)]) ).
cnf(g22,plain,
( ~ equalish(multiplicative_identity,multiply(a,multiplicative_inverse(multiply(m,a))))
| ~ defined(m)
| equalish(multiply(multiplicative_identity,m),multiply(multiply(a,multiplicative_inverse(multiply(m,a))),m)) ),
inference(ground_cnf,[],[file('Axioms/FLD001-0.ax',compatibility_of_equality_and_multiplication)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : FLD033-1 : TPTP v8.1.0. Bugfixed v2.1.0.
% 0.03/0.13 % Command : satcop --statistics %s
% 0.13/0.34 % Computer : n017.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 21:38:01 EDT 2022
% 0.13/0.34 % CPUTime :
% 9.48/1.65 % symbols: 13
% 9.48/1.65 % clauses: 32
% 9.48/1.65 % start clauses: 3
% 9.48/1.65 % iterative deepening steps: 1556
% 9.48/1.65 % maximum path limit: 5
% 9.48/1.65 % literal attempts: 2460504
% 9.48/1.65 % depth failures: 1750132
% 9.48/1.65 % regularity failures: 124836
% 9.48/1.65 % tautology failures: 292036
% 9.48/1.65 % reductions: 140215
% 9.48/1.65 % extensions: 2318686
% 9.48/1.65 % SAT variables: 121615
% 9.48/1.65 % SAT clauses: 195286
% 9.48/1.65 % WalkSAT solutions: 195168
% 9.48/1.65 % CDCL solutions: 114
% 9.48/1.65 % SZS status Unsatisfiable for theBenchmark
% 9.48/1.65 % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------