TSTP Solution File: LCL512+1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : LCL512+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n029.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:23 EDT 2022
% Result : Theorem 0.20s 0.56s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 8
% Syntax : Number of clauses : 15 ( 11 unt; 0 nHn; 7 RR)
% Number of literals : 19 ( 5 equ; 6 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 7 ( 5 usr; 5 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 16 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(29,axiom,
( equivalence_1
| ~ is_a_theorem(implies(equiv('SKOLEMAABB27','SKOLEMAABB28'),implies('SKOLEMAABB27','SKOLEMAABB28'))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax',equivalence_1) ).
cnf(36,axiom,
( ~ kn2
| is_a_theorem(implies(and(X,Y),X)) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax',kn2) ).
cnf(57,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(58,axiom,
( ~ op_equiv
| equiv(X,Y) = and(implies(X,Y),implies(Y,X)) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+1.ax',op_equiv) ).
cnf(60,axiom,
op_implies_and,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+5.ax',rosser_op_implies_and) ).
cnf(61,axiom,
op_equiv,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+5.ax',rosser_op_equiv) ).
cnf(64,axiom,
kn2,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+5.ax',rosser_kn2) ).
cnf(67,negated_conjecture,
~ equivalence_1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',hilbert_equivalence_1) ).
cnf(68,plain,
~ is_a_theorem(implies(equiv('SKOLEMAABB27','SKOLEMAABB28'),implies('SKOLEMAABB27','SKOLEMAABB28'))),
inference('REWRITE',[status(thm)],[29,67]) ).
cnf(71,plain,
is_a_theorem(implies(and(X,Y),X)),
inference('REWRITE',[status(thm)],[36,64]) ).
cnf(75,plain,
equiv(X,Y) = and(implies(X,Y),implies(Y,X)),
inference('REWRITE',[status(thm)],[58,61]) ).
cnf(76,plain,
implies(X,Y) = not(and(X,not(Y))),
inference('REWRITE',[status(thm)],[57,60]) ).
cnf(94,plain,
is_a_theorem(not(and(and(X,Y),not(X)))),
inference('REWRITE',[status(thm)],[71,76,theory(equality)]) ).
cnf(106,plain,
equiv(X,Y) = and(not(and(X,not(Y))),not(and(Y,not(X)))),
inference('REWRITE',[status(thm)],[75,76,theory(equality)]) ).
cnf(116,plain,
$false,
inference('REWRITE',[status(thm)],[68,94,106,76,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : LCL512+1 : TPTP v8.1.0. Released v3.3.0.
% 0.12/0.13 % Command : run-snark %s %d
% 0.13/0.34 % Computer : n029.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 09:33:11 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.49 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.50 *
% 0.20/0.50 *
% 0.20/0.51 #<PACKAGE "SNARK-USER">
% 0.20/0.51 *
% 0.20/0.51 SNARK-TPTP-OPTIONS
% 0.20/0.51 *
% 0.20/0.51 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.20/0.51 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.20/0.51 (USE-FACTORING :POS)
% 0.20/0.51 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.20/0.51 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.20/0.51 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.20/0.51 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.20/0.51 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.20/0.51 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.20/0.51 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.20/0.51 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.20/0.51 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.20/0.51 (DECLARE-TPTP-SYMBOLS2))
% 0.20/0.51 *
% 0.20/0.51 "."
% 0.20/0.51 *
% 0.20/0.51 ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-07-04T09:33:11
% 0.20/0.51 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n029.cluster.edu at 2022-07-04T09:33:11
% 0.20/0.53 WARNING:
% 0.20/0.53 #:|op_implies_or| is a proposition that occurs only negatively; disabling rows that contain it.
% 0.20/0.53 WARNING:
% 0.20/0.53 #:|op_and| is a proposition that occurs only negatively; disabling rows that contain it.
% 0.20/0.56
% 0.20/0.56
% 0.20/0.56 #||
% 0.20/0.56 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.56 % SZS output start Refutation
% See solution above
% 0.20/0.56 ||#
% 0.20/0.56
% 0.20/0.56 ; Summary of computation:
% 0.20/0.56 ; 129 formulas have been input or derived (from 1 formulas).
% 0.20/0.56 ; 116 (90%) were retained. Of these,
% 0.20/0.56 ; 67 (58%) were simplified or subsumed later,
% 0.20/0.56 ; 49 (42%) are still being kept.
% 0.20/0.56 ;
% 0.20/0.56 ; Run time in seconds excluding printing time:
% 0.20/0.56 ; 0.005 11% Read assertion file (1 call)
% 0.20/0.56 ; 0.002 5% Assert (43 calls)
% 0.20/0.56 ; 0.009 20% Process new row (121 calls)
% 0.20/0.56 ; 0.002 5% Condensing (95 calls)
% 0.20/0.56 ; 0.000 0% Forward subsumption (95 calls)
% 0.20/0.56 ; 0.000 0% Backward subsumption (95 calls)
% 0.20/0.56 ; 0.003 7% Forward simplification (119 calls)
% 0.20/0.56 ; 0.003 7% Backward simplification (116 calls)
% 0.20/0.56 ; 0.000 0% Ordering (3 calls)
% 0.20/0.56 ; 0.001 2% Sortal reasoning (32 calls)
% 0.20/0.56 ; 0.000 0% Purity testing (1 call)
% 0.20/0.56 ; 0.019 43% Other
% 0.20/0.56 ; 0.044 Total
% 0.20/0.56 ; 0.045 Real time
% 0.20/0.56 ;
% 0.20/0.56 ; Term-hash-array has 410 terms in all.
% 0.20/0.56 ; Feature-vector-row-index has 33 entries (58 at peak, 95 added, 62 deleted).
% 0.20/0.56 ; Feature-vector-row-index has 290 nodes (391 at peak, 702 added, 412 deleted).
% 0.20/0.56 ; Retrieved 30 possibly forward subsuming rows in 95 calls.
% 0.20/0.56 ; Retrieved 12 possibly backward subsumed rows in 95 calls.
% 0.20/0.56 ; Path-index has 297 entries (297 at peak, 606 added, 309 deleted).
% 0.20/0.56 ; Path-index has 1,081 nodes (1,081 at peak, 1,673 added, 592 deleted).
% 0.20/0.56 ; Trie-index has 297 entries (297 at peak, 606 added, 309 deleted).
% 0.20/0.56 ; Trie-index has 1,169 nodes (1,169 at peak, 2,046 added, 877 deleted).
% 0.20/0.56 ; Retrieved 50 generalization terms in 204 calls.
% 0.20/0.56 ; Retrieved 68 instance terms in 20 calls.
% 0.20/0.56 ;
% 0.20/0.56 ; The agenda of backward simplifiable rows to process has 8 entries:
% 0.20/0.56 ; 8 with value 0
% 0.20/0.56 ; The agenda of input rows to give has 48 entries:
% 0.20/0.56 ; 10 with value 1 1 with value 19 3 with value 28
% 0.20/0.56 ; 1 with value 12 1 with value 20 1 with value 29
% 0.20/0.56 ; 5 with value 13 5 with value 21 3 with value 33
% 0.20/0.56 ; 6 with value 14 2 with value 24 2 with value 35
% 0.20/0.56 ; 3 with value 16 1 with value 27 1 with value 40
% 0.20/0.56 ; 3 with value 18
% 0.20/0.56 Evaluation took:
% 0.20/0.56 0.045 seconds of real time
% 0.20/0.56 0.038383 seconds of user run time
% 0.20/0.56 0.006929 seconds of system run time
% 0.20/0.56 0 calls to %EVAL
% 0.20/0.56 0 page faults and
% 0.20/0.56 4,606,512 bytes consed.
% 0.20/0.56 :PROOF-FOUND
% 0.20/0.56 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-07-04T09:33:11
% 0.20/0.56 :PROOF-FOUND
% 0.20/0.56 *
%------------------------------------------------------------------------------