TSTP Solution File: LCL294-3 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : LCL294-3 : TPTP v8.1.0. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n026.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:22:00 EDT 2022
% Result : Unsatisfiable 0.49s 0.65s
% Output : Refutation 0.49s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 10
% Syntax : Number of clauses : 24 ( 22 unt; 0 nHn; 6 RR)
% Number of literals : 27 ( 4 equ; 6 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 2 con; 0-2 aty)
% Number of variables : 36 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(axiom_1_2,axiom,
axiom(implies(or(X,X),X)),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',axiom_1_2) ).
cnf(axiom_1_3,axiom,
axiom(implies(X,or(Y,X))),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',axiom_1_3) ).
cnf(axiom_1_4,axiom,
axiom(implies(or(X,Y),or(Y,X))),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',axiom_1_4) ).
cnf(axiom_1_6,axiom,
axiom(implies(implies(X,Y),implies(or(Z,X),or(Z,Y)))),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',axiom_1_6) ).
cnf(implies_definition,axiom,
implies(X,Y) = or(not(X),Y),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',implies_definition) ).
cnf(rule_1,axiom,
( theorem(X)
| ~ axiom(X) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',rule_1) ).
cnf(rule_2,axiom,
( theorem(X)
| ~ theorem(implies(Y,X))
| ~ theorem(Y) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',rule_2) ).
cnf(and_defn,axiom,
and(X,Y) = not(or(not(X),not(Y))),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-1.ax',and_defn) ).
cnf(10,plain,
and(X,Y) = not(implies(X,not(Y))),
inference('REWRITE',[status(thm)],[and_defn,implies_definition,theory(equality)]) ).
cnf(equivalent_defn,axiom,
equivalent(X,Y) = and(implies(X,Y),implies(Y,X)),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-2.ax',equivalent_defn) ).
cnf(prove_this,negated_conjecture,
~ theorem(equivalent(implies(p,q),or(not(p),q))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
cnf(13,plain,
~ theorem(equivalent(implies(p,q),implies(p,q))),
inference('REWRITE',[status(thm)],[prove_this,implies_definition,theory(equality)]) ).
cnf(14,plain,
theorem(implies(or(X,X),X)),
inference('HYPERRESOLVE',[status(thm)],[rule_1,axiom_1_2]) ).
cnf(15,plain,
theorem(implies(X,or(Y,X))),
inference('HYPERRESOLVE',[status(thm)],[rule_1,axiom_1_3]) ).
cnf(16,plain,
theorem(implies(or(X,Y),or(Y,X))),
inference('HYPERRESOLVE',[status(thm)],[rule_1,axiom_1_4]) ).
cnf(27,plain,
theorem(implies(implies(X,Y),implies(or(Z,X),or(Z,Y)))),
inference('HYPERRESOLVE',[status(thm)],[rule_1,axiom_1_6]) ).
cnf(29,plain,
theorem(implies(implies(X,not(X)),not(X))),
inference('PARAMODULATE',[status(thm)],[14,implies_definition,theory(equality)]) ).
cnf(41,plain,
theorem(implies(implies(X,Y),or(Y,not(X)))),
inference('PARAMODULATE',[status(thm)],[16,implies_definition,theory(equality)]) ).
cnf(79,plain,
theorem(implies(X,and(X,X))),
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[rule_2,41,29]),implies_definition,10,theory(equality)]) ).
cnf(86,plain,
theorem(implies(implies(X,X),equivalent(X,X))),
inference('PARAMODULATE',[status(thm)],[79,equivalent_defn,theory(equality)]) ).
cnf(133,plain,
~ theorem(implies(implies(p,q),implies(p,q))),
inference('UR-RESOLVE',[status(thm)],[rule_2,86,13]) ).
cnf(372,plain,
theorem(implies(or(X,or(Y,Y)),or(X,Y))),
inference('HYPERRESOLVE',[status(thm)],[rule_2,27,14]) ).
cnf(396,plain,
theorem(implies(implies(X,or(Y,Y)),implies(X,Y))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[372,implies_definition,theory(equality)]),implies_definition,theory(equality)]) ).
cnf(597,plain,
$false,
inference('UR-RESOLVE',[status(thm)],[rule_2,396,133,15]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : LCL294-3 : TPTP v8.1.0. Released v2.3.0.
% 0.07/0.14 % Command : run-snark %s %d
% 0.15/0.36 % Computer : n026.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 600
% 0.15/0.36 % DateTime : Sun Jul 3 01:09:05 EDT 2022
% 0.15/0.36 % CPUTime :
% 0.22/0.49 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.22/0.50 *
% 0.22/0.50 *
% 0.22/0.50 #<PACKAGE "SNARK-USER">
% 0.22/0.50 *
% 0.22/0.50 SNARK-TPTP-OPTIONS
% 0.22/0.50 *
% 0.22/0.50 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.22/0.50 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.22/0.50 (USE-FACTORING :POS)
% 0.22/0.50 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.22/0.50 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.22/0.50 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.22/0.50 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.22/0.50 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.22/0.50 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.22/0.50 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.22/0.50 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.22/0.50 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.22/0.50 (DECLARE-TPTP-SYMBOLS2))
% 0.22/0.50 *
% 0.22/0.50 "."
% 0.22/0.50 *
% 0.22/0.50 ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-07-03T01:09:06
% 0.22/0.50 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n026.cluster.edu at 2022-07-03T01:09:06
% 0.49/0.65
% 0.49/0.65
% 0.49/0.65 #||
% 0.49/0.65 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.49/0.65 % SZS output start Refutation
% See solution above
% 0.49/0.65 ||#
% 0.49/0.65
% 0.49/0.65 ; Summary of computation:
% 0.49/0.65 ; 1710 formulas have been input or derived (from 76 formulas).
% 0.49/0.65 ; 597 (35%) were retained. Of these,
% 0.49/0.65 ; 4 ( 1%) were simplified or subsumed later,
% 0.49/0.65 ; 593 (99%) are still being kept.
% 0.49/0.65 ;
% 0.49/0.65 ; Run time in seconds excluding printing time:
% 0.49/0.65 ; 0.003 2% Read assertion file (1 call)
% 0.49/0.65 ; 0.001 1% Assert (11 calls)
% 0.49/0.65 ; 0.059 41% Process new row (1,263 calls)
% 0.49/0.65 ; 0.015 10% Resolution (150 calls)
% 0.49/0.65 ; 0.008 6% Paramodulation (75 calls)
% 0.49/0.65 ; 0.000 0% Condensing (2 calls)
% 0.49/0.65 ; 0.000 0% Forward subsumption (2 calls)
% 0.49/0.65 ; 0.000 0% Backward subsumption (2 calls)
% 0.49/0.65 ; 0.022 15% Forward simplification (1,263 calls)
% 0.49/0.65 ; 0.007 5% Backward simplification (595 calls)
% 0.49/0.65 ; 0.001 1% Ordering (138 calls)
% 0.49/0.65 ; 0.001 1% Sortal reasoning (32 calls)
% 0.49/0.65 ; 0.000 0% Purity testing (1 call)
% 0.49/0.65 ; 0.027 19% Other
% 0.49/0.65 ; 0.144 Total
% 0.49/0.65 ; 0.148 Real time
% 0.49/0.65 ;
% 0.49/0.65 ; Term-hash-array has 1,343 terms in all.
% 0.49/0.65 ; Feature-vector-row-index has 2 entries (2 at peak, 2 added, 0 deleted).
% 0.49/0.65 ; Feature-vector-row-index has 6 nodes (6 at peak, 6 added, 0 deleted).
% 0.49/0.65 ; Retrieved 0 possibly forward subsuming rows in 2 calls.
% 0.49/0.65 ; Retrieved 0 possibly backward subsumed rows in 2 calls.
% 0.49/0.65 ; Path-index has 1,340 entries (1,340 at peak, 1,345 added, 5 deleted).
% 0.49/0.65 ; Path-index has 3,234 nodes (3,234 at peak, 3,252 added, 18 deleted).
% 0.49/0.65 ; Trie-index has 1,340 entries (1,340 at peak, 1,345 added, 5 deleted).
% 0.49/0.65 ; Trie-index has 5,667 nodes (5,667 at peak, 5,704 added, 37 deleted).
% 0.49/0.65 ; Retrieved 2,033 generalization terms in 3,088 calls.
% 0.49/0.65 ; Retrieved 695 instance terms in 592 calls.
% 0.49/0.65 ; Retrieved 11,363 unifiable terms in 858 calls.
% 0.49/0.65 ;
% 0.49/0.65 ; The agenda of rows to process has 48 entries:
% 0.49/0.65 ; 1 with value 10 1 with value 20 1 with value 26
% 0.49/0.65 ; 8 with value 13 7 with value 21 3 with value 27
% 0.49/0.65 ; 1 with value 14 2 with value 22 2 with value 28
% 0.49/0.65 ; 6 with value 15 1 with value 23 2 with value 29
% 0.49/0.65 ; 5 with value 16 1 with value 25 1 with value 30
% 0.49/0.65 ; 6 with value 18
% 0.49/0.65 ; The agenda of rows to give has 517 entries:
% 0.49/0.65 ; 6 with value (4 17) 38 with value (4 23) 26 with value (4 29)
% 0.49/0.65 ; 25 with value (4 18) 46 with value (4 24) 12 with value (4 30)
% 0.49/0.65 ; 23 with value (4 19) 68 with value (4 25) 2 with value (4 31)
% 0.49/0.65 ; 40 with value (4 20) 61 with value (4 26) 2 with value (4 32)
% 0.49/0.65 ; 43 with value (4 21) 57 with value (4 27) 3 with value (4 33)
% 0.49/0.65 ; 23 with value (4 22) 42 with value (4 28)
% 0.49/0.65 Evaluation took:
% 0.49/0.65 0.149 seconds of real time
% 0.49/0.65 0.129554 seconds of user run time
% 0.49/0.65 0.017114 seconds of system run time
% 0.49/0.65 0 calls to %EVAL
% 0.49/0.65 0 page faults and
% 0.49/0.65 9,951,344 bytes consed.
% 0.49/0.65 :PROOF-FOUND
% 0.49/0.65 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-07-03T01:09:06
% 0.49/0.65 :PROOF-FOUND
% 0.49/0.65 *
%------------------------------------------------------------------------------