TSTP Solution File: LCL094-1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : LCL094-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:09 EDT 2022
% Result : Unsatisfiable 1.69s 1.89s
% Output : Refutation 1.69s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 3
% Syntax : Number of clauses : 28 ( 27 unt; 0 nHn; 4 RR)
% Number of literals : 30 ( 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 : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 95 ( 44 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_5,negated_conjecture,
~ is_a_theorem(implies(a,implies(implies(a,b),b))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_ic_5) ).
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(14,plain,
is_a_theorem(implies(X,implies(implies(X,Y),implies(Z,Y)))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,9,6]) ).
cnf(15,plain,
is_a_theorem(implies(X,implies(implies(implies(implies(Y,Z),implies(U,Z)),V),implies(Y,V)))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,9,ic_JLukasiewicz_4]) ).
cnf(16,plain,
~ is_a_theorem(implies(implies(X,implies(Y,implies(implies(Y,Z),implies(U,Z)))),implies(a,implies(implies(a,b),b)))),
inference('UR-RESOLVE',[status(thm)],[condensed_detachment,9,prove_ic_5]) ).
cnf(17,plain,
is_a_theorem(implies(implies(implies(X,implies(implies(X,Y),implies(Z,Y))),U),implies(V,U))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,14,14]) ).
cnf(18,plain,
is_a_theorem(implies(X,implies(implies(implies(Y,Z),U),implies(implies(implies(U,V),Z),U)))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,14,ic_JLukasiewicz_4]) ).
cnf(24,plain,
is_a_theorem(implies(implies(X,Y),implies(Y,implies(X,Y)))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,10,6]) ).
cnf(28,plain,
is_a_theorem(implies(X,implies(implies(implies(Y,Z),Y),implies(Z,Y)))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,24,ic_JLukasiewicz_4]) ).
cnf(35,plain,
is_a_theorem(implies(implies(implies(X,Y),X),implies(Y,X))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,28,6]) ).
cnf(41,plain,
is_a_theorem(implies(X,implies(Y,implies(Z,Y)))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,35,6]) ).
cnf(55,plain,
is_a_theorem(implies(X,implies(Y,X))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,41,35]) ).
cnf(61,plain,
is_a_theorem(implies(X,implies(implies(implies(Y,Z),Y),implies(U,Y)))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,55,ic_JLukasiewicz_4]) ).
cnf(170,plain,
is_a_theorem(implies(implies(implies(implies(X,Y),implies(Z,Y)),U),implies(X,U))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,15,6]) ).
cnf(182,plain,
is_a_theorem(implies(implies(X,Y),implies(X,implies(Z,implies(U,Y))))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,170,170]) ).
cnf(205,plain,
is_a_theorem(implies(implies(implies(implies(X,Y),implies(Z,Y)),U),implies(V,implies(W,implies(X,U))))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,182,170]) ).
cnf(234,plain,
is_a_theorem(implies(implies(implies(X,Y),X),implies(Z,X))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,61,55]) ).
cnf(598,plain,
is_a_theorem(implies(implies(implies(X,Y),Z),implies(implies(implies(Z,U),Y),Z))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,18,17]) ).
cnf(621,plain,
is_a_theorem(implies(X,implies(implies(implies(Y,Z),Y),Y))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,598,234]) ).
cnf(718,plain,
is_a_theorem(implies(implies(implies(X,Y),X),X)),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,621,17]) ).
cnf(3269,plain,
is_a_theorem(implies(implies(X,implies(X,Y)),implies(Z,implies(X,Y)))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,205,718]) ).
cnf(3465,plain,
is_a_theorem(implies(X,implies(Y,implies(implies(X,Z),Z)))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,3269,170]) ).
cnf(3466,plain,
$false,
inference('REWRITE',[status(thm)],[inference('UR-RESOLVE',[status(thm)],[condensed_detachment,3269,16]),3465]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL094-1 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.13 % Command : run-snark %s %d
% 0.13/0.34 % Computer : n013.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 : Sun Jul 3 14:52:44 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-03T14:52:44
% 0.19/0.47 ; 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-03T14:52:44
% 1.69/1.89
% 1.69/1.89
% 1.69/1.89 #||
% 1.69/1.89 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.69/1.89 % SZS output start Refutation
% See solution above
% 1.69/1.89 ||#
% 1.69/1.89
% 1.69/1.89 ; Summary of computation:
% 1.69/1.89 ; 9312 formulas have been input or derived (from 115 formulas).
% 1.69/1.89 ; 3466 (37%) were retained. Of these,
% 1.69/1.89 ; 71 ( 2%) were simplified or subsumed later,
% 1.69/1.89 ; 3395 (98%) are still being kept.
% 1.69/1.89 ;
% 1.69/1.89 ; Run time in seconds excluding printing time:
% 1.69/1.89 ; 0.001 0% Read assertion file (1 call)
% 1.69/1.89 ; 0.000 0% Assert (3 calls)
% 1.69/1.89 ; 0.347 24% Process new row (7,691 calls)
% 1.69/1.89 ; 0.543 38% Resolution (228 calls)
% 1.69/1.89 ; 0.037 3% Paramodulation (114 calls)
% 1.69/1.89 ; 0.000 0% Condensing (1 call)
% 1.69/1.89 ; 0.000 0% Forward subsumption (1 call)
% 1.69/1.89 ; 0.000 0% Backward subsumption (1 call)
% 1.69/1.89 ; 0.268 19% Forward simplification (7,593 calls)
% 1.69/1.89 ; 0.180 13% Backward simplification (3,466 calls)
% 1.69/1.89 ; 0.000 0% Sortal reasoning (32 calls)
% 1.69/1.89 ; 0.000 0% Purity testing (1 call)
% 1.69/1.89 ; 0.044 3% Other
% 1.69/1.89 ; 1.420 Total
% 1.69/1.89 ; 1.422 Real time
% 1.69/1.89 ;
% 1.69/1.89 ; Term-hash-array has 8,843 terms in all.
% 1.69/1.89 ; Feature-vector-row-index has 1 entry (1 at peak, 1 added, 0 deleted).
% 1.69/1.89 ; Feature-vector-row-index has 4 nodes (4 at peak, 4 added, 0 deleted).
% 1.69/1.89 ; Retrieved 0 possibly forward subsuming rows in 1 call.
% 1.69/1.89 ; Retrieved 0 possibly backward subsumed rows in 1 call.
% 1.69/1.89 ; Path-index has 8,648 entries (8,648 at peak, 8,854 added, 206 deleted).
% 1.69/1.89 ; Path-index has 1,918 nodes (1,918 at peak, 1,945 added, 27 deleted).
% 1.69/1.89 ; Trie-index has 8,648 entries (8,648 at peak, 8,854 added, 206 deleted).
% 1.69/1.89 ; Trie-index has 24,152 nodes (24,152 at peak, 25,201 added, 1,049 deleted).
% 1.69/1.89 ; Retrieved 140,731 generalization terms in 7,592 calls.
% 1.69/1.89 ; Retrieved 37,309 instance terms in 3,464 calls.
% 1.69/1.89 ; Retrieved 1,367,617 unifiable terms in 4,802 calls.
% 1.69/1.89 ;
% 1.69/1.89 ; The agenda of rows to process has 174 entries:
% 1.69/1.89 ; 13 with value 29 9 with value 37 6 with value 44
% 1.69/1.89 ; 1 with value 30 10 with value 38 6 with value 45
% 1.69/1.89 ; 24 with value 31 8 with value 39 9 with value 46
% 1.69/1.89 ; 10 with value 32 4 with value 40 1 with value 47
% 1.69/1.89 ; 13 with value 33 7 with value 41 1 with value 48
% 1.69/1.89 ; 14 with value 34 14 with value 42 1 with value 50
% 1.69/1.89 ; 4 with value 35 6 with value 43 1 with value 53
% 1.69/1.89 ; 12 with value 36
% 1.69/1.89 ; The agenda of rows to give has 3288 entries:
% 1.69/1.89 ; 2 with value (4 28) 175 with value (4 38) 100 with value (4 48)
% 1.69/1.89 ; 3 with value (4 29) 216 with value (4 39) 81 with value (4 49)
% 1.69/1.89 ; 27 with value (4 30) 235 with value (4 40) 45 with value (4 50)
% 1.69/1.89 ; 38 with value (4 31) 261 with value (4 41) 32 with value (4 51)
% 1.69/1.89 ; 40 with value (4 32) 293 with value (4 42) 19 with value (4 52)
% 1.69/1.89 ; 69 with value (4 33) 314 with value (4 43) 4 with value (4 53)
% 1.69/1.89 ; 94 with value (4 34) 220 with value (4 44) 1 with value (4 54)
% 1.69/1.89 ; 84 with value (4 35) 299 with value (4 45) 1 with value (4 58)
% 1.69/1.89 ; 149 with value (4 36) 170 with value (4 46) 1 with value (4 63)
% 1.69/1.89 ; 158 with value (4 37) 157 with value (4 47)
% 1.69/1.89 Evaluation took:
% 1.69/1.89 1.423 seconds of real time
% 1.69/1.89 1.346364 seconds of user run time
% 1.69/1.89 0.077131 seconds of system run time
% 1.69/1.89 [Run times include 0.109 seconds GC run time.]
% 1.69/1.89 0 calls to %EVAL
% 1.69/1.89 0 page faults and
% 1.69/1.89 96,554,392 bytes consed.
% 1.69/1.89 :PROOF-FOUND
% 1.69/1.89 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-07-03T14:52:46
% 1.69/1.89 :PROOF-FOUND
% 1.69/1.89 *
%------------------------------------------------------------------------------