TSTP Solution File: LCL494+1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : LCL494+1 : TPTP v8.1.0. Released v3.3.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:23:18 EDT 2022
% Result : Theorem 0.54s 0.73s
% Output : Refutation 0.54s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 20
% Syntax : Number of clauses : 46 ( 31 unt; 0 nHn; 21 RR)
% Number of literals : 65 ( 14 equ; 25 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 13 ( 11 usr; 11 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 4 con; 0-2 aty)
% Number of variables : 58 ( 8 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ modus_ponens
| ~ is_a_theorem(X)
| ~ is_a_theorem(implies(X,Y))
| is_a_theorem(Y) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+0.ax',modus_ponens) ).
cnf(18,axiom,
( ~ and_2
| is_a_theorem(implies(and(X,Y),Y)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+0.ax',and_2) ).
cnf(19,axiom,
( and_2
| ~ is_a_theorem(implies(and('SKOLEMAAAV16','SKOLEMAAAV17'),'SKOLEMAAAV17')) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+0.ax',and_2) ).
cnf(31,axiom,
( equivalence_2
| ~ is_a_theorem(implies(equiv('SKOLEMAAAV29','SKOLEMAAAV30'),implies('SKOLEMAAAV30','SKOLEMAAAV29'))) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+0.ax',equivalence_2) ).
cnf(48,axiom,
( ~ r2
| is_a_theorem(implies(X,or(Y,X))) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+0.ax',r2) ).
cnf(50,axiom,
( ~ r3
| is_a_theorem(implies(or(X,Y),or(Y,X))) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+0.ax',r3) ).
cnf(56,axiom,
( ~ op_or
| or(X,Y) = not(and(not(X),not(Y))) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+1.ax',op_or) ).
cnf(57,axiom,
( ~ op_and
| and(X,Y) = not(or(not(X),not(Y))) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+1.ax',op_and) ).
cnf(58,axiom,
( ~ op_implies_and
| implies(X,Y) = not(and(X,not(Y))) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+1.ax',op_implies_and) ).
cnf(59,axiom,
( ~ op_implies_or
| implies(X,Y) = or(not(X),Y) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+1.ax',op_implies_or) ).
cnf(60,axiom,
( ~ op_equiv
| equiv(X,Y) = and(implies(X,Y),implies(Y,X)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+1.ax',op_equiv) ).
cnf(61,axiom,
op_implies_or,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+4.ax',principia_op_implies_or) ).
cnf(62,axiom,
op_and,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+4.ax',principia_op_and) ).
cnf(63,axiom,
op_equiv,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+4.ax',principia_op_equiv) ).
cnf(64,axiom,
modus_ponens,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+4.ax',principia_modus_ponens) ).
cnf(66,axiom,
r2,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+4.ax',principia_r2) ).
cnf(67,axiom,
r3,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+4.ax',principia_r3) ).
cnf(71,axiom,
op_or,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hilbert_op_or) ).
cnf(72,axiom,
op_implies_and,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hilbert_op_implies_and) ).
cnf(73,negated_conjecture,
~ equivalence_2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hilbert_equivalence_2) ).
cnf(74,plain,
~ is_a_theorem(implies(equiv('SKOLEMAAAV29','SKOLEMAAAV30'),implies('SKOLEMAAAV30','SKOLEMAAAV29'))),
inference('REWRITE',[status(thm)],[31,73]) ).
cnf(75,plain,
implies(X,Y) = not(and(X,not(Y))),
inference('REWRITE',[status(thm)],[58,72]) ).
cnf(86,plain,
( ~ and_2
| is_a_theorem(not(and(and(X,Y),not(Y)))) ),
inference('REWRITE',[status(thm)],[18,75,theory(equality)]) ).
cnf(103,plain,
( and_2
| ~ is_a_theorem(not(and(and('SKOLEMAAAV16','SKOLEMAAAV17'),not('SKOLEMAAAV17')))) ),
inference('REWRITE',[status(thm)],[19,75,theory(equality)]) ).
cnf(106,plain,
~ is_a_theorem(not(and(equiv('SKOLEMAAAV29','SKOLEMAAAV30'),not(not(and('SKOLEMAAAV30',not('SKOLEMAAAV29'))))))),
inference('REWRITE',[status(thm)],[74,75,theory(equality)]) ).
cnf(113,plain,
or(X,Y) = not(and(not(X),not(Y))),
inference('REWRITE',[status(thm)],[56,71]) ).
cnf(123,plain,
is_a_theorem(not(and(not(and(not(X),not(Y))),not(not(and(not(Y),not(X))))))),
inference('REWRITE',[status(thm)],[50,75,113,67,theory(equality)]) ).
cnf(124,plain,
is_a_theorem(not(and(X,not(not(and(not(Y),not(X))))))),
inference('REWRITE',[status(thm)],[48,75,113,66,theory(equality)]) ).
cnf(128,plain,
( ~ is_a_theorem(X)
| ~ is_a_theorem(not(and(X,not(Y))))
| is_a_theorem(Y) ),
inference('REWRITE',[status(thm)],[1,75,64,theory(equality)]) ).
cnf(129,plain,
equiv(X,Y) = and(not(and(X,not(Y))),not(and(Y,not(X)))),
inference('REWRITE',[status(thm)],[60,75,63,theory(equality)]) ).
cnf(134,plain,
~ is_a_theorem(not(and(and(not(and('SKOLEMAAAV29',not('SKOLEMAAAV30'))),not(and('SKOLEMAAAV30',not('SKOLEMAAAV29')))),not(not(and('SKOLEMAAAV30',not('SKOLEMAAAV29'))))))),
inference('REWRITE',[status(thm)],[106,129,theory(equality)]) ).
cnf(136,plain,
and(X,Y) = not(not(and(not(not(X)),not(not(Y))))),
inference('REWRITE',[status(thm)],[57,113,62,theory(equality)]) ).
cnf(137,plain,
not(and(X,not(Y))) = not(and(not(not(X)),not(Y))),
inference('REWRITE',[status(thm)],[59,113,75,61,theory(equality)]) ).
cnf(138,plain,
and(X,Y) = not(not(and(X,not(not(Y))))),
inference('REWRITE',[status(thm)],[136,137,theory(equality)]) ).
cnf(149,plain,
and(X,and(Y,not(not(Z)))) = not(not(and(X,and(Y,Z)))),
inference('PARAMODULATE',[status(thm)],[138,138,theory(equality)]) ).
cnf(153,plain,
is_a_theorem(not(and(not(X),and(not(Y),X)))),
inference('PARAMODULATE',[status(thm)],[124,138,theory(equality)]) ).
cnf(161,plain,
and(not(not(X)),Y) = and(X,Y),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[138,137,theory(equality)]),138,theory(equality)]) ).
cnf(169,plain,
~ and_2,
inference('UR-RESOLVE',[status(thm)],[86,134]) ).
cnf(170,plain,
~ is_a_theorem(not(and(and('SKOLEMAAAV16','SKOLEMAAAV17'),not('SKOLEMAAAV17')))),
inference('REWRITE',[status(thm)],[103,169]) ).
cnf(189,plain,
( ~ is_a_theorem(not(not(X)))
| ~ is_a_theorem(not(and(X,not(Y))))
| is_a_theorem(Y) ),
inference('PARAMODULATE',[status(thm)],[128,161,theory(equality)]) ).
cnf(190,plain,
and(not(and(X,Y)),Z) = and(not(and(X,not(not(Y)))),Z),
inference('PARAMODULATE',[status(thm)],[161,138,theory(equality)]) ).
cnf(208,plain,
is_a_theorem(not(and(not(and(not(X),Y)),not(not(and(Y,not(X))))))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[123,161,theory(equality)]),190,theory(equality)]) ).
cnf(214,plain,
is_a_theorem(not(and(not(X),and(Y,X)))),
inference('PARAMODULATE',[status(thm)],[153,161,theory(equality)]) ).
cnf(215,plain,
is_a_theorem(not(and(X,and(Y,not(X))))),
inference('PARAMODULATE',[status(thm)],[214,161,theory(equality)]) ).
cnf(335,plain,
is_a_theorem(not(not(not(and(not(X),and(Y,X)))))),
inference('PARAMODULATE',[status(thm)],[215,149,theory(equality)]) ).
cnf(619,plain,
$false,
inference('UR-RESOLVE',[status(thm)],[189,208,335,170]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL494+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.13 % Command : run-snark %s %d
% 0.13/0.34 % Computer : n004.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 : Mon Jul 4 07:46:08 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.21/0.46 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.47 *
% 0.21/0.47 *
% 0.21/0.48 #<PACKAGE "SNARK-USER">
% 0.21/0.48 *
% 0.21/0.48 SNARK-TPTP-OPTIONS
% 0.21/0.48 *
% 0.21/0.48 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.21/0.48 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.21/0.48 (USE-FACTORING :POS)
% 0.21/0.48 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.21/0.48 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.21/0.48 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.21/0.48 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.21/0.48 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.21/0.48 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.21/0.48 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.21/0.48 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.21/0.48 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.21/0.48 (DECLARE-TPTP-SYMBOLS2))
% 0.21/0.48 *
% 0.21/0.48 "."
% 0.21/0.48 *
% 0.21/0.48 ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-07-04T07:46:08
% 0.21/0.48 ; 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-04T07:46:08
% 0.54/0.73
% 0.54/0.73
% 0.54/0.73 #||
% 0.54/0.73 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.54/0.73 % SZS output start Refutation
% See solution above
% 0.54/0.73 ||#
% 0.54/0.73
% 0.54/0.73 ; Summary of computation:
% 0.54/0.73 ; 1590 formulas have been input or derived (from 119 formulas).
% 0.54/0.73 ; 619 (39%) were retained. Of these,
% 0.54/0.73 ; 173 (28%) were simplified or subsumed later,
% 0.54/0.73 ; 446 (72%) are still being kept.
% 0.54/0.73 ;
% 0.54/0.73 ; Run time in seconds excluding printing time:
% 0.54/0.73 ; 0.009 4% Read assertion file (1 call)
% 0.54/0.73 ; 0.004 2% Assert (45 calls)
% 0.54/0.73 ; 0.078 31% Process new row (1,407 calls)
% 0.54/0.73 ; 0.032 13% Resolution (236 calls)
% 0.54/0.73 ; 0.011 4% Paramodulation (118 calls)
% 0.54/0.73 ; 0.003 1% Condensing (142 calls)
% 0.54/0.73 ; 0.005 2% Forward subsumption (142 calls)
% 0.54/0.73 ; 0.004 2% Backward subsumption (136 calls)
% 0.54/0.73 ; 0.000 0% Clause clause subsumption (36 calls)
% 0.54/0.73 ; 0.053 21% Forward simplification (1,347 calls)
% 0.54/0.73 ; 0.023 9% Backward simplification (619 calls)
% 0.54/0.73 ; 0.003 1% Ordering (296 calls)
% 0.54/0.73 ; 0.000 0% Sortal reasoning (32 calls)
% 0.54/0.73 ; 0.000 0% Purity testing (1 call)
% 0.54/0.73 ; 0.023 9% Other
% 0.54/0.73 ; 0.248 Total
% 0.54/0.73 ; 0.252 Real time
% 0.54/0.73 ;
% 0.54/0.73 ; Term-hash-array has 2,237 terms in all.
% 0.54/0.73 ; Feature-vector-row-index has 41 entries (60 at peak, 136 added, 95 deleted).
% 0.54/0.73 ; Feature-vector-row-index has 367 nodes (403 at peak, 1,086 added, 719 deleted).
% 0.54/0.73 ; Retrieved 62 possibly forward subsuming rows in 142 calls.
% 0.54/0.73 ; Retrieved 24 possibly backward subsumed rows in 136 calls.
% 0.54/0.73 ; Path-index has 1,667 entries (1,667 at peak, 2,592 added, 925 deleted).
% 0.54/0.73 ; Path-index has 3,712 nodes (3,712 at peak, 5,022 added, 1,310 deleted).
% 0.54/0.73 ; Trie-index has 1,667 entries (1,667 at peak, 2,592 added, 925 deleted).
% 0.54/0.73 ; Trie-index has 8,640 nodes (8,640 at peak, 12,687 added, 4,047 deleted).
% 0.54/0.73 ; Retrieved 2,971 generalization terms in 15,172 calls.
% 0.54/0.73 ; Retrieved 892 instance terms in 482 calls.
% 0.54/0.73 ; Retrieved 15,660 unifiable terms in 1,594 calls.
% 0.54/0.73 ;
% 0.54/0.73 ; The agenda of rows to process has 97 entries:
% 0.54/0.73 ; 1 with value 13 5 with value 23 2 with value 36
% 0.54/0.73 ; 4 with value 15 10 with value 24 4 with value 37
% 0.54/0.73 ; 3 with value 16 1 with value 25 6 with value 39
% 0.54/0.73 ; 5 with value 17 3 with value 26 1 with value 40
% 0.54/0.73 ; 4 with value 18 4 with value 27 1 with value 41
% 0.54/0.73 ; 4 with value 19 2 with value 30 3 with value 42
% 0.54/0.73 ; 13 with value 20 4 with value 31 2 with value 43
% 0.54/0.73 ; 1 with value 21 3 with value 33 1 with value 49
% 0.54/0.73 ; 6 with value 22 4 with value 34
% 0.54/0.73 ; The agenda of rows to give has 345 entries:
% 0.54/0.73 ; 11 with value (4 23) 18 with value (4 32) 10 with value (4 40)
% 0.54/0.73 ; 10 with value (4 24) 20 with value (4 33) 2 with value (4 41)
% 0.54/0.73 ; 19 with value (4 25) 8 with value (4 34) 2 with value (4 42)
% 0.54/0.73 ; 18 with value (4 26) 25 with value (4 35) 2 with value (4 43)
% 0.54/0.73 ; 27 with value (4 27) 26 with value (4 36) 1 with value (4 44)
% 0.54/0.73 ; 19 with value (4 28) 11 with value (4 37) 2 with value (4 48)
% 0.54/0.73 ; 22 with value (4 29) 28 with value (4 38) 1 with value (4 49)
% 0.54/0.73 ; 28 with value (4 30) 11 with value (4 39) 1 with value (4 54)
% 0.54/0.73 ; 23 with value (4 31)
% 0.54/0.73 Evaluation took:
% 0.54/0.73 0.253 seconds of real time
% 0.54/0.73 0.230358 seconds of user run time
% 0.54/0.73 0.022081 seconds of system run time
% 0.54/0.73 [Run times include 0.011 seconds GC run time.]
% 0.54/0.73 0 calls to %EVAL
% 0.54/0.73 0 page faults and
% 0.54/0.73 21,463,744 bytes consed.
% 0.54/0.73 :PROOF-FOUND
% 0.54/0.73 ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-07-04T07:46:08
% 0.54/0.73 :PROOF-FOUND
% 0.54/0.73 *
%------------------------------------------------------------------------------