TSTP Solution File: LCL086-1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : LCL086-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n013.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:06 EDT 2022
% Result : Unsatisfiable 0.44s 0.61s
% Output : Refutation 0.44s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 3
% Syntax : Number of clauses : 18 ( 17 unt; 0 nHn; 4 RR)
% Number of literals : 20 ( 0 equ; 4 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 : 2 ( 2 usr; 1 con; 0-2 aty)
% Number of variables : 55 ( 26 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(ic_JLukasiewicz_4,axiom,
is_a_theorem(implies(implies(implies(X,Y),implies(Z,U)),implies(V,implies(implies(U,X),implies(Z,X))))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ic_JLukasiewicz_4) ).
cnf(prove_ic_1,negated_conjecture,
~ is_a_theorem(implies(a,a)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_ic_1) ).
cnf(4,plain,
is_a_theorem(implies(X,implies(implies(implies(implies(Y,Z),implies(U,Z)),implies(Z,V)),implies(W,implies(Z,V))))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,ic_JLukasiewicz_4,ic_JLukasiewicz_4]) ).
cnf(6,plain,
is_a_theorem(implies(implies(implies(implies(X,Y),implies(Z,Y)),implies(Y,U)),implies(V,implies(Y,U)))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,4,ic_JLukasiewicz_4]) ).
cnf(9,plain,
is_a_theorem(implies(X,implies(Y,implies(implies(Y,Z),implies(U,Z))))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,6,ic_JLukasiewicz_4]) ).
cnf(10,plain,
is_a_theorem(implies(X,implies(implies(Y,Z),implies(Z,implies(Y,Z))))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,6,6]) ).
cnf(15,plain,
~ is_a_theorem(implies(implies(X,implies(Y,implies(implies(Y,Z),implies(U,Z)))),implies(a,a))),
inference('UR-RESOLVE',[status(thm)],[condensed_detachment,9,prove_ic_1]) ).
cnf(23,plain,
is_a_theorem(implies(implies(X,Y),implies(Y,implies(X,Y)))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,10,6]) ).
cnf(27,plain,
is_a_theorem(implies(X,implies(implies(implies(Y,Z),Y),implies(Z,Y)))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,23,ic_JLukasiewicz_4]) ).
cnf(34,plain,
is_a_theorem(implies(implies(implies(X,Y),X),implies(Y,X))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,27,6]) ).
cnf(41,plain,
is_a_theorem(implies(X,implies(Y,implies(Z,Y)))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,34,6]) ).
cnf(71,plain,
is_a_theorem(implies(X,implies(Y,X))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,41,34]) ).
cnf(73,plain,
is_a_theorem(implies(X,implies(implies(implies(Y,Z),U),implies(Z,U)))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,41,ic_JLukasiewicz_4]) ).
cnf(81,plain,
is_a_theorem(implies(X,implies(implies(implies(Y,Z),Y),implies(U,Y)))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,71,ic_JLukasiewicz_4]) ).
cnf(131,plain,
is_a_theorem(implies(implies(implies(X,Y),Z),implies(Y,Z))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,73,34]) ).
cnf(308,plain,
is_a_theorem(implies(implies(implies(X,Y),X),implies(Z,X))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,81,71]) ).
cnf(325,plain,
$false,
inference('UR-RESOLVE',[status(thm)],[condensed_detachment,308,131,15]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL086-1 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.13 % Command : run-snark %s %d
% 0.13/0.35 % Computer : n013.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Sat Jul 2 20:21:59 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.46 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.47 *
% 0.20/0.47 *
% 0.20/0.48 #<PACKAGE "SNARK-USER">
% 0.20/0.48 *
% 0.20/0.48 SNARK-TPTP-OPTIONS
% 0.20/0.48 *
% 0.20/0.48 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.20/0.48 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.20/0.48 (USE-FACTORING :POS)
% 0.20/0.48 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.20/0.48 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.20/0.48 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.20/0.48 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.20/0.48 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.20/0.48 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.20/0.48 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.20/0.48 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.20/0.48 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.20/0.48 (DECLARE-TPTP-SYMBOLS2))
% 0.20/0.48 *
% 0.20/0.48 "."
% 0.20/0.48 *
% 0.20/0.48 ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-07-02T20:21:59
% 0.20/0.48 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n013.cluster.edu at 2022-07-02T20:21:59
% 0.44/0.61
% 0.44/0.61
% 0.44/0.61 #||
% 0.44/0.61 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.44/0.61 % SZS output start Refutation
% See solution above
% 0.44/0.61 ||#
% 0.44/0.61
% 0.44/0.61 ; Summary of computation:
% 0.44/0.61 ; 987 formulas have been input or derived (from 36 formulas).
% 0.44/0.61 ; 325 (33%) were retained. Of these,
% 0.44/0.61 ; 52 (16%) were simplified or subsumed later,
% 0.44/0.61 ; 273 (84%) are still being kept.
% 0.44/0.61 ;
% 0.44/0.61 ; Run time in seconds excluding printing time:
% 0.44/0.61 ; 0.001 1% Read assertion file (1 call)
% 0.44/0.61 ; 0.000 0% Assert (3 calls)
% 0.44/0.61 ; 0.039 31% Process new row (701 calls)
% 0.44/0.61 ; 0.022 18% Resolution (70 calls)
% 0.44/0.61 ; 0.002 2% Paramodulation (35 calls)
% 0.44/0.61 ; 0.000 0% Condensing (1 call)
% 0.44/0.61 ; 0.000 0% Forward subsumption (1 call)
% 0.44/0.61 ; 0.000 0% Backward subsumption (1 call)
% 0.44/0.61 ; 0.017 14% Forward simplification (689 calls)
% 0.44/0.61 ; 0.018 14% Backward simplification (325 calls)
% 0.44/0.61 ; 0.000 0% Sortal reasoning (32 calls)
% 0.44/0.61 ; 0.000 0% Purity testing (1 call)
% 0.44/0.61 ; 0.026 21% Other
% 0.44/0.61 ; 0.125 Total
% 0.44/0.61 ; 0.127 Real time
% 0.44/0.61 ;
% 0.44/0.61 ; Term-hash-array has 988 terms in all.
% 0.44/0.61 ; Feature-vector-row-index has 1 entry (1 at peak, 1 added, 0 deleted).
% 0.44/0.61 ; Feature-vector-row-index has 4 nodes (4 at peak, 4 added, 0 deleted).
% 0.44/0.61 ; Retrieved 0 possibly forward subsuming rows in 1 call.
% 0.44/0.61 ; Retrieved 0 possibly backward subsumed rows in 1 call.
% 0.44/0.61 ; Path-index has 854 entries (854 at peak, 992 added, 138 deleted).
% 0.44/0.61 ; Path-index has 615 nodes (615 at peak, 619 added, 4 deleted).
% 0.44/0.61 ; Trie-index has 854 entries (854 at peak, 992 added, 138 deleted).
% 0.44/0.61 ; Trie-index has 2,612 nodes (2,612 at peak, 3,062 added, 450 deleted).
% 0.44/0.61 ; Retrieved 2,616 generalization terms in 687 calls.
% 0.44/0.61 ; Retrieved 1,304 instance terms in 323 calls.
% 0.44/0.61 ; Retrieved 19,095 unifiable terms in 790 calls.
% 0.44/0.61 ;
% 0.44/0.61 ; The agenda of rows to process has 66 entries:
% 0.44/0.61 ; 11 with value 20 7 with value 30 2 with value 36
% 0.44/0.61 ; 1 with value 21 1 with value 31 2 with value 37
% 0.44/0.61 ; 6 with value 23 1 with value 32 2 with value 39
% 0.44/0.61 ; 11 with value 25 4 with value 33 1 with value 41
% 0.44/0.61 ; 1 with value 26 3 with value 34 1 with value 44
% 0.44/0.61 ; 11 with value 28 1 with value 35
% 0.44/0.61 ; The agenda of rows to give has 243 entries:
% 0.44/0.61 ; 6 with value (4 26) 12 with value (4 34) 6 with value (4 42)
% 0.44/0.61 ; 9 with value (4 27) 22 with value (4 35) 8 with value (4 43)
% 0.44/0.61 ; 6 with value (4 28) 17 with value (4 36) 13 with value (4 44)
% 0.44/0.61 ; 15 with value (4 29) 6 with value (4 37) 5 with value (4 45)
% 0.44/0.61 ; 12 with value (4 30) 24 with value (4 38) 4 with value (4 46)
% 0.44/0.61 ; 12 with value (4 31) 8 with value (4 39) 4 with value (4 47)
% 0.44/0.61 ; 14 with value (4 32) 15 with value (4 40) 2 with value (4 48)
% 0.44/0.61 ; 15 with value (4 33) 7 with value (4 41) 1 with value (4 49)
% 0.44/0.61 Evaluation took:
% 0.44/0.61 0.127 seconds of real time
% 0.44/0.61 0.116197 seconds of user run time
% 0.44/0.61 0.011099 seconds of system run time
% 0.44/0.61 0 calls to %EVAL
% 0.44/0.61 0 page faults and
% 0.44/0.61 8,467,848 bytes consed.
% 0.44/0.61 :PROOF-FOUND
% 0.44/0.61 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-07-02T20:22:00
% 0.44/0.61 :PROOF-FOUND
% 0.44/0.61 *
%------------------------------------------------------------------------------