TSTP Solution File: LCL016-1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : LCL016-1 : TPTP v8.1.0. Released v1.0.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 : Sun Jul 17 14:19:35 EDT 2022
% Result : Unsatisfiable 201.02s 201.23s
% Output : Refutation 201.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 3
% Syntax : Number of clauses : 45 ( 44 unt; 0 nHn; 4 RR)
% Number of literals : 47 ( 0 equ; 4 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 9 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 143 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(condensed_detachment,axiom,
( ~ is_a_theorem(equivalent(X,Y))
| ~ is_a_theorem(X)
| is_a_theorem(Y) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',condensed_detachment) ).
cnf(yro,axiom,
is_a_theorem(equivalent(equivalent(X,Y),equivalent(Z,equivalent(equivalent(Z,Y),X)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',yro) ).
cnf(prove_yrm,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(a,b),equivalent(c,equivalent(equivalent(b,c),a)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_yrm) ).
cnf(4,plain,
is_a_theorem(equivalent(X,equivalent(equivalent(X,equivalent(Y,equivalent(equivalent(Y,Z),U))),equivalent(U,Z)))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,yro,yro]) ).
cnf(7,plain,
is_a_theorem(equivalent(equivalent(equivalent(equivalent(X,Y),equivalent(Z,equivalent(equivalent(Z,Y),X))),equivalent(U,equivalent(equivalent(U,V),W))),equivalent(W,V))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,4,yro]) ).
cnf(19,plain,
is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(X,Y),Z),Y),X),Z)),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,7,7]) ).
cnf(27,plain,
is_a_theorem(equivalent(X,equivalent(equivalent(X,Y),equivalent(equivalent(equivalent(equivalent(Z,U),Y),U),Z)))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,19,yro]) ).
cnf(30,plain,
is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(equivalent(equivalent(X,Y),Z),Y),X),Z),equivalent(U,equivalent(equivalent(U,V),W))),equivalent(W,V))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,19,4]) ).
cnf(35,plain,
is_a_theorem(equivalent(equivalent(equivalent(equivalent(X,Y),equivalent(Z,equivalent(equivalent(Z,Y),X))),U),equivalent(equivalent(equivalent(equivalent(V,W),U),W),V))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,27,yro]) ).
cnf(92,plain,
is_a_theorem(equivalent(equivalent(equivalent(equivalent(X,Y),equivalent(equivalent(Z,U),equivalent(V,equivalent(equivalent(V,U),Z)))),Y),X)),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,35,7]) ).
cnf(93,plain,
is_a_theorem(equivalent(equivalent(equivalent(equivalent(X,Y),equivalent(equivalent(equivalent(equivalent(equivalent(Z,U),V),U),Z),V)),Y),X)),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,35,30]) ).
cnf(109,plain,
is_a_theorem(equivalent(equivalent(equivalent(equivalent(X,Y),equivalent(Z,equivalent(equivalent(Z,Y),X))),U),U)),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,92,19]) ).
cnf(124,plain,
is_a_theorem(equivalent(X,equivalent(equivalent(X,Y),Y))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,109,19]) ).
cnf(134,plain,
is_a_theorem(equivalent(equivalent(equivalent(X,equivalent(equivalent(X,Y),Y)),Z),Z)),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,124,124]) ).
cnf(135,plain,
is_a_theorem(equivalent(X,equivalent(equivalent(X,equivalent(equivalent(Y,Z),Z)),Y))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,124,yro]) ).
cnf(142,plain,
is_a_theorem(equivalent(equivalent(equivalent(X,equivalent(equivalent(X,equivalent(Y,equivalent(equivalent(Y,Z),U))),equivalent(U,Z))),V),V)),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,124,4]) ).
cnf(143,plain,
is_a_theorem(equivalent(equivalent(equivalent(X,equivalent(equivalent(X,Y),equivalent(equivalent(equivalent(equivalent(Z,U),Y),U),Z))),V),V)),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,124,27]) ).
cnf(156,plain,
is_a_theorem(equivalent(equivalent(equivalent(X,X),Y),Y)),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,134,19]) ).
cnf(168,plain,
is_a_theorem(equivalent(X,X)),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,156,156]) ).
cnf(187,plain,
is_a_theorem(equivalent(equivalent(equivalent(X,X),equivalent(equivalent(Y,Z),Z)),Y)),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,135,156]) ).
cnf(190,plain,
is_a_theorem(equivalent(X,equivalent(equivalent(X,equivalent(equivalent(Y,equivalent(equivalent(Z,U),U)),Z)),Y))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,135,yro]) ).
cnf(246,plain,
is_a_theorem(equivalent(equivalent(equivalent(X,Y),X),Y)),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,187,7]) ).
cnf(264,plain,
is_a_theorem(equivalent(X,equivalent(equivalent(X,Y),equivalent(equivalent(Z,Y),Z)))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,246,yro]) ).
cnf(265,plain,
is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(X,Y),X),Y),Z),Z)),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,246,124]) ).
cnf(343,plain,
is_a_theorem(equivalent(equivalent(equivalent(X,X),Y),equivalent(equivalent(Z,Y),Z))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,264,168]) ).
cnf(349,plain,
is_a_theorem(equivalent(X,equivalent(equivalent(X,equivalent(equivalent(Y,Z),equivalent(equivalent(U,Z),U))),Y))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,264,yro]) ).
cnf(502,plain,
is_a_theorem(equivalent(equivalent(X,equivalent(equivalent(equivalent(Y,Z),Y),Z)),X)),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,265,343]) ).
cnf(1514,plain,
is_a_theorem(equivalent(equivalent(X,equivalent(equivalent(X,Y),Z)),equivalent(Z,Y))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,502,4]) ).
cnf(2006,plain,
is_a_theorem(equivalent(equivalent(equivalent(X,equivalent(equivalent(Y,Z),Z)),Y),X)),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,190,502]) ).
cnf(2899,plain,
is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(X,Y),Y),Z),X),Z)),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,2006,19]) ).
cnf(15627,plain,
is_a_theorem(equivalent(equivalent(equivalent(X,Y),equivalent(equivalent(Z,Y),Z)),X)),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,349,502]) ).
cnf(15939,plain,
is_a_theorem(equivalent(equivalent(equivalent(X,Y),equivalent(equivalent(Z,X),Z)),Y)),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,15627,19]) ).
cnf(16091,plain,
is_a_theorem(equivalent(equivalent(X,Y),equivalent(Y,X))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,15939,1514]) ).
cnf(16198,plain,
is_a_theorem(equivalent(X,equivalent(equivalent(X,equivalent(Y,Z)),equivalent(Z,Y)))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,16091,yro]) ).
cnf(16201,plain,
~ is_a_theorem(equivalent(equivalent(c,equivalent(equivalent(b,c),a)),equivalent(a,b))),
inference('UR-RESOLVE',[status(thm)],[condensed_detachment,16091,prove_yrm]) ).
cnf(19942,plain,
is_a_theorem(equivalent(equivalent(equivalent(X,equivalent(Y,Z)),equivalent(Z,Y)),X)),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,16198,16091]) ).
cnf(38053,plain,
is_a_theorem(equivalent(equivalent(equivalent(equivalent(X,equivalent(equivalent(X,Y),Z)),U),equivalent(Z,Y)),U)),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,142,93]) ).
cnf(38168,plain,
is_a_theorem(equivalent(equivalent(X,equivalent(equivalent(X,Y),equivalent(Z,Y))),Z)),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,38053,2006]) ).
cnf(38318,plain,
is_a_theorem(equivalent(equivalent(equivalent(equivalent(X,Y),Y),Z),equivalent(X,Z))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,38168,2899]) ).
cnf(42886,plain,
is_a_theorem(equivalent(equivalent(equivalent(X,Y),equivalent(equivalent(equivalent(equivalent(Z,U),X),U),Z)),Y)),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,143,93]) ).
cnf(43005,plain,
is_a_theorem(equivalent(equivalent(X,Y),equivalent(equivalent(equivalent(Y,Z),X),Z))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,42886,1514]) ).
cnf(43159,plain,
is_a_theorem(equivalent(X,equivalent(equivalent(equivalent(Y,Z),equivalent(X,Y)),Z))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,43005,38318]) ).
cnf(43683,plain,
is_a_theorem(equivalent(equivalent(equivalent(equivalent(X,Y),equivalent(Z,X)),Y),Z)),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,43159,16091]) ).
cnf(44802,plain,
is_a_theorem(equivalent(equivalent(X,equivalent(Y,Z)),equivalent(equivalent(Z,Y),X))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,43683,19942]) ).
cnf(44929,plain,
$false,
inference('UR-RESOLVE',[status(thm)],[condensed_detachment,44802,43005,16201]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : LCL016-1 : TPTP v8.1.0. Released v1.0.0.
% 0.04/0.14 % Command : run-snark %s %d
% 0.15/0.36 % Computer : n029.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 600
% 0.15/0.36 % DateTime : Mon Jul 4 19:19:27 EDT 2022
% 0.15/0.36 % CPUTime :
% 0.22/0.48 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.22/0.49 *
% 0.22/0.49 *
% 0.22/0.50 #<PACKAGE "SNARK-USER">
% 0.22/0.50 *
% 0.22/0.50 SNARK-TPTP-OPTIONS
% 0.22/0.50 *
% 0.22/0.50 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.22/0.50 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.22/0.50 (USE-FACTORING :POS)
% 0.22/0.50 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.22/0.50 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.22/0.50 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.22/0.50 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.22/0.50 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.22/0.50 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.22/0.50 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.22/0.50 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.22/0.50 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.22/0.50 (DECLARE-TPTP-SYMBOLS2))
% 0.22/0.50 *
% 0.22/0.50 "."
% 0.22/0.50 *
% 0.22/0.50 ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-07-04T19:19:27
% 0.22/0.50 ; 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-07-04T19:19:27
% 201.02/201.23
% 201.02/201.23
% 201.02/201.23 #||
% 201.02/201.23 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 201.02/201.23 % SZS output start Refutation
% See solution above
% 201.11/201.28 ||#
% 201.11/201.28
% 201.11/201.28 ; Summary of computation:
% 201.11/201.28 ; 168871 formulas have been input or derived (from 400 formulas).
% 201.11/201.28 ; 44929 (27%) were retained. Of these,
% 201.11/201.28 ; 44929 (100%) are still being kept.
% 201.11/201.28 ;
% 201.11/201.28 ; Run time in seconds excluding printing time:
% 201.11/201.28 ; 0.001 0% Read assertion file (1 call)
% 201.11/201.28 ; 0.000 0% Assert (3 calls)
% 201.11/201.28 ; 7.882 4% Process new row (152,671 calls)
% 201.11/201.28 ; 162.242 81% Resolution (798 calls)
% 201.11/201.28 ; 2.702 1% Paramodulation (399 calls)
% 201.11/201.28 ; 0.000 0% Condensing (1 call)
% 201.11/201.28 ; 0.000 0% Forward subsumption (1 call)
% 201.11/201.28 ; 0.001 0% Backward subsumption (1 call)
% 201.11/201.28 ; 8.242 4% Forward simplification (152,671 calls)
% 201.11/201.28 ; 19.006 9% Backward simplification (44,929 calls)
% 201.11/201.28 ; 0.000 0% Sortal reasoning (32 calls)
% 201.11/201.28 ; 0.000 0% Purity testing (1 call)
% 201.11/201.28 ; 0.653 0% Other
% 201.11/201.28 ; 200.729 Total
% 201.11/201.28 ; 200.780 Real time
% 201.11/201.28 ;
% 201.11/201.28 ; Term-hash-array has 119,746 terms in all.
% 201.11/201.28 ; Feature-vector-row-index has 1 entry (1 at peak, 1 added, 0 deleted).
% 201.11/201.28 ; Feature-vector-row-index has 4 nodes (4 at peak, 4 added, 0 deleted).
% 201.11/201.28 ; Retrieved 0 possibly forward subsuming rows in 1 call.
% 201.11/201.28 ; Retrieved 0 possibly backward subsumed rows in 1 call.
% 201.11/201.28 ; Path-index has 119,749 entries (119,749 at peak, 119,749 added, 0 deleted).
% 201.11/201.28 ; Path-index has 9,756 nodes (9,756 at peak, 9,756 added, 0 deleted).
% 201.11/201.28 ; Trie-index has 119,749 entries (119,749 at peak, 119,749 added, 0 deleted).
% 201.11/201.28 ; Trie-index has 231,747 nodes (231,747 at peak, 231,747 added, 0 deleted).
% 201.11/201.28 ; Retrieved 5,294,835 generalization terms in 152,668 calls.
% 201.11/201.28 ; Retrieved 4,245,448 instance terms in 44,927 calls.
% 201.11/201.28 ; Retrieved 303,501,045 unifiable terms in 87,407 calls.
% 201.11/201.28 ;
% 201.11/201.28 ; The agenda of rows to process has 1298 entries:
% 201.11/201.28 ; 32 with value 28 10 with value 46 10 with value 55
% 201.11/201.28 ; 32 with value 33 24 with value 47 8 with value 57
% 201.11/201.28 ; 68 with value 34 96 with value 48 8 with value 58
% 201.11/201.28 ; 122 with value 38 71 with value 49 2 with value 61
% 201.11/201.28 ; 194 with value 39 29 with value 50 1 with value 63
% 201.11/201.28 ; 70 with value 40 4 with value 51 1 with value 64
% 201.11/201.28 ; 1 with value 42 55 with value 52 1 with value 65
% 201.11/201.28 ; 152 with value 43 21 with value 53 1 with value 66
% 201.11/201.28 ; 210 with value 44 6 with value 54 1 with value 71
% 201.11/201.28 ; 68 with value 45
% 201.11/201.28 ; The agenda of rows to give has 44529 entries:
% 201.11/201.28 ; 152 with value (4 38) 3753 with value (4 50) 426 with value (4 61)
% 201.11/201.28 ; 201 with value (4 39) 4449 with value (4 51) 381 with value (4 62)
% 201.11/201.28 ; 406 with value (4 40) 5274 with value (4 52) 339 with value (4 63)
% 201.11/201.28 ; 612 with value (4 41) 2700 with value (4 53) 203 with value (4 64)
% 201.11/201.28 ; 817 with value (4 42) 1929 with value (4 54) 127 with value (4 65)
% 201.11/201.28 ; 995 with value (4 43) 1644 with value (4 55) 68 with value (4 66)
% 201.11/201.28 ; 1171 with value (4 44) 1245 with value (4 56) 77 with value (4 67)
% 201.11/201.28 ; 1600 with value (4 45) 1027 with value (4 57) 99 with value (4 68)
% 201.11/201.28 ; 2383 with value (4 46) 591 with value (4 58) 60 with value (4 69)
% 201.11/201.28 ; 3067 with value (4 47) 555 with value (4 59) 70 with value (4 70)
% 201.11/201.28 ; 3808 with value (4 48) 581 with value (4 60) 5 with value (4 71)
% 201.11/201.28 ; 3714 with value (4 49)
% 201.11/201.28 Evaluation took:
% 201.11/201.28 200.785 seconds of real time
% 201.11/201.28 198.73544 seconds of user run time
% 201.11/201.28 2.045481 seconds of system run time
% 201.11/201.28 [Run times include 16.98 seconds GC run time.]
% 201.11/201.28 0 calls to %EVAL
% 201.11/201.28 0 page faults and
% 201.11/201.28 5,051,284,096 bytes consed.
% 201.11/201.28 :PROOF-FOUND
% 201.11/201.28 ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-07-04T19:22:47
% 201.11/201.28 :PROOF-FOUND
% 201.11/201.28 *
%------------------------------------------------------------------------------