TSTP Solution File: HWV008-1.002 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : HWV008-1.002 : TPTP v8.1.0. Bugfixed v2.2.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 19:10:32 EDT 2022
% Result : Unsatisfiable 0.47s 0.64s
% Output : Refutation 0.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 30
% Syntax : Number of clauses : 69 ( 46 unt; 3 nHn; 69 RR)
% Number of literals : 103 ( 0 equ; 39 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 : 21 ( 21 usr; 13 con; 0-2 aty)
% Number of variables : 30 ( 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_1x,axiom,
( ~ mode(X,ok)
| ~ type(X,and)
| ~ value(out(n1,X),n1)
| value(in(n1,X),n1) ),
file('/export/starexec/sandbox/benchmark/Axioms/HWV001-0.ax',and_1_1x) ).
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_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_in2_in1h1,axiom,
( ~ type(X,fulladder)
| connection(in(n2,X),in(n1,h1(X))) ),
file('/export/starexec/sandbox/benchmark/Axioms/HWV001-2.ax',fulladder_connection_in2_in1h1) ).
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_fulladder2,axiom,
( ~ type(X,nbit_adder(n2))
| type(f(n2,X),fulladder) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',nbit_adder_fulladder2) ).
cnf(nbit_adder_connection_outc_outcf1,axiom,
( ~ type(X,nbit_adder(n2))
| connection(out(c,X),out(c,f(n2,X))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',nbit_adder_connection_outc_outcf1) ).
cnf(nbit_adder_connection_ina2_in1f2,axiom,
( ~ type(X,nbit_adder(n2))
| connection(in(a2,X),in(n1,f(n2,X))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',nbit_adder_connection_ina2_in1f2) ).
cnf(nbit_adder_connection_inb2_in2f2,axiom,
( ~ type(X,nbit_adder(n2))
| connection(in(b2,X),in(n2,f(n2,X))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',nbit_adder_connection_inb2_in2f2) ).
cnf(a_isa_2bit_adder,hypothesis,
type(a,nbit_adder(n2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_isa_2bit_adder) ).
cnf(ina2_0,hypothesis,
value(in(a2,a),n0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ina2_0) ).
cnf(inb2_0,hypothesis,
value(in(b2,a),n0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',inb2_0) ).
cnf(outc_1,hypothesis,
value(out(c,a),n1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',outc_1) ).
cnf(diagnosis_or1f2a,negated_conjecture,
~ mode(or1(f(n2,a)),abnormal),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',diagnosis_or1f2a) ).
cnf(diagnosis_and2h2f2a,negated_conjecture,
~ mode(and2(h1(f(n2,a))),abnormal),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',diagnosis_and2h2f2a) ).
cnf(diagnosis_and2h1f2a,negated_conjecture,
~ mode(and2(h2(f(n2,a))),abnormal),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',diagnosis_and2h1f2a) ).
cnf(75,plain,
~ value(in(b2,a),n1),
inference('UR-RESOLVE',[status(thm)],[unique_value,inb2_0,equal_value2]) ).
cnf(81,plain,
type(f(n2,a),fulladder),
inference('HYPERRESOLVE',[status(thm)],[nbit_adder_fulladder2,a_isa_2bit_adder]) ).
cnf(84,plain,
connection(out(c,a),out(c,f(n2,a))),
inference('HYPERRESOLVE',[status(thm)],[nbit_adder_connection_outc_outcf1,a_isa_2bit_adder]) ).
cnf(87,plain,
connection(in(a2,a),in(n1,f(n2,a))),
inference('HYPERRESOLVE',[status(thm)],[nbit_adder_connection_ina2_in1f2,a_isa_2bit_adder]) ).
cnf(88,plain,
connection(in(b2,a),in(n2,f(n2,a))),
inference('HYPERRESOLVE',[status(thm)],[nbit_adder_connection_inb2_in2f2,a_isa_2bit_adder]) ).
cnf(117,plain,
type(or1(f(n2,a)),or),
inference('HYPERRESOLVE',[status(thm)],[fulladder_or1,81]) ).
cnf(118,plain,
type(h2(f(n2,a)),halfadder),
inference('HYPERRESOLVE',[status(thm)],[fulladder_halfadder2,81]) ).
cnf(119,plain,
type(h1(f(n2,a)),halfadder),
inference('HYPERRESOLVE',[status(thm)],[fulladder_halfadder1,81]) ).
cnf(121,plain,
connection(out(c,f(n2,a)),out(n1,or1(f(n2,a)))),
inference('HYPERRESOLVE',[status(thm)],[fulladder_connection_outc_out1or1,81]) ).
cnf(124,plain,
connection(in(n2,f(n2,a)),in(n1,h1(f(n2,a)))),
inference('HYPERRESOLVE',[status(thm)],[fulladder_connection_in2_in1h1,81]) ).
cnf(125,plain,
connection(in(n1,f(n2,a)),in(n1,h2(f(n2,a)))),
inference('HYPERRESOLVE',[status(thm)],[fulladder_connection_in1_in1h2,81]) ).
cnf(126,plain,
connection(out(c,h2(f(n2,a))),in(n1,or1(f(n2,a)))),
inference('HYPERRESOLVE',[status(thm)],[fulladder_connection_outch2_in1or1,81]) ).
cnf(127,plain,
connection(out(c,h1(f(n2,a))),in(n2,or1(f(n2,a)))),
inference('HYPERRESOLVE',[status(thm)],[fulladder_connection_outch1_in2or1,81]) ).
cnf(158,plain,
mode(or1(f(n2,a)),ok),
inference('UR-RESOLVE',[status(thm)],[ok_or_abnormal,117,diagnosis_or1f2a]) ).
cnf(161,plain,
type(and2(h2(f(n2,a))),and),
inference('HYPERRESOLVE',[status(thm)],[halfadder_and2,118]) ).
cnf(164,plain,
connection(out(c,h2(f(n2,a))),out(n1,and2(h2(f(n2,a))))),
inference('HYPERRESOLVE',[status(thm)],[halfadder_connection_outc_out1and2,118]) ).
cnf(167,plain,
connection(in(n1,h2(f(n2,a))),in(n1,and2(h2(f(n2,a))))),
inference('HYPERRESOLVE',[status(thm)],[halfadder_connection_in1_in1and2,118]) ).
cnf(175,plain,
type(and2(h1(f(n2,a))),and),
inference('HYPERRESOLVE',[status(thm)],[halfadder_and2,119]) ).
cnf(178,plain,
connection(out(c,h1(f(n2,a))),out(n1,and2(h1(f(n2,a))))),
inference('HYPERRESOLVE',[status(thm)],[halfadder_connection_outc_out1and2,119]) ).
cnf(181,plain,
connection(in(n1,h1(f(n2,a))),in(n1,and2(h1(f(n2,a))))),
inference('HYPERRESOLVE',[status(thm)],[halfadder_connection_in1_in1and2,119]) ).
cnf(195,plain,
value(out(c,f(n2,a)),n1),
inference('HYPERRESOLVE',[status(thm)],[value_propagation1,84,outc_1]) ).
cnf(227,plain,
value(in(n1,f(n2,a)),n0),
inference('HYPERRESOLVE',[status(thm)],[value_propagation1,87,ina2_0]) ).
cnf(234,plain,
~ value(in(n2,f(n2,a)),n1),
inference('UR-RESOLVE',[status(thm)],[value_propagation2,88,75]) ).
cnf(255,plain,
mode(and2(h2(f(n2,a))),ok),
inference('UR-RESOLVE',[status(thm)],[ok_or_abnormal,161,diagnosis_and2h1f2a]) ).
cnf(259,plain,
mode(and2(h1(f(n2,a))),ok),
inference('UR-RESOLVE',[status(thm)],[ok_or_abnormal,175,diagnosis_and2h2f2a]) ).
cnf(279,plain,
value(out(n1,or1(f(n2,a))),n1),
inference('HYPERRESOLVE',[status(thm)],[value_propagation1,121,195]) ).
cnf(315,plain,
( value(in(n1,or1(f(n2,a))),n1)
| value(in(n2,or1(f(n2,a))),n1) ),
inference('HYPERRESOLVE',[status(thm)],[or_1_11,279,158,117]) ).
cnf(317,plain,
~ value(in(n1,h1(f(n2,a))),n1),
inference('UR-RESOLVE',[status(thm)],[value_propagation2,124,234]) ).
cnf(324,plain,
value(in(n1,h2(f(n2,a))),n0),
inference('HYPERRESOLVE',[status(thm)],[value_propagation1,125,227]) ).
cnf(380,plain,
value(in(n1,and2(h2(f(n2,a)))),n0),
inference('HYPERRESOLVE',[status(thm)],[value_propagation1,167,324]) ).
cnf(382,plain,
value(out(n1,and2(h2(f(n2,a)))),n0),
inference('HYPERRESOLVE',[status(thm)],[and_0x_0,380,255,161]) ).
cnf(391,plain,
value(out(c,h2(f(n2,a))),n0),
inference('HYPERRESOLVE',[status(thm)],[value_propagation2,382,164]) ).
cnf(398,plain,
value(in(n1,or1(f(n2,a))),n0),
inference('HYPERRESOLVE',[status(thm)],[value_propagation1,391,126]) ).
cnf(408,plain,
~ value(in(n1,or1(f(n2,a))),n1),
inference('UR-RESOLVE',[status(thm)],[unique_value,398,equal_value2]) ).
cnf(409,plain,
value(in(n2,or1(f(n2,a))),n1),
inference('REWRITE',[status(thm)],[315,408]) ).
cnf(416,plain,
value(out(c,h1(f(n2,a))),n1),
inference('HYPERRESOLVE',[status(thm)],[value_propagation2,409,127]) ).
cnf(547,plain,
value(out(n1,and2(h1(f(n2,a)))),n1),
inference('HYPERRESOLVE',[status(thm)],[value_propagation1,178,416]) ).
cnf(550,plain,
value(in(n1,and2(h1(f(n2,a)))),n1),
inference('HYPERRESOLVE',[status(thm)],[and_1_1x,547,259,175]) ).
cnf(710,plain,
$false,
inference('REWRITE',[status(thm)],[inference('UR-RESOLVE',[status(thm)],[value_propagation2,550,317]),181]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : HWV008-1.002 : TPTP v8.1.0. Bugfixed v2.2.0.
% 0.07/0.13 % Command : run-snark %s %d
% 0.13/0.35 % Computer : n021.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 : Thu Jun 16 21:16:30 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-16T21:16:30
% 0.20/0.48 ; 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-16T21:16:30
% 0.47/0.64
% 0.47/0.64
% 0.47/0.64 #||
% 0.47/0.64 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.47/0.64 % SZS output start Refutation
% See solution above
% 0.47/0.66 ||#
% 0.47/0.66
% 0.47/0.66 ; Summary of computation:
% 0.47/0.66 ; 1501 formulas have been input or derived (from 393 formulas).
% 0.47/0.66 ; 710 (47%) were retained. Of these,
% 0.47/0.66 ; 1 ( 0%) were simplified or subsumed later,
% 0.47/0.66 ; 709 (100%) are still being kept.
% 0.47/0.66 ;
% 0.47/0.66 ; Run time in seconds excluding printing time:
% 0.47/0.66 ; 0.014 9% Read assertion file (1 call)
% 0.47/0.66 ; 0.003 2% Assert (68 calls)
% 0.47/0.66 ; 0.045 28% Process new row (1,313 calls)
% 0.47/0.66 ; 0.032 20% Resolution (784 calls)
% 0.47/0.66 ; 0.006 4% Paramodulation (392 calls)
% 0.47/0.66 ; 0.000 0% Factoring (8 calls)
% 0.47/0.66 ; 0.001 1% Condensing (77 calls)
% 0.47/0.66 ; 0.002 1% Forward subsumption (77 calls)
% 0.47/0.66 ; 0.005 3% Backward subsumption (77 calls)
% 0.47/0.66 ; 0.000 0% Clause clause subsumption (2 calls)
% 0.47/0.66 ; 0.017 11% Forward simplification (1,313 calls)
% 0.47/0.66 ; 0.004 2% Backward simplification (710 calls)
% 0.47/0.66 ; 0.000 0% Ordering (15 calls)
% 0.47/0.66 ; 0.000 0% Sortal reasoning (32 calls)
% 0.47/0.66 ; 0.000 0% Purity testing (1 call)
% 0.47/0.66 ; 0.031 19% Other
% 0.47/0.66 ; 0.160 Total
% 0.47/0.66 ; 0.175 Real time
% 0.47/0.66 ;
% 0.47/0.66 ; Term-hash-array has 893 terms in all.
% 0.47/0.66 ; Feature-vector-row-index has 76 entries (77 at peak, 77 added, 1 deleted).
% 0.47/0.66 ; Feature-vector-row-index has 549 nodes (567 at peak, 567 added, 18 deleted).
% 0.47/0.66 ; Retrieved 2 possibly forward subsuming rows in 77 calls.
% 0.47/0.66 ; Retrieved 2 possibly backward subsumed rows in 77 calls.
% 0.47/0.66 ; Path-index has 910 entries (910 at peak, 911 added, 1 deleted).
% 0.47/0.66 ; Path-index has 977 nodes (977 at peak, 977 added, 0 deleted).
% 0.47/0.66 ; Trie-index has 910 entries (910 at peak, 911 added, 1 deleted).
% 0.47/0.66 ; Trie-index has 3,285 nodes (3,285 at peak, 3,286 added, 1 deleted).
% 0.47/0.66 ; Retrieved 607 generalization terms in 1,281 calls.
% 0.47/0.66 ; Retrieved 632 instance terms in 632 calls.
% 0.47/0.66 ; Retrieved 8,023 unifiable terms in 5,757 calls.
% 0.47/0.66 ;
% 0.47/0.66 ; The agenda of rows to process has 22 entries:
% 0.47/0.66 ; 2 with value 27 20 with value 28
% 0.47/0.66 ; The agenda of rows to give has 316 entries:
% 0.47/0.66 ; 1 with value (4 19) 66 with value (4 24) 41 with value (4 27)
% 0.47/0.66 ; 34 with value (4 22) 40 with value (4 25) 24 with value (4 28)
% 0.47/0.66 ; 54 with value (4 23) 56 with value (4 26)
% 0.47/0.66 Evaluation took:
% 0.47/0.66 0.176 seconds of real time
% 0.47/0.66 0.154967 seconds of user run time
% 0.47/0.66 0.020945 seconds of system run time
% 0.47/0.66 [Run times include 0.009 seconds GC run time.]
% 0.47/0.66 0 calls to %EVAL
% 0.47/0.66 0 page faults and
% 0.47/0.66 13,892,128 bytes consed.
% 0.47/0.66 :PROOF-FOUND
% 0.47/0.66 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-16T21:16:30
% 0.47/0.66 :PROOF-FOUND
% 0.47/0.66 *
%------------------------------------------------------------------------------