TSTP Solution File: GRP697-1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : GRP697-1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n014.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 : Sat Jul 16 11:40:22 EDT 2022
% Result : Unsatisfiable 1.91s 2.09s
% Output : Refutation 1.91s
% Verified :
% SZS Type : Refutation
% Derivation depth : 23
% Number of leaves : 12
% Syntax : Number of clauses : 101 ( 101 unt; 0 nHn; 7 RR)
% Number of literals : 101 ( 100 equ; 5 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 9 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 185 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c01,axiom,
mult(X,ld(X,Y)) = Y,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c01) ).
cnf(c02,axiom,
ld(X,mult(X,Y)) = Y,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c02) ).
cnf(c03,axiom,
mult(rd(X,Y),Y) = X,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c03) ).
cnf(c04,axiom,
rd(mult(X,Y),Y) = X,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c04) ).
cnf(c05,axiom,
mult(X,unit) = X,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c05) ).
cnf(c06,axiom,
mult(unit,X) = X,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c06) ).
cnf(c07,axiom,
mult(X,i(mult(Y,X))) = i(Y),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c07) ).
cnf(c08,axiom,
mult(X,mult(Y,Z)) = mult(rd(mult(X,Y),X),mult(X,Z)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c08) ).
cnf(c09,axiom,
mult(mult(X,Y),Z) = mult(mult(X,Z),ld(Z,mult(Y,Z))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c09) ).
cnf(c10,axiom,
mult(i(X),X) = unit,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c10) ).
cnf(c11,axiom,
mult(X,i(X)) = unit,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c11) ).
cnf(goals,negated_conjecture,
mult(mult(a,b),mult(b,mult(c,b))) != mult(mult(a,mult(b,mult(b,c))),b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
cnf(13,plain,
unit = i(unit),
inference('PARAMODULATE',[status(thm)],[c05,c10,theory(equality)]) ).
cnf(15,plain,
ld(X,X) = unit,
inference('PARAMODULATE',[status(thm)],[c02,c05,theory(equality)]) ).
cnf(16,plain,
ld(X,unit) = i(X),
inference('PARAMODULATE',[status(thm)],[c02,c11,theory(equality)]) ).
cnf(17,plain,
i(i(X)) = X,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[c02,c10,theory(equality)]),16,theory(equality)]) ).
cnf(19,plain,
ld(rd(X,Y),X) = Y,
inference('PARAMODULATE',[status(thm)],[c02,c03,theory(equality)]) ).
cnf(21,plain,
rd(unit,X) = i(X),
inference('PARAMODULATE',[status(thm)],[c04,c10,theory(equality)]) ).
cnf(23,plain,
ld(X,i(Y)) = i(mult(Y,X)),
inference('PARAMODULATE',[status(thm)],[c02,c07,theory(equality)]) ).
cnf(24,plain,
mult(X,mult(i(X),Y)) = mult(i(X),mult(X,Y)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[c08,c11,theory(equality)]),21,theory(equality)]) ).
cnf(28,plain,
mult(mult(i(X),Y),X) = ld(X,mult(Y,X)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[c09,c10,theory(equality)]),c06,theory(equality)]) ).
cnf(29,plain,
mult(mult(X,i(Y)),Y) = mult(mult(X,Y),i(Y)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[c09,c10,theory(equality)]),16,theory(equality)]) ).
cnf(30,plain,
rd(mult(mult(X,Y),Z),ld(Z,mult(Y,Z))) = mult(X,Z),
inference('PARAMODULATE',[status(thm)],[c04,c09,theory(equality)]) ).
cnf(33,plain,
X = mult(mult(Y,X),ld(X,mult(i(Y),X))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[c09,c11,theory(equality)]),c06,theory(equality)]) ).
cnf(79,plain,
ld(ld(X,Y),i(X)) = i(Y),
inference('PARAMODULATE',[status(thm)],[23,c01,theory(equality)]) ).
cnf(80,plain,
i(ld(X,i(Y))) = mult(Y,X),
inference('PARAMODULATE',[status(thm)],[17,23,theory(equality)]) ).
cnf(104,plain,
i(ld(X,ld(Y,X))) = ld(X,i(ld(X,i(Y)))),
inference('REWRITE',[status(thm)],[28,17,80,theory(equality)]) ).
cnf(113,plain,
X = i(ld(ld(X,i(ld(X,Y))),ld(X,i(Y)))),
inference('REWRITE',[status(thm)],[33,17,80,theory(equality)]) ).
cnf(116,plain,
ld(X,i(ld(Y,i(X)))) = Y,
inference('REWRITE',[status(thm)],[c02,80,theory(equality)]) ).
cnf(119,plain,
i(ld(i(ld(X,Y)),i(Y))) = i(ld(i(ld(X,i(Y))),Y)),
inference('REWRITE',[status(thm)],[24,17,80,theory(equality)]) ).
cnf(121,plain,
i(ld(X,ld(i(X),i(Y)))) = i(ld(i(X),ld(X,i(Y)))),
inference('REWRITE',[status(thm)],[29,17,80,theory(equality)]) ).
cnf(122,plain,
rd(i(ld(X,ld(Y,i(Z)))),i(ld(X,ld(Y,X)))) = i(ld(X,i(Z))),
inference('REWRITE',[status(thm)],[30,104,17,80,theory(equality)]) ).
cnf(140,plain,
i(ld(i(ld(i(ld(b,i(c))),i(b))),ld(b,i(a)))) != i(ld(b,ld(i(ld(i(ld(c,i(b))),i(b))),i(a)))),
inference('REWRITE',[status(thm)],[goals,17,80,theory(equality)]) ).
cnf(143,plain,
ld(X,i(Y)) = rd(i(X),Y),
inference('PARAMODULATE',[status(thm)],[116,19,theory(equality)]) ).
cnf(145,plain,
ld(ld(X,ld(Y,i(Z))),ld(X,ld(Y,X))) = i(ld(X,i(Z))),
inference('REWRITE',[status(thm)],[122,17,143,theory(equality)]) ).
cnf(151,plain,
ld(i(X),i(ld(Y,X))) = Y,
inference('PARAMODULATE',[status(thm)],[116,17,theory(equality)]) ).
cnf(154,plain,
ld(ld(i(X),Y),X) = i(Y),
inference('PARAMODULATE',[status(thm)],[79,17,theory(equality)]) ).
cnf(160,plain,
i(ld(X,ld(i(Y),X))) = ld(X,i(ld(X,Y))),
inference('PARAMODULATE',[status(thm)],[104,17,theory(equality)]) ).
cnf(161,plain,
i(ld(i(X),ld(X,i(X)))) = X,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[104,15,theory(equality)]),17,16,13,theory(equality)]) ).
cnf(162,plain,
ld(ld(X,i(Y)),ld(X,ld(Y,X))) = X,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[116,104,theory(equality)]),17,theory(equality)]) ).
cnf(163,plain,
i(ld(X,ld(ld(Y,i(X)),X))) = ld(X,i(Y)),
inference('PARAMODULATE',[status(thm)],[104,116,theory(equality)]) ).
cnf(164,plain,
ld(i(ld(X,ld(Y,X))),i(X)) = ld(X,i(Y)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[79,104,theory(equality)]),17,theory(equality)]) ).
cnf(169,plain,
i(X) = ld(i(X),ld(X,i(X))),
inference('PARAMODULATE',[status(thm)],[17,161,theory(equality)]) ).
cnf(171,plain,
ld(i(X),X) = i(ld(X,i(X))),
inference('PARAMODULATE',[status(thm)],[154,169,theory(equality)]) ).
cnf(174,plain,
ld(X,ld(Y,ld(ld(X,i(Y)),Y))) = Y,
inference('PARAMODULATE',[status(thm)],[162,116,theory(equality)]) ).
cnf(200,plain,
i(X) = ld(ld(X,i(ld(X,Y))),ld(X,i(Y))),
inference('PARAMODULATE',[status(thm)],[17,113,theory(equality)]) ).
cnf(202,plain,
i(ld(X,i(ld(X,Y)))) = ld(X,ld(i(Y),X)),
inference('PARAMODULATE',[status(thm)],[17,160,theory(equality)]) ).
cnf(207,plain,
i(X) = ld(i(ld(X,ld(Y,X))),ld(X,Y)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[200,104,theory(equality)]),17,theory(equality)]) ).
cnf(232,plain,
X = ld(ld(i(X),i(Y)),ld(i(X),ld(Y,X))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[200,151,theory(equality)]),17,theory(equality)]) ).
cnf(234,plain,
i(ld(X,Y)) = ld(ld(ld(X,Y),Y),ld(ld(X,Y),X)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[200,79,theory(equality)]),17,theory(equality)]) ).
cnf(240,plain,
ld(i(X),ld(X,ld(Y,X))) = i(ld(X,Y)),
inference('PARAMODULATE',[status(thm)],[154,207,theory(equality)]) ).
cnf(241,plain,
ld(i(ld(X,Y)),X) = i(ld(X,ld(Y,X))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[151,207,theory(equality)]),17,theory(equality)]) ).
cnf(251,plain,
i(ld(i(X),Y)) = ld(i(ld(ld(i(X),Y),ld(X,ld(i(X),Y)))),i(Y)),
inference('PARAMODULATE',[status(thm)],[207,154,theory(equality)]) ).
cnf(257,plain,
i(ld(X,i(Y))) = ld(i(Y),ld(ld(X,i(Y)),ld(X,i(ld(X,Y))))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[207,200,theory(equality)]),17,79,theory(equality)]) ).
cnf(264,plain,
X = ld(Y,ld(i(X),ld(ld(Y,X),X))),
inference('PARAMODULATE',[status(thm)],[232,151,theory(equality)]) ).
cnf(280,plain,
ld(X,ld(ld(Y,i(X)),X)) = i(ld(X,i(Y))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[232,174,theory(equality)]),234,163,theory(equality)]) ).
cnf(284,plain,
ld(X,ld(i(X),i(Y))) = i(ld(i(X),ld(X,Y))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[240,79,theory(equality)]),17,theory(equality)]) ).
cnf(285,plain,
ld(i(X),ld(X,Y)) = i(ld(i(X),ld(X,i(Y)))),
inference('REWRITE',[status(thm)],[121,17,284,theory(equality)]) ).
cnf(288,plain,
X = ld(ld(i(X),ld(X,Y)),ld(i(X),i(ld(X,ld(Y,X))))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[200,240,theory(equality)]),17,theory(equality)]) ).
cnf(289,plain,
ld(ld(X,i(Y)),ld(X,i(ld(X,Y)))) = i(ld(i(ld(X,Y)),i(Y))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[240,116,theory(equality)]),119,202,241,17,theory(equality)]) ).
cnf(290,plain,
i(ld(X,i(Y))) = ld(i(Y),i(ld(i(ld(X,Y)),i(Y)))),
inference('REWRITE',[status(thm)],[257,289,theory(equality)]) ).
cnf(306,plain,
i(ld(X,i(ld(X,Y)))) = i(ld(ld(i(Y),X),ld(Y,ld(i(Y),X)))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[241,154,theory(equality)]),202,17,theory(equality)]) ).
cnf(307,plain,
i(ld(i(X),Y)) = ld(i(ld(Y,i(ld(Y,X)))),i(Y)),
inference('REWRITE',[status(thm)],[251,306,theory(equality)]) ).
cnf(318,plain,
ld(X,i(Y)) = i(ld(i(X),ld(ld(Y,X),X))),
inference('PARAMODULATE',[status(thm)],[79,264,theory(equality)]) ).
cnf(323,plain,
i(ld(X,Y)) = ld(i(Y),ld(ld(X,Y),ld(X,i(ld(X,Y))))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[264,151,theory(equality)]),17,theory(equality)]) ).
cnf(336,plain,
ld(i(X),ld(ld(Y,X),X)) = i(ld(X,i(Y))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[232,264,theory(equality)]),234,318,theory(equality)]) ).
cnf(340,plain,
i(ld(i(X),ld(X,Y))) = ld(i(X),ld(X,i(Y))),
inference('PARAMODULATE',[status(thm)],[17,285,theory(equality)]) ).
cnf(352,plain,
ld(ld(i(X),ld(X,Y)),i(X)) = i(ld(i(X),Y)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[241,340,theory(equality)]),79,17,theory(equality)]) ).
cnf(360,plain,
ld(i(ld(X,i(Y))),i(X)) = ld(X,i(ld(i(X),Y))),
inference('PARAMODULATE',[status(thm)],[164,154,theory(equality)]) ).
cnf(361,plain,
i(ld(i(X),Y)) = ld(Y,i(ld(i(Y),ld(Y,X)))),
inference('REWRITE',[status(thm)],[307,360,theory(equality)]) ).
cnf(362,plain,
i(ld(i(ld(b,i(ld(i(b),c)))),ld(b,i(a)))) != i(ld(b,ld(i(ld(i(ld(c,i(b))),i(b))),i(a)))),
inference('REWRITE',[status(thm)],[140,360,theory(equality)]) ).
cnf(363,plain,
ld(i(ld(i(X),i(Y))),X) = ld(i(X),i(ld(X,Y))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[164,79,theory(equality)]),17,theory(equality)]) ).
cnf(367,plain,
i(ld(i(X),Y)) = i(ld(i(Y),i(ld(Y,ld(X,Y))))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[240,164,theory(equality)]),361,340,17,theory(equality)]) ).
cnf(493,plain,
ld(i(X),i(ld(X,Y))) = i(ld(ld(Y,X),i(X))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[154,280,theory(equality)]),17,363,theory(equality)]) ).
cnf(494,plain,
i(ld(i(X),Y)) = ld(ld(ld(X,Y),Y),i(Y)),
inference('REWRITE',[status(thm)],[367,17,493,theory(equality)]) ).
cnf(496,plain,
X = ld(ld(i(X),ld(X,Y)),ld(i(Y),X)),
inference('REWRITE',[status(thm)],[288,17,494,493,theory(equality)]) ).
cnf(567,plain,
ld(X,i(ld(X,Y))) = i(ld(ld(Y,X),X)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[154,336,theory(equality)]),17,202,241,theory(equality)]) ).
cnf(621,plain,
ld(ld(X,Y),Y) = ld(Y,ld(i(X),Y)),
inference('REWRITE',[status(thm)],[202,17,567,theory(equality)]) ).
cnf(631,plain,
i(ld(X,Y)) = ld(i(Y),ld(ld(X,Y),i(ld(ld(Y,X),X)))),
inference('REWRITE',[status(thm)],[323,567,theory(equality)]) ).
cnf(654,plain,
ld(i(ld(X,Y)),Y) = i(ld(Y,ld(Y,X))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[336,241,theory(equality)]),17,494,493,241,theory(equality)]) ).
cnf(658,plain,
i(ld(i(ld(b,i(ld(i(b),c)))),ld(b,i(a)))) != i(ld(b,ld(ld(i(b),ld(i(b),c)),i(a)))),
inference('REWRITE',[status(thm)],[362,17,654,theory(equality)]) ).
cnf(677,plain,
ld(ld(X,Y),i(ld(ld(Y,X),X))) = ld(Y,ld(Y,X)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[336,151,theory(equality)]),654,567,17,theory(equality)]) ).
cnf(678,plain,
i(ld(X,Y)) = ld(i(Y),ld(Y,ld(Y,X))),
inference('REWRITE',[status(thm)],[631,677,theory(equality)]) ).
cnf(698,plain,
ld(ld(i(X),Y),Y) = ld(Y,ld(X,Y)),
inference('PARAMODULATE',[status(thm)],[621,17,theory(equality)]) ).
cnf(707,plain,
ld(i(ld(X,Y)),i(Y)) = i(ld(i(Y),ld(Y,X))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[621,164,theory(equality)]),340,79,theory(equality)]) ).
cnf(720,plain,
i(ld(X,i(Y))) = ld(i(Y),ld(i(Y),ld(Y,X))),
inference('REWRITE',[status(thm)],[290,17,707,theory(equality)]) ).
cnf(872,plain,
ld(i(X),ld(X,Y)) = ld(X,ld(i(X),Y)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[678,151,theory(equality)]),17,707,theory(equality)]) ).
cnf(1098,plain,
i(ld(i(X),i(ld(Y,i(X))))) = ld(i(ld(Y,ld(X,Y))),ld(Y,i(X))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[494,116,theory(equality)]),17,698,567,theory(equality)]) ).
cnf(1184,plain,
X = ld(ld(Y,X),ld(ld(X,Y),X)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[496,567,theory(equality)]),17,151,theory(equality)]) ).
cnf(1208,plain,
ld(X,i(ld(Y,X))) = i(ld(ld(X,Y),X)),
inference('PARAMODULATE',[status(thm)],[79,1184,theory(equality)]) ).
cnf(1219,plain,
ld(ld(i(X),Y),i(X)) = ld(i(ld(Y,ld(X,Y))),ld(Y,i(X))),
inference('REWRITE',[status(thm)],[1098,17,1208,theory(equality)]) ).
cnf(1494,plain,
ld(ld(X,ld(Y,Z)),ld(X,ld(Y,X))) = i(ld(X,Z)),
inference('PARAMODULATE',[status(thm)],[145,17,theory(equality)]) ).
cnf(1496,plain,
ld(i(ld(X,ld(Y,X))),ld(X,Z)) = ld(X,ld(Y,Z)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[151,1494,theory(equality)]),17,theory(equality)]) ).
cnf(1497,plain,
ld(ld(i(X),Y),i(X)) = ld(Y,ld(X,i(X))),
inference('REWRITE',[status(thm)],[1219,1496,theory(equality)]) ).
cnf(1502,plain,
ld(ld(X,Y),ld(X,i(X))) = i(ld(i(X),Y)),
inference('REWRITE',[status(thm)],[352,1497,theory(equality)]) ).
cnf(1623,plain,
ld(ld(i(X),X),ld(i(X),Y)) = ld(X,Y),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[151,1502,theory(equality)]),17,171,theory(equality)]) ).
cnf(1966,plain,
ld(ld(i(X),X),i(ld(Y,i(X)))) = i(ld(Y,X)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[1623,720,theory(equality)]),678,872,theory(equality)]) ).
cnf(1970,plain,
i(ld(ld(X,i(Y)),Y)) = ld(Y,i(ld(i(Y),X))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[1623,567,theory(equality)]),1966,theory(equality)]) ).
cnf(1984,plain,
i(ld(ld(ld(c,i(b)),b),ld(b,i(a)))) != i(ld(b,ld(ld(i(b),ld(i(b),c)),i(a)))),
inference('REWRITE',[status(thm)],[658,17,1970,theory(equality)]) ).
cnf(2991,plain,
ld(i(ld(X,i(Y))),ld(X,Z)) = ld(X,ld(ld(i(X),Y),Z)),
inference('PARAMODULATE',[status(thm)],[1496,154,theory(equality)]) ).
cnf(3001,plain,
$false,
inference('REWRITE',[status(thm)],[1984,17,1970,2991,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP697-1 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.13 % Command : run-snark %s %d
% 0.12/0.34 % Computer : n014.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Mon Jun 13 18:40:52 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.45 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.46 *
% 0.19/0.46 *
% 0.19/0.47 #<PACKAGE "SNARK-USER">
% 0.19/0.47 *
% 0.19/0.47 SNARK-TPTP-OPTIONS
% 0.19/0.47 *
% 0.19/0.47 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.19/0.47 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.19/0.47 (USE-FACTORING :POS)
% 0.19/0.47 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.19/0.47 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.19/0.47 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.19/0.47 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.19/0.47 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.19/0.47 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.19/0.47 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.19/0.47 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.19/0.47 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.19/0.47 (DECLARE-TPTP-SYMBOLS2))
% 0.19/0.47 *
% 0.19/0.47 "."
% 0.19/0.47 *
% 0.19/0.47 ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-13T18:40:52
% 0.19/0.47 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n014.cluster.edu at 2022-06-13T18:40:52
% 0.19/0.48
% 0.19/0.48 ; Recognized right identity assertion (= (|mult| ?X |unit|) ?X).
% 0.19/0.48 ; Recognized left identity assertion (= (|mult| |unit| ?X) ?X).
% 0.19/0.48 ; Recognized possible left inverse assertion (= (|mult| (|i| ?X) ?X) |unit|).
% 1.91/2.09 ; Recognized possible right inverse assertion (= (|mult| ?X (|i| ?X)) |unit|).
% 1.91/2.09
% 1.91/2.09 #||
% 1.91/2.09 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.91/2.09 % SZS output start Refutation
% See solution above
% 1.91/2.10 ||#
% 1.91/2.10
% 1.91/2.10 ; Summary of computation:
% 1.91/2.10 ; 8353 formulas have been input or derived (from 119 formulas).
% 1.91/2.10 ; 3001 (36%) were retained. Of these,
% 1.91/2.10 ; 1564 (52%) were simplified or subsumed later,
% 1.91/2.10 ; 1437 (48%) are still being kept.
% 1.91/2.10 ;
% 1.91/2.10 ; Run time in seconds excluding printing time:
% 1.91/2.10 ; 0.002 0% Read assertion file (1 call)
% 1.91/2.10 ; 0.000 0% Assert (12 calls)
% 1.91/2.10 ; 0.344 21% Process new row (7,913 calls)
% 1.91/2.10 ; 0.010 1% Resolution (236 calls)
% 1.91/2.10 ; 0.136 8% Paramodulation (118 calls)
% 1.91/2.10 ; 0.471 29% Forward simplification (7,388 calls)
% 1.91/2.10 ; 0.217 13% Backward simplification (3,001 calls)
% 1.91/2.10 ; 0.383 24% Ordering (40,645 calls)
% 1.91/2.10 ; 0.001 0% Sortal reasoning (32 calls)
% 1.91/2.10 ; 0.001 0% Purity testing (1 call)
% 1.91/2.10 ; 0.058 4% Other
% 1.91/2.10 ; 1.623 Total
% 1.91/2.10 ; 1.633 Real time
% 1.91/2.10 ;
% 1.91/2.10 ; Term-hash-array has 8,195 terms in all.
% 1.91/2.10 ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 1.91/2.10 ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 1.91/2.10 ; Path-index has 4,185 entries (4,202 at peak, 8,715 added, 4,530 deleted).
% 1.91/2.10 ; Path-index has 3,444 nodes (3,485 at peak, 4,930 added, 1,486 deleted).
% 1.91/2.10 ; Trie-index has 4,185 entries (4,202 at peak, 8,715 added, 4,530 deleted).
% 1.91/2.10 ; Trie-index has 28,077 nodes (28,273 at peak, 61,155 added, 33,078 deleted).
% 1.91/2.10 ; Retrieved 209,035 generalization terms in 116,923 calls.
% 1.91/2.10 ; Retrieved 36,360 instance terms in 3,434 calls.
% 1.91/2.10 ; Retrieved 31,992 unifiable terms in 912 calls.
% 1.91/2.10 ;
% 1.91/2.10 ; The agenda of rows to process has 424 entries:
% 1.91/2.10 ; 9 with value 28 19 with value 38 19 with value 47
% 1.91/2.10 ; 7 with value 29 18 with value 39 5 with value 48
% 1.91/2.10 ; 11 with value 30 25 with value 40 9 with value 49
% 1.91/2.10 ; 8 with value 31 29 with value 41 5 with value 50
% 1.91/2.10 ; 12 with value 32 17 with value 42 4 with value 51
% 1.91/2.10 ; 15 with value 33 26 with value 43 2 with value 52
% 1.91/2.10 ; 21 with value 34 21 with value 44 1 with value 53
% 1.91/2.10 ; 39 with value 35 21 with value 45 1 with value 54
% 1.91/2.10 ; 29 with value 36 15 with value 46 1 with value 58
% 1.91/2.10 ; 35 with value 37
% 1.91/2.10 ; The agenda of rows to give has 1370 entries:
% 1.91/2.10 ; 11 with value (4 24) 88 with value (4 36) 2 with value (4 48)
% 1.91/2.10 ; 31 with value (4 25) 84 with value (4 37) 4 with value (4 49)
% 1.91/2.10 ; 25 with value (4 26) 70 with value (4 38) 1 with value (4 50)
% 1.91/2.10 ; 24 with value (4 27) 89 with value (4 39) 1 with value (4 51)
% 1.91/2.10 ; 41 with value (4 28) 63 with value (4 40) 4 with value (4 52)
% 1.91/2.10 ; 57 with value (4 29) 55 with value (4 41) 1 with value (4 53)
% 1.91/2.10 ; 73 with value (4 30) 62 with value (4 42) 1 with value (4 54)
% 1.91/2.10 ; 92 with value (4 31) 32 with value (4 43) 1 with value (4 55)
% 1.91/2.10 ; 89 with value (4 32) 30 with value (4 44) 1 with value (4 56)
% 1.91/2.10 ; 87 with value (4 33) 15 with value (4 45) 1 with value (4 57)
% 1.91/2.10 ; 97 with value (4 34) 6 with value (4 46) 1 with value (4 62)
% 1.91/2.10 ; 129 with value (4 35) 2 with value (4 47)
% 1.91/2.10 Evaluation took:
% 1.91/2.10 1.634 seconds of real time
% 1.91/2.10 1.483451 seconds of user run time
% 1.91/2.10 0.149993 seconds of system run time
% 1.91/2.10 [Run times include 0.157 seconds GC run time.]
% 1.91/2.10 0 calls to %EVAL
% 1.91/2.10 0 page faults and
% 1.91/2.10 125,005,472 bytes consed.
% 1.91/2.10 :PROOF-FOUND
% 1.91/2.10 ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-13T18:40:53
% 1.91/2.10 :PROOF-FOUND
% 1.91/2.10 *
%------------------------------------------------------------------------------