TSTP Solution File: LCL526+1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : LCL526+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n023.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:23:27 EDT 2022
% Result : Theorem 0.61s 0.80s
% Output : Refutation 0.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 27
% Syntax : Number of clauses : 59 ( 36 unt; 5 nHn; 36 RR)
% Number of literals : 90 ( 15 equ; 29 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 15 ( 13 usr; 13 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 4 con; 0-2 aty)
% Number of variables : 58 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ modus_ponens
| ~ is_a_theorem(X)
| ~ is_a_theorem(implies(X,Y))
| is_a_theorem(Y) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax',modus_ponens) ).
cnf(5,axiom,
( ~ substitution_of_equivalents
| ~ is_a_theorem(equiv(X,Y))
| X = Y ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax',substitution_of_equivalents) ).
cnf(16,axiom,
( ~ and_1
| is_a_theorem(implies(and(X,Y),X)) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax',and_1) ).
cnf(18,axiom,
( ~ and_2
| is_a_theorem(implies(and(X,Y),Y)) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax',and_2) ).
cnf(20,axiom,
( ~ and_3
| is_a_theorem(implies(X,implies(Y,and(X,Y)))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax',and_3) ).
cnf(57,axiom,
( ~ op_implies_and
| implies(X,Y) = not(and(X,not(Y))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+1.ax',op_implies_and) ).
cnf(58,axiom,
( ~ op_equiv
| equiv(X,Y) = and(implies(X,Y),implies(Y,X)) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+1.ax',op_equiv) ).
cnf(60,axiom,
op_implies_and,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+2.ax',hilbert_op_implies_and) ).
cnf(61,axiom,
op_equiv,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+2.ax',hilbert_op_equiv) ).
cnf(62,axiom,
modus_ponens,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+2.ax',hilbert_modus_ponens) ).
cnf(67,axiom,
and_1,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+2.ax',hilbert_and_1) ).
cnf(68,axiom,
and_2,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+2.ax',hilbert_and_2) ).
cnf(69,axiom,
and_3,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+2.ax',hilbert_and_3) ).
cnf(76,axiom,
substitution_of_equivalents,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+2.ax',substitution_of_equivalents) ).
cnf(84,axiom,
( ~ adjunction
| ~ is_a_theorem(X)
| ~ is_a_theorem(Y)
| is_a_theorem(and(X,Y)) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL007+0.ax',adjunction) ).
cnf(85,axiom,
( adjunction
| is_a_theorem('SKOLEMAAAU59') ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL007+0.ax',adjunction) ).
cnf(86,axiom,
( adjunction
| is_a_theorem('SKOLEMAAAU60') ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL007+0.ax',adjunction) ).
cnf(87,axiom,
( adjunction
| ~ is_a_theorem(and('SKOLEMAAAU59','SKOLEMAAAU60')) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL007+0.ax',adjunction) ).
cnf(89,axiom,
( substitution_strict_equiv
| is_a_theorem(strict_equiv('SKOLEMAAAU61','SKOLEMAAAU62')) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL007+0.ax',substitution_strict_equiv) ).
cnf(90,axiom,
( substitution_strict_equiv
| 'SKOLEMAAAU61' != 'SKOLEMAAAU62' ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL007+0.ax',substitution_strict_equiv) ).
cnf(93,axiom,
( ~ axiom_M
| is_a_theorem(implies(necessarily(X),X)) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL007+0.ax',axiom_M) ).
cnf(130,axiom,
( ~ op_strict_implies
| strict_implies(X,Y) = necessarily(implies(X,Y)) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL007+1.ax',op_strict_implies) ).
cnf(131,axiom,
( ~ op_strict_equiv
| strict_equiv(X,Y) = and(strict_implies(X,Y),strict_implies(Y,X)) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL007+1.ax',op_strict_equiv) ).
cnf(135,axiom,
axiom_M,
file('/export/starexec/sandbox/benchmark/Axioms/LCL007+2.ax',km5_axiom_M) ).
cnf(137,axiom,
op_strict_implies,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',s1_0_op_strict_implies) ).
cnf(138,axiom,
op_strict_equiv,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',s1_0_op_strict_equiv) ).
cnf(139,negated_conjecture,
~ substitution_strict_equiv,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',s1_0_substitution_strict_equiv) ).
cnf(140,plain,
is_a_theorem(strict_equiv('SKOLEMAAAU61','SKOLEMAAAU62')),
inference('REWRITE',[status(thm)],[89,139]) ).
cnf(141,plain,
'SKOLEMAAAU61' != 'SKOLEMAAAU62',
inference('REWRITE',[status(thm)],[90,139]) ).
cnf(142,plain,
strict_equiv(X,Y) = and(strict_implies(X,Y),strict_implies(Y,X)),
inference('REWRITE',[status(thm)],[131,138]) ).
cnf(143,plain,
strict_implies(X,Y) = necessarily(implies(X,Y)),
inference('REWRITE',[status(thm)],[130,137]) ).
cnf(166,plain,
strict_equiv(X,Y) = and(necessarily(implies(X,Y)),necessarily(implies(Y,X))),
inference('REWRITE',[status(thm)],[142,143,theory(equality)]) ).
cnf(167,plain,
is_a_theorem(and(necessarily(implies('SKOLEMAAAU61','SKOLEMAAAU62')),necessarily(implies('SKOLEMAAAU62','SKOLEMAAAU61')))),
inference('REWRITE',[status(thm)],[140,166,theory(equality)]) ).
cnf(175,plain,
is_a_theorem(implies(necessarily(X),X)),
inference('REWRITE',[status(thm)],[93,135]) ).
cnf(196,plain,
( ~ is_a_theorem(equiv(X,Y))
| X = Y ),
inference('REWRITE',[status(thm)],[5,76]) ).
cnf(204,plain,
is_a_theorem(implies(X,implies(Y,and(X,Y)))),
inference('REWRITE',[status(thm)],[20,69]) ).
cnf(205,plain,
is_a_theorem(implies(and(X,Y),Y)),
inference('REWRITE',[status(thm)],[18,68]) ).
cnf(206,plain,
is_a_theorem(implies(and(X,Y),X)),
inference('REWRITE',[status(thm)],[16,67]) ).
cnf(213,plain,
( ~ is_a_theorem(X)
| ~ is_a_theorem(implies(X,Y))
| is_a_theorem(Y) ),
inference('REWRITE',[status(thm)],[1,62]) ).
cnf(214,plain,
equiv(X,Y) = and(implies(X,Y),implies(Y,X)),
inference('REWRITE',[status(thm)],[58,61]) ).
cnf(215,plain,
implies(X,Y) = not(and(X,not(Y))),
inference('REWRITE',[status(thm)],[57,60]) ).
cnf(224,plain,
is_a_theorem(not(and(X,not(not(and(Y,not(and(X,Y)))))))),
inference('REWRITE',[status(thm)],[204,215,theory(equality)]) ).
cnf(246,plain,
is_a_theorem(not(and(and(X,Y),not(Y)))),
inference('REWRITE',[status(thm)],[205,215,theory(equality)]) ).
cnf(248,plain,
is_a_theorem(not(and(necessarily(X),not(X)))),
inference('REWRITE',[status(thm)],[175,215,theory(equality)]) ).
cnf(256,plain,
is_a_theorem(not(and(and(X,Y),not(X)))),
inference('REWRITE',[status(thm)],[206,215,theory(equality)]) ).
cnf(272,plain,
( ~ is_a_theorem(X)
| ~ is_a_theorem(not(and(X,not(Y))))
| is_a_theorem(Y) ),
inference('REWRITE',[status(thm)],[213,215,theory(equality)]) ).
cnf(273,plain,
equiv(X,Y) = and(not(and(X,not(Y))),not(and(Y,not(X)))),
inference('REWRITE',[status(thm)],[214,215,theory(equality)]) ).
cnf(274,plain,
( ~ is_a_theorem(and(not(and(X,not(Y))),not(and(Y,not(X)))))
| X = Y ),
inference('REWRITE',[status(thm)],[196,273,theory(equality)]) ).
cnf(281,plain,
is_a_theorem(and(necessarily(not(and('SKOLEMAAAU61',not('SKOLEMAAAU62')))),necessarily(not(and('SKOLEMAAAU62',not('SKOLEMAAAU61')))))),
inference('REWRITE',[status(thm)],[167,215,theory(equality)]) ).
cnf(330,plain,
( adjunction
| is_a_theorem(not(and(X,not(and('SKOLEMAAAU59',X))))) ),
inference('HYPERRESOLVE',[status(thm)],[272,224,85]) ).
cnf(342,plain,
is_a_theorem(necessarily(not(and('SKOLEMAAAU62',not('SKOLEMAAAU61'))))),
inference('HYPERRESOLVE',[status(thm)],[272,281,246]) ).
cnf(343,plain,
is_a_theorem(necessarily(not(and('SKOLEMAAAU61',not('SKOLEMAAAU62'))))),
inference('HYPERRESOLVE',[status(thm)],[272,281,256]) ).
cnf(353,plain,
~ is_a_theorem(and(not(and('SKOLEMAAAU61',not('SKOLEMAAAU62'))),not(and('SKOLEMAAAU62',not('SKOLEMAAAU61'))))),
inference('UR-RESOLVE',[status(thm)],[274,141]) ).
cnf(468,plain,
is_a_theorem(not(and('SKOLEMAAAU62',not('SKOLEMAAAU61')))),
inference('HYPERRESOLVE',[status(thm)],[272,342,248]) ).
cnf(479,plain,
is_a_theorem(not(and('SKOLEMAAAU61',not('SKOLEMAAAU62')))),
inference('HYPERRESOLVE',[status(thm)],[272,343,248]) ).
cnf(702,plain,
( adjunction
| is_a_theorem(and('SKOLEMAAAU59','SKOLEMAAAU60')) ),
inference('HYPERRESOLVE',[status(thm)],[272,330,86]) ).
cnf(763,plain,
adjunction,
inference('HYPERRESOLVE',[status(thm)],[87,702]) ).
cnf(764,plain,
( ~ is_a_theorem(X)
| ~ is_a_theorem(Y)
| is_a_theorem(and(X,Y)) ),
inference('REWRITE',[status(thm)],[84,763]) ).
cnf(766,plain,
$false,
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[764,479,468]),353]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : LCL526+1 : TPTP v8.1.0. Released v3.3.0.
% 0.11/0.13 % Command : run-snark %s %d
% 0.13/0.34 % Computer : n023.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 22:15:28 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-03T22:15:28
% 0.19/0.47 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n023.cluster.edu at 2022-07-03T22:15:28
% 0.19/0.50 WARNING:
% 0.19/0.50 #:|op_necessarily| is a proposition that occurs only negatively; disabling rows that contain it.
% 0.19/0.50 WARNING:
% 0.19/0.50 #:|op_implies_or| is a proposition that occurs only negatively; disabling rows that contain it.
% 0.19/0.50 WARNING:
% 0.19/0.50 #:|op_and| is a proposition that occurs only negatively; disabling rows that contain it.
% 0.19/0.50 WARNING:
% 0.19/0.50 #:|op_implies| is a proposition that occurs only positively; disabling rows that contain it.
% 0.61/0.80
% 0.61/0.80
% 0.61/0.80 #||
% 0.61/0.80 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.61/0.80 % SZS output start Refutation
% See solution above
% 0.61/0.81 ||#
% 0.61/0.81
% 0.61/0.81 ; Summary of computation:
% 0.61/0.81 ; 2433 formulas have been input or derived (from 155 formulas).
% 0.61/0.81 ; 766 (31%) were retained. Of these,
% 0.61/0.81 ; 502 (66%) were simplified or subsumed later,
% 0.61/0.81 ; 264 (34%) are still being kept.
% 0.61/0.81 ;
% 0.61/0.81 ; Run time in seconds excluding printing time:
% 0.61/0.81 ; 0.016 5% Read assertion file (1 call)
% 0.61/0.81 ; 0.006 2% Assert (88 calls)
% 0.61/0.81 ; 0.090 28% Process new row (1,154 calls)
% 0.61/0.81 ; 0.056 17% Resolution (308 calls)
% 0.61/0.81 ; 0.031 9% Paramodulation (154 calls)
% 0.61/0.81 ; 0.001 0% Factoring (38 calls)
% 0.61/0.81 ; 0.005 2% Condensing (693 calls)
% 0.61/0.81 ; 0.024 7% Forward subsumption (693 calls)
% 0.61/0.81 ; 0.009 3% Backward subsumption (515 calls)
% 0.61/0.81 ; 0.003 1% Clause clause subsumption (636 calls)
% 0.61/0.81 ; 0.024 7% Forward simplification (1,132 calls)
% 0.61/0.81 ; 0.029 9% Backward simplification (766 calls)
% 0.61/0.81 ; 0.002 1% Ordering (629 calls)
% 0.61/0.81 ; 0.001 0% Sortal reasoning (32 calls)
% 0.61/0.81 ; 0.001 0% Purity testing (1 call)
% 0.61/0.81 ; 0.029 9% Other
% 0.61/0.81 ; 0.327 Total
% 0.61/0.81 ; 0.341 Real time
% 0.61/0.81 ;
% 0.61/0.81 ; Term-hash-array has 2,717 terms in all.
% 0.61/0.81 ; Feature-vector-row-index has 43 entries (315 at peak, 515 added, 472 deleted).
% 0.61/0.81 ; Feature-vector-row-index has 446 nodes (2,221 at peak, 3,664 added, 3,218 deleted).
% 0.61/0.81 ; Retrieved 664 possibly forward subsuming rows in 693 calls.
% 0.61/0.81 ; Retrieved 32 possibly backward subsumed rows in 515 calls.
% 0.61/0.81 ; Path-index has 1,345 entries (2,133 at peak, 3,236 added, 1,891 deleted).
% 0.61/0.81 ; Path-index has 4,671 nodes (5,263 at peak, 7,225 added, 2,554 deleted).
% 0.61/0.81 ; Trie-index has 1,345 entries (2,133 at peak, 3,236 added, 1,891 deleted).
% 0.61/0.81 ; Trie-index has 6,865 nodes (9,328 at peak, 12,768 added, 5,903 deleted).
% 0.61/0.81 ; Retrieved 1,028 generalization terms in 2,618 calls.
% 0.61/0.81 ; Retrieved 741 instance terms in 250 calls.
% 0.61/0.81 ; Retrieved 32,718 unifiable terms in 2,944 calls.
% 0.61/0.81 ;
% 0.61/0.81 ; The agenda of rows to process has 1052 entries:
% 0.61/0.81 ; 20 with value 20 30 with value 34 12 with value 48
% 0.61/0.81 ; 32 with value 21 40 with value 35 24 with value 49
% 0.61/0.81 ; 76 with value 22 32 with value 36 16 with value 50
% 0.61/0.81 ; 78 with value 23 40 with value 37 16 with value 51
% 0.61/0.81 ; 80 with value 24 20 with value 38 8 with value 52
% 0.61/0.81 ; 40 with value 25 24 with value 39 4 with value 53
% 0.61/0.81 ; 16 with value 26 8 with value 40 4 with value 54
% 0.61/0.81 ; 32 with value 27 18 with value 41 4 with value 55
% 0.61/0.81 ; 36 with value 28 28 with value 42 1 with value 56
% 0.61/0.81 ; 38 with value 29 20 with value 43 4 with value 57
% 0.61/0.81 ; 68 with value 30 14 with value 44 4 with value 58
% 0.61/0.81 ; 50 with value 31 8 with value 45 4 with value 59
% 0.61/0.81 ; 40 with value 32 8 with value 46 4 with value 63
% 0.61/0.81 ; 44 with value 33 6 with value 47 1 with value 68
% 0.61/0.81 ; The agenda of rows to give has 155 entries:
% 0.61/0.81 ; 1 with value (4 4) 5 with value (4 28) 1 with value (4 41)
% 0.61/0.81 ; 2 with value (4 15) 6 with value (4 29) 3 with value (4 42)
% 0.61/0.81 ; 2 with value (4 16) 5 with value (4 30) 3 with value (4 43)
% 0.61/0.81 ; 6 with value (4 17) 7 with value (4 31) 1 with value (4 45)
% 0.61/0.81 ; 5 with value (4 18) 5 with value (4 32) 2 with value (4 47)
% 0.61/0.81 ; 3 with value (4 19) 1 with value (4 33) 2 with value (4 48)
% 0.61/0.81 ; 10 with value (4 20) 3 with value (4 34) 1 with value (4 49)
% 0.61/0.81 ; 8 with value (4 21) 4 with value (4 35) 2 with value (4 50)
% 0.61/0.81 ; 10 with value (4 22) 4 with value (4 36) 1 with value (4 51)
% 0.61/0.81 ; 15 with value (4 23) 2 with value (4 37) 1 with value (4 57)
% 0.61/0.81 ; 11 with value (4 24) 2 with value (4 38) 1 with value (4 61)
% 0.61/0.81 ; 5 with value (4 25) 1 with value (4 39) 1 with value (4 69)
% 0.61/0.81 ; 8 with value (4 26) 2 with value (4 40) 1 with value (4 73)
% 0.61/0.81 ; 2 with value (4 27)
% 0.61/0.81 Evaluation took:
% 0.61/0.81 0.341 seconds of real time
% 0.61/0.81 0.314854 seconds of user run time
% 0.61/0.81 0.025321 seconds of system run time
% 0.61/0.81 [Run times include 0.029 seconds GC run time.]
% 0.61/0.81 0 calls to %EVAL
% 0.61/0.81 0 page faults and
% 0.61/0.81 27,021,528 bytes consed.
% 0.61/0.81 :PROOF-FOUND
% 0.61/0.81 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-07-03T22:15:28
% 0.61/0.81 :PROOF-FOUND
% 0.61/0.81 *
%------------------------------------------------------------------------------