TSTP Solution File: LCL488+1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : LCL488+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n020.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:17 EDT 2022
% Result : Theorem 0.49s 0.68s
% Output : Refutation 0.49s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 16
% Syntax : Number of clauses : 36 ( 26 unt; 0 nHn; 15 RR)
% Number of literals : 50 ( 12 equ; 17 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 11 ( 9 usr; 9 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 50 ( 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(19,axiom,
( and_2
| ~ is_a_theorem(implies(and('SKOLEMAAAV16','SKOLEMAAAV17'),'SKOLEMAAAV17')) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax',and_2) ).
cnf(48,axiom,
( ~ r2
| is_a_theorem(implies(X,or(Y,X))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax',r2) ).
cnf(50,axiom,
( ~ r3
| is_a_theorem(implies(or(X,Y),or(Y,X))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax',r3) ).
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_implies_or,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+4.ax',principia_op_implies_or) ).
cnf(62,axiom,
op_and,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+4.ax',principia_op_and) ).
cnf(64,axiom,
modus_ponens,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+4.ax',principia_modus_ponens) ).
cnf(66,axiom,
r2,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+4.ax',principia_r2) ).
cnf(67,axiom,
r3,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+4.ax',principia_r3) ).
cnf(71,axiom,
op_or,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',hilbert_op_or) ).
cnf(72,axiom,
op_implies_and,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',hilbert_op_implies_and) ).
cnf(73,negated_conjecture,
~ and_2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',hilbert_and_2) ).
cnf(74,plain,
~ is_a_theorem(implies(and('SKOLEMAAAV16','SKOLEMAAAV17'),'SKOLEMAAAV17')),
inference('REWRITE',[status(thm)],[19,73]) ).
cnf(75,plain,
implies(X,Y) = not(and(X,not(Y))),
inference('REWRITE',[status(thm)],[58,72]) ).
cnf(103,plain,
~ is_a_theorem(not(and(and('SKOLEMAAAV16','SKOLEMAAAV17'),not('SKOLEMAAAV17')))),
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(137,plain,
and(X,Y) = not(not(and(not(not(X)),not(not(Y))))),
inference('REWRITE',[status(thm)],[57,113,62,theory(equality)]) ).
cnf(138,plain,
not(and(X,not(Y))) = not(and(not(not(X)),not(Y))),
inference('REWRITE',[status(thm)],[59,113,75,61,theory(equality)]) ).
cnf(139,plain,
and(X,Y) = not(not(and(X,not(not(Y))))),
inference('REWRITE',[status(thm)],[137,138,theory(equality)]) ).
cnf(152,plain,
and(X,and(Y,not(not(Z)))) = not(not(and(X,and(Y,Z)))),
inference('PARAMODULATE',[status(thm)],[139,139,theory(equality)]) ).
cnf(156,plain,
is_a_theorem(not(and(not(X),and(not(Y),X)))),
inference('PARAMODULATE',[status(thm)],[124,139,theory(equality)]) ).
cnf(165,plain,
and(not(not(X)),Y) = and(X,Y),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[139,138,theory(equality)]),139,theory(equality)]) ).
cnf(184,plain,
( ~ is_a_theorem(not(not(X)))
| ~ is_a_theorem(not(and(X,not(Y))))
| is_a_theorem(Y) ),
inference('PARAMODULATE',[status(thm)],[128,165,theory(equality)]) ).
cnf(185,plain,
and(not(and(X,Y)),Z) = and(not(and(X,not(not(Y)))),Z),
inference('PARAMODULATE',[status(thm)],[165,139,theory(equality)]) ).
cnf(202,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,165,theory(equality)]),185,theory(equality)]) ).
cnf(208,plain,
is_a_theorem(not(and(not(X),and(Y,X)))),
inference('PARAMODULATE',[status(thm)],[156,165,theory(equality)]) ).
cnf(209,plain,
is_a_theorem(not(and(X,and(Y,not(X))))),
inference('PARAMODULATE',[status(thm)],[208,165,theory(equality)]) ).
cnf(279,plain,
is_a_theorem(not(not(not(and(not(X),and(Y,X)))))),
inference('PARAMODULATE',[status(thm)],[209,152,theory(equality)]) ).
cnf(461,plain,
$false,
inference('UR-RESOLVE',[status(thm)],[184,202,279,103]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LCL488+1 : TPTP v8.1.0. Released v3.3.0.
% 0.12/0.13 % Command : run-snark %s %d
% 0.13/0.34 % Computer : n020.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 04:57:00 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.45 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.46 *
% 0.20/0.46 *
% 0.20/0.47 #<PACKAGE "SNARK-USER">
% 0.20/0.47 *
% 0.20/0.47 SNARK-TPTP-OPTIONS
% 0.20/0.47 *
% 0.20/0.47 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.20/0.47 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.20/0.47 (USE-FACTORING :POS)
% 0.20/0.47 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.20/0.47 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.20/0.47 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.20/0.47 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.20/0.47 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.20/0.47 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.20/0.47 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.20/0.47 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.20/0.47 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.20/0.47 (DECLARE-TPTP-SYMBOLS2))
% 0.20/0.47 *
% 0.20/0.47 "."
% 0.20/0.47 *
% 0.20/0.47 ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-07-03T04:57:00
% 0.20/0.47 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n020.cluster.edu at 2022-07-03T04:57:00
% 0.49/0.68
% 0.49/0.68
% 0.49/0.68 #||
% 0.49/0.68 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.49/0.68 % SZS output start Refutation
% See solution above
% 0.49/0.68 ||#
% 0.49/0.68
% 0.49/0.68 ; Summary of computation:
% 0.49/0.68 ; 1181 formulas have been input or derived (from 107 formulas).
% 0.49/0.68 ; 461 (39%) were retained. Of these,
% 0.49/0.68 ; 154 (33%) were simplified or subsumed later,
% 0.49/0.68 ; 307 (67%) are still being kept.
% 0.49/0.68 ;
% 0.49/0.68 ; Run time in seconds excluding printing time:
% 0.49/0.68 ; 0.008 4% Read assertion file (1 call)
% 0.49/0.68 ; 0.003 1% Assert (45 calls)
% 0.49/0.68 ; 0.058 28% Process new row (1,010 calls)
% 0.49/0.68 ; 0.014 7% Resolution (212 calls)
% 0.49/0.68 ; 0.024 12% Paramodulation (106 calls)
% 0.49/0.68 ; 0.002 1% Condensing (144 calls)
% 0.49/0.68 ; 0.007 3% Forward subsumption (144 calls)
% 0.49/0.68 ; 0.001 0% Backward subsumption (138 calls)
% 0.49/0.68 ; 0.000 0% Clause clause subsumption (36 calls)
% 0.49/0.68 ; 0.037 18% Forward simplification (961 calls)
% 0.49/0.68 ; 0.020 10% Backward simplification (461 calls)
% 0.49/0.68 ; 0.000 0% Ordering (290 calls)
% 0.49/0.68 ; 0.001 0% Sortal reasoning (32 calls)
% 0.49/0.68 ; 0.000 0% Purity testing (1 call)
% 0.49/0.68 ; 0.032 15% Other
% 0.49/0.68 ; 0.207 Total
% 0.49/0.68 ; 0.210 Real time
% 0.49/0.68 ;
% 0.49/0.68 ; Term-hash-array has 1,760 terms in all.
% 0.49/0.68 ; Feature-vector-row-index has 43 entries (60 at peak, 138 added, 95 deleted).
% 0.49/0.68 ; Feature-vector-row-index has 389 nodes (403 at peak, 1,117 added, 728 deleted).
% 0.49/0.68 ; Retrieved 62 possibly forward subsuming rows in 144 calls.
% 0.49/0.68 ; Retrieved 23 possibly backward subsumed rows in 138 calls.
% 0.49/0.68 ; Path-index has 1,242 entries (1,242 at peak, 2,108 added, 866 deleted).
% 0.49/0.68 ; Path-index has 3,282 nodes (3,282 at peak, 4,575 added, 1,293 deleted).
% 0.49/0.68 ; Trie-index has 1,242 entries (1,242 at peak, 2,108 added, 866 deleted).
% 0.49/0.68 ; Trie-index has 6,561 nodes (6,561 at peak, 10,256 added, 3,695 deleted).
% 0.49/0.68 ; Retrieved 2,049 generalization terms in 9,924 calls.
% 0.49/0.68 ; Retrieved 670 instance terms in 322 calls.
% 0.49/0.68 ; Retrieved 10,559 unifiable terms in 1,321 calls.
% 0.49/0.68 ;
% 0.49/0.68 ; The agenda of rows to process has 74 entries:
% 0.49/0.68 ; 4 with value 15 4 with value 23 2 with value 34
% 0.49/0.68 ; 1 with value 16 9 with value 24 2 with value 36
% 0.49/0.68 ; 4 with value 17 1 with value 25 1 with value 37
% 0.49/0.68 ; 4 with value 18 3 with value 26 4 with value 39
% 0.49/0.68 ; 4 with value 19 3 with value 27 1 with value 41
% 0.49/0.68 ; 11 with value 20 1 with value 30 2 with value 42
% 0.49/0.68 ; 1 with value 21 2 with value 31 2 with value 43
% 0.49/0.68 ; 6 with value 22 2 with value 33
% 0.49/0.68 ; The agenda of rows to give has 216 entries:
% 0.49/0.68 ; 5 with value (4 23) 22 with value (4 30) 8 with value (4 37)
% 0.49/0.68 ; 9 with value (4 24) 12 with value (4 31) 21 with value (4 38)
% 0.49/0.68 ; 12 with value (4 25) 10 with value (4 32) 6 with value (4 39)
% 0.49/0.68 ; 12 with value (4 26) 6 with value (4 33) 7 with value (4 40)
% 0.49/0.68 ; 18 with value (4 27) 6 with value (4 34) 2 with value (4 41)
% 0.49/0.68 ; 15 with value (4 28) 12 with value (4 35) 2 with value (4 42)
% 0.49/0.68 ; 10 with value (4 29) 20 with value (4 36) 1 with value (4 43)
% 0.49/0.68 Evaluation took:
% 0.49/0.68 0.21 seconds of real time
% 0.49/0.68 0.193369 seconds of user run time
% 0.49/0.68 0.017076 seconds of system run time
% 0.49/0.68 [Run times include 0.011 seconds GC run time.]
% 0.49/0.68 0 calls to %EVAL
% 0.49/0.68 0 page faults and
% 0.49/0.68 16,812,736 bytes consed.
% 0.49/0.68 :PROOF-FOUND
% 0.49/0.68 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-07-03T04:57:00
% 0.49/0.68 :PROOF-FOUND
% 0.49/0.68 *
%------------------------------------------------------------------------------