TSTP Solution File: ROB018-10 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : ROB018-10 : TPTP v8.1.0. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n021.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 22.87s 23.09s
% Output : Refutation 22.87s
% 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/sandbox2/benchmark/theBenchmark.p',robbins_axiom) ).
cnf(condition,hypothesis,
negate(add(d,negate(e))) = negate(e),
file('/export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p',prove_result) ).
cnf(10,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(12,plain,
negate(add(negate(add(d,e)),negate(e))) = d,
inference('PARAMODULATE',[status(thm)],[robbins_axiom,condition,theory(equality)]) ).
cnf(13,plain,
negate(add(negate(e),negate(add(d,negate(negate(e)))))) = d,
inference('PARAMODULATE',[status(thm)],[robbins_axiom,condition,theory(equality)]) ).
cnf(14,plain,
negate(add(negate(e),negate(add(negate(e),negate(d))))) = negate(e),
inference('PARAMODULATE',[status(thm)],[robbins_axiom,condition,theory(equality)]) ).
cnf(15,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(16,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(17,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(18,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(20,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(31,plain,
negate(add(d,negate(add(negate(e),negate(negate(add(d,e))))))) = negate(e),
inference('PARAMODULATE',[status(thm)],[robbins_axiom,12,theory(equality)]) ).
cnf(32,plain,
negate(add(d,negate(add(negate(add(d,e)),negate(negate(e)))))) = negate(add(d,e)),
inference('PARAMODULATE',[status(thm)],[robbins_axiom,12,theory(equality)]) ).
cnf(33,plain,
negate(add(negate(add(X,add(negate(add(d,e)),negate(e)))),negate(add(X,d)))) = X,
inference('PARAMODULATE',[status(thm)],[robbins_axiom,12,theory(equality)]) ).
cnf(40,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,13,theory(equality)]) ).
cnf(41,plain,
negate(add(negate(add(negate(e),add(negate(e),negate(d)))),negate(e))) = negate(e),
inference('PARAMODULATE',[status(thm)],[robbins_axiom,14,theory(equality)]) ).
cnf(44,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,14,theory(equality)]) ).
cnf(53,plain,
negate(add(negate(add(d,add(d,negate(e)))),negate(e))) = d,
inference('PARAMODULATE',[status(thm)],[15,condition,theory(equality)]) ).
cnf(55,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,15,theory(equality)]) ).
cnf(59,plain,
negate(add(negate(add(negate(e),add(d,add(d,negate(e))))),d)) = negate(e),
inference('PARAMODULATE',[status(thm)],[robbins_axiom,53,theory(equality)]) ).
cnf(61,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,53,theory(equality)]) ).
cnf(72,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,41,theory(equality)]) ).
cnf(87,plain,
negate(add(negate(add(d,add(negate(e),negate(negate(add(d,e)))))),negate(e))) = d,
inference('PARAMODULATE',[status(thm)],[robbins_axiom,31,theory(equality)]) ).
cnf(96,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,16,theory(equality)]) ).
cnf(118,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)],[16,12,theory(equality)]) ).
cnf(133,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)],[16,53,theory(equality)]) ).
cnf(191,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,17,theory(equality)]) ).
cnf(192,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)],[17,41,theory(equality)]) ).
cnf(260,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)],[15,72,theory(equality)]) ).
cnf(281,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)],[15,87,theory(equality)]) ).
cnf(768,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)],[20,condition,theory(equality)]) ).
cnf(810,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)],[20,13,theory(equality)]) ).
cnf(1161,plain,
negate(add(negate(e),negate(d))) = d,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[44,condition,theory(equality)]),17,theory(equality)]) ).
cnf(1162,plain,
negate(add(negate(add(negate(d),e)),d)) = negate(d),
inference('PARAMODULATE',[status(thm)],[robbins_axiom,1161,theory(equality)]) ).
cnf(1166,plain,
negate(add(negate(add(negate(d),add(d,negate(e)))),d)) = negate(d),
inference('PARAMODULATE',[status(thm)],[15,1161,theory(equality)]) ).
cnf(1167,plain,
negate(add(negate(add(d,add(negate(e),negate(negate(d))))),negate(e))) = d,
inference('PARAMODULATE',[status(thm)],[16,1161,theory(equality)]) ).
cnf(1186,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)],[16,1161,theory(equality)]) ).
cnf(1189,plain,
negate(add(negate(add(negate(d),add(d,add(negate(d),e)))),d)) = negate(d),
inference('PARAMODULATE',[status(thm)],[17,1162,theory(equality)]) ).
cnf(1287,plain,
negate(add(negate(add(negate(d),add(d,add(negate(d),add(d,negate(e)))))),d)) = negate(d),
inference('PARAMODULATE',[status(thm)],[17,1166,theory(equality)]) ).
cnf(1319,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)],[96,1167,theory(equality)]) ).
cnf(1575,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)],[17,1287,theory(equality)]) ).
cnf(1587,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)],[18,1287,theory(equality)]) ).
cnf(1753,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)],[191,33,theory(equality)]) ).
cnf(1800,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)],[15,192,theory(equality)]) ).
cnf(1878,plain,
negate(add(negate(e),add(negate(e),add(negate(e),negate(d))))) = d,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[768,41,theory(equality)]),260,theory(equality)]) ).
cnf(1880,plain,
negate(add(negate(e),add(negate(e),negate(d)))) = d,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[768,1161,theory(equality)]),1186,condition,theory(equality)]) ).
cnf(1885,plain,
negate(add(negate(e),add(negate(add(d,e)),negate(e)))) = d,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[768,12,theory(equality)]),118,condition,theory(equality)]) ).
cnf(1902,plain,
negate(add(negate(e),add(negate(add(d,add(d,negate(e)))),negate(e)))) = d,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[768,53,theory(equality)]),133,condition,theory(equality)]) ).
cnf(1905,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)],[768,192,theory(equality)]) ).
cnf(1907,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)],[768,16,theory(equality)]) ).
cnf(2010,plain,
negate(add(negate(add(negate(d),add(negate(e),add(d,negate(e))))),d)) = add(negate(e),negate(d)),
inference('PARAMODULATE',[status(thm)],[15,1880,theory(equality)]) ).
cnf(2016,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)],[191,1880,theory(equality)]) ).
cnf(2069,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)],[768,1878,theory(equality)]),1800,condition,theory(equality)]) ).
cnf(2105,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)],[15,1885,theory(equality)]) ).
cnf(2199,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)],[15,1902,theory(equality)]) ).
cnf(2209,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)],[768,1902,theory(equality)]),condition,theory(equality)]) ).
cnf(2223,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)],[16,1902,theory(equality)]) ).
cnf(2224,plain,
negate(add(negate(e),add(negate(add(d,add(d,negate(e)))),add(negate(e),negate(e))))) = d,
inference('REWRITE',[status(thm)],[2209,2223,theory(equality)]) ).
cnf(2279,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)],[16,2069,theory(equality)]) ).
cnf(2280,plain,
negate(add(negate(e),add(negate(e),add(negate(e),add(negate(e),add(negate(e),negate(d))))))) = d,
inference('REWRITE',[status(thm)],[1905,2279,theory(equality)]) ).
cnf(2558,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)],[191,2280,theory(equality)]) ).
cnf(2716,plain,
add(negate(e),negate(e)) = add(negate(e),add(negate(e),negate(e))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[robbins_axiom,2224,theory(equality)]),2016,theory(equality)]) ).
cnf(2802,plain,
negate(e) = add(negate(e),negate(e)),
inference('REWRITE',[status(thm)],[2558,59,2716,theory(equality)]) ).
cnf(2803,plain,
add(X,add(negate(e),negate(e))) = add(X,negate(e)),
inference('EMBED',[status(thm)],[2802]) ).
cnf(2826,plain,
negate(add(d,add(d,negate(e)))) = add(negate(add(d,add(d,negate(e)))),negate(e)),
inference('REWRITE',[status(thm)],[2199,55,2802,theory(equality)]) ).
cnf(2836,plain,
negate(negate(add(d,add(d,negate(e))))) = d,
inference('REWRITE',[status(thm)],[53,2826,theory(equality)]) ).
cnf(2839,plain,
negate(add(d,e)) = add(negate(add(d,e)),negate(e)),
inference('REWRITE',[status(thm)],[2105,16,2802,theory(equality)]) ).
cnf(2898,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)],[1753,2839,theory(equality)]) ).
cnf(2900,plain,
negate(negate(add(d,e))) = d,
inference('REWRITE',[status(thm)],[12,2839,theory(equality)]) ).
cnf(2903,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)],[281,2826,2900,theory(equality)]) ).
cnf(2920,plain,
negate(d) = add(negate(e),negate(d)),
inference('REWRITE',[status(thm)],[2010,1166,2802,theory(equality)]) ).
cnf(2925,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)],[1575,2920,theory(equality)]) ).
cnf(2929,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)],[1587,2920,theory(equality)]) ).
cnf(3017,plain,
negate(negate(d)) = d,
inference('REWRITE',[status(thm)],[1161,2920,theory(equality)]) ).
cnf(3025,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)],[2929,3017,theory(equality)]) ).
cnf(3032,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)],[1907,2802,theory(equality)]) ).
cnf(3039,plain,
negate(add(d,negate(add(d,add(d,negate(e)))))) = negate(e),
inference('REWRITE',[status(thm)],[1319,2836,3017,2802,theory(equality)]) ).
cnf(3040,plain,
negate(e) = negate(add(d,add(d,negate(e)))),
inference('REWRITE',[status(thm)],[2903,condition,3039,theory(equality)]) ).
cnf(3041,plain,
negate(add(negate(add(negate(e),e)),d)) = negate(e),
inference('REWRITE',[status(thm)],[61,3040,theory(equality)]) ).
cnf(3059,plain,
negate(negate(e)) = d,
inference('REWRITE',[status(thm)],[2836,3040,theory(equality)]) ).
cnf(3060,plain,
negate(add(d,negate(add(negate(add(d,e)),d)))) = negate(add(d,e)),
inference('REWRITE',[status(thm)],[32,3059,theory(equality)]) ).
cnf(3062,plain,
negate(add(d,negate(add(negate(add(d,d)),d)))) = negate(add(d,d)),
inference('REWRITE',[status(thm)],[40,3059,theory(equality)]) ).
cnf(3140,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)],[810,3059,theory(equality)]) ).
cnf(3332,plain,
X = add(X,negate(e)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[15,2803,theory(equality)]),15,2802,theory(equality)]) ).
cnf(3340,plain,
negate(add(negate(add(d,d)),d)) = negate(e),
inference('REWRITE',[status(thm)],[3140,robbins_axiom,3332,theory(equality)]) ).
cnf(3341,plain,
negate(d) = negate(add(d,d)),
inference('REWRITE',[status(thm)],[3062,3332,3340,theory(equality)]) ).
cnf(3354,plain,
negate(d) = negate(e),
inference('REWRITE',[status(thm)],[3041,3332,theory(equality)]) ).
cnf(3356,plain,
X = add(X,negate(d)),
inference('REWRITE',[status(thm)],[3332,3354,theory(equality)]) ).
cnf(3371,plain,
negate(add(d,negate(add(negate(add(d,add(d,d))),d)))) = negate(add(d,add(d,d))),
inference('REWRITE',[status(thm)],[3025,3356,theory(equality)]) ).
cnf(3372,plain,
negate(add(negate(add(d,add(d,d))),d)) = negate(d),
inference('REWRITE',[status(thm)],[2925,3356,theory(equality)]) ).
cnf(3373,plain,
negate(d) = negate(add(d,add(d,d))),
inference('REWRITE',[status(thm)],[3371,3356,3372,theory(equality)]) ).
cnf(3388,plain,
negate(add(negate(add(d,e)),d)) = negate(d),
inference('REWRITE',[status(thm)],[1189,3356,theory(equality)]) ).
cnf(3389,plain,
negate(d) = negate(add(d,e)),
inference('REWRITE',[status(thm)],[3060,3356,3388,theory(equality)]) ).
cnf(3431,plain,
negate(add(negate(add(negate(X),add(X,add(negate(X),add(X,d))))),X)) = negate(X),
inference('REWRITE',[status(thm)],[2898,3356,3389,theory(equality)]) ).
cnf(3460,plain,
negate(negate(add(d,add(negate(add(negate(X),negate(X))),negate(X))))) = d,
inference('REWRITE',[status(thm)],[3032,3356,3354,3332,theory(equality)]) ).
cnf(3464,plain,
add(e,multiply(successor(successor(one)),d)) != add(e,multiply(successor(one),d)),
inference('REWRITE',[status(thm)],[10,3332,theory(equality)]) ).
cnf(3481,plain,
d = e,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[robbins_axiom,3389,theory(equality)]),3017,3354,3356,theory(equality)]) ).
cnf(3483,plain,
add(d,multiply(successor(successor(one)),d)) != add(d,multiply(successor(one),d)),
inference('REWRITE',[status(thm)],[3464,3481,theory(equality)]) ).
cnf(3484,plain,
negate(negate(add(negate(X),negate(X)))) = negate(X),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[16,3356,theory(equality)]),3356,theory(equality)]) ).
cnf(3485,plain,
negate(negate(add(negate(negate(X)),X))) = negate(negate(X)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[17,3356,theory(equality)]),3356,theory(equality)]) ).
cnf(3490,plain,
negate(negate(negate(X))) = negate(X),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[18,3356,theory(equality)]),3485,3356,theory(equality)]) ).
cnf(3493,plain,
d = add(d,d),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[robbins_axiom,3373,theory(equality)]),3017,3341,3356,theory(equality)]) ).
cnf(3494,plain,
add(X,add(d,d)) = add(X,d),
inference('EMBED',[status(thm)],[3493]) ).
cnf(3496,plain,
negate(add(negate(add(X,d)),negate(add(d,negate(add(X,d)))))) = d,
inference('PARAMODULATE',[status(thm)],[robbins_axiom,3494,theory(equality)]) ).
cnf(3545,plain,
negate(negate(X)) = X,
inference('PARAMODULATE',[status(thm)],[3490,robbins_axiom,theory(equality)]) ).
cnf(3546,plain,
add(negate(X),negate(X)) = negate(X),
inference('REWRITE',[status(thm)],[3484,3545,theory(equality)]) ).
cnf(3562,plain,
negate(add(negate(add(X,add(negate(X),add(X,d)))),X)) = negate(X),
inference('REWRITE',[status(thm)],[3431,3546,theory(equality)]) ).
cnf(3599,plain,
add(negate(X),add(X,d)) = d,
inference('REWRITE',[status(thm)],[3460,3546,3545,theory(equality)]) ).
cnf(3601,plain,
negate(add(negate(add(X,d)),X)) = negate(X),
inference('REWRITE',[status(thm)],[3562,3599,theory(equality)]) ).
cnf(3602,plain,
add(X,d) = d,
inference('REWRITE',[status(thm)],[3496,3545,3601,theory(equality)]) ).
cnf(3604,plain,
$false,
inference('REWRITE',[status(thm)],[3483,3602,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : ROB018-10 : TPTP v8.1.0. Released v7.5.0.
% 0.06/0.12 % Command : run-snark %s %d
% 0.12/0.33 % Computer : n021.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 : Thu Jun 9 14:21:08 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.18/0.44 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.45 *
% 0.18/0.45 *
% 0.18/0.46 #<PACKAGE "SNARK-USER">
% 0.18/0.46 *
% 0.18/0.46 SNARK-TPTP-OPTIONS
% 0.18/0.46 *
% 0.18/0.46 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.18/0.46 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.18/0.46 (USE-FACTORING :POS)
% 0.18/0.46 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.18/0.46 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.18/0.46 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.18/0.46 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.18/0.46 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.18/0.46 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.18/0.46 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.18/0.46 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.18/0.46 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.18/0.46 (DECLARE-TPTP-SYMBOLS2))
% 0.18/0.46 *
% 0.18/0.46 "."
% 0.18/0.46 *
% 0.18/0.46 ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-09T14:21:08
% 0.18/0.46 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n021.cluster.edu at 2022-06-09T14:21:08
% 0.18/0.47
% 0.18/0.47 ; Recognized commutativity assertion (= (|add| ?X ?Y) (|add| ?Y ?X)).
% 0.18/0.47 ; Recognized associativity assertion (= (|add| (|add| ?X ?Y) ?Z) (|add| ?X (|add| ?Y ?Z))).
% 0.18/0.48 ; Recognized left identity assertion (= (|multiply| |one| ?X) ?X).
% 0.18/0.48 ; Declaring add to be commutative.
% 22.87/23.09 ; Declaring add to be associative-commutative.
% 22.87/23.09
% 22.87/23.09 #||
% 22.87/23.09 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 22.87/23.09 % SZS output start Refutation
% See solution above
% 22.87/23.11 ||#
% 22.87/23.11
% 22.87/23.11 ; Summary of computation:
% 22.87/23.11 ; 7379 formulas have been input or derived (from 118 formulas).
% 22.87/23.11 ; 3604 (49%) were retained. Of these,
% 22.87/23.11 ; 3431 (95%) were simplified or subsumed later,
% 22.87/23.11 ; 173 ( 5%) are still being kept.
% 22.87/23.11 ;
% 22.87/23.11 ; Run time in seconds excluding printing time:
% 22.87/23.11 ; 0.003 0% Read assertion file (1 call)
% 22.87/23.11 ; 0.000 0% Assert (11 calls)
% 22.87/23.11 ; 1.450 6% Process new row (7,277 calls)
% 22.87/23.11 ; 0.015 0% Resolution (234 calls)
% 22.87/23.11 ; 0.202 1% Paramodulation (117 calls)
% 22.87/23.11 ; 0.001 0% Embedding (326 calls)
% 22.87/23.11 ; 18.219 81% Forward simplification (6,986 calls)
% 22.87/23.11 ; 1.439 6% Backward simplification (3,582 calls)
% 22.87/23.11 ; 0.022 0% Ordering (8,272 calls)
% 22.87/23.11 ; 1.220 5% Ordering ac (3,144 calls)
% 22.87/23.11 ; 0.000 0% Sortal reasoning (32 calls)
% 22.87/23.11 ; 0.000 0% Purity testing (1 call)
% 22.87/23.11 ; 0.054 0% Other
% 22.87/23.11 ; 22.625 Total
% 22.87/23.11 ; 22.650 Real time
% 22.87/23.11 ;
% 22.87/23.11 ; Term-hash-array has 19,302 terms in all.
% 22.87/23.11 ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 22.87/23.11 ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 22.87/23.11 ; Path-index has 1,009 entries (13,801 at peak, 19,395 added, 18,386 deleted).
% 22.87/23.11 ; Path-index has 730 nodes (1,191 at peak, 1,561 added, 831 deleted).
% 22.87/23.11 ; Trie-index has 1,009 entries (13,801 at peak, 19,395 added, 18,386 deleted).
% 22.87/23.11 ; Trie-index has 312 nodes (354 at peak, 493 added, 181 deleted).
% 22.87/23.11 ; Retrieved 33,134,591 generalization terms in 77,251 calls.
% 22.87/23.11 ; Retrieved 100,238 instance terms in 3,581 calls.
% 22.87/23.11 ; Retrieved 83,183 unifiable terms in 1,178 calls.
% 22.87/23.11 ;
% 22.87/23.11 ; The agenda of backward simplifiable rows to process has 71 entries:
% 22.87/23.11 ; 71 with value 0
% 22.87/23.11 ; The agenda of rows to process has 14 entries:
% 22.87/23.11 ; 1 with value 18 1 with value 26 2 with value 39
% 22.87/23.11 ; 1 with value 19 1 with value 27 1 with value 40
% 22.87/23.11 ; 1 with value 22 1 with value 30 3 with value 41
% 22.87/23.11 ; 1 with value 24 1 with value 37
% 22.87/23.11 ; The agenda of rows to give has 145 entries:
% 22.87/23.11 ; 2 with value (4 15) 3 with value (4 44) 3 with value (4 63)
% 22.87/23.11 ; 1 with value (4 16) 4 with value (4 45) 1 with value (4 64)
% 22.87/23.11 ; 2 with value (4 18) 2 with value (4 46) 3 with value (4 65)
% 22.87/23.11 ; 1 with value (4 19) 10 with value (4 47) 8 with value (4 66)
% 22.87/23.11 ; 1 with value (4 26) 4 with value (4 48) 1 with value (4 67)
% 22.87/23.11 ; 1 with value (4 28) 7 with value (4 49) 5 with value (4 68)
% 22.87/23.11 ; 1 with value (4 29) 6 with value (4 50) 2 with value (4 69)
% 22.87/23.11 ; 2 with value (4 31) 3 with value (4 51) 2 with value (4 70)
% 22.87/23.11 ; 2 with value (4 32) 4 with value (4 52) 2 with value (4 71)
% 22.87/23.11 ; 1 with value (4 33) 4 with value (4 53) 2 with value (4 72)
% 22.87/23.11 ; 3 with value (4 34) 4 with value (4 54) 1 with value (4 74)
% 22.87/23.11 ; 1 with value (4 36) 4 with value (4 55) 1 with value (4 79)
% 22.87/23.11 ; 1 with value (4 37) 3 with value (4 56) 1 with value (4 81)
% 22.87/23.11 ; 1 with value (4 38) 4 with value (4 57) 1 with value (4 85)
% 22.87/23.11 ; 3 with value (4 39) 4 with value (4 58) 1 with value (4 86)
% 22.87/23.11 ; 2 with value (4 40) 2 with value (4 59) 1 with value (4 89)
% 22.87/23.11 ; 2 with value (4 41) 3 with value (4 60) 1 with value (4 90)
% 22.87/23.11 ; 2 with value (4 42) 3 with value (4 61) 1 with value (4 103)
% 22.87/23.11 ; 2 with value (4 43) 2 with value (4 62) 1 with value (4 104)
% 22.87/23.11 Evaluation took:
% 22.87/23.11 22.651 seconds of real time
% 22.87/23.11 22.458115 seconds of user run time
% 22.87/23.11 0.186234 seconds of system run time
% 22.87/23.11 [Run times include 0.867 seconds GC run time.]
% 22.87/23.11 0 calls to %EVAL
% 22.87/23.11 0 page faults and
% 22.87/23.11 1,443,130,944 bytes consed.
% 22.87/23.11 :PROOF-FOUND
% 22.87/23.11 ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-09T14:21:31
% 22.87/23.11 :PROOF-FOUND
% 22.87/23.11 *
%------------------------------------------------------------------------------