TSTP Solution File: LCL053-1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : LCL053-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n028.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:48 EDT 2022
% Result : Unsatisfiable 11.80s 12.03s
% Output : Refutation 12.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 5
% Syntax : Number of clauses : 26 ( 25 unt; 0 nHn; 8 RR)
% Number of literals : 28 ( 0 equ; 8 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 6 ( 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 : 55 ( 15 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_30,negated_conjecture,
~ is_a_theorem(implies(implies(a,implies(a,b)),implies(a,b))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_cn_30) ).
cnf(8,plain,
~ is_a_theorem(implies(implies(implies(not(X),X),X),implies(implies(a,implies(a,b)),implies(a,b)))),
inference('UR-RESOLVE',[status(thm)],[condensed_detachment,prove_cn_30,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(320,plain,
is_a_theorem(implies(implies(X,not(Y)),implies(Y,implies(X,Z)))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,13,12]) ).
cnf(322,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(349,plain,
is_a_theorem(implies(X,implies(Y,implies(not(X),Z)))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,320,12]) ).
cnf(373,plain,
is_a_theorem(implies(implies(implies(X,implies(not(Y),Z)),U),implies(Y,U))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,349,cn_1]) ).
cnf(807,plain,
~ is_a_theorem(implies(implies(a,implies(a,b)),implies(not(implies(a,b)),implies(a,b)))),
inference('UR-RESOLVE',[status(thm)],[condensed_detachment,8,cn_1]) ).
cnf(2197,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(3382,plain,
~ is_a_theorem(implies(not(implies(a,b)),implies(implies(a,b),b))),
inference('UR-RESOLVE',[status(thm)],[condensed_detachment,322,807]) ).
cnf(3387,plain,
is_a_theorem(implies(implies(X,implies(not(not(Y)),not(Y))),implies(Y,implies(X,Z)))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,322,56]) ).
cnf(3486,plain,
~ is_a_theorem(implies(implies(X,X),implies(not(implies(a,b)),implies(implies(a,b),b)))),
inference('UR-RESOLVE',[status(thm)],[condensed_detachment,3382,53]) ).
cnf(15550,plain,
is_a_theorem(implies(not(X),implies(X,implies(Y,Z)))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,3387,373]) ).
cnf(15790,plain,
is_a_theorem(implies(implies(implies(X,implies(Y,Z)),U),implies(not(X),U))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,15550,cn_1]) ).
cnf(18296,plain,
~ is_a_theorem(implies(not(implies(a,b)),implies(not(implies(implies(a,b),b)),implies(implies(a,b),b)))),
inference('UR-RESOLVE',[status(thm)],[condensed_detachment,3486,2197]) ).
cnf(24727,plain,
is_a_theorem(implies(not(X),implies(Y,implies(X,Z)))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,15790,3387]) ).
cnf(24728,plain,
$false,
inference('REWRITE',[status(thm)],[18296,24727]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL053-1 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.13 % Command : run-snark %s %d
% 0.13/0.34 % Computer : n028.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 : Sat Jul 2 11:40:17 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.45 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.46 *
% 0.19/0.46 *
% 0.19/0.47 #<PACKAGE "SNARK-USER">
% 0.19/0.47 *
% 0.19/0.47 SNARK-TPTP-OPTIONS
% 0.19/0.47 *
% 0.19/0.47 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.19/0.47 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.19/0.47 (USE-FACTORING :POS)
% 0.19/0.47 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.19/0.47 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.19/0.47 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.19/0.47 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.19/0.47 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.19/0.47 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.19/0.47 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.19/0.47 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.19/0.47 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.19/0.47 (DECLARE-TPTP-SYMBOLS2))
% 0.19/0.47 *
% 0.19/0.47 "."
% 0.19/0.47 *
% 0.19/0.47 ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-07-02T11:40:17
% 0.19/0.47 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n028.cluster.edu at 2022-07-02T11:40:17
% 11.80/12.03
% 11.80/12.03
% 11.80/12.03 #||
% 11.80/12.03 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 11.80/12.03 % SZS output start Refutation
% See solution above
% 12.17/12.34 ||#
% 12.17/12.34
% 12.17/12.34 ; Summary of computation:
% 12.17/12.34 ; 39782 formulas have been input or derived (from 315 formulas).
% 12.17/12.34 ; 24728 (62%) were retained. Of these,
% 12.17/12.34 ; 205 ( 1%) were simplified or subsumed later,
% 12.17/12.34 ; 24523 (99%) are still being kept.
% 12.17/12.34 ;
% 12.17/12.34 ; Run time in seconds excluding printing time:
% 12.17/12.34 ; 0.001 0% Read assertion file (1 call)
% 12.17/12.34 ; 0.000 0% Assert (5 calls)
% 12.17/12.34 ; 3.061 26% Process new row (36,019 calls)
% 12.17/12.34 ; 5.721 50% Resolution (628 calls)
% 12.17/12.34 ; 0.208 2% Paramodulation (314 calls)
% 12.17/12.34 ; 0.000 0% Condensing (1 call)
% 12.17/12.34 ; 0.000 0% Forward subsumption (1 call)
% 12.17/12.34 ; 0.000 0% Backward subsumption (1 call)
% 12.17/12.34 ; 1.015 9% Forward simplification (35,984 calls)
% 12.17/12.34 ; 1.396 12% Backward simplification (24,728 calls)
% 12.17/12.34 ; 0.000 0% Sortal reasoning (32 calls)
% 12.17/12.34 ; 0.000 0% Purity testing (1 call)
% 12.17/12.34 ; 0.153 1% Other
% 12.17/12.34 ; 11.555 Total
% 12.17/12.34 ; 11.868 Real time
% 12.17/12.34 ;
% 12.17/12.34 ; Term-hash-array has 55,115 terms in all.
% 12.17/12.34 ; Feature-vector-row-index has 1 entry (1 at peak, 1 added, 0 deleted).
% 12.17/12.34 ; Feature-vector-row-index has 4 nodes (4 at peak, 4 added, 0 deleted).
% 12.17/12.34 ; Retrieved 0 possibly forward subsuming rows in 1 call.
% 12.17/12.34 ; Retrieved 0 possibly backward subsumed rows in 1 call.
% 12.17/12.34 ; Path-index has 54,597 entries (54,599 at peak, 55,180 added, 583 deleted).
% 12.17/12.34 ; Path-index has 17,482 nodes (17,482 at peak, 17,487 added, 5 deleted).
% 12.17/12.34 ; Trie-index has 54,597 entries (54,599 at peak, 55,180 added, 583 deleted).
% 12.17/12.34 ; Trie-index has 250,978 nodes (250,996 at peak, 252,876 added, 1,898 deleted).
% 12.17/12.34 ; Retrieved 319,556 generalization terms in 35,981 calls.
% 12.17/12.34 ; Retrieved 148,804 instance terms in 24,726 calls.
% 12.17/12.34 ; Retrieved 14,762,582 unifiable terms in 14,464 calls.
% 12.17/12.34 ;
% 12.17/12.34 ; The agenda of rows to process has 487 entries:
% 12.17/12.34 ; 4 with value 20 26 with value 29 47 with value 38
% 12.17/12.34 ; 8 with value 21 23 with value 30 47 with value 39
% 12.17/12.34 ; 25 with value 22 7 with value 31 22 with value 40
% 12.17/12.34 ; 13 with value 23 2 with value 32 13 with value 41
% 12.17/12.34 ; 16 with value 24 24 with value 33 4 with value 42
% 12.17/12.34 ; 27 with value 25 14 with value 34 2 with value 43
% 12.17/12.34 ; 20 with value 26 18 with value 35 1 with value 47
% 12.17/12.34 ; 37 with value 27 25 with value 36 1 with value 50
% 12.17/12.34 ; 24 with value 28 37 with value 37
% 12.17/12.34 ; The agenda of rows to give has 24212 entries:
% 12.17/12.34 ; 1 with value (4 19) 1747 with value (4 41) 17 with value (4 60)
% 12.17/12.34 ; 1 with value (4 20) 938 with value (4 42) 17 with value (4 61)
% 12.17/12.34 ; 20 with value (4 24) 207 with value (4 43) 21 with value (4 62)
% 12.17/12.34 ; 104 with value (4 25) 37 with value (4 44) 4 with value (4 63)
% 12.17/12.34 ; 162 with value (4 26) 38 with value (4 45) 16 with value (4 64)
% 12.17/12.34 ; 239 with value (4 27) 46 with value (4 46) 15 with value (4 65)
% 12.17/12.34 ; 352 with value (4 28) 30 with value (4 47) 8 with value (4 66)
% 12.17/12.34 ; 538 with value (4 29) 33 with value (4 48) 3 with value (4 67)
% 12.17/12.34 ; 600 with value (4 30) 43 with value (4 49) 14 with value (4 68)
% 12.17/12.34 ; 656 with value (4 31) 21 with value (4 50) 2 with value (4 69)
% 12.17/12.34 ; 974 with value (4 32) 25 with value (4 51) 6 with value (4 70)
% 12.17/12.34 ; 1261 with value (4 33) 30 with value (4 52) 8 with value (4 71)
% 12.17/12.34 ; 1598 with value (4 34) 27 with value (4 53) 1 with value (4 72)
% 12.17/12.34 ; 1878 with value (4 35) 21 with value (4 54) 5 with value (4 73)
% 12.17/12.34 ; 1983 with value (4 36) 22 with value (4 55) 6 with value (4 74)
% 12.17/12.34 ; 2402 with value (4 37) 24 with value (4 56) 1 with value (4 75)
% 12.17/12.34 ; 2562 with value (4 38) 14 with value (4 57) 5 with value (4 77)
% 12.17/12.34 ; 2846 with value (4 39) 21 with value (4 58) 2 with value (4 83)
% 12.17/12.34 ; 2548 with value (4 40) 12 with value (4 59)
% 12.17/12.34 Evaluation took:
% 12.17/12.34 11.87 seconds of real time
% 12.17/12.34 11.384032 seconds of user run time
% 12.17/12.34 0.483825 seconds of system run time
% 12.17/12.34 [Run times include 2.166 seconds GC run time.]
% 12.17/12.34 0 calls to %EVAL
% 12.17/12.34 0 page faults and
% 12.17/12.34 567,864,160 bytes consed.
% 12.17/12.34 :PROOF-FOUND
% 12.17/12.34 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-07-02T11:40:29
% 12.17/12.34 :PROOF-FOUND
% 12.17/12.34 *
%------------------------------------------------------------------------------