TSTP Solution File: LCL055-1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : LCL055-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n006.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:50 EDT 2022
% Result : Unsatisfiable 18.97s 19.15s
% Output : Refutation 18.97s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 5
% Syntax : Number of clauses : 26 ( 25 unt; 0 nHn; 7 RR)
% Number of literals : 28 ( 0 equ; 7 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 : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 61 ( 18 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_37,negated_conjecture,
~ is_a_theorem(implies(implies(implies(a,b),c),implies(not(a),c))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_cn_37) ).
cnf(11,plain,
~ is_a_theorem(implies(not(a),implies(a,b))),
inference('UR-RESOLVE',[status(thm)],[condensed_detachment,cn_1,prove_cn_37]) ).
cnf(12,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(13,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(14,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(57,plain,
is_a_theorem(implies(implies(not(implies(not(X),X)),implies(not(X),X)),X)),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,12,cn_2]) ).
cnf(60,plain,
is_a_theorem(implies(implies(implies(implies(not(X),X),Y),Z),implies(implies(X,Y),Z))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,12,cn_1]) ).
cnf(81,plain,
~ is_a_theorem(implies(implies(not(not(a)),X),implies(a,b))),
inference('UR-RESOLVE',[status(thm)],[condensed_detachment,13,11]) ).
cnf(84,plain,
is_a_theorem(implies(X,implies(implies(not(not(X)),not(X)),Y))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,13,12]) ).
cnf(170,plain,
~ is_a_theorem(implies(implies(not(implies(not(not(a)),X)),Y),implies(a,b))),
inference('UR-RESOLVE',[status(thm)],[condensed_detachment,81,13]) ).
cnf(727,plain,
is_a_theorem(implies(implies(X,not(Y)),implies(Y,implies(X,Z)))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,14,13]) ).
cnf(729,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,14,14]) ).
cnf(781,plain,
is_a_theorem(implies(X,implies(Y,implies(not(X),Z)))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,727,13]) ).
cnf(793,plain,
is_a_theorem(implies(implies(implies(X,implies(Y,Z)),U),implies(implies(Y,not(X)),U))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,727,cn_1]) ).
cnf(856,plain,
is_a_theorem(implies(implies(implies(X,implies(not(Y),Z)),U),implies(Y,U))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,781,cn_1]) ).
cnf(3670,plain,
is_a_theorem(implies(implies(X,implies(not(Y),Y)),implies(implies(Y,Z),implies(X,Z)))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,60,14]) ).
cnf(6131,plain,
is_a_theorem(implies(implies(X,implies(not(not(Y)),not(Y))),implies(Y,implies(X,Z)))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,729,84]) ).
cnf(8925,plain,
is_a_theorem(implies(implies(not(X),not(Y)),implies(implies(X,Z),implies(Y,Z)))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,3670,793]) ).
cnf(11476,plain,
~ is_a_theorem(implies(not(not(implies(not(not(a)),X))),not(a))),
inference('UR-RESOLVE',[status(thm)],[condensed_detachment,8925,170]) ).
cnf(23447,plain,
is_a_theorem(implies(not(X),implies(X,implies(Y,Z)))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,6131,856]) ).
cnf(23794,plain,
is_a_theorem(implies(implies(implies(X,implies(Y,Z)),U),implies(not(X),U))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,23447,cn_1]) ).
cnf(35182,plain,
$false,
inference('UR-RESOLVE',[status(thm)],[condensed_detachment,23794,57,11476]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : LCL055-1 : TPTP v8.1.0. Released v1.0.0.
% 0.06/0.12 % Command : run-snark %s %d
% 0.12/0.33 % Computer : n006.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 : Sun Jul 3 13:08:37 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.45 /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p 2022-07-03T13:08:37
% 0.19/0.46 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n006.cluster.edu at 2022-07-03T13:08:37
% 18.97/19.15
% 18.97/19.15
% 18.97/19.15 #||
% 18.97/19.15 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 18.97/19.15 % SZS output start Refutation
% See solution above
% 18.97/19.15 ||#
% 18.97/19.15
% 18.97/19.15 ; Summary of computation:
% 18.97/19.15 ; 53760 formulas have been input or derived (from 418 formulas).
% 18.97/19.15 ; 35182 (65%) were retained. Of these,
% 18.97/19.15 ; 227 ( 1%) were simplified or subsumed later,
% 18.97/19.15 ; 34955 (99%) are still being kept.
% 18.97/19.15 ;
% 18.97/19.15 ; Run time in seconds excluding printing time:
% 18.97/19.15 ; 0.001 0% Read assertion file (1 call)
% 18.97/19.15 ; 0.000 0% Assert (5 calls)
% 18.97/19.15 ; 4.820 26% Process new row (49,048 calls)
% 18.97/19.15 ; 9.167 49% Resolution (834 calls)
% 18.97/19.15 ; 0.396 2% Paramodulation (417 calls)
% 18.97/19.15 ; 0.000 0% Condensing (1 call)
% 18.97/19.15 ; 0.000 0% Forward subsumption (1 call)
% 18.97/19.15 ; 0.000 0% Backward subsumption (1 call)
% 18.97/19.15 ; 1.836 10% Forward simplification (48,823 calls)
% 18.97/19.15 ; 2.267 12% Backward simplification (35,182 calls)
% 18.97/19.15 ; 0.000 0% Sortal reasoning (32 calls)
% 18.97/19.15 ; 0.001 0% Purity testing (1 call)
% 18.97/19.15 ; 0.193 1% Other
% 18.97/19.15 ; 18.681 Total
% 18.97/19.15 ; 18.684 Real time
% 18.97/19.15 ;
% 18.97/19.15 ; Term-hash-array has 76,917 terms in all.
% 18.97/19.15 ; Feature-vector-row-index has 1 entry (1 at peak, 1 added, 0 deleted).
% 18.97/19.15 ; Feature-vector-row-index has 4 nodes (4 at peak, 4 added, 0 deleted).
% 18.97/19.15 ; Retrieved 0 possibly forward subsuming rows in 1 call.
% 18.97/19.15 ; Retrieved 0 possibly backward subsumed rows in 1 call.
% 18.97/19.15 ; Path-index has 76,351 entries (76,351 at peak, 76,986 added, 635 deleted).
% 18.97/19.15 ; Path-index has 20,515 nodes (20,515 at peak, 20,518 added, 3 deleted).
% 18.97/19.15 ; Trie-index has 76,351 entries (76,351 at peak, 76,986 added, 635 deleted).
% 18.97/19.15 ; Trie-index has 335,798 nodes (335,798 at peak, 337,771 added, 1,973 deleted).
% 18.97/19.15 ; Retrieved 458,072 generalization terms in 48,820 calls.
% 18.97/19.15 ; Retrieved 229,014 instance terms in 35,180 calls.
% 18.97/19.15 ; Retrieved 23,365,152 unifiable terms in 17,746 calls.
% 18.97/19.15 ;
% 18.97/19.15 ; The agenda of rows to process has 624 entries:
% 18.97/19.15 ; 1 with value 14 28 with value 26 29 with value 36
% 18.97/19.15 ; 1 with value 17 42 with value 27 51 with value 37
% 18.97/19.15 ; 4 with value 18 30 with value 28 64 with value 38
% 18.97/19.15 ; 6 with value 19 24 with value 29 69 with value 39
% 18.97/19.15 ; 5 with value 20 28 with value 30 27 with value 40
% 18.97/19.15 ; 9 with value 21 8 with value 31 30 with value 41
% 18.97/19.15 ; 27 with value 22 4 with value 32 4 with value 42
% 18.97/19.15 ; 15 with value 23 27 with value 33 2 with value 44
% 18.97/19.15 ; 15 with value 24 18 with value 34 1 with value 47
% 18.97/19.15 ; 28 with value 25 26 with value 35 1 with value 50
% 18.97/19.15 ; The agenda of rows to give has 34545 entries:
% 18.97/19.15 ; 22 with value (4 24) 280 with value (4 43) 19 with value (4 61)
% 18.97/19.15 ; 128 with value (4 25) 111 with value (4 44) 34 with value (4 62)
% 18.97/19.15 ; 247 with value (4 26) 54 with value (4 45) 12 with value (4 63)
% 18.97/19.15 ; 320 with value (4 27) 57 with value (4 46) 27 with value (4 64)
% 18.97/19.15 ; 478 with value (4 28) 39 with value (4 47) 18 with value (4 65)
% 18.97/19.15 ; 652 with value (4 29) 37 with value (4 48) 11 with value (4 66)
% 18.97/19.15 ; 788 with value (4 30) 43 with value (4 49) 16 with value (4 67)
% 18.97/19.15 ; 1032 with value (4 31) 26 with value (4 50) 13 with value (4 68)
% 18.97/19.15 ; 1353 with value (4 32) 24 with value (4 51) 11 with value (4 69)
% 18.97/19.15 ; 1690 with value (4 33) 40 with value (4 52) 12 with value (4 70)
% 18.97/19.15 ; 2296 with value (4 34) 39 with value (4 53) 12 with value (4 71)
% 18.97/19.15 ; 2811 with value (4 35) 30 with value (4 54) 2 with value (4 72)
% 18.97/19.15 ; 2965 with value (4 36) 33 with value (4 55) 8 with value (4 73)
% 18.97/19.15 ; 3282 with value (4 37) 26 with value (4 56) 9 with value (4 74)
% 18.97/19.15 ; 3888 with value (4 38) 28 with value (4 57) 2 with value (4 75)
% 18.97/19.15 ; 4224 with value (4 39) 31 with value (4 58) 1 with value (4 76)
% 18.97/19.15 ; 3779 with value (4 40) 15 with value (4 59) 7 with value (4 77)
% 18.97/19.15 ; 2395 with value (4 41) 29 with value (4 60) 2 with value (4 87)
% 18.97/19.15 ; 1037 with value (4 42)
% 18.97/19.15 Evaluation took:
% 18.97/19.15 18.688 seconds of real time
% 18.97/19.15 17.97872 seconds of user run time
% 18.97/19.15 0.707863 seconds of system run time
% 18.97/19.15 [Run times include 3.578 seconds GC run time.]
% 18.97/19.15 0 calls to %EVAL
% 18.97/19.15 0 page faults and
% 18.97/19.15 843,035,776 bytes consed.
% 18.97/19.15 :PROOF-FOUND
% 18.97/19.15 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-07-03T13:08:56
% 18.97/19.15 :PROOF-FOUND
% 18.97/19.15 *
%------------------------------------------------------------------------------