TSTP Solution File: ROB018-1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : ROB018-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% 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 : Mon Jul 18 20:56:01 EDT 2022
% Result : Unsatisfiable 23.63s 23.85s
% Output : Refutation 23.63s
% Verified :
% SZS Type : Refutation
% Derivation depth : 25
% Number of leaves : 3
% Syntax : Number of clauses : 112 ( 112 unt; 0 nHn; 73 RR)
% Number of literals : 112 ( 111 equ; 4 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 16 ( 3 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 47 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(robbins_axiom,axiom,
negate(add(negate(add(X,Y)),negate(add(X,negate(Y))))) = X,
file('/export/starexec/sandbox/benchmark/Axioms/ROB001-0.ax',robbins_axiom) ).
cnf(condition,hypothesis,
negate(add(d,negate(e))) = negate(e),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',condition) ).
cnf(prove_result,negated_conjecture,
add(e,multiply(successor(successor(one)),add(d,negate(add(d,negate(e)))))) != add(e,multiply(successor(one),add(d,negate(add(d,negate(e)))))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_result) ).
cnf(8,plain,
add(e,multiply(successor(successor(one)),add(d,negate(e)))) != add(e,multiply(successor(one),add(d,negate(e)))),
inference('REWRITE',[status(thm)],[prove_result,condition,theory(equality)]) ).
cnf(11,plain,
negate(add(negate(add(d,e)),negate(e))) = d,
inference('PARAMODULATE',[status(thm)],[robbins_axiom,condition,theory(equality)]) ).
cnf(12,plain,
negate(add(negate(e),negate(add(d,negate(negate(e)))))) = d,
inference('PARAMODULATE',[status(thm)],[robbins_axiom,condition,theory(equality)]) ).
cnf(13,plain,
negate(add(negate(e),negate(add(negate(e),negate(d))))) = negate(e),
inference('PARAMODULATE',[status(thm)],[robbins_axiom,condition,theory(equality)]) ).
cnf(14,plain,
negate(add(negate(add(X,add(d,negate(e)))),negate(add(X,negate(e))))) = X,
inference('PARAMODULATE',[status(thm)],[robbins_axiom,condition,theory(equality)]) ).
cnf(15,plain,
negate(add(negate(add(negate(add(X,Y)),add(X,negate(Y)))),X)) = negate(add(X,Y)),
inference('PARAMODULATE',[status(thm)],[robbins_axiom,robbins_axiom,theory(equality)]) ).
cnf(16,plain,
negate(add(negate(add(negate(add(X,negate(Y))),add(X,Y))),X)) = negate(add(X,negate(Y))),
inference('PARAMODULATE',[status(thm)],[robbins_axiom,robbins_axiom,theory(equality)]) ).
cnf(17,plain,
negate(add(X,negate(add(negate(add(X,Y)),negate(negate(add(X,negate(Y)))))))) = negate(add(X,Y)),
inference('PARAMODULATE',[status(thm)],[robbins_axiom,robbins_axiom,theory(equality)]) ).
cnf(19,plain,
negate(add(negate(add(X,add(negate(add(Y,Z)),negate(add(Y,negate(Z)))))),negate(add(X,Y)))) = X,
inference('PARAMODULATE',[status(thm)],[robbins_axiom,robbins_axiom,theory(equality)]) ).
cnf(30,plain,
negate(add(d,negate(add(negate(e),negate(negate(add(d,e))))))) = negate(e),
inference('PARAMODULATE',[status(thm)],[robbins_axiom,11,theory(equality)]) ).
cnf(31,plain,
negate(add(d,negate(add(negate(add(d,e)),negate(negate(e)))))) = negate(add(d,e)),
inference('PARAMODULATE',[status(thm)],[robbins_axiom,11,theory(equality)]) ).
cnf(32,plain,
negate(add(negate(add(X,add(negate(add(d,e)),negate(e)))),negate(add(X,d)))) = X,
inference('PARAMODULATE',[status(thm)],[robbins_axiom,11,theory(equality)]) ).
cnf(39,plain,
negate(add(d,negate(add(negate(add(d,negate(negate(e)))),negate(negate(e)))))) = negate(add(d,negate(negate(e)))),
inference('PARAMODULATE',[status(thm)],[robbins_axiom,12,theory(equality)]) ).
cnf(40,plain,
negate(add(negate(add(negate(e),add(negate(e),negate(d)))),negate(e))) = negate(e),
inference('PARAMODULATE',[status(thm)],[robbins_axiom,13,theory(equality)]) ).
cnf(43,plain,
negate(add(negate(add(X,add(negate(e),negate(add(negate(e),negate(d)))))),negate(add(X,negate(e))))) = X,
inference('PARAMODULATE',[status(thm)],[robbins_axiom,13,theory(equality)]) ).
cnf(51,plain,
negate(add(negate(add(d,add(d,negate(e)))),negate(e))) = d,
inference('PARAMODULATE',[status(thm)],[14,condition,theory(equality)]) ).
cnf(53,plain,
negate(add(negate(add(negate(add(X,add(d,negate(e)))),add(X,negate(e)))),X)) = negate(add(X,add(d,negate(e)))),
inference('PARAMODULATE',[status(thm)],[robbins_axiom,14,theory(equality)]) ).
cnf(57,plain,
negate(add(negate(add(negate(e),add(d,add(d,negate(e))))),d)) = negate(e),
inference('PARAMODULATE',[status(thm)],[robbins_axiom,51,theory(equality)]) ).
cnf(59,plain,
negate(add(negate(add(negate(add(d,add(d,negate(e)))),e)),d)) = negate(add(d,add(d,negate(e)))),
inference('PARAMODULATE',[status(thm)],[robbins_axiom,51,theory(equality)]) ).
cnf(70,plain,
negate(add(negate(add(negate(e),add(negate(e),add(negate(e),negate(d))))),negate(e))) = negate(e),
inference('PARAMODULATE',[status(thm)],[robbins_axiom,40,theory(equality)]) ).
cnf(84,plain,
negate(add(negate(add(d,add(negate(e),negate(negate(add(d,e)))))),negate(e))) = d,
inference('PARAMODULATE',[status(thm)],[robbins_axiom,30,theory(equality)]) ).
cnf(93,plain,
negate(add(negate(add(X,add(negate(add(X,Y)),add(X,negate(Y))))),negate(add(X,Y)))) = X,
inference('PARAMODULATE',[status(thm)],[robbins_axiom,15,theory(equality)]) ).
cnf(115,plain,
negate(add(negate(add(negate(add(X,add(negate(add(d,e)),negate(e)))),add(X,d))),X)) = negate(add(X,add(negate(add(d,e)),negate(e)))),
inference('PARAMODULATE',[status(thm)],[15,11,theory(equality)]) ).
cnf(130,plain,
negate(add(negate(add(negate(add(X,add(negate(add(d,add(d,negate(e)))),negate(e)))),add(X,d))),X)) = negate(add(X,add(negate(add(d,add(d,negate(e)))),negate(e)))),
inference('PARAMODULATE',[status(thm)],[15,51,theory(equality)]) ).
cnf(187,plain,
negate(add(negate(add(X,add(negate(add(X,negate(Y))),add(X,Y)))),negate(add(X,negate(Y))))) = X,
inference('PARAMODULATE',[status(thm)],[robbins_axiom,16,theory(equality)]) ).
cnf(188,plain,
negate(add(negate(add(negate(e),add(negate(e),add(negate(e),add(negate(e),negate(d)))))),negate(e))) = negate(e),
inference('PARAMODULATE',[status(thm)],[16,40,theory(equality)]) ).
cnf(256,plain,
negate(add(negate(add(negate(add(negate(e),add(negate(e),add(negate(e),negate(d))))),add(d,negate(e)))),negate(e))) = negate(add(negate(e),add(negate(e),add(negate(e),negate(d))))),
inference('PARAMODULATE',[status(thm)],[14,70,theory(equality)]) ).
cnf(277,plain,
negate(add(negate(add(negate(add(d,add(negate(e),negate(negate(add(d,e)))))),add(d,negate(e)))),d)) = negate(add(d,add(negate(e),negate(negate(add(d,e)))))),
inference('PARAMODULATE',[status(thm)],[14,84,theory(equality)]) ).
cnf(764,plain,
negate(add(negate(add(d,add(negate(add(X,negate(e))),negate(add(negate(e),negate(X)))))),negate(e))) = d,
inference('PARAMODULATE',[status(thm)],[19,condition,theory(equality)]) ).
cnf(806,plain,
negate(add(negate(add(negate(e),add(negate(add(X,negate(add(d,negate(negate(e)))))),negate(add(negate(add(d,negate(negate(e)))),negate(X)))))),d)) = negate(e),
inference('PARAMODULATE',[status(thm)],[19,12,theory(equality)]) ).
cnf(1156,plain,
negate(add(negate(e),negate(d))) = d,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[43,condition,theory(equality)]),16,theory(equality)]) ).
cnf(1157,plain,
negate(add(negate(add(negate(d),e)),d)) = negate(d),
inference('PARAMODULATE',[status(thm)],[robbins_axiom,1156,theory(equality)]) ).
cnf(1161,plain,
negate(add(negate(add(negate(d),add(d,negate(e)))),d)) = negate(d),
inference('PARAMODULATE',[status(thm)],[14,1156,theory(equality)]) ).
cnf(1162,plain,
negate(add(negate(add(d,add(negate(e),negate(negate(d))))),negate(e))) = d,
inference('PARAMODULATE',[status(thm)],[15,1156,theory(equality)]) ).
cnf(1181,plain,
negate(add(negate(add(negate(add(X,add(negate(e),negate(d)))),add(X,d))),X)) = negate(add(X,add(negate(e),negate(d)))),
inference('PARAMODULATE',[status(thm)],[15,1156,theory(equality)]) ).
cnf(1184,plain,
negate(add(negate(add(negate(d),add(d,add(negate(d),e)))),d)) = negate(d),
inference('PARAMODULATE',[status(thm)],[16,1157,theory(equality)]) ).
cnf(1282,plain,
negate(add(negate(add(negate(d),add(d,add(negate(d),add(d,negate(e)))))),d)) = negate(d),
inference('PARAMODULATE',[status(thm)],[16,1161,theory(equality)]) ).
cnf(1314,plain,
negate(add(negate(add(negate(e),add(d,add(negate(e),negate(negate(add(d,add(negate(e),negate(negate(d)))))))))),d)) = negate(e),
inference('PARAMODULATE',[status(thm)],[93,1162,theory(equality)]) ).
cnf(1570,plain,
negate(add(negate(add(negate(d),add(d,add(negate(d),add(d,add(negate(d),add(d,negate(e)))))))),d)) = negate(d),
inference('PARAMODULATE',[status(thm)],[16,1282,theory(equality)]) ).
cnf(1582,plain,
negate(add(d,negate(add(negate(add(d,add(negate(d),add(d,add(negate(d),add(d,negate(e))))))),negate(negate(d)))))) = negate(add(d,add(negate(d),add(d,add(negate(d),add(d,negate(e))))))),
inference('PARAMODULATE',[status(thm)],[17,1282,theory(equality)]) ).
cnf(1748,plain,
negate(add(negate(add(negate(add(X,add(negate(add(d,e)),negate(e)))),add(X,add(negate(add(X,add(negate(add(d,e)),negate(e)))),add(X,d))))),X)) = negate(add(X,add(negate(add(d,e)),negate(e)))),
inference('PARAMODULATE',[status(thm)],[187,32,theory(equality)]) ).
cnf(1795,plain,
negate(add(negate(add(negate(add(negate(e),add(negate(e),add(negate(e),add(negate(e),negate(d)))))),add(d,negate(e)))),negate(e))) = negate(add(negate(e),add(negate(e),add(negate(e),add(negate(e),negate(d)))))),
inference('PARAMODULATE',[status(thm)],[14,188,theory(equality)]) ).
cnf(1873,plain,
negate(add(negate(e),add(negate(e),add(negate(e),negate(d))))) = d,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[764,40,theory(equality)]),256,theory(equality)]) ).
cnf(1875,plain,
negate(add(negate(e),add(negate(e),negate(d)))) = d,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[764,1156,theory(equality)]),1181,condition,theory(equality)]) ).
cnf(1880,plain,
negate(add(negate(e),add(negate(add(d,e)),negate(e)))) = d,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[764,11,theory(equality)]),115,condition,theory(equality)]) ).
cnf(1897,plain,
negate(add(negate(e),add(negate(add(d,add(d,negate(e)))),negate(e)))) = d,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[764,51,theory(equality)]),130,condition,theory(equality)]) ).
cnf(1900,plain,
negate(add(negate(add(d,add(negate(add(negate(e),add(negate(e),add(negate(e),add(negate(e),add(negate(e),negate(d))))))),negate(e)))),negate(e))) = d,
inference('PARAMODULATE',[status(thm)],[764,188,theory(equality)]) ).
cnf(1902,plain,
negate(add(negate(add(d,add(negate(add(negate(add(X,negate(e))),add(negate(e),add(negate(X),negate(e))))),negate(add(X,negate(e)))))),negate(e))) = d,
inference('PARAMODULATE',[status(thm)],[764,15,theory(equality)]) ).
cnf(2005,plain,
negate(add(negate(add(negate(d),add(negate(e),add(d,negate(e))))),d)) = add(negate(e),negate(d)),
inference('PARAMODULATE',[status(thm)],[14,1875,theory(equality)]) ).
cnf(2011,plain,
negate(add(negate(add(negate(e),add(negate(e),add(d,add(negate(e),add(negate(e),d)))))),d)) = add(negate(e),negate(e)),
inference('PARAMODULATE',[status(thm)],[187,1875,theory(equality)]) ).
cnf(2064,plain,
negate(add(negate(e),add(negate(e),add(negate(e),add(negate(e),negate(d)))))) = d,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[764,1873,theory(equality)]),1795,condition,theory(equality)]) ).
cnf(2100,plain,
negate(add(negate(add(negate(e),add(negate(add(d,e)),add(d,negate(e))))),d)) = add(negate(add(d,e)),negate(e)),
inference('PARAMODULATE',[status(thm)],[14,1880,theory(equality)]) ).
cnf(2194,plain,
negate(add(negate(add(negate(e),add(negate(add(d,add(d,negate(e)))),add(d,negate(e))))),d)) = add(negate(add(d,add(d,negate(e)))),negate(e)),
inference('PARAMODULATE',[status(thm)],[14,1897,theory(equality)]) ).
cnf(2204,plain,
negate(add(negate(add(d,add(negate(add(negate(e),add(negate(add(d,add(d,negate(e)))),add(negate(e),negate(e))))),negate(e)))),negate(e))) = d,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[764,1897,theory(equality)]),condition,theory(equality)]) ).
cnf(2218,plain,
negate(add(negate(add(negate(add(X,add(negate(e),add(negate(add(d,add(d,negate(e)))),negate(e))))),add(X,d))),X)) = negate(add(X,add(negate(e),add(negate(add(d,add(d,negate(e)))),negate(e))))),
inference('PARAMODULATE',[status(thm)],[15,1897,theory(equality)]) ).
cnf(2219,plain,
negate(add(negate(e),add(negate(add(d,add(d,negate(e)))),add(negate(e),negate(e))))) = d,
inference('REWRITE',[status(thm)],[2204,2218,theory(equality)]) ).
cnf(2274,plain,
negate(add(negate(add(negate(add(X,add(negate(e),add(negate(e),add(negate(e),add(negate(e),negate(d))))))),add(X,d))),X)) = negate(add(X,add(negate(e),add(negate(e),add(negate(e),add(negate(e),negate(d))))))),
inference('PARAMODULATE',[status(thm)],[15,2064,theory(equality)]) ).
cnf(2275,plain,
negate(add(negate(e),add(negate(e),add(negate(e),add(negate(e),add(negate(e),negate(d))))))) = d,
inference('REWRITE',[status(thm)],[1900,2274,theory(equality)]) ).
cnf(2553,plain,
negate(add(negate(add(negate(e),add(negate(e),add(negate(e),add(negate(e),add(negate(e),add(d,add(negate(e),add(negate(e),add(negate(e),add(negate(e),add(negate(e),d)))))))))))),d)) = add(negate(e),add(negate(e),add(negate(e),add(negate(e),negate(e))))),
inference('PARAMODULATE',[status(thm)],[187,2275,theory(equality)]) ).
cnf(2711,plain,
add(negate(e),negate(e)) = add(negate(e),add(negate(e),negate(e))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[robbins_axiom,2219,theory(equality)]),2011,theory(equality)]) ).
cnf(2797,plain,
negate(e) = add(negate(e),negate(e)),
inference('REWRITE',[status(thm)],[2553,57,2711,theory(equality)]) ).
cnf(2798,plain,
add(X,add(negate(e),negate(e))) = add(X,negate(e)),
inference('EMBED',[status(thm)],[2797]) ).
cnf(2821,plain,
negate(add(d,add(d,negate(e)))) = add(negate(add(d,add(d,negate(e)))),negate(e)),
inference('REWRITE',[status(thm)],[2194,53,2797,theory(equality)]) ).
cnf(2831,plain,
negate(negate(add(d,add(d,negate(e))))) = d,
inference('REWRITE',[status(thm)],[51,2821,theory(equality)]) ).
cnf(2834,plain,
negate(add(d,e)) = add(negate(add(d,e)),negate(e)),
inference('REWRITE',[status(thm)],[2100,15,2797,theory(equality)]) ).
cnf(2893,plain,
negate(add(negate(add(negate(add(X,negate(add(d,e)))),add(X,add(negate(add(X,negate(add(d,e)))),add(X,d))))),X)) = negate(add(X,negate(add(d,e)))),
inference('REWRITE',[status(thm)],[1748,2834,theory(equality)]) ).
cnf(2895,plain,
negate(negate(add(d,e))) = d,
inference('REWRITE',[status(thm)],[11,2834,theory(equality)]) ).
cnf(2898,plain,
negate(add(negate(add(d,negate(add(d,add(d,negate(e)))))),d)) = negate(add(d,add(d,negate(e)))),
inference('REWRITE',[status(thm)],[277,2821,2895,theory(equality)]) ).
cnf(2915,plain,
negate(d) = add(negate(e),negate(d)),
inference('REWRITE',[status(thm)],[2005,1161,2797,theory(equality)]) ).
cnf(2920,plain,
negate(add(negate(add(negate(d),add(negate(d),add(d,add(d,add(d,negate(d))))))),d)) = negate(d),
inference('REWRITE',[status(thm)],[1570,2915,theory(equality)]) ).
cnf(2924,plain,
negate(add(d,negate(add(negate(add(negate(d),add(d,add(d,add(d,negate(d)))))),negate(negate(d)))))) = negate(add(negate(d),add(d,add(d,add(d,negate(d)))))),
inference('REWRITE',[status(thm)],[1582,2915,theory(equality)]) ).
cnf(3012,plain,
negate(negate(d)) = d,
inference('REWRITE',[status(thm)],[1156,2915,theory(equality)]) ).
cnf(3020,plain,
negate(add(d,negate(add(negate(add(negate(d),add(d,add(d,add(d,negate(d)))))),d)))) = negate(add(negate(d),add(d,add(d,add(d,negate(d)))))),
inference('REWRITE',[status(thm)],[2924,3012,theory(equality)]) ).
cnf(3027,plain,
negate(add(negate(add(d,add(negate(add(negate(add(X,negate(e))),add(negate(e),negate(X)))),negate(add(X,negate(e)))))),negate(e))) = d,
inference('REWRITE',[status(thm)],[1902,2797,theory(equality)]) ).
cnf(3034,plain,
negate(add(d,negate(add(d,add(d,negate(e)))))) = negate(e),
inference('REWRITE',[status(thm)],[1314,2831,3012,2797,theory(equality)]) ).
cnf(3035,plain,
negate(e) = negate(add(d,add(d,negate(e)))),
inference('REWRITE',[status(thm)],[2898,condition,3034,theory(equality)]) ).
cnf(3036,plain,
negate(add(negate(add(negate(e),e)),d)) = negate(e),
inference('REWRITE',[status(thm)],[59,3035,theory(equality)]) ).
cnf(3054,plain,
negate(negate(e)) = d,
inference('REWRITE',[status(thm)],[2831,3035,theory(equality)]) ).
cnf(3055,plain,
negate(add(d,negate(add(negate(add(d,e)),d)))) = negate(add(d,e)),
inference('REWRITE',[status(thm)],[31,3054,theory(equality)]) ).
cnf(3057,plain,
negate(add(d,negate(add(negate(add(d,d)),d)))) = negate(add(d,d)),
inference('REWRITE',[status(thm)],[39,3054,theory(equality)]) ).
cnf(3135,plain,
negate(add(negate(add(negate(e),add(negate(add(X,negate(add(d,d)))),negate(add(negate(add(d,d)),negate(X)))))),d)) = negate(e),
inference('REWRITE',[status(thm)],[806,3054,theory(equality)]) ).
cnf(3326,plain,
X = add(X,negate(e)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[14,2798,theory(equality)]),14,2797,theory(equality)]) ).
cnf(3334,plain,
negate(add(negate(add(d,d)),d)) = negate(e),
inference('REWRITE',[status(thm)],[3135,robbins_axiom,3326,theory(equality)]) ).
cnf(3335,plain,
negate(d) = negate(add(d,d)),
inference('REWRITE',[status(thm)],[3057,3326,3334,theory(equality)]) ).
cnf(3348,plain,
negate(d) = negate(e),
inference('REWRITE',[status(thm)],[3036,3326,theory(equality)]) ).
cnf(3349,plain,
X = add(X,negate(d)),
inference('REWRITE',[status(thm)],[3326,3348,theory(equality)]) ).
cnf(3364,plain,
negate(add(d,negate(add(negate(add(d,add(d,d))),d)))) = negate(add(d,add(d,d))),
inference('REWRITE',[status(thm)],[3020,3349,theory(equality)]) ).
cnf(3365,plain,
negate(add(negate(add(d,add(d,d))),d)) = negate(d),
inference('REWRITE',[status(thm)],[2920,3349,theory(equality)]) ).
cnf(3366,plain,
negate(d) = negate(add(d,add(d,d))),
inference('REWRITE',[status(thm)],[3364,3349,3365,theory(equality)]) ).
cnf(3381,plain,
negate(add(negate(add(d,e)),d)) = negate(d),
inference('REWRITE',[status(thm)],[1184,3349,theory(equality)]) ).
cnf(3382,plain,
negate(d) = negate(add(d,e)),
inference('REWRITE',[status(thm)],[3055,3349,3381,theory(equality)]) ).
cnf(3424,plain,
negate(add(negate(add(negate(X),add(X,add(negate(X),add(X,d))))),X)) = negate(X),
inference('REWRITE',[status(thm)],[2893,3349,3382,theory(equality)]) ).
cnf(3453,plain,
negate(negate(add(d,add(negate(add(negate(X),negate(X))),negate(X))))) = d,
inference('REWRITE',[status(thm)],[3027,3349,3348,3326,theory(equality)]) ).
cnf(3457,plain,
add(e,multiply(successor(successor(one)),d)) != add(e,multiply(successor(one),d)),
inference('REWRITE',[status(thm)],[8,3326,theory(equality)]) ).
cnf(3474,plain,
d = e,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[robbins_axiom,3382,theory(equality)]),3012,3348,3349,theory(equality)]) ).
cnf(3476,plain,
add(d,multiply(successor(successor(one)),d)) != add(d,multiply(successor(one),d)),
inference('REWRITE',[status(thm)],[3457,3474,theory(equality)]) ).
cnf(3477,plain,
negate(negate(add(negate(X),negate(X)))) = negate(X),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[15,3349,theory(equality)]),3349,theory(equality)]) ).
cnf(3478,plain,
negate(negate(add(negate(negate(X)),X))) = negate(negate(X)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[16,3349,theory(equality)]),3349,theory(equality)]) ).
cnf(3482,plain,
negate(negate(negate(X))) = negate(X),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[17,3349,theory(equality)]),3478,3349,theory(equality)]) ).
cnf(3485,plain,
d = add(d,d),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[robbins_axiom,3366,theory(equality)]),3012,3335,3349,theory(equality)]) ).
cnf(3486,plain,
add(X,add(d,d)) = add(X,d),
inference('EMBED',[status(thm)],[3485]) ).
cnf(3487,plain,
negate(add(negate(add(X,d)),negate(add(d,negate(add(X,d)))))) = d,
inference('PARAMODULATE',[status(thm)],[robbins_axiom,3486,theory(equality)]) ).
cnf(3535,plain,
negate(negate(X)) = X,
inference('PARAMODULATE',[status(thm)],[3482,robbins_axiom,theory(equality)]) ).
cnf(3536,plain,
add(negate(X),negate(X)) = negate(X),
inference('REWRITE',[status(thm)],[3477,3535,theory(equality)]) ).
cnf(3552,plain,
negate(add(negate(add(X,add(negate(X),add(X,d)))),X)) = negate(X),
inference('REWRITE',[status(thm)],[3424,3536,theory(equality)]) ).
cnf(3589,plain,
add(negate(X),add(X,d)) = d,
inference('REWRITE',[status(thm)],[3453,3536,3535,theory(equality)]) ).
cnf(3591,plain,
negate(add(negate(add(X,d)),X)) = negate(X),
inference('REWRITE',[status(thm)],[3552,3589,theory(equality)]) ).
cnf(3592,plain,
add(X,d) = d,
inference('REWRITE',[status(thm)],[3487,3535,3591,theory(equality)]) ).
cnf(3594,plain,
$false,
inference('REWRITE',[status(thm)],[3476,3592,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : ROB018-1 : TPTP v8.1.0. Released v1.0.0.
% 0.11/0.11 % Command : run-snark %s %d
% 0.11/0.30 % Computer : n032.cluster.edu
% 0.11/0.30 % Model : x86_64 x86_64
% 0.11/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.30 % Memory : 8042.1875MB
% 0.11/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.30 % CPULimit : 300
% 0.11/0.30 % WCLimit : 600
% 0.11/0.30 % DateTime : Thu Jun 9 13:50:52 EDT 2022
% 0.11/0.30 % CPUTime :
% 0.15/0.39 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.15/0.39 *
% 0.15/0.39 *
% 0.15/0.40 #<PACKAGE "SNARK-USER">
% 0.15/0.40 *
% 0.15/0.40 SNARK-TPTP-OPTIONS
% 0.15/0.40 *
% 0.15/0.40 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.15/0.40 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.15/0.40 (USE-FACTORING :POS)
% 0.15/0.40 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.15/0.40 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.15/0.40 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.15/0.40 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.15/0.40 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.15/0.40 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.15/0.40 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.15/0.40 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.15/0.40 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.15/0.40 (DECLARE-TPTP-SYMBOLS2))
% 0.15/0.40 *
% 0.15/0.40 "."
% 0.15/0.40 *
% 0.15/0.40 ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-09T13:50:53
% 0.15/0.40 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n032.cluster.edu at 2022-06-09T13:50:53
% 0.15/0.41
% 0.15/0.41 ; Recognized commutativity assertion (= (|add| ?X ?Y) (|add| ?Y ?X)).
% 0.15/0.41 ; Recognized associativity assertion (= (|add| (|add| ?X ?Y) ?Z) (|add| ?X (|add| ?Y ?Z))).
% 0.15/0.41 ; Recognized left identity assertion (= (|multiply| |one| ?X) ?X).
% 0.15/0.41 ; Declaring add to be commutative.
% 23.63/23.85 ; Declaring add to be associative-commutative.
% 23.63/23.85
% 23.63/23.85 #||
% 23.63/23.85 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 23.63/23.85 % SZS output start Refutation
% See solution above
% 23.63/23.86 ||#
% 23.63/23.86
% 23.63/23.86 ; Summary of computation:
% 23.63/23.86 ; 7337 formulas have been input or derived (from 116 formulas).
% 23.63/23.86 ; 3594 (49%) were retained. Of these,
% 23.63/23.86 ; 3425 (95%) were simplified or subsumed later,
% 23.63/23.86 ; 169 ( 5%) are still being kept.
% 23.63/23.86 ;
% 23.63/23.86 ; Run time in seconds excluding printing time:
% 23.63/23.86 ; 0.002 0% Read assertion file (1 call)
% 23.63/23.86 ; 0.000 0% Assert (9 calls)
% 23.63/23.86 ; 1.549 7% Process new row (7,216 calls)
% 23.63/23.86 ; 0.020 0% Resolution (230 calls)
% 23.63/23.87 ; 0.223 1% Paramodulation (115 calls)
% 23.63/23.87 ; 0.000 0% Embedding (323 calls)
% 23.63/23.87 ; 0.000 0% Condensing (2 calls)
% 23.63/23.87 ; 0.000 0% Forward subsumption (2 calls)
% 23.63/23.87 ; 0.000 0% Backward subsumption (2 calls)
% 23.63/23.87 ; 18.857 80% Forward simplification (6,928 calls)
% 23.63/23.87 ; 1.463 6% Backward simplification (3,572 calls)
% 23.63/23.87 ; 0.017 0% Ordering (8,142 calls)
% 23.63/23.87 ; 1.265 5% Ordering ac (3,144 calls)
% 23.63/23.87 ; 0.000 0% Sortal reasoning (32 calls)
% 23.63/23.87 ; 0.000 0% Purity testing (1 call)
% 23.63/23.87 ; 0.054 0% Other
% 23.63/23.87 ; 23.450 Total
% 23.63/23.87 ; 23.468 Real time
% 23.63/23.87 ;
% 23.63/23.87 ; Term-hash-array has 19,256 terms in all.
% 23.63/23.87 ; Feature-vector-row-index has 2 entries (2 at peak, 2 added, 0 deleted).
% 23.63/23.87 ; Feature-vector-row-index has 12 nodes (12 at peak, 12 added, 0 deleted).
% 23.63/23.87 ; Retrieved 0 possibly forward subsuming rows in 2 calls.
% 23.63/23.87 ; Retrieved 0 possibly backward subsumed rows in 2 calls.
% 23.63/23.87 ; Path-index has 981 entries (13,785 at peak, 19,348 added, 18,367 deleted).
% 23.63/23.87 ; Path-index has 594 nodes (1,101 at peak, 1,404 added, 810 deleted).
% 23.63/23.87 ; Trie-index has 981 entries (13,785 at peak, 19,348 added, 18,367 deleted).
% 23.63/23.87 ; Trie-index has 159 nodes (183 at peak, 233 added, 74 deleted).
% 23.63/23.87 ; Retrieved 33,134,422 generalization terms in 76,940 calls.
% 23.63/23.87 ; Retrieved 100,222 instance terms in 3,569 calls.
% 23.63/23.87 ; Retrieved 83,180 unifiable terms in 1,172 calls.
% 23.63/23.87 ;
% 23.63/23.87 ; The agenda of backward simplifiable rows to process has 70 entries:
% 23.63/23.87 ; 70 with value 0
% 23.63/23.87 ; The agenda of rows to process has 14 entries:
% 23.63/23.87 ; 1 with value 18 1 with value 26 2 with value 39
% 23.63/23.87 ; 1 with value 19 1 with value 27 1 with value 40
% 23.63/23.87 ; 1 with value 22 1 with value 30 3 with value 41
% 23.63/23.87 ; 1 with value 24 1 with value 37
% 23.63/23.87 ; The agenda of rows to give has 143 entries:
% 23.63/23.87 ; 2 with value (4 15) 2 with value (4 46) 1 with value (4 64)
% 23.63/23.87 ; 1 with value (4 16) 10 with value (4 47) 3 with value (4 65)
% 23.63/23.87 ; 2 with value (4 18) 4 with value (4 48) 8 with value (4 66)
% 23.63/23.87 ; 1 with value (4 19) 7 with value (4 49) 1 with value (4 67)
% 23.63/23.87 ; 1 with value (4 29) 6 with value (4 50) 5 with value (4 68)
% 23.63/23.87 ; 1 with value (4 31) 3 with value (4 51) 2 with value (4 69)
% 23.63/23.87 ; 2 with value (4 32) 4 with value (4 52) 2 with value (4 70)
% 23.63/23.87 ; 1 with value (4 33) 4 with value (4 53) 2 with value (4 71)
% 23.63/23.87 ; 3 with value (4 34) 4 with value (4 54) 2 with value (4 72)
% 23.63/23.87 ; 1 with value (4 36) 4 with value (4 55) 1 with value (4 74)
% 23.63/23.87 ; 1 with value (4 37) 3 with value (4 56) 1 with value (4 79)
% 23.63/23.87 ; 1 with value (4 38) 4 with value (4 57) 1 with value (4 81)
% 23.63/23.87 ; 3 with value (4 39) 4 with value (4 58) 1 with value (4 85)
% 23.63/23.87 ; 2 with value (4 40) 3 with value (4 59) 1 with value (4 86)
% 23.63/23.87 ; 2 with value (4 41) 3 with value (4 60) 1 with value (4 89)
% 23.63/23.87 ; 2 with value (4 42) 3 with value (4 61) 1 with value (4 90)
% 23.63/23.87 ; 2 with value (4 43) 2 with value (4 62) 1 with value (4 103)
% 23.63/23.87 ; 3 with value (4 44) 3 with value (4 63) 1 with value (4 104)
% 23.63/23.87 ; 4 with value (4 45)
% 23.63/23.87 Evaluation took:
% 23.63/23.87 23.469 seconds of real time
% 23.63/23.87 23.280104 seconds of user run time
% 23.63/23.87 0.187143 seconds of system run time
% 23.63/23.87 [Run times include 0.831 seconds GC run time.]
% 23.63/23.87 0 calls to %EVAL
% 23.63/23.87 0 page faults and
% 23.63/23.87 1,442,878,968 bytes consed.
% 23.63/23.87 :PROOF-FOUND
% 23.63/23.87 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-09T13:51:16
% 23.63/23.87 :PROOF-FOUND
% 23.63/23.87 *
%------------------------------------------------------------------------------