TSTP Solution File: LCL208-3 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : LCL208-3 : TPTP v8.1.0. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n024.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:11 EDT 2022
% Result : Unsatisfiable 58.31s 58.49s
% Output : Refutation 58.31s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 9
% Syntax : Number of clauses : 30 ( 28 unt; 0 nHn; 6 RR)
% Number of literals : 33 ( 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 : 54 ( 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_5,axiom,
axiom(implies(or(X,or(Y,Z)),or(Y,or(X,Z)))),
file('/export/starexec/sandbox/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/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(prove_this,negated_conjecture,
~ theorem(implies(or(p,q),implies(not(p),q))),
file('/export/starexec/sandbox/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(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(112,plain,
theorem(implies(implies(X,not(Y)),implies(Y,not(X)))),
inference('PARAMODULATE',[status(thm)],[52,implies_definition,theory(equality)]) ).
cnf(255,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(256,plain,
theorem(implies(implies(X,or(Y,Z)),or(Y,implies(X,Z)))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[18,implies_definition,theory(equality)]),implies_definition,theory(equality)]) ).
cnf(268,plain,
theorem(implies(or(X,or(Y,Y)),or(X,Y))),
inference('HYPERRESOLVE',[status(thm)],[rule_2,21,10]) ).
cnf(290,plain,
theorem(implies(implies(X,or(Y,Y)),implies(X,Y))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[268,implies_definition,theory(equality)]),implies_definition,theory(equality)]) ).
cnf(757,plain,
theorem(implies(X,X)),
inference('HYPERRESOLVE',[status(thm)],[rule_2,290,11]) ).
cnf(791,plain,
theorem(implies(X,not(not(X)))),
inference('HYPERRESOLVE',[status(thm)],[rule_2,757,112]) ).
cnf(967,plain,
theorem(implies(or(X,Y),or(X,not(not(Y))))),
inference('HYPERRESOLVE',[status(thm)],[rule_2,791,21]) ).
cnf(2900,plain,
theorem(implies(implies(X,implies(Y,Z)),implies(Y,implies(X,Z)))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[255,implies_definition,theory(equality)]),implies_definition,theory(equality)]) ).
cnf(2946,plain,
theorem(or(X,implies(or(X,Y),Y))),
inference('HYPERRESOLVE',[status(thm)],[rule_2,256,757]) ).
cnf(3170,plain,
theorem(or(implies(or(X,Y),Y),X)),
inference('HYPERRESOLVE',[status(thm)],[rule_2,2946,12]) ).
cnf(15442,plain,
~ theorem(implies(not(p),implies(or(p,q),q))),
inference('UR-RESOLVE',[status(thm)],[rule_2,2900,prove_this]) ).
cnf(15550,plain,
~ theorem(or(implies(or(p,q),q),not(not(p)))),
inference('UR-RESOLVE',[status(thm)],[rule_2,15442,53]) ).
cnf(99361,plain,
$false,
inference('UR-RESOLVE',[status(thm)],[rule_2,967,15550,3170]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : LCL208-3 : TPTP v8.1.0. Released v2.3.0.
% 0.06/0.13 % Command : run-snark %s %d
% 0.13/0.34 % Computer : n024.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 : Sat Jul 2 16:17:15 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.45 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.46 *
% 0.20/0.46 *
% 0.20/0.47 #<PACKAGE "SNARK-USER">
% 0.20/0.47 *
% 0.20/0.47 SNARK-TPTP-OPTIONS
% 0.20/0.47 *
% 0.20/0.47 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.20/0.47 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.20/0.47 (USE-FACTORING :POS)
% 0.20/0.47 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.20/0.47 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.20/0.47 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.20/0.47 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.20/0.47 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.20/0.47 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.20/0.47 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.20/0.47 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.20/0.47 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.20/0.47 (DECLARE-TPTP-SYMBOLS2))
% 0.20/0.47 *
% 0.20/0.47 "."
% 0.20/0.47 *
% 0.20/0.47 ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-07-02T16:17:15
% 0.20/0.47 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n024.cluster.edu at 2022-07-02T16:17:15
% 58.31/58.49
% 58.31/58.49
% 58.31/58.49 #||
% 58.31/58.49 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 58.31/58.49 % SZS output start Refutation
% See solution above
% 58.31/58.49 ||#
% 58.31/58.49
% 58.31/58.49 ; Summary of computation:
% 58.31/58.49 ; 174888 formulas have been input or derived (from 720 formulas).
% 58.31/58.49 ; 99361 (57%) were retained. Of these,
% 58.31/58.50 ; 11 ( 0%) were simplified or subsumed later,
% 58.31/58.50 ; 99350 (100%) are still being kept.
% 58.31/58.50 ;
% 58.31/58.50 ; Run time in seconds excluding printing time:
% 58.31/58.50 ; 0.002 0% Read assertion file (1 call)
% 58.31/58.50 ; 0.000 0% Assert (9 calls)
% 58.31/58.50 ; 13.742 24% Process new row (150,705 calls)
% 58.31/58.50 ; 28.688 49% Resolution (1,438 calls)
% 58.31/58.50 ; 1.611 3% Paramodulation (719 calls)
% 58.31/58.50 ; 0.000 0% Condensing (2 calls)
% 58.31/58.50 ; 0.000 0% Forward subsumption (2 calls)
% 58.31/58.50 ; 0.001 0% Backward subsumption (2 calls)
% 58.31/58.50 ; 6.054 10% Forward simplification (150,705 calls)
% 58.31/58.50 ; 7.284 13% Backward simplification (99,361 calls)
% 58.31/58.50 ; 0.003 0% Ordering (667 calls)
% 58.31/58.50 ; 0.000 0% Sortal reasoning (32 calls)
% 58.31/58.50 ; 0.000 0% Purity testing (1 call)
% 58.31/58.50 ; 0.621 1% Other
% 58.31/58.50 ; 58.006 Total
% 58.31/58.50 ; 58.028 Real time
% 58.31/58.50 ;
% 58.31/58.50 ; Term-hash-array has 210,730 terms in all.
% 58.31/58.50 ; Feature-vector-row-index has 2 entries (2 at peak, 2 added, 0 deleted).
% 58.31/58.50 ; Feature-vector-row-index has 6 nodes (6 at peak, 6 added, 0 deleted).
% 58.31/58.50 ; Retrieved 0 possibly forward subsuming rows in 2 calls.
% 58.31/58.50 ; Retrieved 0 possibly backward subsumed rows in 2 calls.
% 58.31/58.50 ; Path-index has 210,717 entries (210,717 at peak, 210,737 added, 20 deleted).
% 58.31/58.50 ; Path-index has 47,132 nodes (47,132 at peak, 47,132 added, 0 deleted).
% 58.31/58.50 ; Trie-index has 210,717 entries (210,717 at peak, 210,737 added, 20 deleted).
% 58.31/58.50 ; Trie-index has 552,138 nodes (552,138 at peak, 552,138 added, 0 deleted).
% 58.31/58.50 ; Retrieved 1,973,084 generalization terms in 448,861 calls.
% 58.31/58.50 ; Retrieved 380,243 instance terms in 99,358 calls.
% 58.31/58.50 ; Retrieved 26,630,975 unifiable terms in 51,298 calls.
% 58.31/58.50 ;
% 58.31/58.50 ; The agenda of rows to process has 811 entries:
% 58.31/58.50 ; 3 with value 13 64 with value 23 59 with value 32
% 58.31/58.50 ; 3 with value 15 68 with value 24 73 with value 33
% 58.31/58.50 ; 12 with value 16 86 with value 25 28 with value 34
% 58.31/58.50 ; 10 with value 17 72 with value 26 5 with value 35
% 58.31/58.50 ; 20 with value 18 44 with value 27 1 with value 36
% 58.31/58.50 ; 35 with value 19 51 with value 28 1 with value 37
% 58.31/58.50 ; 23 with value 20 16 with value 29 1 with value 38
% 58.31/58.50 ; 42 with value 21 29 with value 30 1 with value 40
% 58.31/58.50 ; 32 with value 22 32 with value 31
% 58.31/58.50 ; The agenda of rows to give has 98631 entries:
% 58.31/58.50 ; 462 with value (4 21) 997 with value (4 36) 24 with value (4 51)
% 58.31/58.50 ; 729 with value (4 22) 419 with value (4 37) 3 with value (4 52)
% 58.31/58.50 ; 1135 with value (4 23) 241 with value (4 38) 41 with value (4 53)
% 58.31/58.50 ; 1774 with value (4 24) 175 with value (4 39) 39 with value (4 54)
% 58.31/58.50 ; 1941 with value (4 25) 101 with value (4 40) 6 with value (4 55)
% 58.31/58.50 ; 2812 with value (4 26) 97 with value (4 41) 6 with value (4 56)
% 58.31/58.50 ; 4210 with value (4 27) 74 with value (4 42) 25 with value (4 57)
% 58.31/58.50 ; 5769 with value (4 28) 87 with value (4 43) 16 with value (4 58)
% 58.31/58.50 ; 8490 with value (4 29) 35 with value (4 44) 2 with value (4 59)
% 58.31/58.50 ; 12219 with value (4 30) 33 with value (4 45) 3 with value (4 60)
% 58.31/58.50 ; 14380 with value (4 31) 61 with value (4 46) 4 with value (4 61)
% 58.31/58.50 ; 17358 with value (4 32) 37 with value (4 47) 1 with value (4 62)
% 58.31/58.50 ; 13291 with value (4 33) 26 with value (4 48) 1 with value (4 63)
% 58.31/58.50 ; 8005 with value (4 34) 17 with value (4 49) 1 with value (4 65)
% 58.31/58.50 ; 3453 with value (4 35) 31 with value (4 50)
% 58.31/58.50 Evaluation took:
% 58.31/58.50 58.036 seconds of real time
% 58.31/58.50 56.037537 seconds of user run time
% 58.31/58.50 1.978578 seconds of system run time
% 58.31/58.50 [Run times include 13.498 seconds GC run time.]
% 58.31/58.50 0 calls to %EVAL
% 58.31/58.50 0 page faults and
% 58.31/58.50 1,974,576,560 bytes consed.
% 58.31/58.50 :PROOF-FOUND
% 58.31/58.50 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-07-02T16:18:13
% 58.31/58.50 :PROOF-FOUND
% 58.31/58.50 *
%------------------------------------------------------------------------------