TSTP Solution File: LCL405-1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : LCL405-1 : TPTP v8.1.0. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n005.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:22:39 EDT 2022
% Result : Unsatisfiable 3.20s 3.39s
% Output : Refutation 3.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 5
% Syntax : Number of clauses : 31 ( 30 unt; 0 nHn; 4 RR)
% Number of literals : 33 ( 0 equ; 4 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 78 ( 24 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(condensed_detachment,axiom,
( ~ is_a_theorem(implies(X,Y))
| ~ is_a_theorem(X)
| is_a_theorem(Y) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',condensed_detachment) ).
cnf(cn_1,axiom,
is_a_theorem(implies(implies(X,Y),implies(implies(Y,Z),implies(X,Z)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_1) ).
cnf(cn_2,axiom,
is_a_theorem(implies(implies(not(X),X),X)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_2) ).
cnf(cn_3,axiom,
is_a_theorem(implies(X,implies(not(X),Y))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_3) ).
cnf(prove_cn_71,negated_conjecture,
~ is_a_theorem(not(implies(implies(x,x),not(implies(y,y))))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_cn_71) ).
cnf(10,plain,
~ is_a_theorem(implies(not(not(implies(implies(x,x),not(implies(y,y))))),not(implies(implies(x,x),not(implies(y,y)))))),
inference('UR-RESOLVE',[status(thm)],[condensed_detachment,prove_cn_71,cn_2]) ).
cnf(11,plain,
is_a_theorem(implies(implies(X,Y),implies(implies(not(X),X),Y))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,cn_1,cn_2]) ).
cnf(12,plain,
is_a_theorem(implies(implies(implies(not(X),Y),Z),implies(X,Z))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,cn_1,cn_3]) ).
cnf(13,plain,
is_a_theorem(implies(implies(implies(implies(X,Y),implies(Z,Y)),U),implies(implies(Z,X),U))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,cn_1,cn_1]) ).
cnf(39,plain,
is_a_theorem(implies(implies(implies(implies(not(X),X),Y),Z),implies(implies(X,Y),Z))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,11,cn_1]) ).
cnf(53,plain,
is_a_theorem(implies(X,X)),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,12,cn_2]) ).
cnf(56,plain,
is_a_theorem(implies(X,implies(implies(not(not(X)),not(X)),Y))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,12,11]) ).
cnf(63,plain,
is_a_theorem(implies(not(implies(X,X)),Y)),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,53,cn_3]) ).
cnf(68,plain,
is_a_theorem(implies(implies(X,Y),implies(not(implies(Z,Z)),Y))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,63,cn_1]) ).
cnf(153,plain,
is_a_theorem(implies(X,implies(not(implies(Y,Y)),Z))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,68,12]) ).
cnf(261,plain,
is_a_theorem(implies(implies(X,not(Y)),implies(Y,implies(X,Z)))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,13,12]) ).
cnf(262,plain,
is_a_theorem(implies(implies(X,implies(Y,Z)),implies(implies(U,Y),implies(X,implies(U,Z))))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,13,13]) ).
cnf(284,plain,
is_a_theorem(implies(X,implies(Y,implies(not(X),Z)))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,261,12]) ).
cnf(304,plain,
is_a_theorem(implies(implies(implies(X,implies(not(Y),Z)),U),implies(Y,U))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,284,cn_1]) ).
cnf(688,plain,
is_a_theorem(implies(implies(X,implies(not(Y),Y)),implies(implies(Y,Z),implies(X,Z)))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,39,13]) ).
cnf(1114,plain,
is_a_theorem(implies(implies(X,implies(not(not(Y)),not(Y))),implies(Y,implies(X,Z)))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,262,56]) ).
cnf(1675,plain,
is_a_theorem(implies(implies(implies(X,X),Y),implies(Z,Y))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,688,153]) ).
cnf(4195,plain,
is_a_theorem(implies(not(X),implies(X,implies(Y,Z)))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,1114,304]) ).
cnf(4197,plain,
is_a_theorem(implies(X,implies(implies(implies(Y,Y),not(X)),Z))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,1114,1675]) ).
cnf(4259,plain,
is_a_theorem(implies(implies(implies(X,implies(Y,Z)),U),implies(not(X),U))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,4195,cn_1]) ).
cnf(4364,plain,
is_a_theorem(implies(implies(implies(X,X),not(implies(Y,Y))),Z)),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,4197,53]) ).
cnf(5761,plain,
is_a_theorem(implies(not(X),implies(Y,implies(X,Z)))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,4259,1114]) ).
cnf(5861,plain,
is_a_theorem(implies(implies(implies(X,Y),Z),implies(not(X),Z))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,5761,688]) ).
cnf(6104,plain,
is_a_theorem(implies(implies(X,Y),implies(not(not(X)),Y))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,5861,39]) ).
cnf(7427,plain,
is_a_theorem(implies(not(not(implies(implies(X,X),not(implies(Y,Y))))),Z)),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,6104,4364]) ).
cnf(7428,plain,
$false,
inference('REWRITE',[status(thm)],[10,7427]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : LCL405-1 : TPTP v8.1.0. Released v2.3.0.
% 0.04/0.13 % Command : run-snark %s %d
% 0.13/0.34 % Computer : n005.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Mon Jul 4 17:06:07 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.21/0.46 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.47 *
% 0.21/0.47 *
% 0.21/0.47 #<PACKAGE "SNARK-USER">
% 0.21/0.47 *
% 0.21/0.47 SNARK-TPTP-OPTIONS
% 0.21/0.47 *
% 0.21/0.48 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.21/0.48 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.21/0.48 (USE-FACTORING :POS)
% 0.21/0.48 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.21/0.48 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.21/0.48 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.21/0.48 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.21/0.48 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.21/0.48 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.21/0.48 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.21/0.48 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.21/0.48 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.21/0.48 (DECLARE-TPTP-SYMBOLS2))
% 0.21/0.48 *
% 0.21/0.48 "."
% 0.21/0.48 *
% 0.21/0.48 ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-07-04T17:06:07
% 0.21/0.48 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n005.cluster.edu at 2022-07-04T17:06:07
% 3.20/3.39
% 3.20/3.39
% 3.20/3.39 #||
% 3.20/3.39 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.20/3.39 % SZS output start Refutation
% See solution above
% 3.20/3.41 ||#
% 3.20/3.41
% 3.20/3.41 ; Summary of computation:
% 3.20/3.41 ; 20435 formulas have been input or derived (from 159 formulas).
% 3.20/3.41 ; 7428 (36%) were retained. Of these,
% 3.20/3.41 ; 370 ( 5%) were simplified or subsumed later,
% 3.20/3.41 ; 7058 (95%) are still being kept.
% 3.20/3.41 ;
% 3.20/3.41 ; Run time in seconds excluding printing time:
% 3.20/3.41 ; 0.001 0% Read assertion file (1 call)
% 3.20/3.41 ; 0.000 0% Assert (5 calls)
% 3.20/3.41 ; 0.834 29% Process new row (16,756 calls)
% 3.20/3.41 ; 1.364 47% Resolution (316 calls)
% 3.20/3.41 ; 0.085 3% Paramodulation (158 calls)
% 3.20/3.41 ; 0.000 0% Condensing (1 call)
% 3.20/3.41 ; 0.000 0% Forward subsumption (1 call)
% 3.20/3.41 ; 0.000 0% Backward subsumption (1 call)
% 3.20/3.41 ; 0.293 10% Forward simplification (16,722 calls)
% 3.20/3.41 ; 0.245 8% Backward simplification (7,428 calls)
% 3.20/3.41 ; 0.000 0% Sortal reasoning (32 calls)
% 3.20/3.41 ; 0.000 0% Purity testing (1 call)
% 3.20/3.41 ; 0.087 3% Other
% 3.20/3.41 ; 2.909 Total
% 3.20/3.41 ; 2.935 Real time
% 3.20/3.41 ;
% 3.20/3.41 ; Term-hash-array has 19,599 terms in all.
% 3.20/3.41 ; Feature-vector-row-index has 1 entry (1 at peak, 1 added, 0 deleted).
% 3.20/3.41 ; Feature-vector-row-index has 4 nodes (4 at peak, 4 added, 0 deleted).
% 3.20/3.41 ; Retrieved 0 possibly forward subsuming rows in 1 call.
% 3.20/3.41 ; Retrieved 0 possibly backward subsumed rows in 1 call.
% 3.20/3.41 ; Path-index has 18,648 entries (18,651 at peak, 19,665 added, 1,017 deleted).
% 3.20/3.41 ; Path-index has 14,915 nodes (14,927 at peak, 14,947 added, 32 deleted).
% 3.20/3.41 ; Trie-index has 18,648 entries (18,651 at peak, 19,665 added, 1,017 deleted).
% 3.20/3.41 ; Trie-index has 111,640 nodes (111,697 at peak, 114,794 added, 3,154 deleted).
% 3.20/3.41 ; Retrieved 91,509 generalization terms in 16,719 calls.
% 3.20/3.41 ; Retrieved 34,676 instance terms in 7,426 calls.
% 3.20/3.41 ; Retrieved 2,729,265 unifiable terms in 10,276 calls.
% 3.20/3.41 ;
% 3.20/3.41 ; The agenda of rows to process has 219 entries:
% 3.20/3.41 ; 31 with value 30 41 with value 35 1 with value 40
% 3.20/3.41 ; 17 with value 31 2 with value 36 1 with value 41
% 3.20/3.41 ; 20 with value 32 6 with value 37 4 with value 42
% 3.20/3.41 ; 53 with value 33 10 with value 38 4 with value 44
% 3.20/3.41 ; 18 with value 34 10 with value 39 1 with value 47
% 3.20/3.41 ; The agenda of rows to give has 6905 entries:
% 3.20/3.41 ; 4 with value (4 24) 307 with value (4 41) 2 with value (4 57)
% 3.20/3.41 ; 40 with value (4 25) 238 with value (4 42) 2 with value (4 58)
% 3.20/3.41 ; 49 with value (4 26) 114 with value (4 43) 1 with value (4 59)
% 3.20/3.41 ; 113 with value (4 27) 74 with value (4 44) 1 with value (4 60)
% 3.20/3.41 ; 181 with value (4 28) 33 with value (4 45) 1 with value (4 61)
% 3.20/3.41 ; 245 with value (4 29) 38 with value (4 46) 3 with value (4 62)
% 3.20/3.41 ; 254 with value (4 30) 27 with value (4 47) 1 with value (4 63)
% 3.20/3.41 ; 210 with value (4 31) 31 with value (4 48) 2 with value (4 64)
% 3.20/3.41 ; 326 with value (4 32) 29 with value (4 49) 9 with value (4 65)
% 3.20/3.41 ; 493 with value (4 33) 9 with value (4 50) 3 with value (4 66)
% 3.20/3.41 ; 567 with value (4 34) 17 with value (4 51) 1 with value (4 67)
% 3.20/3.41 ; 569 with value (4 35) 15 with value (4 52) 1 with value (4 68)
% 3.20/3.41 ; 460 with value (4 36) 12 with value (4 53) 3 with value (4 71)
% 3.20/3.41 ; 575 with value (4 37) 8 with value (4 54) 1 with value (4 73)
% 3.20/3.41 ; 777 with value (4 38) 6 with value (4 55) 4 with value (4 77)
% 3.20/3.41 ; 618 with value (4 39) 8 with value (4 56) 2 with value (4 84)
% 3.20/3.41 ; 421 with value (4 40)
% 3.20/3.41 Evaluation took:
% 3.20/3.41 2.936 seconds of real time
% 3.20/3.41 2.777714 seconds of user run time
% 3.20/3.41 0.157249 seconds of system run time
% 3.20/3.41 [Run times include 0.347 seconds GC run time.]
% 3.20/3.41 0 calls to %EVAL
% 3.20/3.41 0 page faults and
% 3.20/3.41 178,175,144 bytes consed.
% 3.20/3.41 :PROOF-FOUND
% 3.20/3.41 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-07-04T17:06:10
% 3.20/3.41 :PROOF-FOUND
% 3.20/3.41 *
%------------------------------------------------------------------------------