TSTP Solution File: LAT394-1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : LAT394-1 : TPTP v8.1.0. Released v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n010.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:06 EDT 2022
% Result : Unsatisfiable 1.64s 1.88s
% Output : Refutation 1.74s
% Verified :
% SZS Type : Refutation
% Derivation depth : 33
% Number of leaves : 4
% Syntax : Number of clauses : 149 ( 149 unt; 0 nHn; 5 RR)
% Number of literals : 149 ( 148 equ; 4 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 : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 322 ( 71 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(x0,x0)) != f(x1,f(x1,x1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
cnf(6,plain,
f(x0,neg(x0)) != f(x1,neg(x1)),
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(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(10,plain,
and(X,X) = neg(neg(X)),
inference('PARAMODULATE',[status(thm)],[7,sos_003,theory(equality)]) ).
cnf(11,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)],[8,sos_003,theory(equality)]),sos_003,theory(equality)]) ).
cnf(12,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)],[8,sos_003,theory(equality)]) ).
cnf(13,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)],[8,sos_003,theory(equality)]) ).
cnf(14,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)],[8,sos_003,theory(equality)]),7,theory(equality)]) ).
cnf(15,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,8,theory(equality)]) ).
cnf(16,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)],[8,8,theory(equality)]),7,theory(equality)]) ).
cnf(25,plain,
and(f(neg(neg(X)),Y),f(X,f(f(X,f(neg(X),X)),X))) = neg(X),
inference('PARAMODULATE',[status(thm)],[7,11,theory(equality)]) ).
cnf(38,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,14,theory(equality)]) ).
cnf(87,plain,
f(X,f(neg(X),f(f(neg(X),f(neg(neg(X)),neg(X))),Y))) = neg(X),
inference('PARAMODULATE',[status(thm)],[12,11,theory(equality)]) ).
cnf(99,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)],[12,8,theory(equality)]),7,theory(equality)]) ).
cnf(112,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)],[8,13,theory(equality)]),7,theory(equality)]) ).
cnf(120,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)],[12,13,theory(equality)]),7,theory(equality)]) ).
cnf(137,plain,
f(neg(X),f(neg(neg(X)),X)) = neg(neg(X)),
inference('PARAMODULATE',[status(thm)],[87,11,theory(equality)]) ).
cnf(138,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)],[87,87,theory(equality)]),7,theory(equality)]) ).
cnf(139,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,87,theory(equality)]) ).
cnf(153,plain,
and(neg(X),f(neg(neg(X)),X)) = neg(neg(neg(X))),
inference('PARAMODULATE',[status(thm)],[7,137,theory(equality)]) ).
cnf(247,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)],[38,137,theory(equality)]) ).
cnf(343,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)],[15,137,theory(equality)]),7,theory(equality)]) ).
cnf(346,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)],[15,12,theory(equality)]),7,theory(equality)]) ).
cnf(373,plain,
f(X,f(neg(X),f(and(Y,X),f(Y,X)))) = neg(X),
inference('PARAMODULATE',[status(thm)],[112,16,theory(equality)]) ).
cnf(374,plain,
f(X,f(f(X,Y),f(and(Z,X),f(Z,X)))) = f(X,Y),
inference('PARAMODULATE',[status(thm)],[16,16,theory(equality)]) ).
cnf(375,plain,
f(neg(X),f(f(neg(X),f(X,Y)),X)) = f(neg(X),f(X,Y)),
inference('PARAMODULATE',[status(thm)],[16,12,theory(equality)]) ).
cnf(376,plain,
f(f(X,Y),f(f(f(X,Y),neg(Y)),Y)) = f(f(X,Y),neg(Y)),
inference('PARAMODULATE',[status(thm)],[16,13,theory(equality)]) ).
cnf(377,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)],[16,8,theory(equality)]) ).
cnf(453,plain,
and(X,f(neg(X),f(and(Y,X),f(Y,X)))) = neg(neg(X)),
inference('PARAMODULATE',[status(thm)],[7,373,theory(equality)]) ).
cnf(492,plain,
f(X,f(f(X,Y),f(neg(neg(X)),neg(X)))) = f(X,Y),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[374,sos_003,theory(equality)]),10,theory(equality)]) ).
cnf(493,plain,
and(X,f(f(X,Y),f(and(Z,X),f(Z,X)))) = and(X,Y),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[7,374,theory(equality)]),7,theory(equality)]) ).
cnf(548,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,375,theory(equality)]),7,theory(equality)]) ).
cnf(550,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)],[38,375,theory(equality)]) ).
cnf(584,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)],[453,137,theory(equality)]),153,7,theory(equality)]) ).
cnf(598,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,492,theory(equality)]),7,theory(equality)]) ).
cnf(666,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,376,theory(equality)]),7,theory(equality)]) ).
cnf(712,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)],[548,11,theory(equality)]),7,theory(equality)]) ).
cnf(721,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)],[598,11,theory(equality)]),25,7,theory(equality)]) ).
cnf(736,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)],[666,376,theory(equality)]),7,theory(equality)]) ).
cnf(742,plain,
f(f(neg(neg(X)),X),neg(X)) = X,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[377,11,theory(equality)]),sos_003,theory(equality)]) ).
cnf(744,plain,
f(f(f(f(X,Y),neg(Y)),Y),neg(Y)) = Y,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[377,13,theory(equality)]),sos_003,theory(equality)]) ).
cnf(745,plain,
f(f(f(f(X,Y),f(Y,Z)),Y),neg(Y)) = Y,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[377,8,theory(equality)]),sos_003,theory(equality)]) ).
cnf(783,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)],[377,138,theory(equality)]) ).
cnf(786,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)],[666,377,theory(equality)]),7,theory(equality)]) ).
cnf(804,plain,
and(f(neg(neg(X)),X),neg(X)) = neg(X),
inference('PARAMODULATE',[status(thm)],[7,742,theory(equality)]) ).
cnf(811,plain,
and(neg(X),f(f(neg(X),Y),f(neg(X),X))) = and(neg(X),Y),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[493,742,theory(equality)]),804,theory(equality)]) ).
cnf(826,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)],[38,742,theory(equality)]),7,theory(equality)]) ).
cnf(870,plain,
neg(neg(X)) = X,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[744,744,theory(equality)]),sos_003,theory(equality)]) ).
cnf(905,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)],[247,sos_003,870,theory(equality)]) ).
cnf(933,plain,
X = and(X,X),
inference('REWRITE',[status(thm)],[826,905,sos_003,870,theory(equality)]) ).
cnf(936,plain,
and(f(X,Y),f(X,f(f(X,f(neg(X),X)),X))) = neg(X),
inference('REWRITE',[status(thm)],[25,870,theory(equality)]) ).
cnf(957,plain,
and(X,f(neg(X),f(f(neg(X),f(X,neg(X))),Y))) = X,
inference('REWRITE',[status(thm)],[139,870,theory(equality)]) ).
cnf(1009,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)],[343,933,sos_003,870,theory(equality)]) ).
cnf(1056,plain,
and(and(neg(X),f(X,neg(X))),f(X,f(neg(X),X))) = neg(X),
inference('REWRITE',[status(thm)],[550,sos_003,870,theory(equality)]) ).
cnf(1070,plain,
and(neg(X),f(X,f(neg(X),X))) = neg(X),
inference('REWRITE',[status(thm)],[584,933,sos_003,870,theory(equality)]) ).
cnf(1076,plain,
and(X,f(f(X,Y),f(X,neg(X)))) = and(X,Y),
inference('REWRITE',[status(thm)],[598,870,theory(equality)]) ).
cnf(1109,plain,
and(and(X,Y),f(f(and(X,Y),X),f(X,Y))) = and(and(X,Y),X),
inference('REWRITE',[status(thm)],[712,870,theory(equality)]) ).
cnf(1110,plain,
and(f(X,Y),f(X,f(neg(and(X,Y)),and(X,Y)))) = neg(X),
inference('REWRITE',[status(thm)],[721,870,theory(equality)]) ).
cnf(1116,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)],[783,870,theory(equality)]) ).
cnf(1121,plain,
and(f(f(f(X,Y),neg(Y)),Y),neg(Y)) = neg(Y),
inference('PARAMODULATE',[status(thm)],[7,744,theory(equality)]) ).
cnf(1136,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)],[744,377,theory(equality)]),7,theory(equality)]) ).
cnf(1150,plain,
neg(and(X,Y)) = f(X,Y),
inference('PARAMODULATE',[status(thm)],[870,7,theory(equality)]) ).
cnf(1170,plain,
neg(and(x0,neg(x0))) != neg(and(x1,neg(x1))),
inference('REWRITE',[status(thm)],[6,1150,theory(equality)]) ).
cnf(1177,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)],[1116,1150,theory(equality)]) ).
cnf(1179,plain,
and(X,neg(and(neg(X),neg(and(neg(and(neg(X),neg(and(X,neg(X))))),Y))))) = X,
inference('REWRITE',[status(thm)],[957,1150,theory(equality)]) ).
cnf(1190,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)],[1009,1150,theory(equality)]) ).
cnf(1359,plain,
and(neg(X),neg(and(neg(and(neg(X),Y)),neg(and(neg(X),X))))) = and(neg(X),Y),
inference('REWRITE',[status(thm)],[811,1150,theory(equality)]) ).
cnf(1427,plain,
and(and(neg(X),neg(and(X,neg(X)))),neg(and(X,neg(and(neg(X),X))))) = neg(X),
inference('REWRITE',[status(thm)],[1056,1150,theory(equality)]) ).
cnf(1430,plain,
and(neg(X),neg(and(X,neg(and(neg(X),X))))) = neg(X),
inference('REWRITE',[status(thm)],[1070,1150,theory(equality)]) ).
cnf(1469,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)],[346,1150,theory(equality)]) ).
cnf(1541,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)],[99,1150,theory(equality)]) ).
cnf(1555,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)],[120,1150,theory(equality)]) ).
cnf(1697,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)],[548,1150,theory(equality)]) ).
cnf(1729,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)],[666,1150,theory(equality)]) ).
cnf(1767,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)],[736,1150,theory(equality)]) ).
cnf(1772,plain,
neg(and(neg(and(neg(and(neg(and(X,Y)),neg(and(Y,Z)))),Y)),neg(Y))) = Y,
inference('REWRITE',[status(thm)],[745,1150,theory(equality)]) ).
cnf(1787,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)],[786,1150,theory(equality)]) ).
cnf(1849,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)],[936,1150,theory(equality)]) ).
cnf(1879,plain,
and(X,neg(and(neg(and(X,Y)),neg(and(X,neg(X)))))) = and(X,Y),
inference('REWRITE',[status(thm)],[1076,1150,theory(equality)]) ).
cnf(1901,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)],[1109,1150,theory(equality)]) ).
cnf(1902,plain,
and(neg(and(X,Y)),neg(and(X,neg(and(neg(and(X,Y)),and(X,Y)))))) = neg(X),
inference('REWRITE',[status(thm)],[1110,1150,theory(equality)]) ).
cnf(1906,plain,
and(neg(and(neg(and(neg(and(X,Y)),neg(Y))),Y)),neg(Y)) = neg(Y),
inference('REWRITE',[status(thm)],[1121,1150,theory(equality)]) ).
cnf(1910,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)],[1136,1150,theory(equality)]) ).
cnf(1922,plain,
and(neg(and(neg(and(neg(and(X,neg(Y))),Y)),neg(Y))),Y) = Y,
inference('PARAMODULATE',[status(thm)],[1906,870,theory(equality)]) ).
cnf(1923,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)],[1906,1430,theory(equality)]),870,theory(equality)]) ).
cnf(1930,plain,
and(and(X,neg(and(neg(X),X))),neg(and(neg(X),neg(and(X,neg(X)))))) = X,
inference('PARAMODULATE',[status(thm)],[1427,870,theory(equality)]) ).
cnf(1938,plain,
neg(X) = and(neg(and(neg(and(neg(and(Y,X)),neg(and(X,Z)))),X)),neg(X)),
inference('PARAMODULATE',[status(thm)],[870,1772,theory(equality)]) ).
cnf(1960,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)],[1938,1922,theory(equality)]),870,theory(equality)]) ).
cnf(1976,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)],[1697,870,theory(equality)]) ).
cnf(1982,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)],[1901,1930,theory(equality)]) ).
cnf(1983,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)],[1901,1427,theory(equality)]),870,theory(equality)]) ).
cnf(1985,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)],[1901,1906,theory(equality)]),870,theory(equality)]) ).
cnf(1997,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)],[1902,1922,theory(equality)]),870,theory(equality)]) ).
cnf(2020,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)],[1922,1179,theory(equality)]) ).
cnf(2037,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)],[1938,1729,theory(equality)]),870,theory(equality)]) ).
cnf(2039,plain,
neg(and(X,neg(and(neg(and(X,neg(and(neg(X),X)))),X)))) = neg(X),
inference('PARAMODULATE',[status(thm)],[933,1849,theory(equality)]) ).
cnf(2048,plain,
and(neg(and(X,Y)),neg(X)) = neg(X),
inference('REWRITE',[status(thm)],[1849,2039,theory(equality)]) ).
cnf(2049,plain,
X = and(X,and(X,neg(and(neg(X),X)))),
inference('REWRITE',[status(thm)],[1982,933,870,2048,theory(equality)]) ).
cnf(2062,plain,
X = and(X,neg(and(neg(X),X))),
inference('REWRITE',[status(thm)],[1923,870,1430,2049,theory(equality)]) ).
cnf(2072,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)],[1469,2062,theory(equality)]) ).
cnf(2137,plain,
X = and(X,neg(and(neg(X),Y))),
inference('REWRITE',[status(thm)],[1976,933,870,2048,theory(equality)]) ).
cnf(2138,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)],[1541,2137,theory(equality)]) ).
cnf(2141,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)],[1787,933,2138,theory(equality)]) ).
cnf(2143,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)],[1910,870,2141,2138,theory(equality)]) ).
cnf(2147,plain,
neg(X) = and(and(neg(and(Y,X)),neg(and(X,Z))),neg(X)),
inference('REWRITE',[status(thm)],[1938,2143,theory(equality)]) ).
cnf(2163,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)],[1555,2137,theory(equality)]) ).
cnf(2166,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)],[2037,2163,theory(equality)]) ).
cnf(2168,plain,
neg(and(neg(and(X,Y)),neg(Y))) = and(neg(and(neg(and(X,Y)),neg(Y))),Y),
inference('REWRITE',[status(thm)],[1767,2166,933,2163,theory(equality)]) ).
cnf(2177,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)],[2020,2168,theory(equality)]) ).
cnf(2183,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)],[1985,870,2168,theory(equality)]) ).
cnf(2186,plain,
neg(and(neg(and(neg(and(X,neg(Y))),Y)),neg(Y))) = Y,
inference('REWRITE',[status(thm)],[1922,2168,theory(equality)]) ).
cnf(2189,plain,
neg(X) = and(neg(and(neg(and(Y,neg(X))),X)),neg(X)),
inference('REWRITE',[status(thm)],[1997,933,2137,2186,theory(equality)]) ).
cnf(2190,plain,
neg(X) = and(and(neg(and(Y,X)),neg(X)),neg(X)),
inference('REWRITE',[status(thm)],[1960,870,2168,2189,2186,theory(equality)]) ).
cnf(2210,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)],[2072,2137,theory(equality)]) ).
cnf(2214,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)],[1190,2137,theory(equality)]) ).
cnf(2217,plain,
neg(X) = and(neg(X),neg(and(neg(and(neg(X),neg(and(X,neg(X))))),Y))),
inference('REWRITE',[status(thm)],[2177,2214,theory(equality)]) ).
cnf(2224,plain,
and(neg(and(neg(X),Y)),X) = X,
inference('REWRITE',[status(thm)],[2214,870,2217,theory(equality)]) ).
cnf(2225,plain,
neg(X) = and(neg(X),and(neg(and(Y,X)),neg(X))),
inference('REWRITE',[status(thm)],[2183,933,2224,theory(equality)]) ).
cnf(2232,plain,
neg(X) = and(neg(X),and(neg(X),neg(and(X,neg(X))))),
inference('REWRITE',[status(thm)],[1983,933,2224,theory(equality)]) ).
cnf(2233,plain,
X = neg(and(neg(X),neg(and(X,Y)))),
inference('REWRITE',[status(thm)],[1177,933,2224,870,2232,theory(equality)]) ).
cnf(2238,plain,
neg(X) = and(neg(X),neg(and(X,Y))),
inference('REWRITE',[status(thm)],[2217,2233,theory(equality)]) ).
cnf(2243,plain,
and(neg(and(neg(and(neg(and(X,Y)),neg(and(Y,neg(Y))))),Z)),neg(Y)) = neg(Y),
inference('REWRITE',[status(thm)],[2210,870,2238,2224,theory(equality)]) ).
cnf(2248,plain,
and(X,Y) = and(and(X,Y),X),
inference('REWRITE',[status(thm)],[1901,933,870,2048,theory(equality)]) ).
cnf(2251,plain,
and(X,and(X,Y)) = and(X,Y),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[2048,2048,theory(equality)]),870,theory(equality)]) ).
cnf(2275,plain,
X = and(and(neg(and(Y,neg(X))),X),X),
inference('PARAMODULATE',[status(thm)],[2190,870,theory(equality)]) ).
cnf(2278,plain,
neg(and(neg(and(X,neg(Y))),Y)) = neg(Y),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[2238,2275,theory(equality)]),2189,theory(equality)]) ).
cnf(2286,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)],[2048,2147,theory(equality)]),870,theory(equality)]) ).
cnf(2316,plain,
and(neg(X),and(Y,neg(X))) = and(Y,neg(X)),
inference('PARAMODULATE',[status(thm)],[2224,2278,theory(equality)]) ).
cnf(2317,plain,
neg(X) = and(neg(and(Y,X)),neg(X)),
inference('REWRITE',[status(thm)],[2225,2316,theory(equality)]) ).
cnf(2335,plain,
and(X,and(Y,X)) = and(Y,X),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[2224,2317,theory(equality)]),870,theory(equality)]) ).
cnf(2339,plain,
neg(and(neg(and(X,Y)),neg(and(Y,neg(Y))))) = and(X,Y),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[1902,2317,theory(equality)]),2286,870,theory(equality)]) ).
cnf(2340,plain,
and(neg(and(and(X,Y),Z)),neg(Y)) = neg(Y),
inference('REWRITE',[status(thm)],[2243,2339,theory(equality)]) ).
cnf(2352,plain,
and(neg(and(and(X,Y),Z)),neg(X)) = neg(X),
inference('PARAMODULATE',[status(thm)],[2340,2248,theory(equality)]) ).
cnf(2355,plain,
and(neg(and(X,and(Y,Z))),neg(Z)) = neg(Z),
inference('PARAMODULATE',[status(thm)],[2340,2335,theory(equality)]) ).
cnf(2380,plain,
and(X,and(and(X,Y),Z)) = and(and(X,Y),Z),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[2224,2352,theory(equality)]),870,theory(equality)]) ).
cnf(2434,plain,
and(X,and(Y,and(X,Z))) = and(Y,and(X,Z)),
inference('PARAMODULATE',[status(thm)],[2380,2335,theory(equality)]) ).
cnf(2460,plain,
and(X,neg(X)) = and(Y,and(X,neg(X))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[1879,2355,theory(equality)]),2434,2251,870,theory(equality)]) ).
cnf(2462,plain,
and(neg(X),X) = and(Y,and(neg(X),X)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[1359,2355,theory(equality)]),2434,2251,870,theory(equality)]) ).
cnf(2470,plain,
and(neg(and(X,neg(X))),Y) = Y,
inference('PARAMODULATE',[status(thm)],[2224,2460,theory(equality)]) ).
cnf(2471,plain,
X = and(X,neg(and(Y,neg(Y)))),
inference('PARAMODULATE',[status(thm)],[2137,2460,theory(equality)]) ).
cnf(2483,plain,
and(neg(X),X) = and(Y,neg(Y)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[1359,2460,theory(equality)]),2462,870,2470,theory(equality)]) ).
cnf(2484,plain,
and(X,neg(X)) = and(Y,neg(Y)),
inference('PARAMODULATE',[status(thm)],[2483,2483,theory(equality)]) ).
cnf(2497,plain,
neg(and(x0,neg(x0))) != neg(and(X,neg(X))),
inference('PARAMODULATE',[status(thm)],[1170,2484,theory(equality)]) ).
cnf(2498,plain,
neg(and(X,neg(X))) = neg(and(Y,neg(Y))),
inference('PARAMODULATE',[status(thm)],[2470,2471,theory(equality)]) ).
cnf(2499,plain,
$false,
inference('REWRITE',[status(thm)],[2497,2498,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : LAT394-1 : TPTP v8.1.0. Released v5.4.0.
% 0.00/0.12 % Command : run-snark %s %d
% 0.12/0.33 % Computer : n010.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 : Tue Jun 28 19:45:49 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.45 *
% 0.18/0.45 *
% 0.18/0.45 #<PACKAGE "SNARK-USER">
% 0.18/0.45 *
% 0.18/0.45 SNARK-TPTP-OPTIONS
% 0.18/0.45 *
% 0.18/0.45 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.18/0.45 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.18/0.45 (USE-FACTORING :POS)
% 0.18/0.45 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.18/0.45 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.18/0.45 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.18/0.45 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.18/0.45 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.18/0.45 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.18/0.45 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.18/0.45 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.18/0.45 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.18/0.45 (DECLARE-TPTP-SYMBOLS2))
% 0.18/0.45 *
% 0.18/0.45 "."
% 0.18/0.45 *
% 0.18/0.45 ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-28T19:45:49
% 0.18/0.45 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n010.cluster.edu at 2022-06-28T19:45:49
% 1.64/1.88
% 1.64/1.88
% 1.64/1.88 #||
% 1.64/1.88 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.64/1.88 % SZS output start Refutation
% See solution above
% 1.74/1.91 ||#
% 1.74/1.91
% 1.74/1.91 ; Summary of computation:
% 1.74/1.91 ; 6417 formulas have been input or derived (from 118 formulas).
% 1.74/1.91 ; 2499 (39%) were retained. Of these,
% 1.74/1.91 ; 2346 (94%) were simplified or subsumed later,
% 1.74/1.91 ; 153 ( 6%) are still being kept.
% 1.74/1.91 ;
% 1.74/1.91 ; Run time in seconds excluding printing time:
% 1.74/1.91 ; 0.001 0% Read assertion file (1 call)
% 1.74/1.91 ; 0.000 0% Assert (5 calls)
% 1.74/1.91 ; 0.418 29% Process new row (5,958 calls)
% 1.74/1.91 ; 0.008 1% Resolution (234 calls)
% 1.74/1.91 ; 0.150 10% Paramodulation (117 calls)
% 1.74/1.91 ; 0.404 28% Forward simplification (5,788 calls)
% 1.74/1.91 ; 0.366 26% Backward simplification (2,498 calls)
% 1.74/1.91 ; 0.046 3% Ordering (10,718 calls)
% 1.74/1.91 ; 0.001 0% Sortal reasoning (32 calls)
% 1.74/1.91 ; 0.000 0% Purity testing (1 call)
% 1.74/1.91 ; 0.036 3% Other
% 1.74/1.91 ; 1.430 Total
% 1.74/1.91 ; 1.460 Real time
% 1.74/1.91 ;
% 1.74/1.91 ; Term-hash-array has 9,680 terms in all.
% 1.74/1.91 ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 1.74/1.91 ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 1.74/1.91 ; Path-index has 502 entries (3,443 at peak, 10,269 added, 9,767 deleted).
% 1.74/1.91 ; Path-index has 18,586 nodes (22,531 at peak, 32,106 added, 13,520 deleted).
% 1.74/1.91 ; Trie-index has 502 entries (3,443 at peak, 10,269 added, 9,767 deleted).
% 1.74/1.91 ; Trie-index has 2,348 nodes (59,576 at peak, 167,340 added, 164,992 deleted).
% 1.74/1.91 ; Retrieved 86,240 generalization terms in 116,962 calls.
% 1.74/1.91 ; Retrieved 14,830 instance terms in 2,497 calls.
% 1.74/1.91 ; Retrieved 42,015 unifiable terms in 1,027 calls.
% 1.74/1.91 ;
% 1.74/1.91 ; The agenda of rows to process has 34 entries:
% 1.74/1.91 ; 2 with value 25 2 with value 30 4 with value 35
% 1.74/1.91 ; 3 with value 26 4 with value 31 1 with value 37
% 1.74/1.91 ; 2 with value 27 4 with value 32 1 with value 43
% 1.74/1.91 ; 8 with value 28 3 with value 34
% 1.74/1.91 ; The agenda of rows to give has 116 entries:
% 1.74/1.91 ; 16 with value (4 24) 2 with value (4 33) 2 with value (4 50)
% 1.74/1.91 ; 10 with value (4 25) 1 with value (4 34) 1 with value (4 53)
% 1.74/1.91 ; 13 with value (4 26) 1 with value (4 35) 1 with value (4 58)
% 1.74/1.91 ; 13 with value (4 27) 3 with value (4 37) 1 with value (4 64)
% 1.74/1.91 ; 13 with value (4 28) 2 with value (4 38) 1 with value (4 66)
% 1.74/1.91 ; 12 with value (4 29) 2 with value (4 39) 1 with value (4 71)
% 1.74/1.91 ; 12 with value (4 30) 2 with value (4 40) 1 with value (4 90)
% 1.74/1.91 ; 6 with value (4 31)
% 1.74/1.91 Evaluation took:
% 1.74/1.91 1.46 seconds of real time
% 1.74/1.91 1.365508 seconds of user run time
% 1.74/1.91 0.094338 seconds of system run time
% 1.74/1.91 [Run times include 0.211 seconds GC run time.]
% 1.74/1.91 0 calls to %EVAL
% 1.74/1.91 0 page faults and
% 1.74/1.91 152,963,240 bytes consed.
% 1.74/1.91 :PROOF-FOUND
% 1.74/1.91 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-28T19:45:51
% 1.74/1.91 :PROOF-FOUND
% 1.74/1.91 *
%------------------------------------------------------------------------------