TSTP Solution File: LCL240-3 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : LCL240-3 : TPTP v8.1.0. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n011.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:33 EDT 2022
% Result : Unsatisfiable 6.56s 6.75s
% Output : Refutation 6.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 9
% Syntax : Number of clauses : 34 ( 32 unt; 0 nHn; 8 RR)
% Number of literals : 37 ( 4 equ; 8 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 : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 60 ( 9 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(prove_this,negated_conjecture,
~ theorem(implies(and(p,q),p)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
cnf(12,plain,
theorem(implies(or(X,X),X)),
inference('HYPERRESOLVE',[status(thm)],[rule_1,axiom_1_2]) ).
cnf(13,plain,
theorem(implies(X,or(Y,X))),
inference('HYPERRESOLVE',[status(thm)],[rule_1,axiom_1_3]) ).
cnf(15,plain,
theorem(implies(or(X,Y),or(Y,X))),
inference('HYPERRESOLVE',[status(thm)],[rule_1,axiom_1_4]) ).
cnf(21,plain,
and(X,implies(Y,not(Z))) = not(implies(X,and(Y,Z))),
inference('PARAMODULATE',[status(thm)],[10,10,theory(equality)]) ).
cnf(25,plain,
theorem(implies(implies(X,Y),implies(or(Z,X),or(Z,Y)))),
inference('HYPERRESOLVE',[status(thm)],[rule_1,axiom_1_6]) ).
cnf(27,plain,
theorem(implies(implies(X,not(X)),not(X))),
inference('PARAMODULATE',[status(thm)],[12,implies_definition,theory(equality)]) ).
cnf(33,plain,
~ theorem(implies(implies(X,or(Y,X)),implies(and(p,q),p))),
inference('UR-RESOLVE',[status(thm)],[rule_2,13,prove_this]) ).
cnf(50,plain,
theorem(implies(implies(X,Y),or(Y,not(X)))),
inference('PARAMODULATE',[status(thm)],[15,implies_definition,theory(equality)]) ).
cnf(51,plain,
theorem(implies(or(X,not(Y)),implies(Y,X))),
inference('PARAMODULATE',[status(thm)],[15,implies_definition,theory(equality)]) ).
cnf(104,plain,
theorem(implies(X,and(X,X))),
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[rule_2,50,27]),implies_definition,10,theory(equality)]) ).
cnf(422,plain,
theorem(implies(or(X,or(Y,Y)),or(X,Y))),
inference('HYPERRESOLVE',[status(thm)],[rule_2,25,12]) ).
cnf(423,plain,
theorem(implies(or(X,Y),or(X,or(Z,Y)))),
inference('HYPERRESOLVE',[status(thm)],[rule_2,25,13]) ).
cnf(425,plain,
theorem(implies(or(X,Y),or(X,and(Y,Y)))),
inference('HYPERRESOLVE',[status(thm)],[rule_2,25,104]) ).
cnf(426,plain,
theorem(implies(or(X,or(Y,Z)),or(X,or(Z,Y)))),
inference('HYPERRESOLVE',[status(thm)],[rule_2,25,15]) ).
cnf(429,plain,
theorem(implies(implies(X,Y),implies(implies(Z,X),implies(Z,Y)))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[25,implies_definition,theory(equality)]),implies_definition,theory(equality)]) ).
cnf(448,plain,
theorem(implies(implies(X,or(Y,Y)),implies(X,Y))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[422,implies_definition,theory(equality)]),implies_definition,theory(equality)]) ).
cnf(808,plain,
theorem(implies(X,X)),
inference('HYPERRESOLVE',[status(thm)],[rule_2,448,13]) ).
cnf(836,plain,
theorem(or(X,not(X))),
inference('HYPERRESOLVE',[status(thm)],[rule_2,808,50]) ).
cnf(855,plain,
theorem(or(X,or(Y,not(X)))),
inference('HYPERRESOLVE',[status(thm)],[rule_2,836,423]) ).
cnf(3873,plain,
theorem(or(X,implies(X,Y))),
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[rule_2,426,855]),implies_definition,theory(equality)]) ).
cnf(4318,plain,
~ theorem(implies(or(X,and(p,q)),p)),
inference('UR-RESOLVE',[status(thm)],[rule_2,429,33]) ).
cnf(4390,plain,
~ theorem(implies(implies(X,and(p,q)),p)),
inference('PARAMODULATE',[status(thm)],[4318,implies_definition,theory(equality)]) ).
cnf(4491,plain,
~ theorem(or(p,and(X,implies(p,not(q))))),
inference('REWRITE',[status(thm)],[inference('UR-RESOLVE',[status(thm)],[rule_2,4390,51]),21,theory(equality)]) ).
cnf(23586,plain,
$false,
inference('UR-RESOLVE',[status(thm)],[rule_2,4491,425,3873]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL240-3 : TPTP v8.1.0. Released v2.3.0.
% 0.07/0.13 % Command : run-snark %s %d
% 0.12/0.34 % Computer : n011.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Sun Jul 3 07:14:50 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.45 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.47 *
% 0.19/0.47 *
% 0.19/0.47 #<PACKAGE "SNARK-USER">
% 0.19/0.47 *
% 0.19/0.47 SNARK-TPTP-OPTIONS
% 0.19/0.47 *
% 0.19/0.47 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.19/0.47 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.19/0.47 (USE-FACTORING :POS)
% 0.19/0.47 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.19/0.47 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.19/0.47 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.19/0.47 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.19/0.47 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.19/0.47 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.19/0.47 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.19/0.47 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.19/0.47 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.19/0.47 (DECLARE-TPTP-SYMBOLS2))
% 0.19/0.47 *
% 0.19/0.47 "."
% 0.19/0.47 *
% 0.19/0.47 ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-07-03T07:14:50
% 0.19/0.47 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n011.cluster.edu at 2022-07-03T07:14:50
% 6.56/6.75
% 6.56/6.75
% 6.56/6.75 #||
% 6.56/6.75 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 6.56/6.75 % SZS output start Refutation
% See solution above
% 6.56/6.78 ||#
% 6.56/6.78
% 6.56/6.78 ; Summary of computation:
% 6.56/6.78 ; 44698 formulas have been input or derived (from 362 formulas).
% 6.56/6.78 ; 23586 (53%) were retained. Of these,
% 6.56/6.78 ; 7 ( 0%) were simplified or subsumed later,
% 6.56/6.78 ; 23579 (100%) are still being kept.
% 6.56/6.78 ;
% 6.56/6.78 ; Run time in seconds excluding printing time:
% 6.56/6.78 ; 0.003 0% Read assertion file (1 call)
% 6.56/6.78 ; 0.000 0% Assert (10 calls)
% 6.56/6.78 ; 2.152 34% Process new row (37,914 calls)
% 6.56/6.78 ; 2.114 34% Resolution (722 calls)
% 6.56/6.78 ; 0.130 2% Paramodulation (361 calls)
% 6.56/6.78 ; 0.000 0% Condensing (2 calls)
% 6.56/6.78 ; 0.000 0% Forward subsumption (2 calls)
% 6.56/6.78 ; 0.000 0% Backward subsumption (2 calls)
% 6.56/6.78 ; 0.892 14% Forward simplification (37,914 calls)
% 6.56/6.78 ; 0.823 13% Backward simplification (23,585 calls)
% 6.56/6.78 ; 0.004 0% Ordering (781 calls)
% 6.56/6.78 ; 0.000 0% Sortal reasoning (32 calls)
% 6.56/6.78 ; 0.000 0% Purity testing (1 call)
% 6.56/6.78 ; 0.154 2% Other
% 6.56/6.78 ; 6.272 Total
% 6.56/6.78 ; 6.302 Real time
% 6.56/6.78 ;
% 6.56/6.78 ; Term-hash-array has 50,479 terms in all.
% 6.56/6.78 ; Feature-vector-row-index has 2 entries (2 at peak, 2 added, 0 deleted).
% 6.56/6.78 ; Feature-vector-row-index has 6 nodes (6 at peak, 6 added, 0 deleted).
% 6.56/6.78 ; Retrieved 0 possibly forward subsuming rows in 2 calls.
% 6.56/6.78 ; Retrieved 0 possibly backward subsumed rows in 2 calls.
% 6.56/6.78 ; Path-index has 50,475 entries (50,475 at peak, 50,482 added, 7 deleted).
% 6.56/6.78 ; Path-index has 25,457 nodes (25,457 at peak, 25,457 added, 0 deleted).
% 6.56/6.78 ; Trie-index has 50,475 entries (50,475 at peak, 50,482 added, 7 deleted).
% 6.56/6.78 ; Trie-index has 157,609 nodes (157,609 at peak, 157,609 added, 0 deleted).
% 6.56/6.78 ; Retrieved 298,165 generalization terms in 123,288 calls.
% 6.56/6.78 ; Retrieved 80,796 instance terms in 23,582 calls.
% 6.56/6.78 ; Retrieved 2,561,219 unifiable terms in 13,169 calls.
% 6.56/6.78 ;
% 6.56/6.78 ; The agenda of rows to process has 223 entries:
% 6.56/6.78 ; 1 with value 12 2 with value 25 74 with value 31
% 6.56/6.78 ; 1 with value 13 1 with value 26 11 with value 32
% 6.56/6.78 ; 1 with value 14 7 with value 27 9 with value 33
% 6.56/6.78 ; 2 with value 17 8 with value 28 2 with value 40
% 6.56/6.78 ; 3 with value 20 38 with value 29 1 with value 49
% 6.56/6.78 ; 1 with value 22 61 with value 30
% 6.56/6.78 ; The agenda of rows to give has 23217 entries:
% 6.56/6.78 ; 37 with value (4 19) 3088 with value (4 31) 30 with value (4 42)
% 6.56/6.78 ; 245 with value (4 20) 1360 with value (4 32) 19 with value (4 43)
% 6.56/6.78 ; 336 with value (4 21) 643 with value (4 33) 2 with value (4 44)
% 6.56/6.78 ; 464 with value (4 22) 98 with value (4 34) 5 with value (4 45)
% 6.56/6.78 ; 647 with value (4 23) 53 with value (4 35) 4 with value (4 46)
% 6.56/6.78 ; 774 with value (4 24) 21 with value (4 36) 6 with value (4 47)
% 6.56/6.78 ; 1169 with value (4 25) 25 with value (4 37) 9 with value (4 48)
% 6.56/6.78 ; 1820 with value (4 26) 19 with value (4 38) 6 with value (4 49)
% 6.56/6.78 ; 2382 with value (4 27) 16 with value (4 39) 2 with value (4 51)
% 6.56/6.78 ; 3052 with value (4 28) 15 with value (4 40) 17 with value (4 52)
% 6.56/6.78 ; 3682 with value (4 29) 4 with value (4 41) 4 with value (4 59)
% 6.56/6.78 ; 3163 with value (4 30)
% 6.56/6.78 Evaluation took:
% 6.56/6.78 6.303 seconds of real time
% 6.56/6.78 5.907516 seconds of user run time
% 6.56/6.78 0.39453 seconds of system run time
% 6.56/6.78 [Run times include 1.34 seconds GC run time.]
% 6.56/6.78 0 calls to %EVAL
% 6.56/6.78 0 page faults and
% 6.56/6.78 378,176,896 bytes consed.
% 6.56/6.78 :PROOF-FOUND
% 6.56/6.78 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-07-03T07:14:57
% 6.56/6.78 :PROOF-FOUND
% 6.56/6.78 *
%------------------------------------------------------------------------------