TSTP Solution File: BOO075-1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : BOO075-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n029.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 : Thu Jul 14 23:49:08 EDT 2022
% Result : Unsatisfiable 0.51s 0.71s
% Output : Refutation 0.51s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 2
% Syntax : Number of clauses : 26 ( 26 unt; 0 nHn; 2 RR)
% Number of literals : 26 ( 25 equ; 1 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 56 ( 9 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(sh_1,axiom,
nand(nand(X,nand(nand(Y,X),X)),nand(Y,nand(Z,X))) = Y,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sh_1) ).
cnf(prove_meredith_2_basis_1,negated_conjecture,
nand(nand(a,a),nand(b,a)) != a,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_meredith_2_basis_1) ).
cnf(3,plain,
nand(nand(nand(X,nand(Y,Z)),nand(nand(U,nand(X,nand(Y,Z))),nand(X,nand(Y,Z)))),nand(U,X)) = U,
inference('PARAMODULATE',[status(thm)],[sh_1,sh_1,theory(equality)]) ).
cnf(6,plain,
nand(nand(nand(X,Y),nand(nand(Z,nand(X,Y)),nand(X,Y))),nand(Z,X)) = Z,
inference('PARAMODULATE',[status(thm)],[sh_1,3,theory(equality)]) ).
cnf(7,plain,
nand(nand(X,nand(nand(Y,X),X)),nand(Y,nand(Z,nand(nand(X,Z),Z)))) = Y,
inference('PARAMODULATE',[status(thm)],[6,sh_1,theory(equality)]) ).
cnf(14,plain,
nand(nand(X,nand(nand(nand(Y,nand(nand(Y,Y),Y)),X),X)),Y) = nand(Y,nand(nand(Y,Y),Y)),
inference('PARAMODULATE',[status(thm)],[7,sh_1,theory(equality)]) ).
cnf(33,plain,
nand(nand(X,nand(nand(Y,X),X)),nand(Y,nand(nand(Y,Y),Y))) = Y,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[14,sh_1,theory(equality)]),7,theory(equality)]) ).
cnf(39,plain,
nand(X,X) = nand(X,nand(nand(X,X),X)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[14,33,theory(equality)]),7,theory(equality)]) ).
cnf(50,plain,
nand(nand(X,nand(nand(nand(Y,Y),X),X)),Y) = nand(Y,Y),
inference('REWRITE',[status(thm)],[14,39,theory(equality)]) ).
cnf(51,plain,
nand(nand(X,nand(nand(Y,X),X)),nand(Y,Y)) = Y,
inference('REWRITE',[status(thm)],[33,39,theory(equality)]) ).
cnf(57,plain,
nand(nand(X,X),nand(X,nand(Y,X))) = X,
inference('PARAMODULATE',[status(thm)],[sh_1,39,theory(equality)]) ).
cnf(70,plain,
nand(X,nand(nand(Y,nand(nand(X,Y),Y)),X)) = nand(Y,nand(nand(X,Y),Y)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[6,51,theory(equality)]),57,theory(equality)]) ).
cnf(71,plain,
nand(X,nand(nand(Y,nand(nand(X,Y),Y)),nand(Z,nand(X,X)))) = nand(Y,nand(nand(X,Y),Y)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[sh_1,51,theory(equality)]),57,theory(equality)]) ).
cnf(111,plain,
nand(nand(X,X),nand(Y,nand(nand(X,Y),Y))) = X,
inference('PARAMODULATE',[status(thm)],[57,70,theory(equality)]) ).
cnf(115,plain,
nand(nand(X,nand(nand(Y,X),X)),nand(Y,nand(X,nand(nand(Y,X),X)))) = Y,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[70,51,theory(equality)]),57,theory(equality)]) ).
cnf(135,plain,
nand(X,nand(nand(X,X),Y)) = nand(X,X),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[6,111,theory(equality)]),115,theory(equality)]) ).
cnf(190,plain,
nand(X,X) = nand(nand(nand(X,X),Y),nand(nand(X,X),nand(nand(X,X),Y))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[71,6,theory(equality)]),135,theory(equality)]) ).
cnf(191,plain,
nand(nand(nand(X,nand(Y,Y)),nand(nand(Y,nand(X,nand(Y,Y))),nand(X,nand(Y,Y)))),nand(Z,nand(nand(Y,Z),Z))) = Y,
inference('PARAMODULATE',[status(thm)],[sh_1,71,theory(equality)]) ).
cnf(211,plain,
X = nand(nand(X,Y),nand(X,nand(X,Y))),
inference('PARAMODULATE',[status(thm)],[190,sh_1,theory(equality)]) ).
cnf(224,plain,
nand(X,Y) = nand(X,nand(nand(X,Y),X)),
inference('PARAMODULATE',[status(thm)],[211,211,theory(equality)]) ).
cnf(242,plain,
nand(X,nand(nand(X,Y),nand(Z,nand(X,X)))) = nand(X,Y),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[71,224,theory(equality)]),211,theory(equality)]) ).
cnf(305,plain,
nand(X,Y) = nand(X,nand(nand(Y,X),X)),
inference('PARAMODULATE',[status(thm)],[242,sh_1,theory(equality)]) ).
cnf(328,plain,
nand(nand(nand(X,nand(Y,Y)),Y),nand(Z,Y)) = Y,
inference('REWRITE',[status(thm)],[191,305,theory(equality)]) ).
cnf(329,plain,
nand(nand(X,nand(Y,Y)),Y) = nand(Y,Y),
inference('REWRITE',[status(thm)],[50,305,theory(equality)]) ).
cnf(330,plain,
nand(nand(X,X),nand(Y,X)) = X,
inference('REWRITE',[status(thm)],[328,329,theory(equality)]) ).
cnf(331,plain,
$false,
inference('REWRITE',[status(thm)],[prove_meredith_2_basis_1,330,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : BOO075-1 : TPTP v8.1.0. Released v2.6.0.
% 0.04/0.12 % Command : run-snark %s %d
% 0.12/0.33 % Computer : n029.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 : Wed Jun 1 20:31:01 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.45 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.46 *
% 0.19/0.46 *
% 0.19/0.46 #<PACKAGE "SNARK-USER">
% 0.19/0.46 *
% 0.19/0.46 SNARK-TPTP-OPTIONS
% 0.19/0.46 *
% 0.19/0.46 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.19/0.46 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.19/0.46 (USE-FACTORING :POS)
% 0.19/0.46 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.19/0.46 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.19/0.46 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.19/0.46 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.19/0.46 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.19/0.46 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.19/0.46 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.19/0.46 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.19/0.46 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.19/0.46 (DECLARE-TPTP-SYMBOLS2))
% 0.19/0.46 *
% 0.19/0.46 "."
% 0.19/0.46 *
% 0.19/0.46 ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-01T20:31:01
% 0.19/0.46 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n029.cluster.edu at 2022-06-01T20:31:01
% 0.51/0.71
% 0.51/0.71
% 0.51/0.71 #||
% 0.51/0.71 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.51/0.71 % SZS output start Refutation
% See solution above
% 0.51/0.71 ||#
% 0.51/0.71
% 0.51/0.71 ; Summary of computation:
% 0.51/0.71 ; 1546 formulas have been input or derived (from 40 formulas).
% 0.51/0.71 ; 331 (21%) were retained. Of these,
% 0.51/0.71 ; 280 (85%) were simplified or subsumed later,
% 0.51/0.71 ; 51 (15%) are still being kept.
% 0.51/0.71 ;
% 0.51/0.71 ; Run time in seconds excluding printing time:
% 0.51/0.71 ; 0.001 0% Read assertion file (1 call)
% 0.51/0.71 ; 0.000 0% Assert (2 calls)
% 0.51/0.71 ; 0.051 21% Process new row (1,321 calls)
% 0.51/0.71 ; 0.004 2% Resolution (78 calls)
% 0.51/0.71 ; 0.038 15% Paramodulation (39 calls)
% 0.51/0.71 ; 0.059 24% Forward simplification (1,257 calls)
% 0.51/0.71 ; 0.046 19% Backward simplification (331 calls)
% 0.51/0.71 ; 0.018 7% Ordering (4,036 calls)
% 0.51/0.71 ; 0.000 0% Sortal reasoning (32 calls)
% 0.51/0.71 ; 0.000 0% Purity testing (1 call)
% 0.51/0.71 ; 0.030 12% Other
% 0.51/0.71 ; 0.247 Total
% 0.51/0.71 ; 0.249 Real time
% 0.51/0.71 ;
% 0.51/0.71 ; Term-hash-array has 1,267 terms in all.
% 0.51/0.71 ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 0.51/0.71 ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 0.51/0.71 ; Path-index has 171 entries (534 at peak, 1,350 added, 1,179 deleted).
% 0.51/0.71 ; Path-index has 1,369 nodes (1,808 at peak, 2,248 added, 879 deleted).
% 0.51/0.71 ; Trie-index has 171 entries (534 at peak, 1,350 added, 1,179 deleted).
% 0.51/0.71 ; Trie-index has 799 nodes (5,267 at peak, 10,869 added, 10,070 deleted).
% 0.51/0.71 ; Retrieved 12,007 generalization terms in 12,154 calls.
% 0.51/0.71 ; Retrieved 3,322 instance terms in 330 calls.
% 0.51/0.71 ; Retrieved 12,034 unifiable terms in 290 calls.
% 0.51/0.71 ;
% 0.51/0.71 ; The agenda of backward simplifiable rows to process has 55 entries:
% 0.51/0.71 ; 55 with value 0
% 0.51/0.71 ; The agenda of rows to process has 63 entries:
% 0.51/0.71 ; 1 with value 26 1 with value 39 1 with value 53
% 0.51/0.71 ; 1 with value 27 1 with value 40 2 with value 54
% 0.51/0.71 ; 2 with value 28 1 with value 42 2 with value 57
% 0.51/0.71 ; 2 with value 29 2 with value 43 1 with value 58
% 0.51/0.71 ; 1 with value 30 1 with value 44 1 with value 59
% 0.51/0.71 ; 7 with value 31 1 with value 45 2 with value 62
% 0.51/0.71 ; 4 with value 32 1 with value 46 2 with value 63
% 0.51/0.71 ; 1 with value 33 2 with value 47 1 with value 67
% 0.51/0.71 ; 5 with value 34 1 with value 48 1 with value 70
% 0.51/0.71 ; 7 with value 35 3 with value 49 1 with value 74
% 0.51/0.71 ; 3 with value 36 1 with value 52
% 0.51/0.71 ; The agenda of rows to give has 39 entries:
% 0.51/0.71 ; 1 with value (4 17) 6 with value (4 31) 1 with value (4 42)
% 0.51/0.71 ; 2 with value (4 19) 4 with value (4 32) 1 with value (4 43)
% 0.51/0.71 ; 1 with value (4 25) 3 with value (4 33) 1 with value (4 45)
% 0.51/0.71 ; 2 with value (4 26) 1 with value (4 34) 5 with value (4 46)
% 0.51/0.71 ; 3 with value (4 27) 4 with value (4 35) 2 with value (4 51)
% 0.51/0.71 ; 1 with value (4 30) 1 with value (4 36)
% 0.51/0.71 Evaluation took:
% 0.51/0.71 0.249 seconds of real time
% 0.51/0.71 0.226957 seconds of user run time
% 0.51/0.71 0.021912 seconds of system run time
% 0.51/0.71 [Run times include 0.007 seconds GC run time.]
% 0.51/0.71 0 calls to %EVAL
% 0.51/0.71 0 page faults and
% 0.51/0.71 18,722,112 bytes consed.
% 0.51/0.71 :PROOF-FOUND
% 0.51/0.71 ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-01T20:31:01
% 0.51/0.71 :PROOF-FOUND
% 0.51/0.71 *
%------------------------------------------------------------------------------