TSTP Solution File: LCL205-3 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : LCL205-3 : TPTP v8.1.0. Released v2.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:21:08 EDT 2022
% Result : Unsatisfiable 25.41s 25.60s
% Output : Refutation 25.41s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 9
% Syntax : Number of clauses : 31 ( 29 unt; 0 nHn; 6 RR)
% Number of literals : 34 ( 1 equ; 6 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 5 ( 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 : 60 ( 6 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_5,axiom,
axiom(implies(or(X,or(Y,Z)),or(Y,or(X,Z)))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_5) ).
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(not(implies(p,q)),implies(p,not(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(18,plain,
theorem(implies(or(X,or(Y,Z)),or(Y,or(X,Z)))),
inference('HYPERRESOLVE',[status(thm)],[rule_1,axiom_1_5]) ).
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(47,plain,
theorem(implies(implies(X,Y),or(Y,not(X)))),
inference('PARAMODULATE',[status(thm)],[12,implies_definition,theory(equality)]) ).
cnf(112,plain,
theorem(implies(implies(X,not(Y)),implies(Y,not(X)))),
inference('PARAMODULATE',[status(thm)],[47,implies_definition,theory(equality)]) ).
cnf(279,plain,
theorem(implies(or(X,implies(Y,Z)),implies(Y,or(X,Z)))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[18,implies_definition,theory(equality)]),implies_definition,theory(equality)]) ).
cnf(293,plain,
theorem(implies(or(X,or(Y,Y)),or(X,Y))),
inference('HYPERRESOLVE',[status(thm)],[rule_2,21,10]) ).
cnf(295,plain,
theorem(implies(or(X,Y),or(X,implies(Z,Y)))),
inference('HYPERRESOLVE',[status(thm)],[rule_2,21,26]) ).
cnf(299,plain,
theorem(implies(implies(X,Y),implies(implies(Z,X),implies(Z,Y)))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[21,implies_definition,theory(equality)]),implies_definition,theory(equality)]) ).
cnf(315,plain,
theorem(implies(implies(X,or(Y,Y)),implies(X,Y))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[293,implies_definition,theory(equality)]),implies_definition,theory(equality)]) ).
cnf(436,plain,
theorem(implies(implies(X,Y),implies(X,implies(Z,Y)))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[295,implies_definition,theory(equality)]),implies_definition,theory(equality)]) ).
cnf(450,plain,
theorem(implies(X,X)),
inference('HYPERRESOLVE',[status(thm)],[rule_2,315,11]) ).
cnf(477,plain,
theorem(implies(X,not(not(X)))),
inference('HYPERRESOLVE',[status(thm)],[rule_2,450,112]) ).
cnf(2181,plain,
theorem(implies(implies(X,implies(Y,Z)),implies(Y,implies(X,Z)))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[279,implies_definition,theory(equality)]),implies_definition,theory(equality)]) ).
cnf(3083,plain,
~ theorem(implies(not(implies(p,q)),not(q))),
inference('UR-RESOLVE',[status(thm)],[rule_2,436,prove_this]) ).
cnf(3144,plain,
~ theorem(implies(q,not(not(implies(p,q))))),
inference('UR-RESOLVE',[status(thm)],[rule_2,3083,112]) ).
cnf(14576,plain,
theorem(implies(implies(X,Y),implies(implies(Y,Z),implies(X,Z)))),
inference('HYPERRESOLVE',[status(thm)],[rule_2,2181,299]) ).
cnf(54739,plain,
theorem(implies(implies(implies(X,Y),Z),implies(Y,Z))),
inference('HYPERRESOLVE',[status(thm)],[rule_2,14576,26]) ).
cnf(57913,plain,
$false,
inference('UR-RESOLVE',[status(thm)],[rule_2,54739,3144,477]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : LCL205-3 : TPTP v8.1.0. Released v2.3.0.
% 0.11/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.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Mon Jul 4 10:34:59 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.46 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.47 *
% 0.20/0.47 *
% 0.20/0.48 #<PACKAGE "SNARK-USER">
% 0.20/0.48 *
% 0.20/0.48 SNARK-TPTP-OPTIONS
% 0.20/0.48 *
% 0.20/0.48 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.20/0.48 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.20/0.48 (USE-FACTORING :POS)
% 0.20/0.48 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.20/0.48 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.20/0.48 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.20/0.48 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.20/0.48 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.20/0.48 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.20/0.48 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.20/0.48 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.20/0.48 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.20/0.48 (DECLARE-TPTP-SYMBOLS2))
% 0.20/0.48 *
% 0.20/0.48 "."
% 0.20/0.48 *
% 0.20/0.48 ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-07-04T10:35:00
% 0.20/0.48 ; 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-04T10:35:00
% 25.41/25.60
% 25.41/25.60
% 25.41/25.60 #||
% 25.41/25.60 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 25.41/25.60 % SZS output start Refutation
% See solution above
% 25.41/25.60 ||#
% 25.41/25.60
% 25.41/25.60 ; Summary of computation:
% 25.41/25.60 ; 106827 formulas have been input or derived (from 561 formulas).
% 25.41/25.60 ; 57913 (54%) were retained. Of these,
% 25.41/25.60 ; 9 ( 0%) were simplified or subsumed later,
% 25.41/25.60 ; 57904 (100%) are still being kept.
% 25.41/25.60 ;
% 25.41/25.60 ; Run time in seconds excluding printing time:
% 25.41/25.60 ; 0.002 0% Read assertion file (1 call)
% 25.41/25.60 ; 0.000 0% Assert (9 calls)
% 25.41/25.60 ; 6.532 26% Process new row (90,905 calls)
% 25.41/25.60 ; 11.258 45% Resolution (1,120 calls)
% 25.41/25.60 ; 0.718 3% Paramodulation (560 calls)
% 25.41/25.60 ; 0.000 0% Condensing (2 calls)
% 25.41/25.60 ; 0.000 0% Forward subsumption (2 calls)
% 25.41/25.60 ; 0.000 0% Backward subsumption (2 calls)
% 25.41/25.60 ; 2.869 11% Forward simplification (90,905 calls)
% 25.41/25.60 ; 3.359 13% Backward simplification (57,913 calls)
% 25.41/25.60 ; 0.001 0% Ordering (493 calls)
% 25.41/25.60 ; 0.001 0% Sortal reasoning (32 calls)
% 25.41/25.60 ; 0.000 0% Purity testing (1 call)
% 25.41/25.60 ; 0.344 1% Other
% 25.41/25.60 ; 25.084 Total
% 25.41/25.60 ; 25.118 Real time
% 25.41/25.60 ;
% 25.41/25.60 ; Term-hash-array has 123,824 terms in all.
% 25.41/25.60 ; Feature-vector-row-index has 2 entries (2 at peak, 2 added, 0 deleted).
% 25.41/25.60 ; Feature-vector-row-index has 6 nodes (6 at peak, 6 added, 0 deleted).
% 25.41/25.60 ; Retrieved 0 possibly forward subsuming rows in 2 calls.
% 25.41/25.60 ; Retrieved 0 possibly backward subsumed rows in 2 calls.
% 25.41/25.60 ; Path-index has 123,808 entries (123,808 at peak, 123,826 added, 18 deleted).
% 25.41/25.60 ; Path-index has 34,663 nodes (34,667 at peak, 34,667 added, 4 deleted).
% 25.41/25.60 ; Trie-index has 123,808 entries (123,808 at peak, 123,826 added, 18 deleted).
% 25.41/25.60 ; Trie-index has 297,620 nodes (297,620 at peak, 297,628 added, 8 deleted).
% 25.41/25.60 ; Retrieved 925,387 generalization terms in 234,799 calls.
% 25.41/25.60 ; Retrieved 216,745 instance terms in 57,910 calls.
% 25.41/25.60 ; Retrieved 10,742,506 unifiable terms in 28,317 calls.
% 25.41/25.60 ;
% 25.41/25.60 ; The agenda of rows to process has 621 entries:
% 25.41/25.60 ; 1 with value 12 70 with value 21 32 with value 29
% 25.41/25.60 ; 4 with value 14 36 with value 22 26 with value 30
% 25.41/25.60 ; 22 with value 15 51 with value 23 33 with value 31
% 25.41/25.60 ; 14 with value 16 47 with value 24 55 with value 32
% 25.41/25.60 ; 19 with value 17 11 with value 25 3 with value 33
% 25.41/25.60 ; 72 with value 18 16 with value 26 1 with value 35
% 25.41/25.60 ; 27 with value 19 13 with value 27 1 with value 37
% 25.41/25.60 ; 47 with value 20 19 with value 28 1 with value 38
% 25.41/25.60 ; The agenda of rows to give has 57343 entries:
% 25.41/25.60 ; 9 with value (4 19) 8419 with value (4 32) 20 with value (4 45)
% 25.41/25.60 ; 80 with value (4 20) 5203 with value (4 33) 6 with value (4 46)
% 25.41/25.60 ; 445 with value (4 21) 2427 with value (4 34) 14 with value (4 47)
% 25.41/25.60 ; 547 with value (4 22) 754 with value (4 35) 7 with value (4 48)
% 25.41/25.60 ; 878 with value (4 23) 142 with value (4 36) 11 with value (4 49)
% 25.41/25.60 ; 1416 with value (4 24) 169 with value (4 37) 11 with value (4 50)
% 25.41/25.60 ; 1742 with value (4 25) 152 with value (4 38) 2 with value (4 51)
% 25.41/25.60 ; 2420 with value (4 26) 96 with value (4 39) 4 with value (4 52)
% 25.41/25.60 ; 3749 with value (4 27) 73 with value (4 40) 17 with value (4 53)
% 25.41/25.60 ; 4763 with value (4 28) 58 with value (4 41) 3 with value (4 55)
% 25.41/25.60 ; 6789 with value (4 29) 38 with value (4 42) 6 with value (4 56)
% 25.41/25.60 ; 8453 with value (4 30) 47 with value (4 43) 2 with value (4 59)
% 25.41/25.60 ; 8363 with value (4 31) 8 with value (4 44)
% 25.41/25.60 Evaluation took:
% 25.41/25.60 25.122 seconds of real time
% 25.41/25.60 24.015036 seconds of user run time
% 25.41/25.60 1.076094 seconds of system run time
% 25.41/25.60 [Run times include 5.231 seconds GC run time.]
% 25.41/25.60 0 calls to %EVAL
% 25.41/25.60 0 page faults and
% 25.41/25.60 1,023,428,184 bytes consed.
% 25.41/25.60 :PROOF-FOUND
% 25.41/25.60 ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-07-04T10:35:25
% 25.41/25.60 :PROOF-FOUND
% 25.41/25.60 *
%------------------------------------------------------------------------------