TSTP Solution File: LCL456+1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : LCL456+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n013.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:06 EDT 2022
% Result : Theorem 0.45s 0.63s
% Output : Refutation 0.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 18
% Syntax : Number of clauses : 43 ( 32 unt; 0 nHn; 18 RR)
% Number of literals : 58 ( 14 equ; 20 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 12 ( 10 usr; 10 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 61 ( 9 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(8,axiom,
( ~ modus_tollens
| is_a_theorem(implies(implies(not(X),not(Y)),implies(Y,X))) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+0.ax',modus_tollens) ).
cnf(10,axiom,
( ~ implies_1
| is_a_theorem(implies(X,implies(Y,X))) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+0.ax',implies_1) ).
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(51,axiom,
( r3
| ~ is_a_theorem(implies(or('SKOLEMAAAU48','SKOLEMAAAU49'),or('SKOLEMAAAU49','SKOLEMAAAU48'))) ),
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_or,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+2.ax',hilbert_op_or) ).
cnf(62,axiom,
op_implies_and,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+2.ax',hilbert_op_implies_and) ).
cnf(64,axiom,
modus_ponens,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+2.ax',hilbert_modus_ponens) ).
cnf(65,axiom,
modus_tollens,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+2.ax',hilbert_modus_tollens) ).
cnf(66,axiom,
implies_1,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+2.ax',hilbert_implies_1) ).
cnf(70,axiom,
and_2,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+2.ax',hilbert_and_2) ).
cnf(79,axiom,
op_implies_or,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',principia_op_implies_or) ).
cnf(80,axiom,
op_and,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',principia_op_and) ).
cnf(81,negated_conjecture,
~ r3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',principia_r3) ).
cnf(82,plain,
~ is_a_theorem(implies(or('SKOLEMAAAU48','SKOLEMAAAU49'),or('SKOLEMAAAU49','SKOLEMAAAU48'))),
inference('REWRITE',[status(thm)],[51,81]) ).
cnf(83,plain,
and(X,Y) = not(or(not(X),not(Y))),
inference('REWRITE',[status(thm)],[57,80]) ).
cnf(84,plain,
implies(X,Y) = or(not(X),Y),
inference('REWRITE',[status(thm)],[59,79]) ).
cnf(85,plain,
and(X,Y) = not(implies(X,not(Y))),
inference('REWRITE',[status(thm)],[83,84,theory(equality)]) ).
cnf(95,plain,
is_a_theorem(implies(and(X,Y),Y)),
inference('REWRITE',[status(thm)],[18,70]) ).
cnf(101,plain,
is_a_theorem(implies(X,implies(Y,X))),
inference('REWRITE',[status(thm)],[10,66]) ).
cnf(102,plain,
is_a_theorem(implies(implies(not(X),not(Y)),implies(Y,X))),
inference('REWRITE',[status(thm)],[8,65]) ).
cnf(103,plain,
( ~ is_a_theorem(X)
| ~ is_a_theorem(implies(X,Y))
| is_a_theorem(Y) ),
inference('REWRITE',[status(thm)],[1,64]) ).
cnf(105,plain,
implies(X,Y) = not(and(X,not(Y))),
inference('REWRITE',[status(thm)],[58,62]) ).
cnf(106,plain,
and(X,Y) = not(not(and(X,not(not(Y))))),
inference('REWRITE',[status(thm)],[85,105,theory(equality)]) ).
cnf(114,plain,
~ is_a_theorem(not(and(or('SKOLEMAAAU48','SKOLEMAAAU49'),not(or('SKOLEMAAAU49','SKOLEMAAAU48'))))),
inference('REWRITE',[status(thm)],[82,105,theory(equality)]) ).
cnf(115,plain,
is_a_theorem(not(and(and(X,Y),not(Y)))),
inference('REWRITE',[status(thm)],[95,105,theory(equality)]) ).
cnf(117,plain,
is_a_theorem(not(and(X,not(not(and(Y,not(X))))))),
inference('REWRITE',[status(thm)],[101,105,theory(equality)]) ).
cnf(118,plain,
is_a_theorem(not(and(not(and(not(X),not(not(Y)))),not(not(and(Y,not(X))))))),
inference('REWRITE',[status(thm)],[102,105,theory(equality)]) ).
cnf(125,plain,
not(and(X,not(Y))) = or(not(X),Y),
inference('REWRITE',[status(thm)],[84,105,theory(equality)]) ).
cnf(131,plain,
( ~ is_a_theorem(X)
| ~ is_a_theorem(not(and(X,not(Y))))
| is_a_theorem(Y) ),
inference('REWRITE',[status(thm)],[103,105,theory(equality)]) ).
cnf(139,plain,
or(X,Y) = not(and(not(X),not(Y))),
inference('REWRITE',[status(thm)],[56,61]) ).
cnf(140,plain,
not(and(X,not(Y))) = not(and(not(not(X)),not(Y))),
inference('REWRITE',[status(thm)],[125,139,theory(equality)]) ).
cnf(148,plain,
~ is_a_theorem(not(and(not(and(not('SKOLEMAAAU48'),not('SKOLEMAAAU49'))),not(not(and(not('SKOLEMAAAU49'),not('SKOLEMAAAU48'))))))),
inference('REWRITE',[status(thm)],[114,139,theory(equality)]) ).
cnf(162,plain,
and(not(not(X)),Y) = and(X,Y),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[106,140,theory(equality)]),106,theory(equality)]) ).
cnf(187,plain,
is_a_theorem(not(and(X,and(not(and(not(Y),not(not(Z)))),and(Z,not(Y)))))),
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[131,118,117]),106,theory(equality)]) ).
cnf(196,plain,
~ is_a_theorem(not(and(not(and(and(X,Y),not(Y))),and(not(and(not('SKOLEMAAAU48'),not('SKOLEMAAAU49'))),and(not('SKOLEMAAAU49'),not('SKOLEMAAAU48')))))),
inference('REWRITE',[status(thm)],[inference('UR-RESOLVE',[status(thm)],[131,148,115]),106,theory(equality)]) ).
cnf(454,plain,
and(not(and(X,Y)),Z) = and(not(and(X,not(not(Y)))),Z),
inference('PARAMODULATE',[status(thm)],[162,106,theory(equality)]) ).
cnf(539,plain,
is_a_theorem(not(and(X,and(not(and(not(Y),Z)),and(Z,not(Y)))))),
inference('REWRITE',[status(thm)],[187,454,theory(equality)]) ).
cnf(540,plain,
$false,
inference('REWRITE',[status(thm)],[196,539]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL456+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.13 % Command : run-snark %s %d
% 0.13/0.34 % Computer : n013.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 19:13:59 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.46 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.47 *
% 0.19/0.47 *
% 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-03T19:14: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 n013.cluster.edu at 2022-07-03T19:14:00
% 0.45/0.63
% 0.45/0.63
% 0.45/0.63 #||
% 0.45/0.63 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.45/0.63 % SZS output start Refutation
% See solution above
% 0.47/0.64 ||#
% 0.47/0.64
% 0.47/0.64 ; Summary of computation:
% 0.47/0.64 ; 727 formulas have been input or derived (from 75 formulas).
% 0.47/0.64 ; 540 (74%) were retained. Of these,
% 0.47/0.64 ; 226 (42%) were simplified or subsumed later,
% 0.47/0.64 ; 314 (58%) are still being kept.
% 0.47/0.64 ;
% 0.47/0.64 ; Run time in seconds excluding printing time:
% 0.47/0.64 ; 0.009 6% Read assertion file (1 call)
% 0.47/0.64 ; 0.004 3% Assert (53 calls)
% 0.47/0.64 ; 0.051 33% Process new row (652 calls)
% 0.47/0.64 ; 0.011 7% Resolution (148 calls)
% 0.47/0.64 ; 0.003 2% Paramodulation (74 calls)
% 0.47/0.64 ; 0.000 0% Condensing (90 calls)
% 0.47/0.64 ; 0.004 3% Forward subsumption (90 calls)
% 0.47/0.64 ; 0.001 1% Backward subsumption (90 calls)
% 0.47/0.64 ; 0.000 0% Clause clause subsumption (5 calls)
% 0.47/0.64 ; 0.023 15% Forward simplification (640 calls)
% 0.47/0.64 ; 0.016 10% Backward simplification (540 calls)
% 0.47/0.64 ; 0.002 1% Ordering (91 calls)
% 0.47/0.64 ; 0.000 0% Sortal reasoning (32 calls)
% 0.47/0.64 ; 0.001 1% Purity testing (1 call)
% 0.47/0.64 ; 0.030 19% Other
% 0.47/0.64 ; 0.155 Total
% 0.47/0.64 ; 0.169 Real time
% 0.47/0.64 ;
% 0.47/0.64 ; Term-hash-array has 1,819 terms in all.
% 0.47/0.64 ; Feature-vector-row-index has 14 entries (60 at peak, 90 added, 76 deleted).
% 0.47/0.64 ; Feature-vector-row-index has 142 nodes (403 at peak, 679 added, 537 deleted).
% 0.47/0.64 ; Retrieved 18 possibly forward subsuming rows in 90 calls.
% 0.47/0.64 ; Retrieved 11 possibly backward subsumed rows in 90 calls.
% 0.47/0.64 ; Path-index has 1,146 entries (1,294 at peak, 2,056 added, 910 deleted).
% 0.47/0.64 ; Path-index has 2,226 nodes (2,238 at peak, 3,254 added, 1,028 deleted).
% 0.47/0.64 ; Trie-index has 1,146 entries (1,294 at peak, 2,056 added, 910 deleted).
% 0.47/0.64 ; Trie-index has 3,498 nodes (4,386 at peak, 7,041 added, 3,543 deleted).
% 0.47/0.64 ; Retrieved 1,305 generalization terms in 5,593 calls.
% 0.47/0.64 ; Retrieved 898 instance terms in 449 calls.
% 0.47/0.64 ; Retrieved 4,871 unifiable terms in 755 calls.
% 0.47/0.64 ;
% 0.47/0.64 ; The agenda of backward simplifiable rows to process has 27 entries:
% 0.47/0.64 ; 27 with value 0
% 0.47/0.64 ; The agenda of rows to process has 16 entries:
% 0.47/0.64 ; 2 with value 24 1 with value 30 1 with value 34
% 0.47/0.64 ; 3 with value 26 3 with value 31 2 with value 37
% 0.47/0.64 ; 3 with value 29 1 with value 33
% 0.47/0.64 ; The agenda of input rows to give has 3 entries:
% 0.47/0.64 ; 1 with value 23 2 with value 28
% 0.47/0.64 ; The agenda of rows to give has 243 entries:
% 0.47/0.64 ; 4 with value (4 14) 18 with value (4 25) 1 with value (4 35)
% 0.47/0.64 ; 1 with value (4 15) 13 with value (4 26) 11 with value (4 36)
% 0.47/0.64 ; 4 with value (4 16) 27 with value (4 27) 5 with value (4 37)
% 0.47/0.64 ; 21 with value (4 17) 15 with value (4 28) 1 with value (4 38)
% 0.47/0.64 ; 4 with value (4 18) 10 with value (4 29) 1 with value (4 39)
% 0.47/0.64 ; 6 with value (4 19) 3 with value (4 30) 10 with value (4 40)
% 0.47/0.64 ; 7 with value (4 20) 9 with value (4 31) 1 with value (4 42)
% 0.47/0.64 ; 10 with value (4 21) 1 with value (4 32) 5 with value (4 43)
% 0.47/0.64 ; 10 with value (4 22) 6 with value (4 33) 1 with value (4 44)
% 0.47/0.64 ; 7 with value (4 23) 3 with value (4 34) 8 with value (4 46)
% 0.47/0.64 ; 20 with value (4 24)
% 0.47/0.64 Evaluation took:
% 0.47/0.64 0.17 seconds of real time
% 0.47/0.64 0.162605 seconds of user run time
% 0.47/0.64 0.006897 seconds of system run time
% 0.47/0.64 [Run times include 0.012 seconds GC run time.]
% 0.47/0.64 0 calls to %EVAL
% 0.47/0.64 0 page faults and
% 0.47/0.64 14,680,224 bytes consed.
% 0.47/0.64 :PROOF-FOUND
% 0.47/0.64 ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-07-03T19:14:00
% 0.47/0.64 :PROOF-FOUND
% 0.47/0.64 *
%------------------------------------------------------------------------------