TSTP Solution File: HWV001-1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : HWV001-1 : TPTP v8.1.0. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n032.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Sat Jul 16 19:10:28 EDT 2022
% Result : Unsatisfiable 35.30s 35.55s
% Output : Refutation 35.30s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 26
% Syntax : Number of clauses : 149 ( 149 unt; 0 nHn; 108 RR)
% Number of literals : 149 ( 139 equ; 4 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 24 ( 24 usr; 19 con; 0-2 aty)
% Number of variables : 54 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(and_definition1,axiom,
and(X,n0) = n0,
file('/export/starexec/sandbox2/benchmark/Axioms/HWC002-0.ax',and_definition1) ).
cnf(and_definition2,axiom,
and(X,n1) = X,
file('/export/starexec/sandbox2/benchmark/Axioms/HWC002-0.ax',and_definition2) ).
cnf(not_definition1,axiom,
not(n0) = n1,
file('/export/starexec/sandbox2/benchmark/Axioms/HWC002-0.ax',not_definition1) ).
cnf(not_definition2,axiom,
not(n1) = n0,
file('/export/starexec/sandbox2/benchmark/Axioms/HWC002-0.ax',not_definition2) ).
cnf(not_canonicalization2,axiom,
not(or(X,Y)) = and(not(X),not(Y)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',not_canonicalization2) ).
cnf(and_or_canonicalization,axiom,
and(or(X,Y),Z) = or(and(X,Z),and(Y,Z)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',and_or_canonicalization) ).
cnf(and_simplification1,axiom,
and(X,X) = X,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',and_simplification1) ).
cnf(15,plain,
and(X,and(X,Y)) = and(X,Y),
inference('EMBED',[status(thm)],[and_simplification1]) ).
cnf(and_not_simplification1,axiom,
and(X,not(X)) = n0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',and_not_simplification1) ).
cnf(19,plain,
and(X,and(not(X),Y)) = and(n0,Y),
inference('EMBED',[status(thm)],[and_not_simplification1]) ).
cnf(not_simplification,axiom,
not(not(X)) = X,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',not_simplification) ).
cnf(constructor1,negated_conjecture,
a1 = and(b1,b3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',constructor1) ).
cnf(24,plain,
and(b1,and(b3,X)) = and(a1,X),
inference('EMBED',[status(thm)],[constructor1]) ).
cnf(constructor2,negated_conjecture,
a2 = and(b2,b3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',constructor2) ).
cnf(26,plain,
and(b2,and(b3,X)) = and(a2,X),
inference('EMBED',[status(thm)],[constructor2]) ).
cnf(constructor3,negated_conjecture,
b1 = not(d1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',constructor3) ).
cnf(constructor4,negated_conjecture,
b2 = not(d2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',constructor4) ).
cnf(constructor5,negated_conjecture,
b3 = or(c1,c2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',constructor5) ).
cnf(constructor6,negated_conjecture,
c1 = or(d1,d3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',constructor6) ).
cnf(constructor7,negated_conjecture,
c2 = or(d2,d3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',constructor7) ).
cnf(constructor8,negated_conjecture,
d3 = f3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',constructor8) ).
cnf(constructor9,negated_conjecture,
d1 = not(e1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',constructor9) ).
cnf(constructor10,negated_conjecture,
d2 = not(e2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',constructor10) ).
cnf(constructor11,negated_conjecture,
e1 = or(f1,f3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',constructor11) ).
cnf(39,plain,
e1 = or(f1,d3),
inference('REWRITE',[status(thm)],[constructor11,constructor8,theory(equality)]) ).
cnf(constructor12,negated_conjecture,
e2 = or(f2,f3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',constructor12) ).
cnf(42,plain,
e2 = or(f2,d3),
inference('REWRITE',[status(thm)],[constructor12,constructor8,theory(equality)]) ).
cnf(constructor13,negated_conjecture,
f1 = not(i1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',constructor13) ).
cnf(constructor14,negated_conjecture,
f2 = not(i2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',constructor14) ).
cnf(constructor15,negated_conjecture,
f3 = and(i1,i2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',constructor15) ).
cnf(47,plain,
d3 = and(i1,i2),
inference('REWRITE',[status(thm)],[constructor15,constructor8,theory(equality)]) ).
cnf(48,plain,
and(i1,and(i2,X)) = and(d3,X),
inference('EMBED',[status(thm)],[47]) ).
cnf(circuit_description,negated_conjecture,
circuit(input(i1,i2),output(a1,a2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',circuit_description) ).
cnf(prove_interchange,negated_conjecture,
~ circuit(input(i1,i2),output(i2,i1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_interchange) ).
cnf(51,plain,
and(a1,b1) = a1,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[15,24,theory(equality)]),constructor1,theory(equality)]) ).
cnf(52,plain,
and(a1,and(b1,X)) = and(a1,X),
inference('EMBED',[status(thm)],[51]) ).
cnf(53,plain,
and(a1,b3) = a1,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[15,24,theory(equality)]),constructor1,theory(equality)]) ).
cnf(54,plain,
and(a1,and(b3,X)) = and(a1,X),
inference('EMBED',[status(thm)],[53]) ).
cnf(55,plain,
and(a2,b2) = a2,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[15,26,theory(equality)]),constructor2,theory(equality)]) ).
cnf(56,plain,
and(a2,and(b2,X)) = and(a2,X),
inference('EMBED',[status(thm)],[55]) ).
cnf(57,plain,
and(a2,b3) = a2,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[15,26,theory(equality)]),constructor2,theory(equality)]) ).
cnf(59,plain,
and(a2,b1) = and(a1,b2),
inference('PARAMODULATE',[status(thm)],[24,26,theory(equality)]) ).
cnf(97,plain,
not(f2) = i2,
inference('PARAMODULATE',[status(thm)],[not_simplification,constructor14,theory(equality)]) ).
cnf(98,plain,
not(f1) = i1,
inference('PARAMODULATE',[status(thm)],[not_simplification,constructor13,theory(equality)]) ).
cnf(99,plain,
b2 = e2,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[not_simplification,constructor10,theory(equality)]),constructor4,theory(equality)]) ).
cnf(100,plain,
d2 = not(b2),
inference('REWRITE',[status(thm)],[constructor10,99,theory(equality)]) ).
cnf(101,plain,
b2 = or(f2,d3),
inference('REWRITE',[status(thm)],[42,99,theory(equality)]) ).
cnf(113,plain,
b1 = e1,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[not_simplification,constructor9,theory(equality)]),constructor3,theory(equality)]) ).
cnf(114,plain,
d1 = not(b1),
inference('REWRITE',[status(thm)],[constructor9,113,theory(equality)]) ).
cnf(115,plain,
b1 = or(f1,d3),
inference('REWRITE',[status(thm)],[39,113,theory(equality)]) ).
cnf(131,plain,
and(d2,b2) = n0,
inference('PARAMODULATE',[status(thm)],[and_not_simplification1,constructor4,theory(equality)]) ).
cnf(133,plain,
and(d1,b1) = n0,
inference('PARAMODULATE',[status(thm)],[and_not_simplification1,constructor3,theory(equality)]) ).
cnf(137,plain,
n0 = and(a1,not(b3)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[24,19,theory(equality)]),and_definition1,theory(equality)]) ).
cnf(239,plain,
d2 = and(i2,not(d3)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[not_canonicalization2,101,theory(equality)]),97,100,theory(equality)]) ).
cnf(240,plain,
and(i2,and(not(d3),X)) = and(d2,X),
inference('EMBED',[status(thm)],[239]) ).
cnf(241,plain,
d1 = and(i1,not(d3)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[not_canonicalization2,115,theory(equality)]),98,114,theory(equality)]) ).
cnf(242,plain,
and(i1,and(not(d3),X)) = and(d1,X),
inference('EMBED',[status(thm)],[241]) ).
cnf(243,plain,
not(c1) = and(b1,not(d3)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[not_canonicalization2,constructor6,theory(equality)]),constructor3,theory(equality)]) ).
cnf(244,plain,
and(b1,and(not(d3),X)) = and(not(c1),X),
inference('EMBED',[status(thm)],[243]) ).
cnf(245,plain,
not(c2) = and(b2,not(d3)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[not_canonicalization2,constructor7,theory(equality)]),constructor4,theory(equality)]) ).
cnf(246,plain,
and(b2,and(not(d3),X)) = and(not(c2),X),
inference('EMBED',[status(thm)],[245]) ).
cnf(247,plain,
not(b3) = and(not(c1),not(c2)),
inference('PARAMODULATE',[status(thm)],[not_canonicalization2,constructor5,theory(equality)]) ).
cnf(248,plain,
and(not(c1),and(not(c2),X)) = and(not(b3),X),
inference('EMBED',[status(thm)],[247]) ).
cnf(249,plain,
not(and(not(X),not(Y))) = or(X,Y),
inference('PARAMODULATE',[status(thm)],[not_simplification,not_canonicalization2,theory(equality)]) ).
cnf(251,plain,
and(not(and(not(X),not(Y))),Z) = not(and(not(and(X,Z)),not(and(Y,Z)))),
inference('REWRITE',[status(thm)],[and_or_canonicalization,249,theory(equality)]) ).
cnf(294,plain,
X = not(and(not(X),not(and(X,Y)))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[251,and_definition2,theory(equality)]),and_definition2,not_definition1,and_definition1,not_definition2,theory(equality)]) ).
cnf(295,plain,
and(not(and(not(X),not(Y))),X) = X,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[251,and_simplification1,theory(equality)]),294,theory(equality)]) ).
cnf(297,plain,
and(not(and(X,not(Y))),X) = and(X,Y),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[251,and_not_simplification1,theory(equality)]),and_definition2,not_definition1,not_simplification,theory(equality)]) ).
cnf(307,plain,
and(a2,b1) = and(a2,a1),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[26,52,theory(equality)]),51,57,59,theory(equality)]) ).
cnf(309,plain,
and(a2,a1) = and(a1,b2),
inference('REWRITE',[status(thm)],[59,307,theory(equality)]) ).
cnf(310,plain,
and(a1,and(b2,X)) = and(a2,and(a1,X)),
inference('EMBED',[status(thm)],[309]) ).
cnf(315,plain,
and(d2,i1) = n0,
inference('PARAMODULATE',[status(thm)],[48,240,theory(equality)]) ).
cnf(316,plain,
and(d2,and(i1,X)) = and(X,n0),
inference('EMBED',[status(thm)],[315]) ).
cnf(332,plain,
and(d1,d2) = n0,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[316,242,theory(equality)]),and_definition1,theory(equality)]) ).
cnf(340,plain,
and(not(c1),i2) = and(d2,b1),
inference('PARAMODULATE',[status(thm)],[240,244,theory(equality)]) ).
cnf(342,plain,
and(not(c1),i1) = n0,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[242,244,theory(equality)]),133,theory(equality)]) ).
cnf(344,plain,
and(not(c1),b3) = and(a1,not(d3)),
inference('PARAMODULATE',[status(thm)],[24,244,theory(equality)]) ).
cnf(346,plain,
and(not(c1),a1) = and(not(c1),b3),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[52,244,theory(equality)]),344,theory(equality)]) ).
cnf(348,plain,
and(not(c1),a1) = and(a1,not(d3)),
inference('REWRITE',[status(thm)],[344,346,theory(equality)]) ).
cnf(356,plain,
and(not(c1),and(a2,a1)) = and(a2,not(c1)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[26,244,theory(equality)]),243,309,346,theory(equality)]) ).
cnf(364,plain,
and(not(c2),i2) = n0,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[240,246,theory(equality)]),131,theory(equality)]) ).
cnf(366,plain,
and(not(c2),i1) = and(d1,b2),
inference('PARAMODULATE',[status(thm)],[242,246,theory(equality)]) ).
cnf(368,plain,
and(not(c2),b3) = and(a2,not(d3)),
inference('PARAMODULATE',[status(thm)],[26,246,theory(equality)]) ).
cnf(370,plain,
and(not(c2),a2) = and(not(c2),b3),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[56,246,theory(equality)]),368,theory(equality)]) ).
cnf(372,plain,
and(not(c2),a2) = and(a2,not(d3)),
inference('REWRITE',[status(thm)],[368,370,theory(equality)]) ).
cnf(382,plain,
and(not(c2),a1) = and(a1,and(not(c2),a2)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[310,246,theory(equality)]),372,theory(equality)]) ).
cnf(384,plain,
and(not(c2),a1) = and(a2,not(c1)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[54,246,theory(equality)]),356,309,348,382,370,theory(equality)]) ).
cnf(408,plain,
n0 = and(a2,not(c1)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[24,248,theory(equality)]),and_simplification1,384,137,constructor1,theory(equality)]) ).
cnf(409,plain,
and(a2,and(not(c1),X)) = and(X,n0),
inference('EMBED',[status(thm)],[408]) ).
cnf(410,plain,
and(not(c2),a1) = n0,
inference('REWRITE',[status(thm)],[384,408,theory(equality)]) ).
cnf(411,plain,
and(not(c2),and(a1,X)) = and(X,n0),
inference('EMBED',[status(thm)],[410]) ).
cnf(502,plain,
i1 = not(and(f1,not(d3))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[294,47,theory(equality)]),constructor13,theory(equality)]) ).
cnf(503,plain,
i2 = not(and(f2,not(d3))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[294,47,theory(equality)]),constructor14,theory(equality)]) ).
cnf(504,plain,
i2 = not(and(f2,b2)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[294,239,theory(equality)]),constructor4,constructor14,theory(equality)]) ).
cnf(505,plain,
i1 = not(and(f1,b1)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[294,241,theory(equality)]),constructor3,constructor13,theory(equality)]) ).
cnf(510,plain,
not(X) = and(not(X),not(and(X,Y))),
inference('PARAMODULATE',[status(thm)],[not_simplification,294,theory(equality)]) ).
cnf(512,plain,
f2 = and(f2,b2),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[not_simplification,504,theory(equality)]),constructor14,theory(equality)]) ).
cnf(513,plain,
and(f2,and(b2,X)) = and(f2,X),
inference('EMBED',[status(thm)],[512]) ).
cnf(520,plain,
and(f2,not(d3)) = and(not(c2),f2),
inference('PARAMODULATE',[status(thm)],[246,513,theory(equality)]) ).
cnf(522,plain,
i2 = not(and(not(c2),f2)),
inference('REWRITE',[status(thm)],[503,520,theory(equality)]) ).
cnf(539,plain,
f1 = and(f1,b1),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[not_simplification,505,theory(equality)]),constructor13,theory(equality)]) ).
cnf(540,plain,
and(f1,and(b1,X)) = and(f1,X),
inference('EMBED',[status(thm)],[539]) ).
cnf(547,plain,
and(f1,not(d3)) = and(not(c1),f1),
inference('PARAMODULATE',[status(thm)],[244,540,theory(equality)]) ).
cnf(549,plain,
i1 = not(and(not(c1),f1)),
inference('REWRITE',[status(thm)],[502,547,theory(equality)]) ).
cnf(588,plain,
f2 = and(not(c2),f2),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[not_simplification,522,theory(equality)]),constructor14,theory(equality)]) ).
cnf(589,plain,
and(not(c2),and(f2,X)) = and(f2,X),
inference('EMBED',[status(thm)],[588]) ).
cnf(594,plain,
and(f2,a1) = n0,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[411,589,theory(equality)]),and_definition1,theory(equality)]) ).
cnf(606,plain,
f1 = and(not(c1),f1),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[not_simplification,549,theory(equality)]),constructor13,theory(equality)]) ).
cnf(607,plain,
and(not(c1),and(f1,X)) = and(f1,X),
inference('EMBED',[status(thm)],[606]) ).
cnf(612,plain,
and(f1,a2) = n0,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[409,607,theory(equality)]),and_definition1,theory(equality)]) ).
cnf(642,plain,
and(b3,c1) = c1,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[295,247,theory(equality)]),not_simplification,theory(equality)]) ).
cnf(643,plain,
and(b3,and(c1,X)) = and(c1,X),
inference('EMBED',[status(thm)],[642]) ).
cnf(644,plain,
and(b3,c2) = c2,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[295,247,theory(equality)]),not_simplification,theory(equality)]) ).
cnf(645,plain,
and(b3,and(c2,X)) = and(c2,X),
inference('EMBED',[status(thm)],[644]) ).
cnf(688,plain,
and(c1,b2) = and(a2,c1),
inference('PARAMODULATE',[status(thm)],[26,643,theory(equality)]) ).
cnf(689,plain,
and(c1,and(b2,X)) = and(a2,and(c1,X)),
inference('EMBED',[status(thm)],[688]) ).
cnf(712,plain,
and(c2,b1) = and(a1,c2),
inference('PARAMODULATE',[status(thm)],[24,645,theory(equality)]) ).
cnf(713,plain,
and(c2,and(b1,X)) = and(a1,and(c2,X)),
inference('EMBED',[status(thm)],[712]) ).
cnf(788,plain,
d2 = and(d2,c2),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[510,245,theory(equality)]),not_simplification,100,theory(equality)]) ).
cnf(789,plain,
and(d2,and(c2,X)) = and(d2,X),
inference('EMBED',[status(thm)],[788]) ).
cnf(794,plain,
d1 = and(d1,c1),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[510,243,theory(equality)]),not_simplification,114,theory(equality)]) ).
cnf(795,plain,
and(d1,and(c1,X)) = and(d1,X),
inference('EMBED',[status(thm)],[794]) ).
cnf(852,plain,
c2 = and(c2,i2),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[510,588,theory(equality)]),97,not_simplification,theory(equality)]) ).
cnf(856,plain,
c1 = and(c1,i1),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[510,606,theory(equality)]),98,not_simplification,theory(equality)]) ).
cnf(864,plain,
c1 = and(c1,not(and(d2,b1))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[510,340,theory(equality)]),not_simplification,theory(equality)]) ).
cnf(868,plain,
c2 = and(c2,not(and(d1,b2))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[510,366,theory(equality)]),not_simplification,theory(equality)]) ).
cnf(926,plain,
and(d2,b1) = and(a1,d2),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[713,789,theory(equality)]),788,theory(equality)]) ).
cnf(934,plain,
c1 = and(c1,not(and(a1,d2))),
inference('REWRITE',[status(thm)],[864,926,theory(equality)]) ).
cnf(942,plain,
and(d1,b2) = and(a2,d1),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[689,795,theory(equality)]),794,theory(equality)]) ).
cnf(950,plain,
c2 = and(c2,not(and(a2,d1))),
inference('REWRITE',[status(thm)],[868,942,theory(equality)]) ).
cnf(1946,plain,
i2 = c2,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[297,364,theory(equality)]),852,and_definition2,not_definition1,theory(equality)]) ).
cnf(1988,plain,
circuit(input(i1,c2),output(a1,a2)),
inference('REWRITE',[status(thm)],[circuit_description,1946,theory(equality)]) ).
cnf(1989,plain,
~ circuit(input(i1,c2),output(c2,i1)),
inference('REWRITE',[status(thm)],[prove_interchange,1946,theory(equality)]) ).
cnf(1990,plain,
not(f2) = c2,
inference('REWRITE',[status(thm)],[97,1946,theory(equality)]) ).
cnf(2079,plain,
i1 = c1,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[297,342,theory(equality)]),856,and_definition2,not_definition1,theory(equality)]) ).
cnf(2111,plain,
not(f1) = c1,
inference('REWRITE',[status(thm)],[98,2079,theory(equality)]) ).
cnf(2200,plain,
circuit(input(c1,c2),output(a1,a2)),
inference('REWRITE',[status(thm)],[1988,2079,theory(equality)]) ).
cnf(2201,plain,
~ circuit(input(c1,c2),output(c2,c1)),
inference('REWRITE',[status(thm)],[1989,2079,theory(equality)]) ).
cnf(2214,plain,
and(not(and(X,Y)),X) = and(X,not(Y)),
inference('PARAMODULATE',[status(thm)],[297,not_simplification,theory(equality)]) ).
cnf(2336,plain,
d1 = and(a2,d1),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[2214,332,theory(equality)]),942,constructor4,and_definition2,not_definition1,theory(equality)]) ).
cnf(2366,plain,
c2 = and(a1,c2),
inference('REWRITE',[status(thm)],[950,712,constructor3,2336,theory(equality)]) ).
cnf(2387,plain,
d2 = and(a1,d2),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[2214,332,theory(equality)]),926,constructor3,and_definition2,not_definition1,theory(equality)]) ).
cnf(2411,plain,
c1 = and(a2,c1),
inference('REWRITE',[status(thm)],[934,688,constructor4,2387,theory(equality)]) ).
cnf(2438,plain,
a1 = c2,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[2214,594,theory(equality)]),2366,1990,and_definition2,not_definition1,theory(equality)]) ).
cnf(2520,plain,
circuit(input(c1,a1),output(a1,a2)),
inference('REWRITE',[status(thm)],[2200,2438,theory(equality)]) ).
cnf(2521,plain,
~ circuit(input(c1,a1),output(a1,c1)),
inference('REWRITE',[status(thm)],[2201,2438,theory(equality)]) ).
cnf(2528,plain,
a2 = c1,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[2214,612,theory(equality)]),2411,2111,and_definition2,not_definition1,theory(equality)]) ).
cnf(2580,plain,
circuit(input(a2,a1),output(a1,a2)),
inference('REWRITE',[status(thm)],[2520,2528,theory(equality)]) ).
cnf(2581,plain,
$false,
inference('REWRITE',[status(thm)],[2521,2580,2528,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : HWV001-1 : TPTP v8.1.0. Released v1.1.0.
% 0.03/0.11 % Command : run-snark %s %d
% 0.11/0.30 % Computer : n032.cluster.edu
% 0.11/0.30 % Model : x86_64 x86_64
% 0.11/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.30 % Memory : 8042.1875MB
% 0.11/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.30 % CPULimit : 300
% 0.11/0.30 % WCLimit : 600
% 0.11/0.30 % DateTime : Thu Jun 16 23:13:15 EDT 2022
% 0.11/0.31 % CPUTime :
% 0.15/0.41 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.15/0.41 *
% 0.15/0.42 *
% 0.15/0.42 #<PACKAGE "SNARK-USER">
% 0.15/0.42 *
% 0.15/0.42 SNARK-TPTP-OPTIONS
% 0.15/0.42 *
% 0.15/0.42 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.15/0.42 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.15/0.42 (USE-FACTORING :POS)
% 0.15/0.42 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.15/0.42 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.15/0.42 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.15/0.42 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.15/0.42 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.15/0.42 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.15/0.42 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.15/0.42 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.15/0.42 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.15/0.42 (DECLARE-TPTP-SYMBOLS2))
% 0.15/0.42 *
% 0.15/0.42 "."
% 0.15/0.42 *
% 0.15/0.42 ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-16T23:13:15
% 0.15/0.42 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n032.cluster.edu at 2022-06-16T23:13:15
% 0.15/0.43
% 0.15/0.43 ; Recognized right identity assertion (= (|and| ?X |n1|) ?X).
% 0.15/0.43 ; Recognized right identity assertion (= (|or| ?X |n0|) ?X).
% 0.15/0.43 ; Recognized commutativity assertion (= (|and| ?X ?Y) (|and| ?Y ?X)).
% 0.15/0.43 ; Recognized commutativity assertion (= (|or| ?X ?Y) (|or| ?Y ?X)).
% 0.15/0.43 ; Recognized associativity assertion (= (|and| ?X (|and| ?Y ?Z)) (|and| (|and| ?X ?Y) ?Z)).
% 0.15/0.43 ; Recognized associativity assertion (= (|or| ?X (|or| ?Y ?Z)) (|or| (|or| ?X ?Y) ?Z)).
% 0.15/0.43 ; Recognized possible right inverse assertion (= (|and| ?X (|not| ?X)) |n0|).
% 0.15/0.43 ; Recognized possible right inverse assertion (= (|or| ?X (|not| ?X)) |n1|).
% 0.15/0.43 ; Declaring and to be commutative.
% 0.15/0.43 ; Declaring and to be associative-commutative.
% 0.15/0.43 ; Declaring or to be commutative.
% 35.30/35.55 ; Declaring or to be associative-commutative.
% 35.30/35.55
% 35.30/35.55 #||
% 35.30/35.55 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 35.30/35.55 % SZS output start Refutation
% See solution above
% 35.30/35.56 ||#
% 35.30/35.56
% 35.30/35.56 ; Summary of computation:
% 35.30/35.56 ; 104267 formulas have been input or derived (from 582 formulas).
% 35.30/35.56 ; 2581 ( 2%) were retained. Of these,
% 35.30/35.56 ; 2078 (81%) were simplified or subsumed later,
% 35.30/35.56 ; 503 (19%) are still being kept.
% 35.30/35.56 ;
% 35.30/35.56 ; Run time in seconds excluding printing time:
% 35.30/35.56 ; 0.005 0% Read assertion file (1 call)
% 35.30/35.56 ; 0.001 0% Assert (47 calls)
% 35.30/35.56 ; 0.468 1% Process new row (97,553 calls)
% 35.30/35.56 ; 0.037 0% Resolution (1,162 calls)
% 35.30/35.56 ; 2.088 6% Paramodulation (581 calls)
% 35.30/35.56 ; 0.010 0% Embedding (1,237 calls)
% 35.30/35.56 ; 31.178 89% Forward simplification (93,147 calls)
% 35.30/35.56 ; 0.165 0% Backward simplification (1,345 calls)
% 35.30/35.56 ; 0.352 1% Ordering (210,714 calls)
% 35.30/35.56 ; 0.475 1% Ordering ac (129,466 calls)
% 35.30/35.56 ; 0.000 0% Sortal reasoning (32 calls)
% 35.30/35.56 ; 0.000 0% Purity testing (1 call)
% 35.30/35.56 ; 0.351 1% Other
% 35.30/35.56 ; 35.130 Total
% 35.30/35.56 ; 35.141 Real time
% 35.30/35.56 ;
% 35.30/35.56 ; Term-hash-array has 6,138 terms in all.
% 35.30/35.56 ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 35.30/35.56 ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 35.30/35.56 ; Path-index has 1,339 entries (3,510 at peak, 6,514 added, 5,175 deleted).
% 35.30/35.56 ; Path-index has 309 nodes (402 at peak, 633 added, 324 deleted).
% 35.30/35.56 ; Trie-index has 1,339 entries (3,510 at peak, 6,514 added, 5,175 deleted).
% 35.30/35.56 ; Trie-index has 131 nodes (156 at peak, 322 added, 191 deleted).
% 35.30/35.56 ; Retrieved 102,421,003 generalization terms in 623,318 calls.
% 35.30/35.56 ; Retrieved 5,309 instance terms in 1,364 calls.
% 35.30/35.56 ; Retrieved 357,472 unifiable terms in 3,259 calls.
% 35.30/35.56 ;
% 35.30/35.56 ; The agenda of rows to process has 2200 entries:
% 35.30/35.56 ; 30 with value 17 167 with value 26 43 with value 35
% 35.30/35.56 ; 68 with value 18 119 with value 27 31 with value 36
% 35.30/35.56 ; 58 with value 19 183 with value 28 35 with value 37
% 35.30/35.56 ; 130 with value 20 134 with value 29 13 with value 38
% 35.30/35.56 ; 103 with value 21 126 with value 30 18 with value 39
% 35.30/35.56 ; 206 with value 22 100 with value 31 10 with value 40
% 35.30/35.56 ; 136 with value 23 96 with value 32 2 with value 41
% 35.30/35.56 ; 164 with value 24 69 with value 33 2 with value 42
% 35.30/35.56 ; 108 with value 25 48 with value 34 1 with value 46
% 35.30/35.56 ; The agenda of input rows to give has 3 entries:
% 35.30/35.56 ; 2 with value 6 1 with value 9
% 35.30/35.56 ; The agenda of rows to give has 333 entries:
% 35.30/35.56 ; 4 with value (4 7) 6 with value (4 19) 18 with value (4 27)
% 35.30/35.56 ; 6 with value (4 9) 8 with value (4 20) 4 with value (4 28)
% 35.30/35.56 ; 4 with value (4 10) 60 with value (4 21) 3 with value (4 29)
% 35.30/35.56 ; 16 with value (4 11) 28 with value (4 22) 28 with value (4 30)
% 35.30/35.56 ; 6 with value (4 12) 16 with value (4 23) 18 with value (4 31)
% 35.30/35.56 ; 8 with value (4 16) 28 with value (4 24) 18 with value (4 32)
% 35.30/35.56 ; 5 with value (4 17) 16 with value (4 25) 1 with value (4 33)
% 35.30/35.56 ; 10 with value (4 18) 22 with value (4 26)
% 35.30/35.56 Evaluation took:
% 35.30/35.56 35.142 seconds of real time
% 35.30/35.56 34.391476 seconds of user run time
% 35.30/35.56 0.747961 seconds of system run time
% 35.30/35.56 [Run times include 0.273 seconds GC run time.]
% 35.30/35.56 0 calls to %EVAL
% 35.30/35.56 0 page faults and
% 35.30/35.56 791,407,968 bytes consed.
% 35.30/35.56 :PROOF-FOUND
% 35.30/35.56 ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-16T23:13:50
% 35.30/35.56 :PROOF-FOUND
% 35.30/35.56 *
%------------------------------------------------------------------------------