%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : HWV008-1.001 : TPTP v8.1.0. Released v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n015.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:32 EDT 2022
% Result : Unsatisfiable 0.20s 0.59s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 31
% Syntax : Number of clauses : 70 ( 46 unt; 3 nHn; 70 RR)
% Number of literals : 105 ( 0 equ; 40 neg)
% Maximal clause size : 5 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 20 ( 20 usr; 12 con; 0-2 aty)
% Number of variables : 31 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(value_propagation1,axiom,
( ~ connection(X,Y)
| ~ value(X,Z)
| value(Y,Z) ),
file('/export/starexec/sandbox/benchmark/Axioms/HWV001-0.ax',value_propagation1) ).
cnf(value_propagation2,axiom,
( ~ connection(X,Y)
| ~ value(Y,Z)
| value(X,Z) ),
file('/export/starexec/sandbox/benchmark/Axioms/HWV001-0.ax',value_propagation2) ).
cnf(unique_value,axiom,
( ~ value(X,Y)
| ~ value(X,Z)
| equal_value(Y,Z) ),
file('/export/starexec/sandbox/benchmark/Axioms/HWV001-0.ax',unique_value) ).
cnf(equal_value2,axiom,
~ equal_value(n1,n0),
file('/export/starexec/sandbox/benchmark/Axioms/HWV001-0.ax',equal_value2) ).
cnf(ok_or_abnormal,axiom,
( ~ type(X,Y)
| mode(X,ok)
| mode(X,abnormal) ),
file('/export/starexec/sandbox/benchmark/Axioms/HWV001-0.ax',ok_or_abnormal) ).
cnf(and_0x_0,axiom,
( ~ mode(X,ok)
| ~ type(X,and)
| ~ value(in(Y,X),n0)
| value(out(n1,X),n0) ),
file('/export/starexec/sandbox/benchmark/Axioms/HWV001-0.ax',and_0x_0) ).
cnf(and_1_x1,axiom,
( ~ mode(X,ok)
| ~ type(X,and)
| ~ value(out(n1,X),n1)
| value(in(n2,X),n1) ),
file('/export/starexec/sandbox/benchmark/Axioms/HWV001-0.ax',and_1_x1) ).
cnf(or_1_11,axiom,
( ~ mode(X,ok)
| ~ type(X,or)
| ~ value(out(n1,X),n1)
| value(in(n1,X),n1)
| value(in(n2,X),n1) ),
file('/export/starexec/sandbox/benchmark/Axioms/HWV001-0.ax',or_1_11) ).
cnf(halfadder_and2,axiom,
( ~ type(X,halfadder)
| type(and2(X),and) ),
file('/export/starexec/sandbox/benchmark/Axioms/HWV001-1.ax',halfadder_and2) ).
cnf(halfadder_connection_in1_in1and2,axiom,
( ~ type(X,halfadder)
| connection(in(n1,X),in(n1,and2(X))) ),
file('/export/starexec/sandbox/benchmark/Axioms/HWV001-1.ax',halfadder_connection_in1_in1and2) ).
cnf(halfadder_connection_in2_in2and2,axiom,
( ~ type(X,halfadder)
| connection(in(n2,X),in(n2,and2(X))) ),
file('/export/starexec/sandbox/benchmark/Axioms/HWV001-1.ax',halfadder_connection_in2_in2and2) ).
cnf(halfadder_connection_outc_out1and2,axiom,
( ~ type(X,halfadder)
| connection(out(c,X),out(n1,and2(X))) ),
file('/export/starexec/sandbox/benchmark/Axioms/HWV001-1.ax',halfadder_connection_outc_out1and2) ).
cnf(fulladder_halfadder1,axiom,
( ~ type(X,fulladder)
| type(h1(X),halfadder) ),
file('/export/starexec/sandbox/benchmark/Axioms/HWV001-2.ax',fulladder_halfadder1) ).
cnf(fulladder_halfadder2,axiom,
( ~ type(X,fulladder)
| type(h2(X),halfadder) ),
file('/export/starexec/sandbox/benchmark/Axioms/HWV001-2.ax',fulladder_halfadder2) ).
cnf(fulladder_or1,axiom,
( ~ type(X,fulladder)
| type(or1(X),or) ),
file('/export/starexec/sandbox/benchmark/Axioms/HWV001-2.ax',fulladder_or1) ).
cnf(fulladder_connection_outch1_in2or1,axiom,
( ~ type(X,fulladder)
| connection(out(c,h1(X)),in(n2,or1(X))) ),
file('/export/starexec/sandbox/benchmark/Axioms/HWV001-2.ax',fulladder_connection_outch1_in2or1) ).
cnf(fulladder_connection_outch2_in1or1,axiom,
( ~ type(X,fulladder)
| connection(out(c,h2(X)),in(n1,or1(X))) ),
file('/export/starexec/sandbox/benchmark/Axioms/HWV001-2.ax',fulladder_connection_outch2_in1or1) ).
cnf(fulladder_connection_in1_in1h2,axiom,
( ~ type(X,fulladder)
| connection(in(n1,X),in(n1,h2(X))) ),
file('/export/starexec/sandbox/benchmark/Axioms/HWV001-2.ax',fulladder_connection_in1_in1h2) ).
cnf(fulladder_connection_inc_in2h1,axiom,
( ~ type(X,fulladder)
| connection(in(c,X),in(n2,h1(X))) ),
file('/export/starexec/sandbox/benchmark/Axioms/HWV001-2.ax',fulladder_connection_inc_in2h1) ).
cnf(fulladder_connection_outc_out1or1,axiom,
( ~ type(X,fulladder)
| connection(out(c,X),out(n1,or1(X))) ),
file('/export/starexec/sandbox/benchmark/Axioms/HWV001-2.ax',fulladder_connection_outc_out1or1) ).
cnf(nbit_adder_fulladder1,axiom,
( ~ type(X,nbit_adder(n1))
| type(v(n1,X),fulladder) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',nbit_adder_fulladder1) ).
cnf(nbit_adder_connection_outc_outcv1,axiom,
( ~ type(X,nbit_adder(n1))
| connection(out(c,X),out(c,v(n1,X))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',nbit_adder_connection_outc_outcv1) ).
cnf(nbit_adder_connection_ina1_in1v1,axiom,
( ~ type(X,nbit_adder(n1))
| connection(in(a1,X),in(n1,v(n1,X))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',nbit_adder_connection_ina1_in1v1) ).
cnf(nbit_adder_connection_inc_incv1,axiom,
( ~ type(X,nbit_adder(n1))
| connection(in(c,X),in(c,v(n1,X))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',nbit_adder_connection_inc_incv1) ).
cnf(a_isa_1bit_adder,hypothesis,
type(a,nbit_adder(n1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_isa_1bit_adder) ).
cnf(ina1_0,hypothesis,
value(in(a1,a),n0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ina1_0) ).
cnf(inc_0,hypothesis,
value(in(c,a),n0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',inc_0) ).
cnf(outc_0,hypothesis,
value(out(c,a),n1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',outc_0) ).
cnf(diagnosis_or1v1,negated_conjecture,
~ mode(or1(v(n1,a)),abnormal),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',diagnosis_or1v1) ).
cnf(diagnosis_and2h1v1,negated_conjecture,
~ mode(and2(h1(v(n1,a))),abnormal),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',diagnosis_and2h1v1) ).
cnf(diagnosis_and2h2v1,negated_conjecture,
~ mode(and2(h2(v(n1,a))),abnormal),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',diagnosis_and2h2v1) ).
cnf(66,plain,
~ value(in(c,a),n1),
inference('UR-RESOLVE',[status(thm)],[unique_value,inc_0,equal_value2]) ).
cnf(69,plain,
type(v(n1,a),fulladder),
inference('HYPERRESOLVE',[status(thm)],[nbit_adder_fulladder1,a_isa_1bit_adder]) ).
cnf(71,plain,
connection(out(c,a),out(c,v(n1,a))),
inference('HYPERRESOLVE',[status(thm)],[nbit_adder_connection_outc_outcv1,a_isa_1bit_adder]) ).
cnf(72,plain,
connection(in(a1,a),in(n1,v(n1,a))),
inference('HYPERRESOLVE',[status(thm)],[nbit_adder_connection_ina1_in1v1,a_isa_1bit_adder]) ).
cnf(74,plain,
connection(in(c,a),in(c,v(n1,a))),
inference('HYPERRESOLVE',[status(thm)],[nbit_adder_connection_inc_incv1,a_isa_1bit_adder]) ).
cnf(83,plain,
type(or1(v(n1,a)),or),
inference('HYPERRESOLVE',[status(thm)],[fulladder_or1,69]) ).
cnf(84,plain,
type(h2(v(n1,a)),halfadder),
inference('HYPERRESOLVE',[status(thm)],[fulladder_halfadder2,69]) ).
cnf(85,plain,
type(h1(v(n1,a)),halfadder),
inference('HYPERRESOLVE',[status(thm)],[fulladder_halfadder1,69]) ).
cnf(87,plain,
connection(out(c,v(n1,a)),out(n1,or1(v(n1,a)))),
inference('HYPERRESOLVE',[status(thm)],[fulladder_connection_outc_out1or1,69]) ).
cnf(89,plain,
connection(in(c,v(n1,a)),in(n2,h1(v(n1,a)))),
inference('HYPERRESOLVE',[status(thm)],[fulladder_connection_inc_in2h1,69]) ).
cnf(91,plain,
connection(in(n1,v(n1,a)),in(n1,h2(v(n1,a)))),
inference('HYPERRESOLVE',[status(thm)],[fulladder_connection_in1_in1h2,69]) ).
cnf(92,plain,
connection(out(c,h2(v(n1,a))),in(n1,or1(v(n1,a)))),
inference('HYPERRESOLVE',[status(thm)],[fulladder_connection_outch2_in1or1,69]) ).
cnf(93,plain,
connection(out(c,h1(v(n1,a))),in(n2,or1(v(n1,a)))),
inference('HYPERRESOLVE',[status(thm)],[fulladder_connection_outch1_in2or1,69]) ).
cnf(95,plain,
mode(or1(v(n1,a)),ok),
inference('UR-RESOLVE',[status(thm)],[ok_or_abnormal,83,diagnosis_or1v1]) ).
cnf(98,plain,
type(and2(h2(v(n1,a))),and),
inference('HYPERRESOLVE',[status(thm)],[halfadder_and2,84]) ).
cnf(101,plain,
connection(out(c,h2(v(n1,a))),out(n1,and2(h2(v(n1,a))))),
inference('HYPERRESOLVE',[status(thm)],[halfadder_connection_outc_out1and2,84]) ).
cnf(104,plain,
connection(in(n1,h2(v(n1,a))),in(n1,and2(h2(v(n1,a))))),
inference('HYPERRESOLVE',[status(thm)],[halfadder_connection_in1_in1and2,84]) ).
cnf(112,plain,
type(and2(h1(v(n1,a))),and),
inference('HYPERRESOLVE',[status(thm)],[halfadder_and2,85]) ).
cnf(115,plain,
connection(out(c,h1(v(n1,a))),out(n1,and2(h1(v(n1,a))))),
inference('HYPERRESOLVE',[status(thm)],[halfadder_connection_outc_out1and2,85]) ).
cnf(117,plain,
connection(in(n2,h1(v(n1,a))),in(n2,and2(h1(v(n1,a))))),
inference('HYPERRESOLVE',[status(thm)],[halfadder_connection_in2_in2and2,85]) ).
cnf(128,plain,
value(out(c,v(n1,a)),n1),
inference('HYPERRESOLVE',[status(thm)],[value_propagation1,71,outc_0]) ).
cnf(140,plain,
value(in(n1,v(n1,a)),n0),
inference('HYPERRESOLVE',[status(thm)],[value_propagation1,72,ina1_0]) ).
cnf(153,plain,
~ value(in(c,v(n1,a)),n1),
inference('UR-RESOLVE',[status(thm)],[value_propagation2,74,66]) ).
cnf(160,plain,
mode(and2(h2(v(n1,a))),ok),
inference('UR-RESOLVE',[status(thm)],[ok_or_abnormal,98,diagnosis_and2h2v1]) ).
cnf(164,plain,
mode(and2(h1(v(n1,a))),ok),
inference('UR-RESOLVE',[status(thm)],[ok_or_abnormal,112,diagnosis_and2h1v1]) ).
cnf(166,plain,
value(out(n1,or1(v(n1,a))),n1),
inference('HYPERRESOLVE',[status(thm)],[value_propagation1,87,128]) ).
cnf(184,plain,
( value(in(n1,or1(v(n1,a))),n1)
| value(in(n2,or1(v(n1,a))),n1) ),
inference('HYPERRESOLVE',[status(thm)],[or_1_11,166,95,83]) ).
cnf(194,plain,
~ value(in(n2,h1(v(n1,a))),n1),
inference('UR-RESOLVE',[status(thm)],[value_propagation2,89,153]) ).
cnf(209,plain,
value(in(n1,h2(v(n1,a))),n0),
inference('HYPERRESOLVE',[status(thm)],[value_propagation1,91,140]) ).
cnf(225,plain,
value(in(n1,and2(h2(v(n1,a)))),n0),
inference('HYPERRESOLVE',[status(thm)],[value_propagation1,104,209]) ).
cnf(227,plain,
value(out(n1,and2(h2(v(n1,a)))),n0),
inference('HYPERRESOLVE',[status(thm)],[and_0x_0,225,160,98]) ).
cnf(236,plain,
value(out(c,h2(v(n1,a))),n0),
inference('HYPERRESOLVE',[status(thm)],[value_propagation2,227,101]) ).
cnf(243,plain,
value(in(n1,or1(v(n1,a))),n0),
inference('HYPERRESOLVE',[status(thm)],[value_propagation1,236,92]) ).
cnf(253,plain,
~ value(in(n1,or1(v(n1,a))),n1),
inference('UR-RESOLVE',[status(thm)],[unique_value,243,equal_value2]) ).
cnf(254,plain,
value(in(n2,or1(v(n1,a))),n1),
inference('REWRITE',[status(thm)],[184,253]) ).
cnf(261,plain,
value(out(c,h1(v(n1,a))),n1),
inference('HYPERRESOLVE',[status(thm)],[value_propagation2,254,93]) ).
cnf(344,plain,
value(out(n1,and2(h1(v(n1,a)))),n1),
inference('HYPERRESOLVE',[status(thm)],[value_propagation1,115,261]) ).
cnf(346,plain,
value(in(n2,and2(h1(v(n1,a)))),n1),
inference('HYPERRESOLVE',[status(thm)],[and_1_x1,344,164,112]) ).
cnf(407,plain,
$false,
inference('REWRITE',[status(thm)],[inference('UR-RESOLVE',[status(thm)],[value_propagation2,346,194]),117]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : HWV008-1.001 : TPTP v8.1.0. Released v2.1.0.
% 0.08/0.14 % Command : run-snark %s %d
% 0.13/0.35 % Computer : n015.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Fri Jun 17 03:21:57 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.46 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.47 *
% 0.20/0.47 *
% 0.20/0.48 #<PACKAGE "SNARK-USER">
% 0.20/0.48 *
% 0.20/0.48 SNARK-TPTP-OPTIONS
% 0.20/0.48 *
% 0.20/0.48 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.20/0.48 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.20/0.48 (USE-FACTORING :POS)
% 0.20/0.48 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.20/0.48 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.20/0.48 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.20/0.48 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.20/0.48 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.20/0.48 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.20/0.48 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.20/0.48 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.20/0.48 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.20/0.48 (DECLARE-TPTP-SYMBOLS2))
% 0.20/0.48 *
% 0.20/0.48 "."
% 0.20/0.48 *
% 0.20/0.48 ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-17T03:21:57
% 0.20/0.48 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n015.cluster.edu at 2022-06-17T03:21:57
% 0.20/0.59
% 0.20/0.59
% 0.20/0.59 #||
% 0.20/0.59 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.59 % SZS output start Refutation
% See solution above
% 0.20/0.60 ||#
% 0.20/0.60
% 0.20/0.60 ; Summary of computation:
% 0.20/0.60 ; 896 formulas have been input or derived (from 253 formulas).
% 0.44/0.60 ; 407 (45%) were retained. Of these,
% 0.44/0.60 ; 1 ( 0%) were simplified or subsumed later,
% 0.44/0.60 ; 406 (100%) are still being kept.
% 0.44/0.60 ;
% 0.44/0.60 ; Run time in seconds excluding printing time:
% 0.44/0.60 ; 0.013 11% Read assertion file (1 call)
% 0.44/0.60 ; 0.001 1% Assert (60 calls)
% 0.44/0.60 ; 0.036 31% Process new row (778 calls)
% 0.44/0.60 ; 0.018 16% Resolution (504 calls)
% 0.44/0.60 ; 0.008 7% Paramodulation (252 calls)
% 0.44/0.60 ; 0.000 0% Factoring (4 calls)
% 0.44/0.60 ; 0.002 2% Condensing (60 calls)
% 0.44/0.60 ; 0.001 1% Forward subsumption (60 calls)
% 0.44/0.60 ; 0.003 3% Backward subsumption (60 calls)
% 0.44/0.60 ; 0.000 0% Clause clause subsumption (2 calls)
% 0.44/0.60 ; 0.006 5% Forward simplification (778 calls)
% 0.44/0.60 ; 0.002 2% Backward simplification (407 calls)
% 0.44/0.60 ; 0.000 0% Ordering (8 calls)
% 0.44/0.60 ; 0.000 0% Sortal reasoning (32 calls)
% 0.44/0.60 ; 0.000 0% Purity testing (1 call)
% 0.44/0.60 ; 0.026 22% Other
% 0.44/0.60 ; 0.116 Total
% 0.44/0.60 ; 0.121 Real time
% 0.44/0.60 ;
% 0.44/0.60 ; Term-hash-array has 514 terms in all.
% 0.44/0.60 ; Feature-vector-row-index has 59 entries (60 at peak, 60 added, 1 deleted).
% 0.44/0.60 ; Feature-vector-row-index has 410 nodes (427 at peak, 427 added, 17 deleted).
% 0.44/0.60 ; Retrieved 2 possibly forward subsuming rows in 60 calls.
% 0.44/0.60 ; Retrieved 2 possibly backward subsumed rows in 60 calls.
% 0.44/0.60 ; Path-index has 529 entries (529 at peak, 530 added, 1 deleted).
% 0.44/0.60 ; Path-index has 864 nodes (864 at peak, 864 added, 0 deleted).
% 0.44/0.60 ; Trie-index has 529 entries (529 at peak, 530 added, 1 deleted).
% 0.44/0.60 ; Trie-index has 1,984 nodes (1,984 at peak, 1,985 added, 1 deleted).
% 0.44/0.60 ; Retrieved 375 generalization terms in 739 calls.
% 0.44/0.60 ; Retrieved 346 instance terms in 346 calls.
% 0.44/0.60 ; Retrieved 4,989 unifiable terms in 3,519 calls.
% 0.44/0.60 ;
% 0.44/0.60 ; The agenda of rows to process has 13 entries:
% 0.44/0.60 ; 3 with value 27 10 with value 28
% 0.44/0.60 ; The agenda of rows to give has 153 entries:
% 0.44/0.60 ; 1 with value (4 21) 26 with value (4 24) 16 with value (4 27)
% 0.44/0.60 ; 26 with value (4 22) 24 with value (4 25) 4 with value (4 28)
% 0.44/0.60 ; 30 with value (4 23) 26 with value (4 26)
% 0.44/0.60 Evaluation took:
% 0.44/0.60 0.122 seconds of real time
% 0.44/0.60 0.103974 seconds of user run time
% 0.44/0.60 0.017737 seconds of system run time
% 0.44/0.60 0 calls to %EVAL
% 0.44/0.60 0 page faults and
% 0.44/0.60 10,948,952 bytes consed.
% 0.44/0.60 :PROOF-FOUND
% 0.44/0.60 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-17T03:21:57
% 0.44/0.60 :PROOF-FOUND
% 0.44/0.60 *
%------------------------------------------------------------------------------