TSTP Solution File: HWC002-1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : HWC002-1 : TPTP v8.1.0. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n021.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Sat Jul 16 13:07:35 EDT 2022
% Result : Unsatisfiable 86.56s 86.78s
% Output : Refutation 86.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 20
% Syntax : Number of clauses : 100 ( 99 unt; 0 nHn; 42 RR)
% Number of literals : 101 ( 92 equ; 6 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 3 con; 0-4 aty)
% Number of variables : 218 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(and_definition1,axiom,
and(n0,n0) = n0,
file('/export/starexec/sandbox2/benchmark/Axioms/HWC001-0.ax',and_definition1) ).
cnf(and_definition2,axiom,
and(n0,n1) = n0,
file('/export/starexec/sandbox2/benchmark/Axioms/HWC001-0.ax',and_definition2) ).
cnf(and_definition4,axiom,
and(n1,n1) = n1,
file('/export/starexec/sandbox2/benchmark/Axioms/HWC001-0.ax',and_definition4) ).
cnf(or_definition2,axiom,
or(n0,n1) = n1,
file('/export/starexec/sandbox2/benchmark/Axioms/HWC001-0.ax',or_definition2) ).
cnf(or_definition3,axiom,
or(n1,n0) = n1,
file('/export/starexec/sandbox2/benchmark/Axioms/HWC001-0.ax',or_definition3) ).
cnf(or_definition4,axiom,
or(n1,n1) = n1,
file('/export/starexec/sandbox2/benchmark/Axioms/HWC001-0.ax',or_definition4) ).
cnf(not_definition1,axiom,
not(n0) = n1,
file('/export/starexec/sandbox2/benchmark/Axioms/HWC001-0.ax',not_definition1) ).
cnf(not_definition2,axiom,
not(n1) = n0,
file('/export/starexec/sandbox2/benchmark/Axioms/HWC001-0.ax',not_definition2) ).
cnf(invert_adjacent2,axiom,
( ~ circuit(top(connect(X,Y)),nil,bottom(connect(Z,U)))
| circuit(top(connect(not(X),Y)),nil,bottom(connect(not(Z),U))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',invert_adjacent2) ).
cnf(subsume_symmetric,axiom,
circuit(top(X),Y,bottom(X)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',subsume_symmetric) ).
cnf(and_table_definition,axiom,
and(table(X,Y,Z,U),table(V,W,X1,Y1)) = table(and(X,V),and(Y,W),and(Z,X1),and(U,Y1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',and_table_definition) ).
cnf(and_definition5,axiom,
and(nil,X) = X,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',and_definition5) ).
cnf(or_table_definition,axiom,
or(table(X,Y,Z,U),table(V,W,X1,Y1)) = table(or(X,V),or(Y,W),or(Z,X1),or(U,Y1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',or_table_definition) ).
cnf(or_definition5,axiom,
or(nil,X) = X,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',or_definition5) ).
cnf(not_table_definition,axiom,
not(table(X,Y,Z,U)) = table(not(X),not(Y),not(Z),not(U)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',not_table_definition) ).
cnf(not_definition3,axiom,
not(nil) = nil,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',not_definition3) ).
cnf(empty_table,axiom,
table(n0,n0,n0,n0) = nil,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',empty_table) ).
cnf(full_table,axiom,
table(n1,n1,n1,n1) = nil,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',full_table) ).
cnf(connect_definition1,axiom,
connect(nil,X) = X,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',connect_definition1) ).
cnf(prove_output_configuration,negated_conjecture,
~ circuit(top(connect(table(n0,n1,n0,n1),nil)),nil,bottom(connect(table(n0,n0,n1,n1),nil))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_output_configuration) ).
cnf(39,plain,
not(table(nil,X,Y,Z)) = table(nil,not(X),not(Y),not(Z)),
inference('PARAMODULATE',[status(thm)],[not_table_definition,not_definition3,theory(equality)]) ).
cnf(40,plain,
not(table(n1,X,Y,Z)) = table(n0,not(X),not(Y),not(Z)),
inference('PARAMODULATE',[status(thm)],[not_table_definition,not_definition2,theory(equality)]) ).
cnf(41,plain,
not(table(n0,X,Y,Z)) = table(n1,not(X),not(Y),not(Z)),
inference('PARAMODULATE',[status(thm)],[not_table_definition,not_definition1,theory(equality)]) ).
cnf(49,plain,
not(table(X,Y,Z,n1)) = table(not(X),not(Y),not(Z),n0),
inference('PARAMODULATE',[status(thm)],[not_table_definition,not_definition2,theory(equality)]) ).
cnf(50,plain,
not(table(X,Y,Z,n0)) = table(not(X),not(Y),not(Z),n1),
inference('PARAMODULATE',[status(thm)],[not_table_definition,not_definition1,theory(equality)]) ).
cnf(58,plain,
and(table(n0,X,Y,Z),table(n1,U,V,W)) = table(n0,and(X,U),and(Y,V),and(Z,W)),
inference('PARAMODULATE',[status(thm)],[and_table_definition,and_definition2,theory(equality)]) ).
cnf(60,plain,
and(table(n0,X,Y,Z),table(n0,U,V,W)) = and(table(n0,X,Y,Z),table(n1,U,V,W)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[and_table_definition,and_definition1,theory(equality)]),58,theory(equality)]) ).
cnf(61,plain,
and(table(n0,X,Y,Z),table(n0,U,V,W)) = table(n0,and(X,U),and(Y,V),and(Z,W)),
inference('REWRITE',[status(thm)],[58,60,theory(equality)]) ).
cnf(63,plain,
and(table(nil,X,Y,Z),table(U,V,W,X1)) = table(U,and(X,V),and(Y,W),and(Z,X1)),
inference('PARAMODULATE',[status(thm)],[and_table_definition,and_definition5,theory(equality)]) ).
cnf(64,plain,
and(table(n0,X,Y,Z),table(n0,U,V,W)) = and(table(nil,X,Y,Z),table(n0,U,V,W)),
inference('REWRITE',[status(thm)],[61,63,theory(equality)]) ).
cnf(66,plain,
and(table(X,Y,Z,U),table(V,W,X1,Y1)) = and(table(nil,Y,Z,U),table(and(X,V),W,X1,Y1)),
inference('REWRITE',[status(thm)],[and_table_definition,63,theory(equality)]) ).
cnf(67,plain,
or(table(n0,X,Y,Z),table(n1,U,V,W)) = table(n1,or(X,U),or(Y,V),or(Z,W)),
inference('PARAMODULATE',[status(thm)],[or_table_definition,or_definition2,theory(equality)]) ).
cnf(71,plain,
or(table(nil,X,Y,Z),table(U,V,W,X1)) = table(U,or(X,V),or(Y,W),or(Z,X1)),
inference('PARAMODULATE',[status(thm)],[or_table_definition,or_definition5,theory(equality)]) ).
cnf(73,plain,
or(table(n0,X,Y,Z),table(n1,U,V,W)) = or(table(nil,X,Y,Z),table(n1,U,V,W)),
inference('REWRITE',[status(thm)],[67,71,theory(equality)]) ).
cnf(74,plain,
or(table(X,Y,Z,U),table(V,W,X1,Y1)) = or(table(nil,Y,Z,U),table(or(X,V),W,X1,Y1)),
inference('REWRITE',[status(thm)],[or_table_definition,71,theory(equality)]) ).
cnf(85,plain,
and(table(X,Y,Z,U),nil) = and(table(nil,Y,Z,U),table(and(X,n1),n1,n1,n1)),
inference('PARAMODULATE',[status(thm)],[66,full_table,theory(equality)]) ).
cnf(86,plain,
and(table(X,Y,Z,U),nil) = and(table(nil,Y,Z,U),table(and(X,n0),n0,n0,n0)),
inference('PARAMODULATE',[status(thm)],[66,empty_table,theory(equality)]) ).
cnf(91,plain,
or(table(X,Y,Z,U),nil) = or(table(nil,Y,Z,U),table(or(X,n1),n1,n1,n1)),
inference('PARAMODULATE',[status(thm)],[74,full_table,theory(equality)]) ).
cnf(92,plain,
or(table(X,Y,Z,U),nil) = or(table(nil,Y,Z,U),table(or(X,n0),n0,n0,n0)),
inference('PARAMODULATE',[status(thm)],[74,empty_table,theory(equality)]) ).
cnf(137,plain,
not(table(nil,nil,X,Y)) = table(nil,nil,not(X),not(Y)),
inference('PARAMODULATE',[status(thm)],[39,not_definition3,theory(equality)]) ).
cnf(151,plain,
not(table(n1,n1,X,Y)) = table(n0,n0,not(X),not(Y)),
inference('PARAMODULATE',[status(thm)],[40,not_definition2,theory(equality)]) ).
cnf(152,plain,
not(table(n1,n0,X,Y)) = table(n0,n1,not(X),not(Y)),
inference('PARAMODULATE',[status(thm)],[40,not_definition1,theory(equality)]) ).
cnf(164,plain,
not(table(n0,n1,X,Y)) = table(n1,n0,not(X),not(Y)),
inference('PARAMODULATE',[status(thm)],[41,not_definition2,theory(equality)]) ).
cnf(165,plain,
not(table(n0,n0,X,Y)) = table(n1,n1,not(X),not(Y)),
inference('PARAMODULATE',[status(thm)],[41,not_definition1,theory(equality)]) ).
cnf(221,plain,
not(table(nil,nil,nil,X)) = table(nil,nil,nil,not(X)),
inference('PARAMODULATE',[status(thm)],[137,not_definition3,theory(equality)]) ).
cnf(293,plain,
not(table(n1,n1,n1,X)) = table(n0,n0,n0,not(X)),
inference('PARAMODULATE',[status(thm)],[151,not_definition2,theory(equality)]) ).
cnf(301,plain,
not(table(n1,n0,n1,X)) = table(n0,n1,n0,not(X)),
inference('PARAMODULATE',[status(thm)],[152,not_definition2,theory(equality)]) ).
cnf(302,plain,
not(table(n1,n0,n0,X)) = table(n0,n1,n1,not(X)),
inference('PARAMODULATE',[status(thm)],[152,not_definition1,theory(equality)]) ).
cnf(339,plain,
not(table(n0,n1,n0,X)) = table(n1,n0,n1,not(X)),
inference('PARAMODULATE',[status(thm)],[164,not_definition1,theory(equality)]) ).
cnf(347,plain,
not(table(n0,n0,n0,X)) = table(n1,n1,n1,not(X)),
inference('PARAMODULATE',[status(thm)],[165,not_definition1,theory(equality)]) ).
cnf(457,plain,
not(table(nil,nil,nil,n0)) = table(nil,nil,nil,n1),
inference('PARAMODULATE',[status(thm)],[221,not_definition1,theory(equality)]) ).
cnf(626,plain,
not(table(n1,n1,n1,n0)) = table(n0,n0,n0,n1),
inference('PARAMODULATE',[status(thm)],[293,not_definition1,theory(equality)]) ).
cnf(646,plain,
not(table(n1,n0,n1,n1)) = table(n0,n1,n0,n0),
inference('PARAMODULATE',[status(thm)],[301,not_definition2,theory(equality)]) ).
cnf(647,plain,
not(table(n1,n0,n1,n0)) = table(n0,n1,n0,n1),
inference('PARAMODULATE',[status(thm)],[301,not_definition1,theory(equality)]) ).
cnf(651,plain,
not(table(n1,n0,n0,n1)) = table(n0,n1,n1,n0),
inference('PARAMODULATE',[status(thm)],[302,not_definition2,theory(equality)]) ).
cnf(652,plain,
not(table(n1,n0,n0,n0)) = table(n0,n1,n1,n1),
inference('PARAMODULATE',[status(thm)],[302,not_definition1,theory(equality)]) ).
cnf(721,plain,
not(table(n0,n1,n0,n0)) = table(n1,n0,n1,n1),
inference('PARAMODULATE',[status(thm)],[339,not_definition1,theory(equality)]) ).
cnf(722,plain,
not(not(table(n0,n1,n0,n0))) = table(n0,n1,n0,n0),
inference('REWRITE',[status(thm)],[646,721,theory(equality)]) ).
cnf(749,plain,
not(table(n0,n0,n0,n1)) = table(n1,n1,n1,n0),
inference('PARAMODULATE',[status(thm)],[347,not_definition2,theory(equality)]) ).
cnf(750,plain,
not(not(table(n0,n0,n0,n1))) = table(n0,n0,n0,n1),
inference('REWRITE',[status(thm)],[626,749,theory(equality)]) ).
cnf(24220,plain,
and(table(n1,X,Y,Z),nil) = and(table(nil,X,Y,Z),nil),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[85,and_definition4,theory(equality)]),full_table,theory(equality)]) ).
cnf(24583,plain,
and(table(n0,X,Y,Z),nil) = and(table(n1,X,Y,Z),nil),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[86,and_definition1,theory(equality)]),24220,empty_table,theory(equality)]) ).
cnf(24610,plain,
and(table(n0,X,Y,Z),nil) = and(table(nil,X,Y,Z),nil),
inference('REWRITE',[status(thm)],[24220,24583,theory(equality)]) ).
cnf(25591,plain,
or(table(n0,X,Y,Z),nil) = or(table(nil,X,Y,Z),nil),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[91,or_definition2,theory(equality)]),full_table,theory(equality)]) ).
cnf(25659,plain,
or(table(n1,X,Y,Z),nil) = or(table(n0,X,Y,Z),nil),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[91,or_definition4,theory(equality)]),25591,full_table,theory(equality)]) ).
cnf(25871,plain,
or(not(table(n1,X,Y,Z)),nil) = or(not(table(nil,X,Y,Z)),nil),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[91,40,theory(equality)]),full_table,or_definition2,39,theory(equality)]) ).
cnf(25872,plain,
or(not(table(n0,X,Y,Z)),nil) = or(not(table(n1,X,Y,Z)),nil),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[91,41,theory(equality)]),25871,full_table,or_definition4,39,theory(equality)]) ).
cnf(25873,plain,
or(not(table(n0,X,Y,Z)),nil) = or(not(table(nil,X,Y,Z)),nil),
inference('REWRITE',[status(thm)],[25871,25872,theory(equality)]) ).
cnf(26740,plain,
or(table(n0,X,Y,Z),nil) = or(table(n0,X,Y,Z),table(n1,n0,n0,n0)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[92,or_definition3,theory(equality)]),73,25659,theory(equality)]) ).
cnf(26866,plain,
nil = table(n1,n0,n0,n0),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[26740,empty_table,theory(equality)]),or_definition5,theory(equality)]) ).
cnf(26867,plain,
nil = table(n0,n1,n1,n1),
inference('REWRITE',[status(thm)],[652,not_definition3,26866,theory(equality)]) ).
cnf(39125,plain,
table(n0,X,Y,Z) = table(n1,X,Y,Z),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[60,empty_table,theory(equality)]),and_definition5,theory(equality)]) ).
cnf(39977,plain,
not(table(n0,n0,n0,n1)) = table(n0,n1,n1,n0),
inference('REWRITE',[status(thm)],[651,39125,theory(equality)]) ).
cnf(40031,plain,
not(table(n0,n0,n1,n0)) = table(n0,n1,n0,n1),
inference('REWRITE',[status(thm)],[647,39125,theory(equality)]) ).
cnf(40033,plain,
~ circuit(top(connect(not(table(n0,n0,n1,n0)),nil)),nil,bottom(connect(table(n0,n0,n1,n1),nil))),
inference('REWRITE',[status(thm)],[prove_output_configuration,40031,theory(equality)]) ).
cnf(40111,plain,
not(table(n0,n1,n0,n0)) = table(n0,n0,n1,n1),
inference('REWRITE',[status(thm)],[721,39125,theory(equality)]) ).
cnf(40131,plain,
~ circuit(top(connect(not(table(n0,n0,n1,n0)),nil)),nil,bottom(connect(not(table(n0,n1,n0,n0)),nil))),
inference('REWRITE',[status(thm)],[40033,40111,theory(equality)]) ).
cnf(42158,plain,
~ circuit(top(connect(table(n0,n0,n1,n0),nil)),nil,bottom(connect(table(n0,n1,n0,n0),nil))),
inference('UR-RESOLVE',[status(thm)],[invert_adjacent2,40131]) ).
cnf(42846,plain,
and(table(nil,n0,X,Y),table(Z,n1,U,V)) = table(Z,n0,and(X,U),and(Y,V)),
inference('PARAMODULATE',[status(thm)],[63,and_definition2,theory(equality)]) ).
cnf(42848,plain,
and(table(nil,n0,X,Y),table(Z,n0,U,V)) = and(table(nil,n0,X,Y),table(Z,n1,U,V)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[63,and_definition1,theory(equality)]),42846,theory(equality)]) ).
cnf(42895,plain,
and(table(nil,nil,X,Y),table(Z,U,V,W)) = table(Z,U,and(X,V),and(Y,W)),
inference('PARAMODULATE',[status(thm)],[63,and_definition5,theory(equality)]) ).
cnf(42926,plain,
and(table(nil,nil,nil,X),table(Y,Z,U,V)) = table(Y,Z,U,and(X,V)),
inference('PARAMODULATE',[status(thm)],[42895,and_definition5,theory(equality)]) ).
cnf(42930,plain,
and(table(nil,nil,nil,n0),table(X,Y,Z,n1)) = table(X,Y,Z,n0),
inference('PARAMODULATE',[status(thm)],[42926,and_definition2,theory(equality)]) ).
cnf(42932,plain,
and(table(nil,nil,nil,n0),table(X,Y,Z,n0)) = table(X,Y,Z,n0),
inference('PARAMODULATE',[status(thm)],[42926,and_definition1,theory(equality)]) ).
cnf(42954,plain,
and(table(n0,nil,nil,n0),nil) = not(table(n0,n0,n0,n1)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[42930,26867,theory(equality)]),39977,24610,theory(equality)]) ).
cnf(44632,plain,
not(table(n0,n0,n0,n1)) = nil,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[42932,empty_table,theory(equality)]),42954,24610,theory(equality)]) ).
cnf(44633,plain,
nil = table(n0,n0,n0,n1),
inference('REWRITE',[status(thm)],[750,not_definition3,44632,theory(equality)]) ).
cnf(44890,plain,
nil = table(n0,n1,n1,n0),
inference('REWRITE',[status(thm)],[39977,44632,theory(equality)]) ).
cnf(46540,plain,
or(table(nil,nil,X,Y),table(Z,U,V,W)) = table(Z,U,or(X,V),or(Y,W)),
inference('PARAMODULATE',[status(thm)],[71,or_definition5,theory(equality)]) ).
cnf(46565,plain,
or(table(nil,nil,nil,X),table(Y,Z,U,V)) = table(Y,Z,U,or(X,V)),
inference('PARAMODULATE',[status(thm)],[46540,or_definition5,theory(equality)]) ).
cnf(46572,plain,
or(not(table(nil,nil,nil,n0)),table(X,Y,Z,n0)) = table(X,Y,Z,n1),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[46565,or_definition3,theory(equality)]),457,theory(equality)]) ).
cnf(47836,plain,
not(table(X,Y,Z,n0)) = or(not(table(nil,nil,nil,n0)),not(table(X,Y,Z,n1))),
inference('REWRITE',[status(thm)],[50,49,46572,theory(equality)]) ).
cnf(48484,plain,
nil = or(not(table(n0,nil,nil,n0)),nil),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[47836,44633,theory(equality)]),25873,not_definition3,empty_table,theory(equality)]) ).
cnf(111300,plain,
and(table(n0,n0,X,Y),table(n0,n0,n1,n0)) = and(table(n0,n0,X,Y),nil),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[42848,44890,theory(equality)]),24610,64,theory(equality)]) ).
cnf(112092,plain,
table(n0,n0,n1,n0) = nil,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[111300,empty_table,theory(equality)]),and_definition5,theory(equality)]) ).
cnf(112103,plain,
nil = table(n0,n1,n0,n1),
inference('REWRITE',[status(thm)],[40031,not_definition3,112092,theory(equality)]) ).
cnf(112109,plain,
~ circuit(top(nil),nil,bottom(connect(table(n0,n1,n0,n0),nil))),
inference('REWRITE',[status(thm)],[42158,connect_definition1,112092,theory(equality)]) ).
cnf(112177,plain,
not(table(n0,n1,n0,n0)) = nil,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[47836,112103,theory(equality)]),48484,25873,not_definition3,theory(equality)]) ).
cnf(112178,plain,
nil = table(n0,n1,n0,n0),
inference('REWRITE',[status(thm)],[722,not_definition3,112177,theory(equality)]) ).
cnf(112194,plain,
$false,
inference('REWRITE',[status(thm)],[112109,subsume_symmetric,connect_definition1,112178,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : HWC002-1 : TPTP v8.1.0. Released v1.1.0.
% 0.06/0.12 % Command : run-snark %s %d
% 0.12/0.33 % Computer : n021.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Thu Jun 9 12:45:08 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.45 *
% 0.18/0.45 *
% 0.18/0.46 #<PACKAGE "SNARK-USER">
% 0.18/0.46 *
% 0.18/0.46 SNARK-TPTP-OPTIONS
% 0.18/0.46 *
% 0.18/0.46 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.18/0.46 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.18/0.46 (USE-FACTORING :POS)
% 0.18/0.46 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.18/0.46 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.18/0.46 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.18/0.46 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.18/0.46 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.18/0.46 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.18/0.46 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.18/0.46 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.18/0.46 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.18/0.46 (DECLARE-TPTP-SYMBOLS2))
% 0.18/0.46 *
% 0.18/0.46 "."
% 0.18/0.46 *
% 0.18/0.46 ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-09T12:45:08
% 0.18/0.46 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n021.cluster.edu at 2022-06-09T12:45:08
% 0.18/0.48
% 0.18/0.48 ; Recognized left identity assertion (= (|and| |nil| ?X) ?X).
% 0.18/0.48 ; Recognized left identity assertion (= (|or| |nil| ?X) ?X).
% 86.56/86.78 ; Recognized left identity assertion (= (|connect| |nil| ?X) ?X).
% 86.56/86.78
% 86.56/86.78 #||
% 86.56/86.78 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 86.56/86.78 % SZS output start Refutation
% See solution above
% 86.56/86.79 ||#
% 86.56/86.79
% 86.56/86.79 ; Summary of computation:
% 86.56/86.79 ; 271363 formulas have been input or derived (from 4791 formulas).
% 86.56/86.79 ; 112194 (41%) were retained. Of these,
% 86.56/86.79 ; 32829 (29%) were simplified or subsumed later,
% 86.56/86.79 ; 79365 (71%) are still being kept.
% 86.56/86.79 ;
% 86.56/86.79 ; Run time in seconds excluding printing time:
% 86.56/86.79 ; 0.009 0% Read assertion file (1 call)
% 86.56/86.79 ; 0.001 0% Assert (38 calls)
% 86.56/86.79 ; 18.503 21% Process new row (259,261 calls)
% 86.56/86.79 ; 22.903 27% Resolution (9,580 calls)
% 86.56/86.79 ; 9.236 11% Paramodulation (4,790 calls)
% 86.56/86.79 ; 0.006 0% Condensing (113 calls)
% 86.56/86.79 ; 0.008 0% Forward subsumption (113 calls)
% 86.56/86.79 ; 0.005 0% Backward subsumption (74 calls)
% 86.56/86.79 ; 0.001 0% Clause clause subsumption (263 calls)
% 86.56/86.79 ; 17.482 20% Forward simplification (257,853 calls)
% 86.56/86.79 ; 14.782 17% Backward simplification (112,194 calls)
% 86.56/86.79 ; 1.705 2% Ordering (338,169 calls)
% 86.56/86.79 ; 0.000 0% Sortal reasoning (32 calls)
% 86.56/86.79 ; 0.000 0% Purity testing (1 call)
% 86.56/86.79 ; 1.676 2% Other
% 86.56/86.79 ; 86.317 Total
% 86.56/86.79 ; 86.333 Real time
% 86.56/86.80 ;
% 86.56/86.80 ; Term-hash-array has 247,916 terms in all.
% 86.56/86.80 ; Feature-vector-row-index has 74 entries (74 at peak, 74 added, 0 deleted).
% 86.56/86.80 ; Feature-vector-row-index has 320 nodes (320 at peak, 320 added, 0 deleted).
% 86.56/86.80 ; Retrieved 277 possibly forward subsuming rows in 113 calls.
% 86.56/86.80 ; Retrieved 82 possibly backward subsumed rows in 74 calls.
% 86.56/86.80 ; Path-index has 173,363 entries (177,879 at peak, 259,051 added, 85,688 deleted).
% 86.56/86.80 ; Path-index has 38,961 nodes (38,973 at peak, 42,560 added, 3,599 deleted).
% 86.56/86.80 ; Trie-index has 173,363 entries (177,879 at peak, 259,051 added, 85,688 deleted).
% 86.56/86.80 ; Trie-index has 1,039,620 nodes (1,069,040 at peak, 1,515,235 added, 475,615 deleted).
% 86.56/86.80 ; Retrieved 1,988,038 generalization terms in 1,452,675 calls.
% 86.56/86.80 ; Retrieved 416,951 instance terms in 126,151 calls.
% 86.56/86.80 ; Retrieved 811,133 unifiable terms in 111,278 calls.
% 86.56/86.80 ;
% 86.56/86.80 ; The agenda of backward simplifiable rows to process has 775 entries:
% 86.56/86.80 ; 775 with value 0
% 86.56/86.80 ; The agenda of rows to process has 7 entries:
% 86.56/86.80 ; 2 with value 26 2 with value 30 2 with value 34
% 86.56/86.80 ; 1 with value 27
% 86.56/86.80 ; The agenda of rows to give has 75186 entries:
% 86.56/86.80 ; 1 with value (4 13) 4013 with value (4 39) 162 with value (4 55)
% 86.56/86.80 ; 1 with value (4 15) 2700 with value (4 40) 161 with value (4 56)
% 86.56/86.80 ; 4 with value (4 24) 2733 with value (4 41) 80 with value (4 57)
% 86.56/86.80 ; 2 with value (4 26) 2745 with value (4 42) 19 with value (4 58)
% 86.56/86.80 ; 3 with value (4 27) 2718 with value (4 43) 29 with value (4 59)
% 86.56/86.80 ; 1663 with value (4 28) 1976 with value (4 44) 30 with value (4 60)
% 86.56/86.80 ; 3381 with value (4 29) 1857 with value (4 45) 44 with value (4 61)
% 86.56/86.80 ; 5443 with value (4 30) 1606 with value (4 46) 32 with value (4 62)
% 86.56/86.80 ; 5265 with value (4 31) 1181 with value (4 47) 32 with value (4 63)
% 86.56/86.80 ; 4512 with value (4 32) 1498 with value (4 48) 16 with value (4 64)
% 86.56/86.80 ; 5025 with value (4 33) 843 with value (4 49) 16 with value (4 65)
% 86.56/86.80 ; 4342 with value (4 34) 619 with value (4 50) 14 with value (4 66)
% 86.56/86.80 ; 4486 with value (4 35) 321 with value (4 51) 16 with value (4 67)
% 86.56/86.80 ; 6147 with value (4 36) 397 with value (4 52) 1 with value (4 69)
% 86.56/86.80 ; 4642 with value (4 37) 110 with value (4 53) 10 with value (4 70)
% 86.56/86.80 ; 4054 with value (4 38) 234 with value (4 54) 2 with value (4 71)
% 86.56/86.80 Evaluation took:
% 86.56/86.80 86.339 seconds of real time
% 86.56/86.80 81.73769 seconds of user run time
% 86.56/86.80 4.593801 seconds of system run time
% 86.56/86.80 [Run times include 23.888 seconds GC run time.]
% 86.56/86.80 0 calls to %EVAL
% 86.56/86.80 0 page faults and
% 86.56/86.80 2,957,973,544 bytes consed.
% 86.56/86.80 :PROOF-FOUND
% 86.56/86.80 ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-09T12:46:34
% 86.56/86.80 :PROOF-FOUND
% 86.56/86.80 *
%------------------------------------------------------------------------------