TSTP Solution File: LCL518+1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : LCL518+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:25 EDT 2022
% Result : Theorem 0.48s 0.64s
% Output : Refutation 0.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 18
% Syntax : Number of clauses : 46 ( 34 unt; 0 nHn; 18 RR)
% Number of literals : 63 ( 13 equ; 21 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 12 ( 10 usr; 10 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 1 con; 0-2 aty)
% Number of variables : 64 ( 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(34,axiom,
( ~ kn1
| is_a_theorem(implies(X,and(X,X))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax',kn1) ).
cnf(36,axiom,
( ~ kn2
| is_a_theorem(implies(and(X,Y),X)) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax',kn2) ).
cnf(38,axiom,
( ~ kn3
| is_a_theorem(implies(implies(X,Y),implies(not(and(Y,Z)),not(and(Z,X))))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax',kn3) ).
cnf(47,axiom,
( r1
| ~ is_a_theorem(implies(or('SKOLEMAAAV45','SKOLEMAAAV45'),'SKOLEMAAAV45')) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax',r1) ).
cnf(56,axiom,
( ~ op_or
| or(X,Y) = not(and(not(X),not(Y))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+1.ax',op_or) ).
cnf(57,axiom,
( ~ op_and
| and(X,Y) = not(or(not(X),not(Y))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+1.ax',op_and) ).
cnf(58,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(59,axiom,
( ~ op_implies_or
| implies(X,Y) = or(not(X),Y) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+1.ax',op_implies_or) ).
cnf(61,axiom,
op_or,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+5.ax',rosser_op_or) ).
cnf(62,axiom,
op_implies_and,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+5.ax',rosser_op_implies_and) ).
cnf(64,axiom,
modus_ponens,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+5.ax',rosser_modus_ponens) ).
cnf(65,axiom,
kn1,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+5.ax',rosser_kn1) ).
cnf(66,axiom,
kn2,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+5.ax',rosser_kn2) ).
cnf(67,axiom,
kn3,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+5.ax',rosser_kn3) ).
cnf(69,axiom,
op_implies_or,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',principia_op_implies_or) ).
cnf(70,axiom,
op_and,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',principia_op_and) ).
cnf(71,negated_conjecture,
~ r1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',principia_r1) ).
cnf(72,plain,
~ is_a_theorem(implies(or('SKOLEMAAAV45','SKOLEMAAAV45'),'SKOLEMAAAV45')),
inference('REWRITE',[status(thm)],[47,71]) ).
cnf(73,plain,
and(X,Y) = not(or(not(X),not(Y))),
inference('REWRITE',[status(thm)],[57,70]) ).
cnf(74,plain,
implies(X,Y) = or(not(X),Y),
inference('REWRITE',[status(thm)],[59,69]) ).
cnf(75,plain,
and(X,Y) = not(implies(X,not(Y))),
inference('REWRITE',[status(thm)],[73,74,theory(equality)]) ).
cnf(77,plain,
is_a_theorem(implies(implies(X,Y),implies(not(and(Y,Z)),not(and(Z,X))))),
inference('REWRITE',[status(thm)],[38,67]) ).
cnf(78,plain,
is_a_theorem(implies(and(X,Y),X)),
inference('REWRITE',[status(thm)],[36,66]) ).
cnf(80,plain,
is_a_theorem(implies(X,and(X,X))),
inference('REWRITE',[status(thm)],[34,65]) ).
cnf(81,plain,
( ~ is_a_theorem(X)
| ~ is_a_theorem(implies(X,Y))
| is_a_theorem(Y) ),
inference('REWRITE',[status(thm)],[1,64]) ).
cnf(83,plain,
implies(X,Y) = not(and(X,not(Y))),
inference('REWRITE',[status(thm)],[58,62]) ).
cnf(84,plain,
and(X,Y) = not(not(and(X,not(not(Y))))),
inference('REWRITE',[status(thm)],[75,83,theory(equality)]) ).
cnf(85,plain,
is_a_theorem(not(and(X,not(and(X,X))))),
inference('REWRITE',[status(thm)],[80,83,theory(equality)]) ).
cnf(101,plain,
is_a_theorem(not(and(and(X,Y),not(X)))),
inference('REWRITE',[status(thm)],[78,83,theory(equality)]) ).
cnf(112,plain,
not(and(X,not(Y))) = or(not(X),Y),
inference('REWRITE',[status(thm)],[74,83,theory(equality)]) ).
cnf(113,plain,
is_a_theorem(not(and(not(and(X,not(Y))),and(not(and(Y,Z)),and(Z,X))))),
inference('REWRITE',[status(thm)],[77,84,83,theory(equality)]) ).
cnf(114,plain,
( ~ is_a_theorem(X)
| ~ is_a_theorem(not(and(X,not(Y))))
| is_a_theorem(Y) ),
inference('REWRITE',[status(thm)],[81,83,theory(equality)]) ).
cnf(131,plain,
~ is_a_theorem(not(and(or('SKOLEMAAAV45','SKOLEMAAAV45'),not('SKOLEMAAAV45')))),
inference('REWRITE',[status(thm)],[72,83,theory(equality)]) ).
cnf(133,plain,
or(X,Y) = not(and(not(X),not(Y))),
inference('REWRITE',[status(thm)],[56,61]) ).
cnf(134,plain,
not(and(X,not(Y))) = not(and(not(not(X)),not(Y))),
inference('REWRITE',[status(thm)],[112,133,theory(equality)]) ).
cnf(145,plain,
~ is_a_theorem(not(and(not(and(not('SKOLEMAAAV45'),not('SKOLEMAAAV45'))),not('SKOLEMAAAV45')))),
inference('REWRITE',[status(thm)],[131,133,theory(equality)]) ).
cnf(150,plain,
is_a_theorem(and(not(and(and(X,Y),not(X))),not(and(and(X,Y),not(X))))),
inference('HYPERRESOLVE',[status(thm)],[114,101,85]) ).
cnf(155,plain,
( ~ is_a_theorem(X)
| ~ is_a_theorem(not(and(X,and(Y,Z))))
| is_a_theorem(not(and(Y,not(not(Z))))) ),
inference('PARAMODULATE',[status(thm)],[114,84,theory(equality)]) ).
cnf(164,plain,
and(not(not(X)),Y) = and(X,Y),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[84,134,theory(equality)]),84,theory(equality)]) ).
cnf(171,plain,
is_a_theorem(not(and(and(X,Y),not(not(not(X)))))),
inference('PARAMODULATE',[status(thm)],[101,164,theory(equality)]) ).
cnf(215,plain,
is_a_theorem(not(not(not(and(and(X,Y),not(X)))))),
inference('HYPERRESOLVE',[status(thm)],[114,150,171]) ).
cnf(222,plain,
is_a_theorem(not(and(and(not(X),Y),X))),
inference('PARAMODULATE',[status(thm)],[215,84,theory(equality)]) ).
cnf(311,plain,
is_a_theorem(not(and(not(and(and(X,X),Y)),not(not(and(Y,X)))))),
inference('HYPERRESOLVE',[status(thm)],[155,85,113]) ).
cnf(328,plain,
is_a_theorem(not(and(X,not(X)))),
inference('HYPERRESOLVE',[status(thm)],[114,311,222]) ).
cnf(330,plain,
$false,
inference('REWRITE',[status(thm)],[inference('UR-RESOLVE',[status(thm)],[114,311,145]),328]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : LCL518+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.13 % Command : run-snark %s %d
% 0.14/0.35 % Computer : n004.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Sun Jul 3 04:35:53 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.21/0.46 /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p 2022-07-03T04:35:53
% 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-03T04:35:53
% 0.48/0.64
% 0.48/0.64
% 0.48/0.64 #||
% 0.48/0.64 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.48/0.64 % SZS output start Refutation
% See solution above
% 0.48/0.66 ||#
% 0.48/0.66
% 0.48/0.66 ; Summary of computation:
% 0.48/0.66 ; 849 formulas have been input or derived (from 97 formulas).
% 0.48/0.66 ; 330 (39%) were retained. Of these,
% 0.48/0.66 ; 120 (36%) were simplified or subsumed later,
% 0.48/0.66 ; 210 (64%) are still being kept.
% 0.48/0.66 ;
% 0.48/0.66 ; Run time in seconds excluding printing time:
% 0.48/0.66 ; 0.008 5% Read assertion file (1 call)
% 0.48/0.66 ; 0.004 2% Assert (43 calls)
% 0.48/0.66 ; 0.037 23% Process new row (759 calls)
% 0.48/0.66 ; 0.008 5% Resolution (192 calls)
% 0.48/0.66 ; 0.010 6% Paramodulation (96 calls)
% 0.48/0.66 ; 0.003 2% Condensing (170 calls)
% 0.48/0.66 ; 0.004 2% Forward subsumption (170 calls)
% 0.48/0.66 ; 0.005 3% Backward subsumption (149 calls)
% 0.48/0.66 ; 0.000 0% Clause clause subsumption (83 calls)
% 0.48/0.66 ; 0.034 21% Forward simplification (748 calls)
% 0.48/0.66 ; 0.017 10% Backward simplification (330 calls)
% 0.48/0.66 ; 0.001 1% Ordering (311 calls)
% 0.48/0.66 ; 0.000 0% Sortal reasoning (32 calls)
% 0.48/0.66 ; 0.000 0% Purity testing (1 call)
% 0.48/0.66 ; 0.031 19% Other
% 0.48/0.66 ; 0.162 Total
% 0.48/0.66 ; 0.175 Real time
% 0.48/0.66 ;
% 0.48/0.66 ; Term-hash-array has 1,242 terms in all.
% 0.48/0.66 ; Feature-vector-row-index has 60 entries (60 at peak, 149 added, 89 deleted).
% 0.48/0.66 ; Feature-vector-row-index has 518 nodes (518 at peak, 1,148 added, 630 deleted).
% 0.48/0.66 ; Retrieved 147 possibly forward subsuming rows in 170 calls.
% 0.48/0.66 ; Retrieved 33 possibly backward subsumed rows in 149 calls.
% 0.48/0.66 ; Path-index has 940 entries (940 at peak, 1,557 added, 617 deleted).
% 0.48/0.66 ; Path-index has 3,477 nodes (3,477 at peak, 4,659 added, 1,182 deleted).
% 0.48/0.66 ; Trie-index has 940 entries (940 at peak, 1,557 added, 617 deleted).
% 0.48/0.66 ; Trie-index has 5,535 nodes (5,535 at peak, 8,097 added, 2,562 deleted).
% 0.48/0.66 ; Retrieved 1,259 generalization terms in 9,048 calls.
% 0.48/0.66 ; Retrieved 457 instance terms in 180 calls.
% 0.48/0.66 ; Retrieved 6,286 unifiable terms in 1,082 calls.
% 0.48/0.66 ;
% 0.48/0.66 ; The agenda of rows to process has 32 entries:
% 0.48/0.66 ; 1 with value 23 1 with value 32 2 with value 39
% 0.48/0.66 ; 1 with value 26 2 with value 34 2 with value 40
% 0.48/0.66 ; 4 with value 27 1 with value 35 3 with value 42
% 0.48/0.66 ; 1 with value 28 1 with value 36 3 with value 44
% 0.48/0.66 ; 2 with value 29 1 with value 37 4 with value 45
% 0.48/0.66 ; 1 with value 31 2 with value 38
% 0.48/0.66 ; The agenda of rows to give has 123 entries:
% 0.48/0.66 ; 1 with value (4 13) 5 with value (4 33) 4 with value (4 42)
% 0.48/0.66 ; 1 with value (4 15) 5 with value (4 34) 6 with value (4 43)
% 0.48/0.66 ; 1 with value (4 21) 7 with value (4 35) 1 with value (4 44)
% 0.48/0.66 ; 1 with value (4 23) 6 with value (4 36) 2 with value (4 45)
% 0.48/0.66 ; 5 with value (4 27) 3 with value (4 37) 8 with value (4 46)
% 0.48/0.66 ; 4 with value (4 28) 9 with value (4 38) 6 with value (4 47)
% 0.48/0.66 ; 8 with value (4 29) 9 with value (4 39) 3 with value (4 48)
% 0.48/0.66 ; 2 with value (4 30) 8 with value (4 40) 2 with value (4 49)
% 0.48/0.66 ; 7 with value (4 31) 3 with value (4 41) 1 with value (4 50)
% 0.48/0.66 ; 5 with value (4 32)
% 0.48/0.66 Evaluation took:
% 0.48/0.66 0.175 seconds of real time
% 0.48/0.66 0.162489 seconds of user run time
% 0.48/0.66 0.012968 seconds of system run time
% 0.48/0.66 [Run times include 0.011 seconds GC run time.]
% 0.48/0.66 0 calls to %EVAL
% 0.48/0.66 0 page faults and
% 0.48/0.66 14,531,824 bytes consed.
% 0.48/0.66 :PROOF-FOUND
% 0.48/0.66 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-07-03T04:35:53
% 0.48/0.66 :PROOF-FOUND
% 0.48/0.66 *
%------------------------------------------------------------------------------