TSTP Solution File: LCL187-3 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : LCL187-3 : TPTP v8.1.0. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n008.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:20:54 EDT 2022
% Result : Unsatisfiable 0.91s 1.12s
% Output : Refutation 0.91s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of clauses : 25 ( 23 unt; 0 nHn; 6 RR)
% Number of literals : 28 ( 1 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 : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 46 ( 11 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(prove_this,negated_conjecture,
~ theorem(implies(p,implies(not(p),q))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
cnf(10,plain,
theorem(implies(or(X,X),X)),
inference('HYPERRESOLVE',[status(thm)],[rule_1,axiom_1_2]) ).
cnf(11,plain,
theorem(implies(X,or(Y,X))),
inference('HYPERRESOLVE',[status(thm)],[rule_1,axiom_1_3]) ).
cnf(12,plain,
theorem(implies(or(X,Y),or(Y,X))),
inference('HYPERRESOLVE',[status(thm)],[rule_1,axiom_1_4]) ).
cnf(21,plain,
theorem(implies(implies(X,Y),implies(or(Z,X),or(Z,Y)))),
inference('HYPERRESOLVE',[status(thm)],[rule_1,axiom_1_6]) ).
cnf(26,plain,
theorem(implies(X,implies(Y,X))),
inference('PARAMODULATE',[status(thm)],[11,implies_definition,theory(equality)]) ).
cnf(52,plain,
theorem(implies(implies(X,Y),or(Y,not(X)))),
inference('PARAMODULATE',[status(thm)],[12,implies_definition,theory(equality)]) ).
cnf(53,plain,
theorem(implies(or(X,not(Y)),implies(Y,X))),
inference('PARAMODULATE',[status(thm)],[12,implies_definition,theory(equality)]) ).
cnf(107,plain,
theorem(or(implies(X,Y),not(Y))),
inference('HYPERRESOLVE',[status(thm)],[rule_2,52,26]) ).
cnf(138,plain,
~ theorem(or(implies(not(p),q),not(p))),
inference('UR-RESOLVE',[status(thm)],[rule_2,53,prove_this]) ).
cnf(344,plain,
theorem(implies(or(X,or(Y,Y)),or(X,Y))),
inference('HYPERRESOLVE',[status(thm)],[rule_2,21,10]) ).
cnf(345,plain,
theorem(implies(or(X,Y),or(X,or(Z,Y)))),
inference('HYPERRESOLVE',[status(thm)],[rule_2,21,11]) ).
cnf(347,plain,
theorem(implies(or(X,or(Y,Z)),or(X,or(Z,Y)))),
inference('HYPERRESOLVE',[status(thm)],[rule_2,21,12]) ).
cnf(371,plain,
~ theorem(or(implies(not(p),q),implies(p,not(p)))),
inference('REWRITE',[status(thm)],[inference('UR-RESOLVE',[status(thm)],[rule_2,344,138]),implies_definition,theory(equality)]) ).
cnf(416,plain,
theorem(or(implies(X,Y),or(Z,not(Y)))),
inference('HYPERRESOLVE',[status(thm)],[rule_2,345,107]) ).
cnf(3818,plain,
theorem(or(implies(X,Y),implies(Y,Z))),
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[rule_2,347,416]),implies_definition,theory(equality)]) ).
cnf(3924,plain,
theorem(or(implies(X,Y),implies(Z,X))),
inference('HYPERRESOLVE',[status(thm)],[rule_2,3818,12]) ).
cnf(3925,plain,
$false,
inference('REWRITE',[status(thm)],[371,3924]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : LCL187-3 : TPTP v8.1.0. Released v2.3.0.
% 0.11/0.12 % Command : run-snark %s %d
% 0.12/0.33 % Computer : n008.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Mon Jul 4 10:40:38 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.45 *
% 0.18/0.45 *
% 0.18/0.46 #<PACKAGE "SNARK-USER">
% 0.18/0.46 *
% 0.18/0.46 SNARK-TPTP-OPTIONS
% 0.18/0.46 *
% 0.18/0.46 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.18/0.46 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.18/0.46 (USE-FACTORING :POS)
% 0.18/0.46 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.18/0.46 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.18/0.46 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.18/0.46 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.18/0.46 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.18/0.46 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.18/0.46 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.18/0.46 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.18/0.46 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.18/0.46 (DECLARE-TPTP-SYMBOLS2))
% 0.18/0.46 *
% 0.18/0.46 "."
% 0.18/0.46 *
% 0.18/0.46 ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-07-04T10:40:38
% 0.18/0.46 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n008.cluster.edu at 2022-07-04T10:40:38
% 0.91/1.12
% 0.91/1.12
% 0.91/1.12 #||
% 0.91/1.12 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.91/1.12 % SZS output start Refutation
% See solution above
% 0.91/1.12 ||#
% 0.91/1.12
% 0.91/1.12 ; Summary of computation:
% 0.91/1.12 ; 7698 formulas have been input or derived (from 154 formulas).
% 0.91/1.12 ; 3925 (51%) were retained. Of these,
% 0.91/1.12 ; 2 ( 0%) were simplified or subsumed later,
% 0.91/1.12 ; 3923 (100%) are still being kept.
% 0.91/1.12 ;
% 0.91/1.12 ; Run time in seconds excluding printing time:
% 0.91/1.12 ; 0.003 0% Read assertion file (1 call)
% 0.91/1.12 ; 0.000 0% Assert (9 calls)
% 0.91/1.12 ; 0.292 44% Process new row (6,467 calls)
% 0.91/1.12 ; 0.110 17% Resolution (306 calls)
% 0.91/1.12 ; 0.015 2% Paramodulation (153 calls)
% 0.91/1.12 ; 0.000 0% Condensing (2 calls)
% 0.91/1.12 ; 0.000 0% Forward subsumption (2 calls)
% 0.91/1.12 ; 0.000 0% Backward subsumption (2 calls)
% 0.91/1.12 ; 0.124 19% Forward simplification (6,467 calls)
% 0.91/1.12 ; 0.062 9% Backward simplification (3,925 calls)
% 0.91/1.12 ; 0.003 0% Ordering (127 calls)
% 0.91/1.12 ; 0.000 0% Sortal reasoning (32 calls)
% 0.91/1.12 ; 0.000 0% Purity testing (1 call)
% 0.91/1.12 ; 0.054 8% Other
% 0.91/1.12 ; 0.663 Total
% 0.91/1.12 ; 0.664 Real time
% 0.91/1.12 ;
% 0.91/1.12 ; Term-hash-array has 8,608 terms in all.
% 0.91/1.12 ; Feature-vector-row-index has 2 entries (2 at peak, 2 added, 0 deleted).
% 0.91/1.12 ; Feature-vector-row-index has 6 nodes (6 at peak, 6 added, 0 deleted).
% 0.91/1.12 ; Retrieved 0 possibly forward subsuming rows in 2 calls.
% 0.91/1.12 ; Retrieved 0 possibly backward subsumed rows in 2 calls.
% 0.91/1.12 ; Path-index has 8,607 entries (8,609 at peak, 8,610 added, 3 deleted).
% 0.91/1.12 ; Path-index has 5,917 nodes (5,917 at peak, 5,917 added, 0 deleted).
% 0.91/1.12 ; Trie-index has 8,607 entries (8,609 at peak, 8,610 added, 3 deleted).
% 0.91/1.12 ; Trie-index has 25,763 nodes (25,769 at peak, 25,769 added, 6 deleted).
% 0.91/1.12 ; Retrieved 28,335 generalization terms in 15,727 calls.
% 0.91/1.12 ; Retrieved 11,500 instance terms in 3,922 calls.
% 0.91/1.12 ; Retrieved 150,018 unifiable terms in 3,284 calls.
% 0.91/1.12 ;
% 0.91/1.12 ; The agenda of rows to process has 71 entries:
% 0.91/1.12 ; 7 with value 17 10 with value 23 14 with value 27
% 0.91/1.12 ; 8 with value 18 2 with value 24 5 with value 28
% 0.91/1.12 ; 9 with value 20 5 with value 25 1 with value 29
% 0.91/1.12 ; 3 with value 21 4 with value 26 1 with value 30
% 0.91/1.12 ; 2 with value 22
% 0.91/1.12 ; The agenda of rows to give has 3769 entries:
% 0.91/1.12 ; 1 with value (4 16) 321 with value (4 24) 57 with value (4 32)
% 0.91/1.12 ; 2 with value (4 17) 367 with value (4 25) 14 with value (4 33)
% 0.91/1.12 ; 55 with value (4 18) 407 with value (4 26) 13 with value (4 34)
% 0.91/1.12 ; 86 with value (4 19) 524 with value (4 27) 1 with value (4 35)
% 0.91/1.13 ; 122 with value (4 20) 475 with value (4 28) 6 with value (4 36)
% 0.91/1.13 ; 176 with value (4 21) 357 with value (4 29) 5 with value (4 37)
% 0.91/1.13 ; 166 with value (4 22) 235 with value (4 30) 5 with value (4 39)
% 0.91/1.13 ; 240 with value (4 23) 133 with value (4 31) 1 with value (4 41)
% 0.91/1.13 Evaluation took:
% 0.91/1.13 0.665 seconds of real time
% 0.91/1.13 0.614173 seconds of user run time
% 0.91/1.13 0.05059 seconds of system run time
% 0.91/1.13 [Run times include 0.065 seconds GC run time.]
% 0.91/1.13 0 calls to %EVAL
% 0.91/1.13 0 page faults and
% 0.91/1.13 52,970,512 bytes consed.
% 0.91/1.13 :PROOF-FOUND
% 0.91/1.13 ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-07-04T10:40:39
% 0.91/1.13 :PROOF-FOUND
% 0.91/1.13 *
%------------------------------------------------------------------------------