TSTP Solution File: LCL483+1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : LCL483+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n015.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:15 EDT 2022
% Result : Theorem 0.19s 0.57s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 12
% Syntax : Number of clauses : 25 ( 19 unt; 0 nHn; 11 RR)
% Number of literals : 31 ( 11 equ; 10 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 9 ( 7 usr; 7 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 29 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(9,axiom,
( modus_tollens
| ~ is_a_theorem(implies(implies(not('SKOLEMAAAV6'),not('SKOLEMAAAV5')),implies('SKOLEMAAAV5','SKOLEMAAAV6'))) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+0.ax',modus_tollens) ).
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(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(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,
~ modus_tollens,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hilbert_modus_tollens) ).
cnf(74,plain,
~ is_a_theorem(implies(implies(not('SKOLEMAAAV6'),not('SKOLEMAAAV5')),implies('SKOLEMAAAV5','SKOLEMAAAV6'))),
inference('REWRITE',[status(thm)],[9,73]) ).
cnf(75,plain,
implies(X,Y) = not(and(X,not(Y))),
inference('REWRITE',[status(thm)],[58,72]) ).
cnf(98,plain,
~ is_a_theorem(not(and(not(and(not('SKOLEMAAAV6'),not(not('SKOLEMAAAV5')))),not(not(and('SKOLEMAAAV5',not('SKOLEMAAAV6'))))))),
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(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(162,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(185,plain,
and(not(and(X,Y)),Z) = and(not(and(X,not(not(Y)))),Z),
inference('PARAMODULATE',[status(thm)],[162,139,theory(equality)]) ).
cnf(202,plain,
~ is_a_theorem(not(and(not(and(not('SKOLEMAAAV6'),'SKOLEMAAAV5')),not(not(and('SKOLEMAAAV5',not('SKOLEMAAAV6'))))))),
inference('REWRITE',[status(thm)],[98,185,theory(equality)]) ).
cnf(203,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,162,theory(equality)]),185,theory(equality)]) ).
cnf(204,plain,
$false,
inference('REWRITE',[status(thm)],[202,203]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12 % Problem : LCL483+1 : TPTP v8.1.0. Released v3.3.0.
% 0.08/0.13 % Command : run-snark %s %d
% 0.13/0.34 % Computer : n015.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 01:08:59 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.45 /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p 2022-07-03T01:09:00
% 0.19/0.47 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n015.cluster.edu at 2022-07-03T01:09:00
% 0.19/0.57
% 0.19/0.57
% 0.19/0.57 #||
% 0.19/0.57 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.57 % SZS output start Refutation
% See solution above
% 0.19/0.57 ||#
% 0.19/0.57
% 0.19/0.57 ; Summary of computation:
% 0.19/0.57 ; 244 formulas have been input or derived (from 63 formulas).
% 0.19/0.57 ; 204 (84%) were retained. Of these,
% 0.19/0.57 ; 114 (56%) were simplified or subsumed later,
% 0.19/0.57 ; 90 (44%) are still being kept.
% 0.19/0.57 ;
% 0.19/0.57 ; Run time in seconds excluding printing time:
% 0.19/0.57 ; 0.008 8% Read assertion file (1 call)
% 0.19/0.57 ; 0.004 4% Assert (45 calls)
% 0.19/0.57 ; 0.027 26% Process new row (232 calls)
% 0.19/0.57 ; 0.003 3% Resolution (124 calls)
% 0.19/0.57 ; 0.003 3% Paramodulation (62 calls)
% 0.19/0.57 ; 0.003 3% Condensing (127 calls)
% 0.19/0.57 ; 0.007 7% Forward subsumption (127 calls)
% 0.19/0.57 ; 0.003 3% Backward subsumption (127 calls)
% 0.19/0.57 ; 0.000 0% Clause clause subsumption (9 calls)
% 0.19/0.57 ; 0.005 5% Forward simplification (220 calls)
% 0.19/0.57 ; 0.015 14% Backward simplification (204 calls)
% 0.19/0.57 ; 0.001 1% Ordering (82 calls)
% 0.19/0.57 ; 0.000 0% Sortal reasoning (32 calls)
% 0.19/0.57 ; 0.000 0% Purity testing (1 call)
% 0.19/0.57 ; 0.025 24% Other
% 0.19/0.57 ; 0.104 Total
% 0.19/0.57 ; 0.107 Real time
% 0.19/0.57 ;
% 0.19/0.57 ; Term-hash-array has 857 terms in all.
% 0.19/0.57 ; Feature-vector-row-index has 36 entries (60 at peak, 127 added, 91 deleted).
% 0.19/0.57 ; Feature-vector-row-index has 347 nodes (403 at peak, 1,038 added, 691 deleted).
% 0.19/0.57 ; Retrieved 36 possibly forward subsuming rows in 127 calls.
% 0.19/0.57 ; Retrieved 17 possibly backward subsumed rows in 127 calls.
% 0.19/0.57 ; Path-index has 487 entries (511 at peak, 1,192 added, 705 deleted).
% 0.19/0.57 ; Path-index has 1,749 nodes (1,771 at peak, 3,008 added, 1,259 deleted).
% 0.19/0.57 ; Trie-index has 487 entries (511 at peak, 1,192 added, 705 deleted).
% 0.19/0.57 ; Trie-index has 2,414 nodes (2,581 at peak, 5,374 added, 2,960 deleted).
% 0.19/0.57 ; Retrieved 159 generalization terms in 1,024 calls.
% 0.19/0.57 ; Retrieved 225 instance terms in 76 calls.
% 0.19/0.57 ; Retrieved 957 unifiable terms in 462 calls.
% 0.19/0.57 ;
% 0.19/0.57 ; The agenda of rows to process has 10 entries:
% 0.19/0.57 ; 1 with value 26 1 with value 30 4 with value 33
% 0.19/0.57 ; 1 with value 29 2 with value 31 1 with value 34
% 0.19/0.57 ; The agenda of input rows to give has 3 entries:
% 0.19/0.57 ; 2 with value 24 1 with value 27
% 0.19/0.57 ; The agenda of rows to give has 33 entries:
% 0.19/0.57 ; 1 with value (4 15) 1 with value (4 22) 5 with value (4 30)
% 0.19/0.57 ; 1 with value (4 16) 4 with value (4 23) 1 with value (4 31)
% 0.19/0.57 ; 2 with value (4 18) 1 with value (4 24) 2 with value (4 32)
% 0.19/0.57 ; 2 with value (4 19) 2 with value (4 26) 1 with value (4 35)
% 0.19/0.57 ; 1 with value (4 20) 1 with value (4 27) 2 with value (4 36)
% 0.19/0.57 ; 3 with value (4 21) 1 with value (4 29) 2 with value (4 42)
% 0.19/0.57 Evaluation took:
% 0.19/0.57 0.107 seconds of real time
% 0.19/0.57 0.091478 seconds of user run time
% 0.19/0.57 0.016213 seconds of system run time
% 0.19/0.57 0 calls to %EVAL
% 0.19/0.57 0 page faults and
% 0.19/0.57 8,410,200 bytes consed.
% 0.19/0.57 :PROOF-FOUND
% 0.19/0.57 ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-07-03T01:09:00
% 0.19/0.57 :PROOF-FOUND
% 0.19/0.57 *
%------------------------------------------------------------------------------