TSTP Solution File: RNG024-6 by SATCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SATCoP---0.1
% Problem : RNG024-6 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : satcop --statistics %s
% Computer : n018.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 : Mon Jul 18 20:40:13 EDT 2022
% Result : Unsatisfiable 0.12s 0.34s
% Output : Proof 0.12s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(g0,plain,
~ sPE(associator(x,y,y),additive_identity),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_right_alternative)]) ).
cnf(g1,plain,
sPE(associator(x,y,y),add(multiply(multiply(x,y),y),additive_inverse(multiply(x,multiply(y,y))))),
inference(ground_cnf,[],[file('Axioms/RNG003-0.ax',associator)]) ).
cnf(g2,plain,
( ~ sPE(associator(x,y,y),add(multiply(x,multiply(y,y)),additive_inverse(multiply(x,multiply(y,y)))))
| ~ sPE(add(multiply(x,multiply(y,y)),additive_inverse(multiply(x,multiply(y,y)))),additive_identity)
| sPE(associator(x,y,y),additive_identity) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g3,plain,
( ~ sPE(add(multiply(x,multiply(y,y)),additive_inverse(multiply(x,multiply(y,y)))),add(additive_inverse(multiply(x,multiply(y,y))),multiply(x,multiply(y,y))))
| ~ sPE(add(additive_inverse(multiply(x,multiply(y,y))),multiply(x,multiply(y,y))),additive_identity)
| sPE(add(multiply(x,multiply(y,y)),additive_inverse(multiply(x,multiply(y,y)))),additive_identity) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g4,plain,
sPE(add(additive_inverse(multiply(x,multiply(y,y))),multiply(x,multiply(y,y))),additive_identity),
inference(ground_cnf,[],[file('Axioms/RNG003-0.ax',left_additive_inverse)]) ).
cnf(g5,plain,
sPE(add(multiply(x,multiply(y,y)),additive_inverse(multiply(x,multiply(y,y)))),add(additive_inverse(multiply(x,multiply(y,y))),multiply(x,multiply(y,y)))),
inference(ground_cnf,[],[file('Axioms/RNG003-0.ax',commutativity_for_addition)]) ).
cnf(g6,plain,
( ~ sPE(associator(x,y,y),add(multiply(multiply(x,y),y),additive_inverse(multiply(x,multiply(y,y)))))
| ~ sPE(add(multiply(multiply(x,y),y),additive_inverse(multiply(x,multiply(y,y)))),add(multiply(x,multiply(y,y)),additive_inverse(multiply(x,multiply(y,y)))))
| sPE(associator(x,y,y),add(multiply(x,multiply(y,y)),additive_inverse(multiply(x,multiply(y,y))))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g7,plain,
( ~ sPE(multiply(multiply(x,y),y),multiply(x,multiply(y,y)))
| ~ sPE(additive_inverse(multiply(x,multiply(y,y))),additive_inverse(multiply(x,multiply(y,y))))
| sPE(add(multiply(multiply(x,y),y),additive_inverse(multiply(x,multiply(y,y)))),add(multiply(x,multiply(y,y)),additive_inverse(multiply(x,multiply(y,y))))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g8,plain,
sPE(multiply(multiply(x,y),y),multiply(x,multiply(y,y))),
inference(ground_cnf,[],[file('Axioms/RNG003-0.ax',right_alternative)]) ).
cnf(g9,plain,
sPE(additive_inverse(multiply(x,multiply(y,y))),additive_inverse(multiply(x,multiply(y,y)))),
inference(ground_cnf,[],[theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : RNG024-6 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.12 % Command : satcop --statistics %s
% 0.12/0.33 % Computer : n018.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.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Mon May 30 09:08:27 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.34 % symbols: 10
% 0.12/0.34 % clauses: 24
% 0.12/0.34 % start clauses: 1
% 0.12/0.34 % iterative deepening steps: 201
% 0.12/0.34 % maximum path limit: 4
% 0.12/0.34 % literal attempts: 4105
% 0.12/0.34 % depth failures: 1507
% 0.12/0.34 % regularity failures: 496
% 0.12/0.34 % tautology failures: 304
% 0.12/0.34 % reductions: 0
% 0.12/0.34 % extensions: 3928
% 0.12/0.34 % SAT variables: 1649
% 0.12/0.34 % SAT clauses: 2207
% 0.12/0.34 % WalkSAT solutions: 2207
% 0.12/0.34 % CDCL solutions: 0
% 0.12/0.34 % SZS status Unsatisfiable for theBenchmark
% 0.12/0.34 % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------