TSTP Solution File: LCL115-1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : LCL115-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:20:20 EDT 2022
% Result : Unsatisfiable 2.02s 2.19s
% Output : Refutation 2.02s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 6
% Syntax : Number of clauses : 21 ( 20 unt; 0 nHn; 5 RR)
% Number of literals : 23 ( 0 equ; 5 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 5 ( 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 : 38 ( 8 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(mv_1,axiom,
is_a_theorem(implies(X,implies(Y,X))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mv_1) ).
cnf(mv_2,axiom,
is_a_theorem(implies(implies(X,Y),implies(implies(Y,Z),implies(X,Z)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mv_2) ).
cnf(mv_3,axiom,
is_a_theorem(implies(implies(implies(X,Y),Y),implies(implies(Y,X),X))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mv_3) ).
cnf(mv_5,axiom,
is_a_theorem(implies(implies(not(X),not(Y)),implies(Y,X))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mv_5) ).
cnf(prove_mv_39,negated_conjecture,
~ is_a_theorem(implies(not(implies(a,b)),not(b))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_mv_39) ).
cnf(7,plain,
is_a_theorem(implies(X,implies(Y,implies(Z,Y)))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,mv_1,mv_1]) ).
cnf(10,plain,
~ is_a_theorem(implies(not(not(b)),not(not(implies(a,b))))),
inference('UR-RESOLVE',[status(thm)],[condensed_detachment,mv_5,prove_mv_39]) ).
cnf(13,plain,
is_a_theorem(implies(implies(implies(X,Y),Z),implies(Y,Z))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,mv_2,mv_1]) ).
cnf(14,plain,
is_a_theorem(implies(implies(implies(X,Y),Z),implies(implies(not(Y),not(X)),Z))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,mv_2,mv_5]) ).
cnf(25,plain,
is_a_theorem(implies(implies(implies(X,implies(Y,X)),Z),Z)),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,7,mv_3]) ).
cnf(30,plain,
is_a_theorem(implies(not(X),implies(X,Y))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,13,mv_5]) ).
cnf(31,plain,
is_a_theorem(implies(X,implies(implies(X,Y),Y))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,13,mv_3]) ).
cnf(42,plain,
is_a_theorem(implies(implies(implies(X,Y),Z),implies(not(X),Z))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,30,mv_2]) ).
cnf(151,plain,
is_a_theorem(implies(X,X)),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,25,13]) ).
cnf(166,plain,
is_a_theorem(implies(implies(implies(X,X),Y),Y)),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,151,31]) ).
cnf(390,plain,
~ is_a_theorem(implies(implies(not(b),X),not(not(implies(a,b))))),
inference('UR-RESOLVE',[status(thm)],[condensed_detachment,42,10]) ).
cnf(2615,plain,
is_a_theorem(implies(implies(not(X),not(implies(Y,Y))),X)),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,14,166]) ).
cnf(6626,plain,
is_a_theorem(implies(not(not(X)),X)),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,2615,42]) ).
cnf(6809,plain,
is_a_theorem(implies(X,not(not(X)))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,6626,mv_5]) ).
cnf(6977,plain,
$false,
inference('UR-RESOLVE',[status(thm)],[condensed_detachment,6809,14,390]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : LCL115-1 : TPTP v8.1.0. Released v1.0.0.
% 0.06/0.12 % Command : run-snark %s %d
% 0.12/0.33 % Computer : n028.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 : Sat Jul 2 13:21:17 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.44 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.45 *
% 0.19/0.45 *
% 0.19/0.45 #<PACKAGE "SNARK-USER">
% 0.19/0.45 *
% 0.19/0.45 SNARK-TPTP-OPTIONS
% 0.19/0.45 *
% 0.19/0.45 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.19/0.45 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.19/0.45 (USE-FACTORING :POS)
% 0.19/0.45 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.19/0.45 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.19/0.45 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.19/0.45 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.19/0.45 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.19/0.45 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.19/0.45 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.19/0.45 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.19/0.45 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.19/0.45 (DECLARE-TPTP-SYMBOLS2))
% 0.19/0.45 *
% 0.19/0.46 "."
% 0.19/0.46 *
% 0.19/0.46 ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-07-02T13:21:17
% 0.19/0.46 ; 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-02T13:21:17
% 2.02/2.19
% 2.02/2.19
% 2.02/2.19 #||
% 2.02/2.19 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.02/2.19 % SZS output start Refutation
% See solution above
% 2.02/2.19 ||#
% 2.02/2.19
% 2.02/2.19 ; Summary of computation:
% 2.02/2.19 ; 13062 formulas have been input or derived (from 158 formulas).
% 2.02/2.19 ; 6977 (53%) were retained. Of these,
% 2.02/2.19 ; 38 ( 1%) were simplified or subsumed later,
% 2.02/2.19 ; 6939 (99%) are still being kept.
% 2.02/2.19 ;
% 2.02/2.19 ; Run time in seconds excluding printing time:
% 2.02/2.19 ; 0.001 0% Read assertion file (1 call)
% 2.02/2.19 ; 0.000 0% Assert (6 calls)
% 2.02/2.19 ; 0.561 32% Process new row (10,931 calls)
% 2.02/2.19 ; 0.598 35% Resolution (314 calls)
% 2.02/2.19 ; 0.024 1% Paramodulation (157 calls)
% 2.02/2.19 ; 0.000 0% Condensing (1 call)
% 2.02/2.19 ; 0.000 0% Forward subsumption (1 call)
% 2.02/2.19 ; 0.000 0% Backward subsumption (1 call)
% 2.02/2.19 ; 0.293 17% Forward simplification (10,931 calls)
% 2.02/2.19 ; 0.184 11% Backward simplification (6,977 calls)
% 2.02/2.19 ; 0.000 0% Sortal reasoning (32 calls)
% 2.02/2.19 ; 0.000 0% Purity testing (1 call)
% 2.02/2.19 ; 0.072 4% Other
% 2.02/2.19 ; 1.733 Total
% 2.02/2.19 ; 1.734 Real time
% 2.02/2.19 ;
% 2.02/2.19 ; Term-hash-array has 15,651 terms in all.
% 2.02/2.19 ; Feature-vector-row-index has 1 entry (1 at peak, 1 added, 0 deleted).
% 2.02/2.19 ; Feature-vector-row-index has 4 nodes (4 at peak, 4 added, 0 deleted).
% 2.02/2.19 ; Retrieved 0 possibly forward subsuming rows in 1 call.
% 2.02/2.19 ; Retrieved 0 possibly backward subsumed rows in 1 call.
% 2.02/2.19 ; Path-index has 15,577 entries (15,577 at peak, 15,654 added, 77 deleted).
% 2.02/2.19 ; Path-index has 3,754 nodes (3,754 at peak, 3,759 added, 5 deleted).
% 2.02/2.19 ; Trie-index has 15,577 entries (15,577 at peak, 15,654 added, 77 deleted).
% 2.02/2.19 ; Trie-index has 37,970 nodes (37,970 at peak, 38,048 added, 78 deleted).
% 2.02/2.19 ; Retrieved 121,390 generalization terms in 10,928 calls.
% 2.02/2.19 ; Retrieved 24,887 instance terms in 6,975 calls.
% 2.02/2.19 ; Retrieved 1,794,534 unifiable terms in 5,502 calls.
% 2.02/2.19 ;
% 2.02/2.19 ; The agenda of rows to process has 324 entries:
% 2.02/2.19 ; 1 with value 11 19 with value 21 29 with value 28
% 2.02/2.19 ; 2 with value 13 20 with value 22 32 with value 29
% 2.02/2.19 ; 3 with value 14 12 with value 23 9 with value 30
% 2.02/2.19 ; 2 with value 16 30 with value 24 15 with value 31
% 2.02/2.19 ; 6 with value 17 15 with value 25 1 with value 32
% 2.02/2.19 ; 14 with value 18 37 with value 26 3 with value 33
% 2.02/2.19 ; 5 with value 19 56 with value 27 1 with value 34
% 2.02/2.19 ; 12 with value 20
% 2.02/2.19 ; The agenda of rows to give has 6782 entries:
% 2.02/2.19 ; 1 with value (4 17) 377 with value (4 26) 883 with value (4 32)
% 2.02/2.19 ; 17 with value (4 20) 417 with value (4 27) 663 with value (4 33)
% 2.02/2.19 ; 60 with value (4 21) 552 with value (4 28) 407 with value (4 34)
% 2.02/2.19 ; 104 with value (4 22) 660 with value (4 29) 227 with value (4 35)
% 2.02/2.19 ; 146 with value (4 23) 805 with value (4 30) 104 with value (4 36)
% 2.02/2.19 ; 202 with value (4 24) 842 with value (4 31) 31 with value (4 37)
% 2.02/2.19 ; 284 with value (4 25)
% 2.02/2.19 Evaluation took:
% 2.02/2.19 1.735 seconds of real time
% 2.02/2.19 1.647479 seconds of user run time
% 2.02/2.19 0.087851 seconds of system run time
% 2.02/2.19 [Run times include 0.199 seconds GC run time.]
% 2.02/2.19 0 calls to %EVAL
% 2.02/2.19 0 page faults and
% 2.02/2.19 118,779,600 bytes consed.
% 2.02/2.19 :PROOF-FOUND
% 2.02/2.19 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-07-02T13:21:19
% 2.02/2.19 :PROOF-FOUND
% 2.02/2.19 *
%------------------------------------------------------------------------------