TSTP Solution File: LCL268-3 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : LCL268-3 : TPTP v8.1.0. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n007.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:21:52 EDT 2022
% Result : Unsatisfiable 0.42s 0.61s
% Output : Refutation 0.45s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 10
% Syntax : Number of clauses : 23 ( 21 unt; 0 nHn; 5 RR)
% Number of literals : 26 ( 4 equ; 5 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 : 6 ( 6 usr; 1 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/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_2) ).
cnf(axiom_1_3,axiom,
axiom(implies(X,or(Y,X))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_3) ).
cnf(axiom_1_4,axiom,
axiom(implies(or(X,Y),or(Y,X))),
file('/export/starexec/sandbox2/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/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_6) ).
cnf(implies_definition,axiom,
implies(X,Y) = or(not(X),Y),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',implies_definition) ).
cnf(rule_1,axiom,
( theorem(X)
| ~ axiom(X) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',rule_1) ).
cnf(rule_2,axiom,
( theorem(X)
| ~ theorem(implies(Y,X))
| ~ theorem(Y) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',rule_2) ).
cnf(and_defn,axiom,
and(X,Y) = not(or(not(X),not(Y))),
file('/export/starexec/sandbox2/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/sandbox2/benchmark/Axioms/LCL004-2.ax',equivalent_defn) ).
cnf(prove_this,negated_conjecture,
~ theorem(equivalent(p,p)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
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(26,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(40,plain,
theorem(implies(implies(X,Y),or(Y,not(X)))),
inference('PARAMODULATE',[status(thm)],[16,implies_definition,theory(equality)]) ).
cnf(91,plain,
theorem(implies(X,and(X,X))),
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[rule_2,40,29]),implies_definition,10,theory(equality)]) ).
cnf(99,plain,
theorem(implies(implies(X,X),equivalent(X,X))),
inference('PARAMODULATE',[status(thm)],[91,equivalent_defn,theory(equality)]) ).
cnf(152,plain,
~ theorem(implies(p,p)),
inference('UR-RESOLVE',[status(thm)],[rule_2,99,prove_this]) ).
cnf(488,plain,
theorem(implies(or(X,or(Y,Y)),or(X,Y))),
inference('HYPERRESOLVE',[status(thm)],[rule_2,26,14]) ).
cnf(514,plain,
theorem(implies(implies(X,or(Y,Y)),implies(X,Y))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[488,implies_definition,theory(equality)]),implies_definition,theory(equality)]) ).
cnf(874,plain,
$false,
inference('UR-RESOLVE',[status(thm)],[rule_2,514,152,15]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : LCL268-3 : TPTP v8.1.0. Released v2.3.0.
% 0.00/0.10 % Command : run-snark %s %d
% 0.09/0.30 % Computer : n007.cluster.edu
% 0.09/0.30 % Model : x86_64 x86_64
% 0.09/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30 % Memory : 8042.1875MB
% 0.09/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30 % CPULimit : 300
% 0.09/0.30 % WCLimit : 600
% 0.09/0.30 % DateTime : Sun Jul 3 21:02:41 EDT 2022
% 0.09/0.30 % CPUTime :
% 0.15/0.40 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.15/0.41 *
% 0.15/0.41 *
% 0.15/0.41 #<PACKAGE "SNARK-USER">
% 0.15/0.41 *
% 0.15/0.41 SNARK-TPTP-OPTIONS
% 0.15/0.41 *
% 0.15/0.41 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.15/0.41 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.15/0.41 (USE-FACTORING :POS)
% 0.15/0.41 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.15/0.41 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.15/0.41 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.15/0.41 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.15/0.41 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.15/0.41 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.15/0.41 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.15/0.41 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.15/0.41 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.15/0.41 (DECLARE-TPTP-SYMBOLS2))
% 0.15/0.41 *
% 0.15/0.41 "."
% 0.15/0.41 *
% 0.15/0.41 ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-07-03T21:02:41
% 0.15/0.41 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n007.cluster.edu at 2022-07-03T21:02:41
% 0.42/0.61
% 0.42/0.61
% 0.42/0.61 #||
% 0.42/0.61 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.42/0.61 % SZS output start Refutation
% See solution above
% 0.45/0.64 ||#
% 0.45/0.64
% 0.45/0.64 ; Summary of computation:
% 0.45/0.64 ; 2010 formulas have been input or derived (from 85 formulas).
% 0.45/0.64 ; 874 (43%) were retained. Of these,
% 0.45/0.64 ; 33 ( 4%) were simplified or subsumed later,
% 0.45/0.64 ; 841 (96%) are still being kept.
% 0.45/0.64 ;
% 0.45/0.64 ; Run time in seconds excluding printing time:
% 0.45/0.64 ; 0.003 2% Read assertion file (1 call)
% 0.45/0.64 ; 0.001 1% Assert (11 calls)
% 0.45/0.64 ; 0.083 42% Process new row (1,557 calls)
% 0.45/0.64 ; 0.033 17% Resolution (168 calls)
% 0.45/0.64 ; 0.007 4% Paramodulation (84 calls)
% 0.45/0.64 ; 0.000 0% Condensing (2 calls)
% 0.45/0.64 ; 0.000 0% Forward subsumption (2 calls)
% 0.45/0.64 ; 0.000 0% Backward subsumption (2 calls)
% 0.45/0.64 ; 0.026 13% Forward simplification (1,557 calls)
% 0.45/0.64 ; 0.016 8% Backward simplification (873 calls)
% 0.45/0.64 ; 0.001 1% Ordering (144 calls)
% 0.45/0.64 ; 0.000 0% Sortal reasoning (32 calls)
% 0.45/0.64 ; 0.000 0% Purity testing (1 call)
% 0.45/0.64 ; 0.028 14% Other
% 0.45/0.64 ; 0.198 Total
% 0.45/0.64 ; 0.225 Real time
% 0.45/0.64 ;
% 0.45/0.64 ; Term-hash-array has 1,907 terms in all.
% 0.45/0.64 ; Feature-vector-row-index has 2 entries (2 at peak, 2 added, 0 deleted).
% 0.45/0.64 ; Feature-vector-row-index has 6 nodes (6 at peak, 6 added, 0 deleted).
% 0.45/0.64 ; Retrieved 0 possibly forward subsuming rows in 2 calls.
% 0.45/0.64 ; Retrieved 0 possibly backward subsumed rows in 2 calls.
% 0.45/0.64 ; Path-index has 1,844 entries (1,844 at peak, 1,910 added, 66 deleted).
% 0.45/0.64 ; Path-index has 3,443 nodes (3,443 at peak, 3,493 added, 50 deleted).
% 0.45/0.64 ; Trie-index has 1,844 entries (1,844 at peak, 1,910 added, 66 deleted).
% 0.45/0.64 ; Trie-index has 8,103 nodes (8,103 at peak, 8,495 added, 392 deleted).
% 0.45/0.64 ; Retrieved 2,874 generalization terms in 4,221 calls.
% 0.45/0.64 ; Retrieved 962 instance terms in 870 calls.
% 0.45/0.64 ; Retrieved 16,243 unifiable terms in 1,065 calls.
% 0.45/0.64 ;
% 0.45/0.64 ; The agenda of rows to process has 55 entries:
% 0.45/0.64 ; 1 with value 10 1 with value 20 1 with value 25
% 0.45/0.64 ; 8 with value 13 8 with value 21 1 with value 26
% 0.45/0.64 ; 1 with value 14 3 with value 22 3 with value 27
% 0.45/0.64 ; 7 with value 15 2 with value 23 6 with value 29
% 0.45/0.64 ; 4 with value 16 1 with value 24 2 with value 30
% 0.45/0.64 ; 6 with value 18
% 0.45/0.64 ; The agenda of rows to give has 758 entries:
% 0.45/0.64 ; 8 with value (4 17) 52 with value (4 23) 81 with value (4 29)
% 0.45/0.64 ; 29 with value (4 18) 62 with value (4 24) 27 with value (4 30)
% 0.45/0.64 ; 29 with value (4 19) 78 with value (4 25) 14 with value (4 31)
% 0.45/0.64 ; 44 with value (4 20) 59 with value (4 26) 10 with value (4 32)
% 0.45/0.64 ; 58 with value (4 21) 84 with value (4 27) 3 with value (4 33)
% 0.45/0.64 ; 45 with value (4 22) 74 with value (4 28) 1 with value (4 35)
% 0.45/0.64 Evaluation took:
% 0.45/0.64 0.226 seconds of real time
% 0.45/0.64 0.208537 seconds of user run time
% 0.45/0.64 0.016084 seconds of system run time
% 0.45/0.64 [Run times include 0.022 seconds GC run time.]
% 0.45/0.64 0 calls to %EVAL
% 0.45/0.64 0 page faults and
% 0.45/0.64 12,934,824 bytes consed.
% 0.45/0.64 :PROOF-FOUND
% 0.45/0.64 ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-07-03T21:02:41
% 0.45/0.64 :PROOF-FOUND
% 0.45/0.64 *
%------------------------------------------------------------------------------