TSTP Solution File: LAT393-1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : LAT393-1 : TPTP v8.1.0. Released v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n011.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 : Sun Jul 17 06:45:05 EDT 2022
% Result : Unsatisfiable 12.75s 12.93s
% Output : Refutation 12.75s
% Verified :
% SZS Type : Refutation
% Derivation depth : 32
% Number of leaves : 4
% Syntax : Number of clauses : 147 ( 147 unt; 0 nHn; 7 RR)
% Number of literals : 147 ( 146 equ; 6 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 18 ( 3 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 320 ( 75 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(sos,axiom,
f(f(f(f(X,Y),f(Y,Z)),U),f(Y,f(f(Y,f(f(X,X),X)),Z))) = Y,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos) ).
cnf(sos_002,axiom,
and(X,Y) = f(f(X,Y),f(X,Y)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_002) ).
cnf(sos_003,axiom,
neg(X) = f(X,X),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_003) ).
cnf(goals,negated_conjecture,
f(x0,f(f(x1,x2),f(x1,x2))) != f(x1,f(f(x0,x2),f(x0,x2))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
cnf(6,plain,
f(x0,neg(f(x1,x2))) != f(x1,neg(f(x0,x2))),
inference('REWRITE',[status(thm)],[goals,sos_003,theory(equality)]) ).
cnf(7,plain,
and(X,Y) = neg(f(X,Y)),
inference('REWRITE',[status(thm)],[sos_002,sos_003,theory(equality)]) ).
cnf(8,plain,
f(x0,and(x1,x2)) != f(x1,and(x0,x2)),
inference('REWRITE',[status(thm)],[6,7,theory(equality)]) ).
cnf(9,plain,
f(f(f(f(X,Y),f(Y,Z)),U),f(Y,f(f(Y,f(neg(X),X)),Z))) = Y,
inference('REWRITE',[status(thm)],[sos,sos_003,theory(equality)]) ).
cnf(11,plain,
and(X,X) = neg(neg(X)),
inference('PARAMODULATE',[status(thm)],[7,sos_003,theory(equality)]) ).
cnf(12,plain,
f(f(neg(neg(X)),Y),f(X,f(f(X,f(neg(X),X)),X))) = X,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[9,sos_003,theory(equality)]),sos_003,theory(equality)]) ).
cnf(13,plain,
f(f(f(neg(X),f(X,Y)),Z),f(X,f(f(X,f(neg(X),X)),Y))) = X,
inference('PARAMODULATE',[status(thm)],[9,sos_003,theory(equality)]) ).
cnf(14,plain,
f(f(f(f(X,Y),neg(Y)),Z),f(Y,f(f(Y,f(neg(X),X)),Y))) = Y,
inference('PARAMODULATE',[status(thm)],[9,sos_003,theory(equality)]) ).
cnf(15,plain,
f(and(f(X,Y),f(Y,Z)),f(Y,f(f(Y,f(neg(X),X)),Z))) = Y,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[9,sos_003,theory(equality)]),7,theory(equality)]) ).
cnf(16,plain,
and(f(f(f(X,Y),f(Y,Z)),U),f(Y,f(f(Y,f(neg(X),X)),Z))) = neg(Y),
inference('PARAMODULATE',[status(thm)],[7,9,theory(equality)]) ).
cnf(17,plain,
f(X,f(f(X,Y),f(f(f(X,Y),f(and(Z,X),f(Z,X))),U))) = f(X,Y),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[9,9,theory(equality)]),7,theory(equality)]) ).
cnf(26,plain,
and(f(neg(neg(X)),Y),f(X,f(f(X,f(neg(X),X)),X))) = neg(X),
inference('PARAMODULATE',[status(thm)],[7,12,theory(equality)]) ).
cnf(39,plain,
and(and(f(X,Y),f(Y,Z)),f(Y,f(f(Y,f(neg(X),X)),Z))) = neg(Y),
inference('PARAMODULATE',[status(thm)],[7,15,theory(equality)]) ).
cnf(88,plain,
f(X,f(neg(X),f(f(neg(X),f(neg(neg(X)),neg(X))),Y))) = neg(X),
inference('PARAMODULATE',[status(thm)],[13,12,theory(equality)]) ).
cnf(100,plain,
f(f(f(and(f(X,Y),f(Y,Z)),f(f(f(X,Y),f(Y,Z)),f(Y,f(f(Y,f(neg(X),X)),Z)))),U),f(f(f(X,Y),f(Y,Z)),Y)) = f(f(X,Y),f(Y,Z)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[13,9,theory(equality)]),7,theory(equality)]) ).
cnf(113,plain,
f(X,f(neg(X),f(f(neg(X),f(and(Y,X),f(Y,X))),Z))) = neg(X),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[9,14,theory(equality)]),7,theory(equality)]) ).
cnf(121,plain,
f(f(f(and(f(X,Y),neg(Y)),f(f(f(X,Y),neg(Y)),f(Y,f(f(Y,f(neg(X),X)),Y)))),Z),f(f(f(X,Y),neg(Y)),Y)) = f(f(X,Y),neg(Y)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[13,14,theory(equality)]),7,theory(equality)]) ).
cnf(138,plain,
f(neg(X),f(neg(neg(X)),X)) = neg(neg(X)),
inference('PARAMODULATE',[status(thm)],[88,12,theory(equality)]) ).
cnf(139,plain,
f(X,f(neg(X),and(neg(X),f(neg(neg(X)),neg(X))))) = neg(X),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[88,88,theory(equality)]),7,theory(equality)]) ).
cnf(140,plain,
and(X,f(neg(X),f(f(neg(X),f(neg(neg(X)),neg(X))),Y))) = neg(neg(X)),
inference('PARAMODULATE',[status(thm)],[7,88,theory(equality)]) ).
cnf(154,plain,
and(neg(X),f(neg(neg(X)),X)) = neg(neg(neg(X))),
inference('PARAMODULATE',[status(thm)],[7,138,theory(equality)]) ).
cnf(248,plain,
and(and(f(X,neg(Y)),neg(neg(Y))),f(neg(Y),f(f(neg(Y),f(neg(X),X)),f(neg(neg(Y)),Y)))) = neg(neg(Y)),
inference('PARAMODULATE',[status(thm)],[39,138,theory(equality)]) ).
cnf(344,plain,
and(f(f(neg(neg(X)),f(f(neg(neg(X)),X),Y)),Z),f(f(neg(neg(X)),X),f(f(f(neg(neg(X)),X),f(neg(neg(X)),neg(X))),Y))) = and(neg(neg(X)),X),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[16,138,theory(equality)]),7,theory(equality)]) ).
cnf(347,plain,
and(f(f(f(X,f(neg(Y),f(Y,Z))),f(f(neg(Y),f(Y,Z)),f(Y,f(f(Y,f(neg(Y),Y)),Z)))),U),f(f(neg(Y),f(Y,Z)),Y)) = and(neg(Y),f(Y,Z)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[16,13,theory(equality)]),7,theory(equality)]) ).
cnf(374,plain,
f(X,f(neg(X),f(and(Y,X),f(Y,X)))) = neg(X),
inference('PARAMODULATE',[status(thm)],[113,17,theory(equality)]) ).
cnf(375,plain,
f(X,f(f(X,Y),f(and(Z,X),f(Z,X)))) = f(X,Y),
inference('PARAMODULATE',[status(thm)],[17,17,theory(equality)]) ).
cnf(376,plain,
f(neg(X),f(f(neg(X),f(X,Y)),X)) = f(neg(X),f(X,Y)),
inference('PARAMODULATE',[status(thm)],[17,13,theory(equality)]) ).
cnf(377,plain,
f(f(X,Y),f(f(f(X,Y),neg(Y)),Y)) = f(f(X,Y),neg(Y)),
inference('PARAMODULATE',[status(thm)],[17,14,theory(equality)]) ).
cnf(378,plain,
f(f(X,Y),f(f(f(X,Y),f(Y,Z)),Y)) = f(f(X,Y),f(Y,Z)),
inference('PARAMODULATE',[status(thm)],[17,9,theory(equality)]) ).
cnf(454,plain,
and(X,f(neg(X),f(and(Y,X),f(Y,X)))) = neg(neg(X)),
inference('PARAMODULATE',[status(thm)],[7,374,theory(equality)]) ).
cnf(493,plain,
f(X,f(f(X,Y),f(neg(neg(X)),neg(X)))) = f(X,Y),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[375,sos_003,theory(equality)]),11,theory(equality)]) ).
cnf(549,plain,
and(neg(X),f(f(neg(X),f(X,Y)),X)) = and(neg(X),f(X,Y)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[7,376,theory(equality)]),7,theory(equality)]) ).
cnf(551,plain,
and(and(f(X,neg(neg(X))),f(neg(neg(X)),neg(X))),f(neg(neg(X)),f(neg(X),X))) = neg(neg(neg(X))),
inference('PARAMODULATE',[status(thm)],[39,376,theory(equality)]) ).
cnf(585,plain,
and(f(neg(neg(X)),X),f(and(neg(neg(X)),X),f(neg(neg(neg(X))),neg(neg(X))))) = neg(and(neg(neg(X)),X)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[454,138,theory(equality)]),154,7,theory(equality)]) ).
cnf(599,plain,
and(X,f(f(X,Y),f(neg(neg(X)),neg(X)))) = and(X,Y),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[7,493,theory(equality)]),7,theory(equality)]) ).
cnf(667,plain,
and(f(X,Y),f(f(f(X,Y),neg(Y)),Y)) = and(f(X,Y),neg(Y)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[7,377,theory(equality)]),7,theory(equality)]) ).
cnf(713,plain,
and(and(neg(neg(X)),Y),f(f(and(neg(neg(X)),Y),X),f(neg(neg(X)),Y))) = and(and(neg(neg(X)),Y),X),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[549,12,theory(equality)]),7,theory(equality)]) ).
cnf(722,plain,
and(f(neg(neg(X)),Y),f(X,f(neg(and(neg(neg(X)),Y)),and(neg(neg(X)),Y)))) = neg(X),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[599,12,theory(equality)]),26,7,theory(equality)]) ).
cnf(737,plain,
and(f(f(X,Y),neg(Y)),f(f(f(f(X,Y),neg(Y)),and(f(f(X,Y),neg(Y)),Y)),f(f(f(X,Y),neg(Y)),Y))) = and(f(f(X,Y),neg(Y)),and(f(f(X,Y),neg(Y)),Y)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[667,377,theory(equality)]),7,theory(equality)]) ).
cnf(743,plain,
f(f(neg(neg(X)),X),neg(X)) = X,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[378,12,theory(equality)]),sos_003,theory(equality)]) ).
cnf(745,plain,
f(f(f(f(X,Y),neg(Y)),Y),neg(Y)) = Y,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[378,14,theory(equality)]),sos_003,theory(equality)]) ).
cnf(746,plain,
f(f(f(f(X,Y),f(Y,Z)),Y),neg(Y)) = Y,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[378,9,theory(equality)]),sos_003,theory(equality)]) ).
cnf(784,plain,
f(neg(X),f(f(neg(X),f(f(neg(X),and(neg(X),f(neg(neg(X)),neg(X)))),Y)),f(neg(X),and(neg(X),f(neg(neg(X)),neg(X)))))) = f(neg(X),f(f(neg(X),and(neg(X),f(neg(neg(X)),neg(X)))),Y)),
inference('PARAMODULATE',[status(thm)],[378,139,theory(equality)]) ).
cnf(787,plain,
and(f(f(X,Y),f(Y,Z)),f(f(f(f(X,Y),f(Y,Z)),and(f(f(X,Y),f(Y,Z)),Y)),f(f(f(X,Y),f(Y,Z)),Y))) = and(f(f(X,Y),f(Y,Z)),and(f(f(X,Y),f(Y,Z)),Y)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[667,378,theory(equality)]),7,theory(equality)]) ).
cnf(827,plain,
and(and(f(X,f(neg(neg(Y)),Y)),Y),f(f(neg(neg(Y)),Y),f(f(f(neg(neg(Y)),Y),f(neg(X),X)),neg(Y)))) = and(neg(neg(Y)),Y),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[39,743,theory(equality)]),7,theory(equality)]) ).
cnf(871,plain,
neg(neg(X)) = X,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[745,745,theory(equality)]),sos_003,theory(equality)]) ).
cnf(906,plain,
and(and(f(X,neg(Y)),Y),f(neg(Y),f(f(neg(Y),f(neg(X),X)),neg(Y)))) = Y,
inference('REWRITE',[status(thm)],[248,sos_003,871,theory(equality)]) ).
cnf(934,plain,
X = and(X,X),
inference('REWRITE',[status(thm)],[827,906,sos_003,871,theory(equality)]) ).
cnf(937,plain,
and(f(X,Y),f(X,f(f(X,f(neg(X),X)),X))) = neg(X),
inference('REWRITE',[status(thm)],[26,871,theory(equality)]) ).
cnf(958,plain,
and(X,f(neg(X),f(f(neg(X),f(X,neg(X))),Y))) = X,
inference('REWRITE',[status(thm)],[140,871,theory(equality)]) ).
cnf(1010,plain,
and(f(f(X,f(neg(X),Y)),Z),f(neg(X),f(f(neg(X),f(X,neg(X))),Y))) = X,
inference('REWRITE',[status(thm)],[344,934,sos_003,871,theory(equality)]) ).
cnf(1057,plain,
and(and(neg(X),f(X,neg(X))),f(X,f(neg(X),X))) = neg(X),
inference('REWRITE',[status(thm)],[551,sos_003,871,theory(equality)]) ).
cnf(1071,plain,
and(neg(X),f(X,f(neg(X),X))) = neg(X),
inference('REWRITE',[status(thm)],[585,934,sos_003,871,theory(equality)]) ).
cnf(1110,plain,
and(and(X,Y),f(f(and(X,Y),X),f(X,Y))) = and(and(X,Y),X),
inference('REWRITE',[status(thm)],[713,871,theory(equality)]) ).
cnf(1111,plain,
and(f(X,Y),f(X,f(neg(and(X,Y)),and(X,Y)))) = neg(X),
inference('REWRITE',[status(thm)],[722,871,theory(equality)]) ).
cnf(1117,plain,
f(neg(X),f(f(neg(X),f(f(neg(X),and(neg(X),f(X,neg(X)))),Y)),f(neg(X),and(neg(X),f(X,neg(X)))))) = f(neg(X),f(f(neg(X),and(neg(X),f(X,neg(X)))),Y)),
inference('REWRITE',[status(thm)],[784,871,theory(equality)]) ).
cnf(1122,plain,
and(f(f(f(X,Y),neg(Y)),Y),neg(Y)) = neg(Y),
inference('PARAMODULATE',[status(thm)],[7,745,theory(equality)]) ).
cnf(1137,plain,
f(f(f(f(f(X,Y),f(Y,Z)),and(f(f(X,Y),f(Y,Z)),Y)),f(f(f(X,Y),f(Y,Z)),Y)),and(f(f(X,Y),f(Y,Z)),Y)) = f(f(f(X,Y),f(Y,Z)),Y),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[745,378,theory(equality)]),7,theory(equality)]) ).
cnf(1151,plain,
neg(and(X,Y)) = f(X,Y),
inference('PARAMODULATE',[status(thm)],[871,7,theory(equality)]) ).
cnf(1152,plain,
neg(and(x0,and(x1,x2))) != neg(and(x1,and(x0,x2))),
inference('REWRITE',[status(thm)],[8,1151,theory(equality)]) ).
cnf(1178,plain,
neg(and(neg(X),neg(and(neg(and(neg(X),neg(and(neg(and(neg(X),and(neg(X),neg(and(X,neg(X)))))),Y)))),neg(and(neg(X),and(neg(X),neg(and(X,neg(X)))))))))) = neg(and(neg(X),neg(and(neg(and(neg(X),and(neg(X),neg(and(X,neg(X)))))),Y)))),
inference('REWRITE',[status(thm)],[1117,1151,theory(equality)]) ).
cnf(1180,plain,
and(X,neg(and(neg(X),neg(and(neg(and(neg(X),neg(and(X,neg(X))))),Y))))) = X,
inference('REWRITE',[status(thm)],[958,1151,theory(equality)]) ).
cnf(1191,plain,
and(neg(and(neg(and(X,neg(and(neg(X),Y)))),Z)),neg(and(neg(X),neg(and(neg(and(neg(X),neg(and(X,neg(X))))),Y))))) = X,
inference('REWRITE',[status(thm)],[1010,1151,theory(equality)]) ).
cnf(1428,plain,
and(and(neg(X),neg(and(X,neg(X)))),neg(and(X,neg(and(neg(X),X))))) = neg(X),
inference('REWRITE',[status(thm)],[1057,1151,theory(equality)]) ).
cnf(1431,plain,
and(neg(X),neg(and(X,neg(and(neg(X),X))))) = neg(X),
inference('REWRITE',[status(thm)],[1071,1151,theory(equality)]) ).
cnf(1470,plain,
and(neg(and(neg(and(neg(and(X,neg(and(neg(Y),neg(and(Y,Z)))))),neg(and(neg(and(neg(Y),neg(and(Y,Z)))),neg(and(Y,neg(and(neg(and(Y,neg(and(neg(Y),Y)))),Z)))))))),U)),neg(and(neg(and(neg(Y),neg(and(Y,Z)))),Y))) = and(neg(Y),neg(and(Y,Z))),
inference('REWRITE',[status(thm)],[347,1151,theory(equality)]) ).
cnf(1542,plain,
neg(and(neg(and(neg(and(and(neg(and(X,Y)),neg(and(Y,Z))),neg(and(neg(and(neg(and(X,Y)),neg(and(Y,Z)))),neg(and(Y,neg(and(neg(and(Y,neg(and(neg(X),X)))),Z)))))))),U)),neg(and(neg(and(neg(and(X,Y)),neg(and(Y,Z)))),Y)))) = neg(and(neg(and(X,Y)),neg(and(Y,Z)))),
inference('REWRITE',[status(thm)],[100,1151,theory(equality)]) ).
cnf(1556,plain,
neg(and(neg(and(neg(and(and(neg(and(X,Y)),neg(Y)),neg(and(neg(and(neg(and(X,Y)),neg(Y))),neg(and(Y,neg(and(neg(and(Y,neg(and(neg(X),X)))),Y)))))))),Z)),neg(and(neg(and(neg(and(X,Y)),neg(Y))),Y)))) = neg(and(neg(and(X,Y)),neg(Y))),
inference('REWRITE',[status(thm)],[121,1151,theory(equality)]) ).
cnf(1698,plain,
and(neg(X),neg(and(neg(and(neg(X),neg(and(X,Y)))),X))) = and(neg(X),neg(and(X,Y))),
inference('REWRITE',[status(thm)],[549,1151,theory(equality)]) ).
cnf(1730,plain,
and(neg(and(X,Y)),neg(and(neg(and(neg(and(X,Y)),neg(Y))),Y))) = and(neg(and(X,Y)),neg(Y)),
inference('REWRITE',[status(thm)],[667,1151,theory(equality)]) ).
cnf(1768,plain,
and(neg(and(neg(and(X,Y)),neg(Y))),neg(and(neg(and(neg(and(neg(and(X,Y)),neg(Y))),and(neg(and(neg(and(X,Y)),neg(Y))),Y))),neg(and(neg(and(neg(and(X,Y)),neg(Y))),Y))))) = and(neg(and(neg(and(X,Y)),neg(Y))),and(neg(and(neg(and(X,Y)),neg(Y))),Y)),
inference('REWRITE',[status(thm)],[737,1151,theory(equality)]) ).
cnf(1773,plain,
neg(and(neg(and(neg(and(neg(and(X,Y)),neg(and(Y,Z)))),Y)),neg(Y))) = Y,
inference('REWRITE',[status(thm)],[746,1151,theory(equality)]) ).
cnf(1788,plain,
and(neg(and(neg(and(X,Y)),neg(and(Y,Z)))),neg(and(neg(and(neg(and(neg(and(X,Y)),neg(and(Y,Z)))),and(neg(and(neg(and(X,Y)),neg(and(Y,Z)))),Y))),neg(and(neg(and(neg(and(X,Y)),neg(and(Y,Z)))),Y))))) = and(neg(and(neg(and(X,Y)),neg(and(Y,Z)))),and(neg(and(neg(and(X,Y)),neg(and(Y,Z)))),Y)),
inference('REWRITE',[status(thm)],[787,1151,theory(equality)]) ).
cnf(1850,plain,
and(neg(and(X,Y)),neg(and(X,neg(and(neg(and(X,neg(and(neg(X),X)))),X))))) = neg(X),
inference('REWRITE',[status(thm)],[937,1151,theory(equality)]) ).
cnf(1902,plain,
and(and(X,Y),neg(and(neg(and(and(X,Y),X)),neg(and(X,Y))))) = and(and(X,Y),X),
inference('REWRITE',[status(thm)],[1110,1151,theory(equality)]) ).
cnf(1903,plain,
and(neg(and(X,Y)),neg(and(X,neg(and(neg(and(X,Y)),and(X,Y)))))) = neg(X),
inference('REWRITE',[status(thm)],[1111,1151,theory(equality)]) ).
cnf(1907,plain,
and(neg(and(neg(and(neg(and(X,Y)),neg(Y))),Y)),neg(Y)) = neg(Y),
inference('REWRITE',[status(thm)],[1122,1151,theory(equality)]) ).
cnf(1911,plain,
neg(and(neg(and(neg(and(neg(and(neg(and(X,Y)),neg(and(Y,Z)))),and(neg(and(neg(and(X,Y)),neg(and(Y,Z)))),Y))),neg(and(neg(and(neg(and(X,Y)),neg(and(Y,Z)))),Y)))),and(neg(and(neg(and(X,Y)),neg(and(Y,Z)))),Y))) = neg(and(neg(and(neg(and(X,Y)),neg(and(Y,Z)))),Y)),
inference('REWRITE',[status(thm)],[1137,1151,theory(equality)]) ).
cnf(1923,plain,
and(neg(and(neg(and(neg(and(X,neg(Y))),Y)),neg(Y))),Y) = Y,
inference('PARAMODULATE',[status(thm)],[1907,871,theory(equality)]) ).
cnf(1924,plain,
and(neg(and(neg(and(X,and(X,neg(and(neg(X),X))))),neg(and(X,neg(and(neg(X),X)))))),and(X,neg(and(neg(X),X)))) = and(X,neg(and(neg(X),X))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[1907,1431,theory(equality)]),871,theory(equality)]) ).
cnf(1931,plain,
and(and(X,neg(and(neg(X),X))),neg(and(neg(X),neg(and(X,neg(X)))))) = X,
inference('PARAMODULATE',[status(thm)],[1428,871,theory(equality)]) ).
cnf(1939,plain,
neg(X) = and(neg(and(neg(and(neg(and(Y,X)),neg(and(X,Z)))),X)),neg(X)),
inference('PARAMODULATE',[status(thm)],[871,1773,theory(equality)]) ).
cnf(1961,plain,
and(neg(and(neg(and(X,neg(Y))),Y)),neg(Y)) = and(neg(and(neg(and(neg(and(Z,neg(and(neg(and(neg(and(X,neg(Y))),Y)),neg(Y))))),neg(Y))),neg(and(neg(and(neg(and(X,neg(Y))),Y)),neg(Y))))),and(neg(and(neg(and(X,neg(Y))),Y)),neg(Y))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[1939,1923,theory(equality)]),871,theory(equality)]) ).
cnf(1977,plain,
and(X,neg(and(neg(and(X,neg(and(neg(X),Y)))),neg(X)))) = and(X,neg(and(neg(X),Y))),
inference('PARAMODULATE',[status(thm)],[1698,871,theory(equality)]) ).
cnf(1983,plain,
and(X,neg(and(neg(and(X,and(X,neg(and(neg(X),X))))),neg(X)))) = and(X,and(X,neg(and(neg(X),X)))),
inference('PARAMODULATE',[status(thm)],[1902,1931,theory(equality)]) ).
cnf(1984,plain,
and(neg(X),neg(and(neg(and(neg(X),and(neg(X),neg(and(X,neg(X)))))),X))) = and(neg(X),and(neg(X),neg(and(X,neg(X))))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[1902,1428,theory(equality)]),871,theory(equality)]) ).
cnf(1986,plain,
and(neg(X),neg(and(neg(and(neg(X),neg(and(neg(and(neg(and(Y,X)),neg(X))),X)))),X))) = and(neg(X),neg(and(neg(and(neg(and(Y,X)),neg(X))),X))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[1902,1907,theory(equality)]),871,theory(equality)]) ).
cnf(1998,plain,
and(neg(X),neg(and(neg(and(neg(and(neg(and(Y,neg(X))),X)),neg(X))),neg(and(neg(X),X))))) = and(neg(and(neg(and(Y,neg(X))),X)),neg(X)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[1903,1923,theory(equality)]),871,theory(equality)]) ).
cnf(2021,plain,
and(neg(and(neg(and(neg(X),and(neg(X),neg(and(neg(and(neg(X),neg(and(X,neg(X))))),Y))))),neg(and(neg(X),neg(and(neg(and(neg(X),neg(and(X,neg(X))))),Y)))))),and(neg(X),neg(and(neg(and(neg(X),neg(and(X,neg(X))))),Y)))) = and(neg(X),neg(and(neg(and(neg(X),neg(and(X,neg(X))))),Y))),
inference('PARAMODULATE',[status(thm)],[1923,1180,theory(equality)]) ).
cnf(2038,plain,
and(neg(and(neg(and(X,Y)),neg(Y))),Y) = and(neg(and(neg(and(neg(and(neg(and(X,Y)),neg(Y))),neg(and(neg(and(neg(and(neg(and(X,Y)),neg(Y))),Y)),Z)))),neg(and(neg(and(neg(and(X,Y)),neg(Y))),Y)))),and(neg(and(neg(and(X,Y)),neg(Y))),Y)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[1939,1730,theory(equality)]),871,theory(equality)]) ).
cnf(2040,plain,
neg(and(X,neg(and(neg(and(X,neg(and(neg(X),X)))),X)))) = neg(X),
inference('PARAMODULATE',[status(thm)],[934,1850,theory(equality)]) ).
cnf(2049,plain,
and(neg(and(X,Y)),neg(X)) = neg(X),
inference('REWRITE',[status(thm)],[1850,2040,theory(equality)]) ).
cnf(2050,plain,
X = and(X,and(X,neg(and(neg(X),X)))),
inference('REWRITE',[status(thm)],[1983,934,871,2049,theory(equality)]) ).
cnf(2063,plain,
X = and(X,neg(and(neg(X),X))),
inference('REWRITE',[status(thm)],[1924,871,1431,2050,theory(equality)]) ).
cnf(2073,plain,
and(neg(and(neg(and(neg(and(X,neg(and(neg(Y),neg(and(Y,Z)))))),neg(and(neg(and(neg(Y),neg(and(Y,Z)))),neg(and(Y,neg(and(neg(Y),Z)))))))),U)),neg(and(neg(and(neg(Y),neg(and(Y,Z)))),Y))) = and(neg(Y),neg(and(Y,Z))),
inference('REWRITE',[status(thm)],[1470,2063,theory(equality)]) ).
cnf(2138,plain,
X = and(X,neg(and(neg(X),Y))),
inference('REWRITE',[status(thm)],[1977,934,871,2049,theory(equality)]) ).
cnf(2139,plain,
neg(and(neg(and(neg(and(neg(and(X,Y)),neg(and(Y,Z)))),U)),neg(and(neg(and(neg(and(X,Y)),neg(and(Y,Z)))),Y)))) = neg(and(neg(and(X,Y)),neg(and(Y,Z)))),
inference('REWRITE',[status(thm)],[1542,2138,theory(equality)]) ).
cnf(2142,plain,
neg(and(neg(and(X,Y)),neg(and(Y,Z)))) = and(neg(and(neg(and(X,Y)),neg(and(Y,Z)))),and(neg(and(neg(and(X,Y)),neg(and(Y,Z)))),Y)),
inference('REWRITE',[status(thm)],[1788,934,2139,theory(equality)]) ).
cnf(2144,plain,
and(neg(and(X,Y)),neg(and(Y,Z))) = neg(and(neg(and(neg(and(X,Y)),neg(and(Y,Z)))),Y)),
inference('REWRITE',[status(thm)],[1911,871,2142,2139,theory(equality)]) ).
cnf(2148,plain,
neg(X) = and(and(neg(and(Y,X)),neg(and(X,Z))),neg(X)),
inference('REWRITE',[status(thm)],[1939,2144,theory(equality)]) ).
cnf(2164,plain,
neg(and(neg(and(neg(and(neg(and(X,Y)),neg(Y))),Z)),neg(and(neg(and(neg(and(X,Y)),neg(Y))),Y)))) = neg(and(neg(and(X,Y)),neg(Y))),
inference('REWRITE',[status(thm)],[1556,2138,theory(equality)]) ).
cnf(2167,plain,
and(neg(and(neg(and(X,Y)),neg(Y))),Y) = and(neg(and(neg(and(X,Y)),neg(Y))),and(neg(and(neg(and(X,Y)),neg(Y))),Y)),
inference('REWRITE',[status(thm)],[2038,2164,theory(equality)]) ).
cnf(2169,plain,
neg(and(neg(and(X,Y)),neg(Y))) = and(neg(and(neg(and(X,Y)),neg(Y))),Y),
inference('REWRITE',[status(thm)],[1768,2167,934,2164,theory(equality)]) ).
cnf(2178,plain,
neg(and(neg(and(neg(X),and(neg(X),neg(and(neg(and(neg(X),neg(and(X,neg(X))))),Y))))),neg(and(neg(X),neg(and(neg(and(neg(X),neg(and(X,neg(X))))),Y)))))) = and(neg(X),neg(and(neg(and(neg(X),neg(and(X,neg(X))))),Y))),
inference('REWRITE',[status(thm)],[2021,2169,theory(equality)]) ).
cnf(2184,plain,
and(neg(X),neg(and(neg(and(neg(X),and(neg(and(Y,X)),neg(X)))),X))) = and(neg(X),and(neg(and(Y,X)),neg(X))),
inference('REWRITE',[status(thm)],[1986,871,2169,theory(equality)]) ).
cnf(2187,plain,
neg(and(neg(and(neg(and(X,neg(Y))),Y)),neg(Y))) = Y,
inference('REWRITE',[status(thm)],[1923,2169,theory(equality)]) ).
cnf(2190,plain,
neg(X) = and(neg(and(neg(and(Y,neg(X))),X)),neg(X)),
inference('REWRITE',[status(thm)],[1998,934,2138,2187,theory(equality)]) ).
cnf(2191,plain,
neg(X) = and(and(neg(and(Y,X)),neg(X)),neg(X)),
inference('REWRITE',[status(thm)],[1961,871,2169,2190,2187,theory(equality)]) ).
cnf(2211,plain,
and(neg(and(neg(and(neg(and(X,neg(and(neg(Y),neg(and(Y,Z)))))),neg(and(neg(and(neg(Y),neg(and(Y,Z)))),neg(Y))))),U)),neg(and(neg(and(neg(Y),neg(and(Y,Z)))),Y))) = and(neg(Y),neg(and(Y,Z))),
inference('REWRITE',[status(thm)],[2073,2138,theory(equality)]) ).
cnf(2215,plain,
and(neg(and(neg(X),Y)),neg(and(neg(X),neg(and(neg(and(neg(X),neg(and(X,neg(X))))),Z))))) = X,
inference('REWRITE',[status(thm)],[1191,2138,theory(equality)]) ).
cnf(2218,plain,
neg(X) = and(neg(X),neg(and(neg(and(neg(X),neg(and(X,neg(X))))),Y))),
inference('REWRITE',[status(thm)],[2178,2215,theory(equality)]) ).
cnf(2225,plain,
and(neg(and(neg(X),Y)),X) = X,
inference('REWRITE',[status(thm)],[2215,871,2218,theory(equality)]) ).
cnf(2226,plain,
neg(X) = and(neg(X),and(neg(and(Y,X)),neg(X))),
inference('REWRITE',[status(thm)],[2184,934,2225,theory(equality)]) ).
cnf(2233,plain,
neg(X) = and(neg(X),and(neg(X),neg(and(X,neg(X))))),
inference('REWRITE',[status(thm)],[1984,934,2225,theory(equality)]) ).
cnf(2234,plain,
X = neg(and(neg(X),neg(and(X,Y)))),
inference('REWRITE',[status(thm)],[1178,934,2225,871,2233,theory(equality)]) ).
cnf(2239,plain,
neg(X) = and(neg(X),neg(and(X,Y))),
inference('REWRITE',[status(thm)],[2218,2234,theory(equality)]) ).
cnf(2244,plain,
and(neg(and(neg(and(neg(and(X,Y)),neg(and(Y,neg(Y))))),Z)),neg(Y)) = neg(Y),
inference('REWRITE',[status(thm)],[2211,871,2239,2225,theory(equality)]) ).
cnf(2249,plain,
and(X,Y) = and(and(X,Y),X),
inference('REWRITE',[status(thm)],[1902,934,871,2049,theory(equality)]) ).
cnf(2276,plain,
X = and(and(neg(and(Y,neg(X))),X),X),
inference('PARAMODULATE',[status(thm)],[2191,871,theory(equality)]) ).
cnf(2279,plain,
neg(and(neg(and(X,neg(Y))),Y)) = neg(Y),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[2239,2276,theory(equality)]),2190,theory(equality)]) ).
cnf(2286,plain,
and(X,Y) = and(and(neg(and(Z,neg(and(X,Y)))),X),and(X,Y)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[2148,2049,theory(equality)]),871,theory(equality)]) ).
cnf(2287,plain,
and(X,neg(and(neg(and(Y,X)),neg(and(X,Z))))) = neg(and(neg(and(Y,X)),neg(and(X,Z)))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[2049,2148,theory(equality)]),871,theory(equality)]) ).
cnf(2317,plain,
and(neg(X),and(Y,neg(X))) = and(Y,neg(X)),
inference('PARAMODULATE',[status(thm)],[2225,2279,theory(equality)]) ).
cnf(2318,plain,
neg(X) = and(neg(and(Y,X)),neg(X)),
inference('REWRITE',[status(thm)],[2226,2317,theory(equality)]) ).
cnf(2335,plain,
neg(X) = and(neg(X),neg(and(Y,X))),
inference('PARAMODULATE',[status(thm)],[2249,2318,theory(equality)]) ).
cnf(2336,plain,
and(X,and(Y,X)) = and(Y,X),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[2225,2318,theory(equality)]),871,theory(equality)]) ).
cnf(2340,plain,
neg(and(neg(and(X,Y)),neg(and(Y,neg(Y))))) = and(X,Y),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[1903,2318,theory(equality)]),2287,871,theory(equality)]) ).
cnf(2341,plain,
and(neg(and(and(X,Y),Z)),neg(Y)) = neg(Y),
inference('REWRITE',[status(thm)],[2244,2340,theory(equality)]) ).
cnf(2352,plain,
neg(X) = and(neg(X),neg(and(and(Y,X),Z))),
inference('PARAMODULATE',[status(thm)],[2249,2341,theory(equality)]) ).
cnf(2369,plain,
neg(X) = and(neg(X),neg(and(and(X,Y),Z))),
inference('PARAMODULATE',[status(thm)],[2352,2249,theory(equality)]) ).
cnf(2370,plain,
neg(X) = and(neg(X),neg(and(Y,and(Z,X)))),
inference('PARAMODULATE',[status(thm)],[2352,2336,theory(equality)]) ).
cnf(2423,plain,
neg(X) = and(neg(X),neg(and(Y,and(X,Z)))),
inference('PARAMODULATE',[status(thm)],[2369,2336,theory(equality)]) ).
cnf(7190,plain,
and(X,Y) = and(and(Y,X),and(X,Y)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[2286,2335,theory(equality)]),871,theory(equality)]) ).
cnf(7195,plain,
and(X,and(Y,Z)) = and(and(Z,X),and(X,and(Y,Z))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[2286,2370,theory(equality)]),871,theory(equality)]) ).
cnf(7196,plain,
and(X,and(Y,Z)) = and(and(Y,X),and(X,and(Y,Z))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[2286,2423,theory(equality)]),871,theory(equality)]) ).
cnf(7341,plain,
and(X,Y) = and(Y,X),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[2249,7190,theory(equality)]),7190,theory(equality)]) ).
cnf(7435,plain,
neg(and(x0,and(x2,x1))) != neg(and(x1,and(x0,x2))),
inference('PARAMODULATE',[status(thm)],[1152,7341,theory(equality)]) ).
cnf(7714,plain,
neg(and(x0,and(x2,x1))) != neg(and(x1,and(x2,x0))),
inference('PARAMODULATE',[status(thm)],[7435,7341,theory(equality)]) ).
cnf(7719,plain,
and(X,and(Y,Z)) = and(and(X,and(Y,Z)),and(Z,X)),
inference('PARAMODULATE',[status(thm)],[7341,7195,theory(equality)]) ).
cnf(7732,plain,
and(X,and(Y,Z)) = and(and(Y,Z),and(Z,X)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[7195,7195,theory(equality)]),7719,theory(equality)]) ).
cnf(7746,plain,
and(X,and(Y,Z)) = and(and(Y,Z),and(Y,X)),
inference('REWRITE',[status(thm)],[7196,7732,theory(equality)]) ).
cnf(7767,plain,
and(X,and(Y,Z)) = and(Z,and(Y,X)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[7341,7746,theory(equality)]),7746,theory(equality)]) ).
cnf(7788,plain,
$false,
inference('REWRITE',[status(thm)],[7714,7767,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LAT393-1 : TPTP v8.1.0. Released v5.4.0.
% 0.07/0.12 % Command : run-snark %s %d
% 0.13/0.33 % Computer : n011.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Thu Jun 30 00:22:02 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.20/0.44 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.45 *
% 0.20/0.45 *
% 0.20/0.46 #<PACKAGE "SNARK-USER">
% 0.20/0.46 *
% 0.20/0.46 SNARK-TPTP-OPTIONS
% 0.20/0.46 *
% 0.20/0.46 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.20/0.46 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.20/0.46 (USE-FACTORING :POS)
% 0.20/0.46 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.20/0.46 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.20/0.46 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.20/0.46 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.20/0.46 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.20/0.46 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.20/0.46 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.20/0.46 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.20/0.46 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.20/0.46 (DECLARE-TPTP-SYMBOLS2))
% 0.20/0.46 *
% 0.20/0.46 "."
% 0.20/0.46 *
% 0.20/0.46 ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-30T00:22:02
% 0.20/0.46 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n011.cluster.edu at 2022-06-30T00:22:02
% 12.75/12.93
% 12.75/12.93
% 12.75/12.93 #||
% 12.75/12.93 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 12.75/12.93 % SZS output start Refutation
% See solution above
% 12.75/12.98 ||#
% 12.75/12.98
% 12.75/12.98 ; Summary of computation:
% 12.75/12.98 ; 194250 formulas have been input or derived (from 372 formulas).
% 12.75/12.98 ; 7788 ( 4%) were retained. Of these,
% 12.75/12.98 ; 3246 (42%) were simplified or subsumed later,
% 12.75/12.98 ; 4542 (58%) are still being kept.
% 12.75/12.98 ;
% 12.75/12.98 ; Run time in seconds excluding printing time:
% 12.75/12.98 ; 0.001 0% Read assertion file (1 call)
% 12.75/12.98 ; 0.000 0% Assert (5 calls)
% 12.75/12.98 ; 1.187 10% Process new row (169,362 calls)
% 12.75/12.98 ; 0.081 1% Resolution (742 calls)
% 12.75/12.98 ; 2.372 19% Paramodulation (371 calls)
% 12.75/12.98 ; 7.118 57% Forward simplification (168,153 calls)
% 12.75/12.98 ; 0.789 6% Backward simplification (7,787 calls)
% 12.75/12.98 ; 0.475 4% Ordering (236,462 calls)
% 12.75/12.98 ; 0.001 0% Sortal reasoning (32 calls)
% 12.75/12.98 ; 0.000 0% Purity testing (1 call)
% 12.75/12.98 ; 0.441 4% Other
% 12.75/12.98 ; 12.465 Total
% 12.75/12.98 ; 12.516 Real time
% 12.75/12.98 ;
% 12.75/12.98 ; Term-hash-array has 21,045 terms in all.
% 12.75/12.98 ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 12.75/12.98 ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 12.75/12.98 ; Path-index has 10,293 entries (11,529 at peak, 21,706 added, 11,413 deleted).
% 12.75/12.98 ; Path-index has 22,532 nodes (22,764 at peak, 36,381 added, 13,849 deleted).
% 12.75/12.98 ; Trie-index has 10,293 entries (11,529 at peak, 21,706 added, 11,413 deleted).
% 12.75/12.98 ; Trie-index has 30,036 nodes (59,583 at peak, 200,154 added, 170,118 deleted).
% 12.75/12.98 ; Retrieved 2,815,962 generalization terms in 1,821,900 calls.
% 12.75/12.98 ; Retrieved 97,608 instance terms in 7,787 calls.
% 12.75/12.98 ; Retrieved 569,968 unifiable terms in 3,238 calls.
% 12.75/12.98 ;
% 12.75/12.98 ; The agenda of backward simplifiable rows to process has 8 entries:
% 12.75/12.98 ; 8 with value 0
% 12.75/12.98 ; The agenda of rows to process has 1056 entries:
% 12.75/12.98 ; 10 with value 25 49 with value 33 46 with value 40
% 12.75/12.98 ; 26 with value 26 116 with value 34 41 with value 41
% 12.75/12.98 ; 8 with value 27 93 with value 35 32 with value 42
% 12.75/12.98 ; 30 with value 28 71 with value 36 16 with value 43
% 12.75/12.98 ; 73 with value 29 138 with value 37 16 with value 44
% 12.75/12.98 ; 69 with value 30 90 with value 38 4 with value 47
% 12.75/12.98 ; 44 with value 31 34 with value 39 1 with value 49
% 12.75/12.98 ; 49 with value 32
% 12.75/12.98 ; The agenda of rows to give has 4283 entries:
% 12.75/12.98 ; 2 with value (4 23) 275 with value (4 39) 16 with value (4 52)
% 12.75/12.98 ; 2 with value (4 25) 181 with value (4 40) 4 with value (4 53)
% 12.75/12.98 ; 5 with value (4 27) 172 with value (4 41) 6 with value (4 54)
% 12.75/12.98 ; 5 with value (4 28) 163 with value (4 42) 3 with value (4 55)
% 12.75/12.98 ; 14 with value (4 29) 48 with value (4 43) 6 with value (4 56)
% 12.75/12.98 ; 98 with value (4 30) 43 with value (4 44) 2 with value (4 57)
% 12.75/12.98 ; 235 with value (4 31) 25 with value (4 45) 4 with value (4 58)
% 12.75/12.98 ; 242 with value (4 32) 51 with value (4 46) 1 with value (4 59)
% 12.75/12.98 ; 344 with value (4 33) 93 with value (4 47) 1 with value (4 62)
% 12.75/12.98 ; 573 with value (4 34) 28 with value (4 48) 2 with value (4 63)
% 12.75/12.98 ; 646 with value (4 35) 21 with value (4 49) 1 with value (4 64)
% 12.75/12.98 ; 487 with value (4 36) 29 with value (4 50) 1 with value (4 71)
% 12.75/12.98 ; 265 with value (4 37) 39 with value (4 51) 1 with value (4 90)
% 12.75/12.98 ; 149 with value (4 38)
% 12.75/12.98 Evaluation took:
% 12.75/12.98 12.517 seconds of real time
% 12.75/12.98 11.559632 seconds of user run time
% 12.75/12.98 0.956042 seconds of system run time
% 12.75/12.98 [Run times include 1.178 seconds GC run time.]
% 12.75/12.98 0 calls to %EVAL
% 12.75/12.98 0 page faults and
% 12.75/12.98 1,003,238,600 bytes consed.
% 12.75/12.98 :PROOF-FOUND
% 12.75/12.98 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-30T00:22:15
% 12.75/12.98 :PROOF-FOUND
% 12.75/12.98 *
%------------------------------------------------------------------------------