TSTP Solution File: HWC001-1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : HWC001-1 : TPTP v8.1.0. Bugfixed v1.1.1.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n025.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 0.20s 0.50s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 9
% Syntax : Number of clauses : 13 ( 11 unt; 0 nHn; 10 RR)
% Number of literals : 17 ( 5 equ; 5 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-4 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 20 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(nand_definition,axiom,
nand(X,Y) = not(and(X,Y)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',nand_definition) ).
cnf(and_definition1,axiom,
and(X,n0) = n0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',and_definition1) ).
cnf(and_definition2,axiom,
and(X,n1) = X,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',and_definition2) ).
cnf(not_definition1,axiom,
not(n0) = n1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',not_definition1) ).
cnf(not_definition2,axiom,
not(n1) = n0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',not_definition2) ).
cnf(nand_table_definition,negated_conjecture,
( ~ output(X,Y,Z,U)
| ~ output(V,W,X1,Y1)
| output(nand(X,V),nand(Y,W),nand(Z,X1),nand(U,Y1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',nand_table_definition) ).
cnf(7,plain,
( ~ output(X,Y,Z,U)
| ~ output(V,W,X1,Y1)
| output(not(and(X,V)),not(and(Y,W)),not(and(Z,X1)),not(and(U,Y1))) ),
inference('REWRITE',[status(thm)],[nand_table_definition,nand_definition,theory(equality)]) ).
cnf(input1,negated_conjecture,
output(n0,n0,n1,n1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',input1) ).
cnf(input2,negated_conjecture,
output(n0,n1,n0,n1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',input2) ).
cnf(prove_cannot_make_or,negated_conjecture,
~ output(n0,n1,n1,n1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_cannot_make_or) ).
cnf(11,plain,
output(n1,n1,n0,n0),
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[7,input1,input1]),not_definition2,and_definition2,not_definition1,and_definition1,theory(equality)]) ).
cnf(13,plain,
output(n1,n0,n1,n0),
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[7,input2,input2]),not_definition2,and_definition2,not_definition1,and_definition1,theory(equality)]) ).
cnf(18,plain,
$false,
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[7,13,11]),prove_cannot_make_or,and_definition1,not_definition1,not_definition2,and_definition2,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12 % Problem : HWC001-1 : TPTP v8.1.0. Bugfixed v1.1.1.
% 0.08/0.13 % Command : run-snark %s %d
% 0.14/0.34 % Computer : n025.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Thu Jun 9 12:59:35 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.20/0.45 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.46 *
% 0.20/0.46 *
% 0.20/0.47 #<PACKAGE "SNARK-USER">
% 0.20/0.47 *
% 0.20/0.47 SNARK-TPTP-OPTIONS
% 0.20/0.47 *
% 0.20/0.47 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.20/0.47 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.20/0.47 (USE-FACTORING :POS)
% 0.20/0.47 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.20/0.47 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.20/0.47 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.20/0.47 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.20/0.47 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.20/0.47 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.20/0.47 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.20/0.47 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.20/0.47 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.20/0.47 (DECLARE-TPTP-SYMBOLS2))
% 0.20/0.47 *
% 0.20/0.47 "."
% 0.20/0.47 *
% 0.20/0.47 ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-09T12:59:35
% 0.20/0.47 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n025.cluster.edu at 2022-06-09T12:59:35
% 0.20/0.48
% 0.20/0.50 ; Recognized right identity assertion (= (|and| ?X |n1|) ?X).
% 0.20/0.50
% 0.20/0.50 #||
% 0.20/0.50 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.50 % SZS output start Refutation
% See solution above
% 0.20/0.50 ||#
% 0.20/0.50
% 0.20/0.50 ; Summary of computation:
% 0.20/0.50 ; 71 formulas have been input or derived (from 13 formulas).
% 0.20/0.50 ; 18 (25%) were retained. Of these,
% 0.20/0.50 ; 1 ( 6%) were simplified or subsumed later,
% 0.20/0.50 ; 17 (94%) are still being kept.
% 0.20/0.50 ;
% 0.20/0.50 ; Run time in seconds excluding printing time:
% 0.20/0.50 ; 0.002 7% Read assertion file (1 call)
% 0.20/0.50 ; 0.000 0% Assert (9 calls)
% 0.20/0.50 ; 0.002 7% Process new row (53 calls)
% 0.20/0.50 ; 0.000 0% Resolution (24 calls)
% 0.20/0.50 ; 0.001 4% Paramodulation (12 calls)
% 0.20/0.50 ; 0.000 0% Condensing (1 call)
% 0.20/0.50 ; 0.000 0% Forward subsumption (1 call)
% 0.20/0.50 ; 0.000 0% Backward subsumption (1 call)
% 0.20/0.50 ; 0.002 7% Forward simplification (53 calls)
% 0.20/0.50 ; 0.000 0% Backward simplification (17 calls)
% 0.20/0.50 ; 0.000 0% Ordering (25 calls)
% 0.20/0.50 ; 0.000 0% Sortal reasoning (32 calls)
% 0.20/0.50 ; 0.000 0% Purity testing (1 call)
% 0.20/0.50 ; 0.021 75% Other
% 0.20/0.50 ; 0.028 Total
% 0.20/0.50 ; 0.031 Real time
% 0.20/0.50 ;
% 0.20/0.50 ; Term-hash-array has 33 terms in all.
% 0.20/0.50 ; Feature-vector-row-index has 1 entry (1 at peak, 1 added, 0 deleted).
% 0.20/0.50 ; Feature-vector-row-index has 8 nodes (8 at peak, 8 added, 0 deleted).
% 0.20/0.50 ; Retrieved 0 possibly forward subsuming rows in 1 call.
% 0.20/0.50 ; Retrieved 0 possibly backward subsumed rows in 1 call.
% 0.20/0.50 ; Path-index has 35 entries (35 at peak, 35 added, 0 deleted).
% 0.20/0.50 ; Path-index has 87 nodes (87 at peak, 87 added, 0 deleted).
% 0.20/0.50 ; Trie-index has 35 entries (35 at peak, 35 added, 0 deleted).
% 0.20/0.50 ; Trie-index has 80 nodes (80 at peak, 80 added, 0 deleted).
% 0.20/0.50 ; Retrieved 256 generalization terms in 314 calls.
% 0.20/0.50 ; Retrieved 15 instance terms in 15 calls.
% 0.20/0.50 ; Retrieved 240 unifiable terms in 112 calls.
% 0.20/0.50 ;
% 0.20/0.50 ; The agenda of rows to process has 17 entries:
% 0.20/0.50 ; 17 with value 22
% 0.20/0.50 ; The agenda of rows to give has 4 entries:
% 0.20/0.50 ; 4 with value (4 8)
% 0.20/0.50 Evaluation took:
% 0.20/0.50 0.031 seconds of real time
% 0.20/0.50 0.026038 seconds of user run time
% 0.20/0.50 0.005311 seconds of system run time
% 0.20/0.50 0 calls to %EVAL
% 0.20/0.50 0 page faults and
% 0.20/0.50 2,288,432 bytes consed.
% 0.20/0.50 :PROOF-FOUND
% 0.20/0.50 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-09T12:59:35
% 0.20/0.50 :PROOF-FOUND
% 0.20/0.50 *
%------------------------------------------------------------------------------