TSTP Solution File: BOO003-4 by SATCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SATCoP---0.1
% Problem : BOO003-4 : TPTP v8.1.0. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : satcop --statistics %s
% Computer : n026.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 : Thu Jul 14 23:48:40 EDT 2022
% Result : Unsatisfiable 0.19s 0.42s
% Output : Proof 0.19s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(g0,plain,
~ sPE(multiply(a,a),a),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_a_times_a_is_a)]) ).
cnf(g1,plain,
( ~ sPE(a,multiply(a,a))
| sPE(multiply(a,a),a) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g2,plain,
sPE(add(a,additive_identity),a),
inference(ground_cnf,[],[file('Axioms/BOO004-0.ax',additive_id1)]) ).
cnf(g3,plain,
sPE(multiply(a,a),multiply(a,a)),
inference(ground_cnf,[],[file('Axioms/BOO004-0.ax',commutativity_of_multiply)]) ).
cnf(g4,plain,
sPE(multiply(a,multiplicative_identity),a),
inference(ground_cnf,[],[file('Axioms/BOO004-0.ax',multiplicative_id1)]) ).
cnf(g5,plain,
( ~ sPE(add(a,additive_identity),a)
| sPE(a,add(a,additive_identity)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g6,plain,
sPE(add(multiply(a,a),additive_identity),multiply(a,a)),
inference(ground_cnf,[],[file('Axioms/BOO004-0.ax',additive_id1)]) ).
cnf(g7,plain,
( ~ sPE(a,add(a,additive_identity))
| ~ sPE(add(a,additive_identity),multiply(a,a))
| sPE(a,multiply(a,a)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g8,plain,
( ~ sPE(add(a,additive_identity),add(multiply(a,a),additive_identity))
| ~ sPE(add(multiply(a,a),additive_identity),multiply(a,a))
| sPE(add(a,additive_identity),multiply(a,a)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g9,plain,
( ~ sPE(add(a,additive_identity),a)
| ~ sPE(a,add(multiply(a,a),additive_identity))
| sPE(add(a,additive_identity),add(multiply(a,a),additive_identity)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g10,plain,
sPE(a,a),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g11,plain,
sPE(multiply(a,inverse(a)),additive_identity),
inference(ground_cnf,[],[file('Axioms/BOO004-0.ax',multiplicative_inverse1)]) ).
cnf(g12,plain,
( ~ sPE(a,add(multiply(a,a),multiply(a,inverse(a))))
| ~ sPE(add(multiply(a,a),multiply(a,inverse(a))),add(multiply(a,a),additive_identity))
| sPE(a,add(multiply(a,a),additive_identity)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g13,plain,
( ~ sPE(multiply(a,a),multiply(a,a))
| ~ sPE(multiply(a,inverse(a)),additive_identity)
| sPE(add(multiply(a,a),multiply(a,inverse(a))),add(multiply(a,a),additive_identity)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g14,plain,
sPE(add(a,inverse(a)),multiplicative_identity),
inference(ground_cnf,[],[file('Axioms/BOO004-0.ax',additive_inverse1)]) ).
cnf(g15,plain,
( ~ sPE(a,multiply(a,add(a,inverse(a))))
| ~ sPE(multiply(a,add(a,inverse(a))),add(multiply(a,a),multiply(a,inverse(a))))
| sPE(a,add(multiply(a,a),multiply(a,inverse(a)))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g16,plain,
sPE(multiply(a,add(a,inverse(a))),add(multiply(a,a),multiply(a,inverse(a)))),
inference(ground_cnf,[],[file('Axioms/BOO004-0.ax',distributivity2)]) ).
cnf(g17,plain,
( ~ sPE(multiply(a,add(a,inverse(a))),a)
| sPE(a,multiply(a,add(a,inverse(a)))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g18,plain,
( ~ sPE(multiply(a,add(a,inverse(a))),multiply(a,multiplicative_identity))
| ~ sPE(multiply(a,multiplicative_identity),a)
| sPE(multiply(a,add(a,inverse(a))),a) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g19,plain,
( ~ sPE(a,a)
| ~ sPE(add(a,inverse(a)),multiplicative_identity)
| sPE(multiply(a,add(a,inverse(a))),multiply(a,multiplicative_identity)) ),
inference(ground_cnf,[],[theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : BOO003-4 : TPTP v8.1.0. Released v1.1.0.
% 0.06/0.12 % Command : satcop --statistics %s
% 0.12/0.33 % Computer : n026.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Wed Jun 1 18:48:12 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.42 % symbols: 8
% 0.19/0.42 % clauses: 15
% 0.19/0.42 % start clauses: 1
% 0.19/0.42 % iterative deepening steps: 324
% 0.19/0.42 % maximum path limit: 12
% 0.19/0.42 % literal attempts: 18102
% 0.19/0.42 % depth failures: 4635
% 0.19/0.42 % regularity failures: 2318
% 0.19/0.42 % tautology failures: 1773
% 0.19/0.42 % reductions: 0
% 0.19/0.42 % extensions: 17989
% 0.19/0.42 % SAT variables: 9597
% 0.19/0.42 % SAT clauses: 15364
% 0.19/0.42 % WalkSAT solutions: 15363
% 0.19/0.42 % CDCL solutions: 0
% 0.19/0.42 % SZS status Unsatisfiable for theBenchmark
% 0.19/0.42 % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------