TSTP Solution File: LCL092-1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : LCL092-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n004.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:08 EDT 2022
% Result : Unsatisfiable 10.56s 10.76s
% Output : Refutation 10.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 3
% Syntax : Number of clauses : 37 ( 36 unt; 0 nHn; 6 RR)
% Number of literals : 39 ( 0 equ; 6 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 8 ( 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 : 150 ( 83 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(condensed_detachment,axiom,
( ~ is_a_theorem(implies(X,Y))
| ~ is_a_theorem(X)
| is_a_theorem(Y) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',condensed_detachment) ).
cnf(ic_JLukasiewicz_5,axiom,
is_a_theorem(implies(implies(implies(X,Y),implies(Z,U)),implies(implies(U,X),implies(V,implies(Z,X))))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ic_JLukasiewicz_5) ).
cnf(prove_ic_3,negated_conjecture,
~ is_a_theorem(implies(implies(implies(a,b),a),a)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_ic_3) ).
cnf(4,plain,
is_a_theorem(implies(implies(implies(X,implies(Y,Z)),implies(Z,U)),implies(V,implies(implies(W,Z),implies(Z,U))))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,ic_JLukasiewicz_5,ic_JLukasiewicz_5]) ).
cnf(5,plain,
~ is_a_theorem(implies(implies(implies(implies(X,Y),implies(Z,U)),implies(implies(U,X),implies(V,implies(Z,X)))),implies(implies(implies(a,b),a),a))),
inference('UR-RESOLVE',[status(thm)],[condensed_detachment,ic_JLukasiewicz_5,prove_ic_3]) ).
cnf(6,plain,
is_a_theorem(implies(X,implies(implies(Y,Z),implies(Z,implies(implies(U,V),implies(V,Z)))))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,4,4]) ).
cnf(9,plain,
is_a_theorem(implies(implies(X,Y),implies(Y,implies(implies(Z,U),implies(U,Y))))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,6,ic_JLukasiewicz_5]) ).
cnf(13,plain,
is_a_theorem(implies(implies(implies(implies(X,Y),implies(Y,Z)),U),implies(V,implies(Z,U)))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,9,ic_JLukasiewicz_5]) ).
cnf(18,plain,
is_a_theorem(implies(X,implies(Y,implies(implies(Y,Z),implies(U,implies(V,Z)))))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,13,ic_JLukasiewicz_5]) ).
cnf(19,plain,
is_a_theorem(implies(X,implies(implies(Y,Z),implies(Z,implies(U,implies(V,Z)))))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,13,4]) ).
cnf(25,plain,
is_a_theorem(implies(X,implies(implies(X,Y),implies(Z,implies(U,Y))))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,18,13]) ).
cnf(27,plain,
is_a_theorem(implies(implies(implies(implies(X,Y),implies(Z,implies(U,Y))),V),implies(W,implies(X,V)))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,18,ic_JLukasiewicz_5]) ).
cnf(29,plain,
is_a_theorem(implies(implies(implies(X,implies(Y,Z)),U),implies(V,implies(implies(implies(U,W),Z),U)))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,25,ic_JLukasiewicz_5]) ).
cnf(38,plain,
is_a_theorem(implies(implies(X,Y),implies(Y,implies(Z,implies(U,Y))))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,19,13]) ).
cnf(43,plain,
is_a_theorem(implies(implies(implies(X,implies(Y,Z)),U),implies(V,implies(Z,U)))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,38,ic_JLukasiewicz_5]) ).
cnf(70,plain,
is_a_theorem(implies(X,implies(Y,implies(Z,implies(U,implies(V,Y)))))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,43,43]) ).
cnf(75,plain,
is_a_theorem(implies(implies(implies(X,Y),implies(Z,implies(U,X))),implies(V,implies(W,implies(Z,implies(U,X)))))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,43,ic_JLukasiewicz_5]) ).
cnf(79,plain,
is_a_theorem(implies(X,implies(Y,implies(Z,implies(U,X))))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,70,43]) ).
cnf(162,plain,
is_a_theorem(implies(X,implies(implies(implies(implies(Y,implies(Z,implies(U,V))),W),V),implies(Y,implies(Z,implies(U,V)))))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,29,27]) ).
cnf(237,plain,
~ is_a_theorem(implies(implies(X,implies(Y,a)),a)),
inference('UR-RESOLVE',[status(thm)],[condensed_detachment,5,29]) ).
cnf(268,plain,
~ is_a_theorem(implies(implies(X,implies(Y,implies(Z,implies(U,X)))),implies(implies(V,implies(W,a)),a))),
inference('UR-RESOLVE',[status(thm)],[condensed_detachment,237,79]) ).
cnf(641,plain,
is_a_theorem(implies(X,implies(Y,implies(implies(Z,U),implies(V,implies(U,U)))))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,75,ic_JLukasiewicz_5]) ).
cnf(768,plain,
is_a_theorem(implies(X,implies(implies(Y,Z),implies(U,implies(Z,Z))))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,641,27]) ).
cnf(789,plain,
is_a_theorem(implies(implies(X,Y),implies(Z,implies(Y,Y)))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,768,27]) ).
cnf(804,plain,
is_a_theorem(implies(X,implies(Y,implies(Z,implies(U,U))))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,789,75]) ).
cnf(805,plain,
is_a_theorem(implies(implies(implies(X,X),Y),implies(Z,implies(U,Y)))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,789,ic_JLukasiewicz_5]) ).
cnf(819,plain,
is_a_theorem(implies(X,implies(Y,implies(Z,Z)))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,804,27]) ).
cnf(840,plain,
is_a_theorem(implies(X,implies(Y,Y))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,819,27]) ).
cnf(854,plain,
is_a_theorem(implies(X,X)),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,840,840]) ).
cnf(11102,plain,
is_a_theorem(implies(implies(implies(implies(X,implies(Y,implies(Z,U))),V),U),implies(X,implies(Y,implies(Z,U))))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,162,27]) ).
cnf(11221,plain,
is_a_theorem(implies(implies(X,implies(Y,implies(X,Z))),implies(U,implies(V,implies(Y,implies(X,Z)))))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,11102,27]) ).
cnf(11338,plain,
is_a_theorem(implies(X,implies(Y,implies(Z,implies(implies(implies(U,U),V),V))))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,11221,805]) ).
cnf(11486,plain,
is_a_theorem(implies(X,implies(Y,implies(implies(implies(Z,Z),U),U)))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,11338,27]) ).
cnf(11606,plain,
is_a_theorem(implies(X,implies(implies(implies(Y,Y),Z),Z))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,11486,840]) ).
cnf(11719,plain,
is_a_theorem(implies(implies(implies(X,X),Y),Y)),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,11606,854]) ).
cnf(11721,plain,
is_a_theorem(implies(implies(X,Y),implies(Z,implies(implies(implies(U,U),X),Y)))),
inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,11606,ic_JLukasiewicz_5]) ).
cnf(13077,plain,
$false,
inference('UR-RESOLVE',[status(thm)],[condensed_detachment,11721,11719,268]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LCL092-1 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.13 % Command : run-snark %s %d
% 0.12/0.34 % Computer : n004.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Sun Jul 3 01:03:08 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.18/0.45 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.46 *
% 0.18/0.46 *
% 0.18/0.47 #<PACKAGE "SNARK-USER">
% 0.18/0.47 *
% 0.18/0.47 SNARK-TPTP-OPTIONS
% 0.18/0.47 *
% 0.18/0.47 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.18/0.47 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.18/0.47 (USE-FACTORING :POS)
% 0.18/0.47 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.18/0.47 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.18/0.47 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.18/0.47 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.18/0.47 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.18/0.47 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.18/0.47 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.18/0.47 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.18/0.47 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.18/0.47 (DECLARE-TPTP-SYMBOLS2))
% 0.18/0.47 *
% 0.18/0.47 "."
% 0.18/0.47 *
% 0.18/0.47 ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-07-03T01:03:08
% 0.18/0.47 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n004.cluster.edu at 2022-07-03T01:03:08
% 10.56/10.76
% 10.56/10.76
% 10.56/10.76 #||
% 10.56/10.76 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 10.56/10.76 % SZS output start Refutation
% See solution above
% 10.56/10.77 ||#
% 10.56/10.77
% 10.56/10.77 ; Summary of computation:
% 10.56/10.77 ; 36375 formulas have been input or derived (from 239 formulas).
% 10.56/10.77 ; 13077 (36%) were retained. Of these,
% 10.56/10.77 ; 471 ( 4%) were simplified or subsumed later,
% 10.56/10.77 ; 12606 (96%) are still being kept.
% 10.56/10.77 ;
% 10.56/10.77 ; Run time in seconds excluding printing time:
% 10.56/10.77 ; 0.001 0% Read assertion file (1 call)
% 10.56/10.77 ; 0.000 0% Assert (3 calls)
% 10.56/10.77 ; 1.449 14% Process new row (29,351 calls)
% 10.56/10.77 ; 2.701 26% Resolution (476 calls)
% 10.56/10.77 ; 0.239 2% Paramodulation (238 calls)
% 10.56/10.77 ; 0.000 0% Condensing (1 call)
% 10.56/10.77 ; 0.000 0% Forward subsumption (1 call)
% 10.56/10.77 ; 0.000 0% Backward subsumption (1 call)
% 10.56/10.77 ; 2.514 24% Forward simplification (29,324 calls)
% 10.56/10.77 ; 3.275 32% Backward simplification (13,077 calls)
% 10.56/10.77 ; 0.001 0% Sortal reasoning (32 calls)
% 10.56/10.77 ; 0.000 0% Purity testing (1 call)
% 10.56/10.77 ; 0.118 1% Other
% 10.56/10.77 ; 10.298 Total
% 10.56/10.77 ; 10.300 Real time
% 10.56/10.77 ;
% 10.56/10.77 ; Term-hash-array has 31,688 terms in all.
% 10.56/10.77 ; Feature-vector-row-index has 1 entry (1 at peak, 1 added, 0 deleted).
% 10.56/10.77 ; Feature-vector-row-index has 4 nodes (4 at peak, 4 added, 0 deleted).
% 10.56/10.77 ; Retrieved 0 possibly forward subsuming rows in 1 call.
% 10.56/10.77 ; Retrieved 0 possibly backward subsumed rows in 1 call.
% 10.56/10.77 ; Path-index has 30,308 entries (30,308 at peak, 31,717 added, 1,409 deleted).
% 10.56/10.77 ; Path-index has 3,896 nodes (3,896 at peak, 3,982 added, 86 deleted).
% 10.56/10.77 ; Trie-index has 30,308 entries (30,308 at peak, 31,717 added, 1,409 deleted).
% 10.56/10.77 ; Trie-index has 57,207 nodes (57,207 at peak, 63,047 added, 5,840 deleted).
% 10.56/10.77 ; Retrieved 1,721,636 generalization terms in 29,321 calls.
% 10.56/10.77 ; Retrieved 747,825 instance terms in 13,075 calls.
% 10.56/10.77 ; Retrieved 8,943,764 unifiable terms in 15,787 calls.
% 10.56/10.77 ;
% 10.56/10.77 ; The agenda of rows to process has 536 entries:
% 10.56/10.77 ; 1 with value 23 13 with value 40 25 with value 52
% 10.56/10.77 ; 16 with value 26 18 with value 41 24 with value 53
% 10.56/10.77 ; 3 with value 27 32 with value 42 36 with value 54
% 10.56/10.77 ; 1 with value 28 18 with value 43 2 with value 55
% 10.56/10.77 ; 17 with value 29 23 with value 44 15 with value 56
% 10.56/10.77 ; 14 with value 32 31 with value 45 1 with value 57
% 10.56/10.77 ; 6 with value 33 18 with value 46 2 with value 58
% 10.56/10.77 ; 4 with value 34 24 with value 47 6 with value 59
% 10.56/10.77 ; 14 with value 35 24 with value 48 2 with value 60
% 10.56/10.77 ; 16 with value 36 17 with value 49 1 with value 61
% 10.56/10.77 ; 8 with value 37 40 with value 50 1 with value 64
% 10.56/10.77 ; 18 with value 38 20 with value 51 1 with value 66
% 10.56/10.77 ; 24 with value 39
% 10.56/10.77 ; The agenda of rows to give has 12389 entries:
% 10.56/10.77 ; 2 with value (4 36) 525 with value (4 48) 581 with value (4 59)
% 10.56/10.77 ; 6 with value (4 37) 618 with value (4 49) 400 with value (4 60)
% 10.56/10.77 ; 73 with value (4 38) 639 with value (4 50) 313 with value (4 61)
% 10.56/10.77 ; 66 with value (4 39) 792 with value (4 51) 171 with value (4 62)
% 10.56/10.77 ; 90 with value (4 40) 822 with value (4 52) 114 with value (4 63)
% 10.56/10.77 ; 143 with value (4 41) 949 with value (4 53) 83 with value (4 64)
% 10.56/10.77 ; 148 with value (4 42) 866 with value (4 54) 42 with value (4 65)
% 10.56/10.77 ; 192 with value (4 43) 956 with value (4 55) 34 with value (4 66)
% 10.56/10.77 ; 256 with value (4 44) 888 with value (4 56) 33 with value (4 67)
% 10.56/10.77 ; 320 with value (4 45) 793 with value (4 57) 15 with value (4 68)
% 10.56/10.77 ; 291 with value (4 46) 688 with value (4 58) 1 with value (4 70)
% 10.56/10.77 ; 479 with value (4 47)
% 10.56/10.77 Evaluation took:
% 10.56/10.77 10.302 seconds of real time
% 10.56/10.77 10.021254 seconds of user run time
% 10.56/10.77 0.28098 seconds of system run time
% 10.56/10.77 [Run times include 1.212 seconds GC run time.]
% 10.56/10.77 0 calls to %EVAL
% 10.56/10.77 0 page faults and
% 10.56/10.77 755,040,008 bytes consed.
% 10.56/10.77 :PROOF-FOUND
% 10.56/10.77 ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-07-03T01:03:18
% 10.56/10.77 :PROOF-FOUND
% 10.56/10.77 *
%------------------------------------------------------------------------------