TSTP Solution File: LCL182-3 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : LCL182-3 : TPTP v8.1.0. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n017.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:51 EDT 2022
% Result : Unsatisfiable 42.75s 42.95s
% Output : Refutation 42.75s
% 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(implies(p,q),implies(not(q),not(p)))),
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(36,plain,
theorem(implies(implies(X,Y),or(Y,not(X)))),
inference('PARAMODULATE',[status(thm)],[12,implies_definition,theory(equality)]) ).
cnf(37,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)],[36,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(289,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(450,plain,
theorem(implies(X,X)),
inference('HYPERRESOLVE',[status(thm)],[rule_2,289,11]) ).
cnf(477,plain,
theorem(implies(X,not(not(X)))),
inference('HYPERRESOLVE',[status(thm)],[rule_2,450,112]) ).
cnf(535,plain,
theorem(implies(or(X,Y),or(X,not(not(Y))))),
inference('HYPERRESOLVE',[status(thm)],[rule_2,477,21]) ).
cnf(2179,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(2213,plain,
theorem(or(X,implies(implies(Y,X),not(Y)))),
inference('HYPERRESOLVE',[status(thm)],[rule_2,256,36]) ).
cnf(2288,plain,
theorem(or(implies(implies(X,Y),not(X)),Y)),
inference('HYPERRESOLVE',[status(thm)],[rule_2,2213,12]) ).
cnf(11454,plain,
~ theorem(implies(not(q),implies(implies(p,q),not(p)))),
inference('UR-RESOLVE',[status(thm)],[rule_2,2179,prove_this]) ).
cnf(11538,plain,
~ theorem(or(implies(implies(p,q),not(p)),not(not(q)))),
inference('UR-RESOLVE',[status(thm)],[rule_2,11454,37]) ).
cnf(81228,plain,
$false,
inference('UR-RESOLVE',[status(thm)],[rule_2,535,11538,2288]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : LCL182-3 : TPTP v8.1.0. Released v2.3.0.
% 0.06/0.13 % Command : run-snark %s %d
% 0.12/0.33 % Computer : n017.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.34 % DateTime : Mon Jul 4 08:49:27 EDT 2022
% 0.12/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-04T08:49:27
% 0.20/0.47 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n017.cluster.edu at 2022-07-04T08:49:27
% 42.75/42.95
% 42.75/42.95
% 42.75/42.95 #||
% 42.75/42.95 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 42.75/42.96 % SZS output start Refutation
% See solution above
% 42.75/42.96 ||#
% 42.75/42.96
% 42.75/42.96 ; Summary of computation:
% 42.75/42.96 ; 155816 formulas have been input or derived (from 666 formulas).
% 42.75/42.96 ; 81228 (52%) were retained. Of these,
% 42.75/42.96 ; 654 ( 1%) were simplified or subsumed later,
% 42.75/42.96 ; 80574 (99%) are still being kept.
% 42.75/42.96 ;
% 42.75/42.96 ; Run time in seconds excluding printing time:
% 42.75/42.96 ; 0.002 0% Read assertion file (1 call)
% 42.75/42.96 ; 0.000 0% Assert (9 calls)
% 42.75/42.96 ; 9.975 23% Process new row (131,910 calls)
% 42.75/42.96 ; 19.914 47% Resolution (1,330 calls)
% 42.75/42.96 ; 1.444 3% Paramodulation (665 calls)
% 42.75/42.96 ; 0.001 0% Condensing (2 calls)
% 42.75/42.96 ; 0.000 0% Forward subsumption (2 calls)
% 42.75/42.96 ; 0.000 0% Backward subsumption (2 calls)
% 42.75/42.96 ; 4.570 11% Forward simplification (131,909 calls)
% 42.75/42.96 ; 6.023 14% Backward simplification (81,228 calls)
% 42.75/42.96 ; 0.000 0% Ordering (645 calls)
% 42.75/42.96 ; 0.001 0% Sortal reasoning (32 calls)
% 42.75/42.96 ; 0.000 0% Purity testing (1 call)
% 42.75/42.96 ; 0.549 1% Other
% 42.75/42.96 ; 42.479 Total
% 42.75/42.96 ; 42.489 Real time
% 42.75/42.96 ;
% 42.75/42.96 ; Term-hash-array has 174,397 terms in all.
% 42.75/42.96 ; Feature-vector-row-index has 2 entries (2 at peak, 2 added, 0 deleted).
% 42.75/42.96 ; Feature-vector-row-index has 6 nodes (6 at peak, 6 added, 0 deleted).
% 42.75/42.96 ; Retrieved 0 possibly forward subsuming rows in 2 calls.
% 42.75/42.96 ; Retrieved 0 possibly backward subsumed rows in 2 calls.
% 42.75/42.96 ; Path-index has 173,116 entries (173,116 at peak, 174,404 added, 1,288 deleted).
% 42.75/42.96 ; Path-index has 44,812 nodes (44,812 at peak, 44,819 added, 7 deleted).
% 42.75/42.96 ; Trie-index has 173,116 entries (173,116 at peak, 174,404 added, 1,288 deleted).
% 42.75/42.96 ; Trie-index has 448,851 nodes (448,851 at peak, 450,437 added, 1,586 deleted).
% 42.75/42.96 ; Retrieved 1,487,819 generalization terms in 337,494 calls.
% 42.75/42.96 ; Retrieved 277,142 instance terms in 81,225 calls.
% 42.75/42.96 ; Retrieved 19,997,534 unifiable terms in 37,893 calls.
% 42.75/42.96 ;
% 42.75/42.96 ; The agenda of rows to process has 752 entries:
% 42.75/42.96 ; 1 with value 13 64 with value 23 43 with value 32
% 42.75/42.96 ; 1 with value 15 68 with value 24 54 with value 33
% 42.75/42.96 ; 11 with value 16 85 with value 25 22 with value 34
% 42.75/42.96 ; 10 with value 17 73 with value 26 4 with value 35
% 42.75/42.96 ; 21 with value 18 43 with value 27 2 with value 36
% 42.75/42.96 ; 34 with value 19 50 with value 28 1 with value 37
% 42.75/42.96 ; 24 with value 20 14 with value 29 1 with value 38
% 42.75/42.96 ; 42 with value 21 25 with value 30 1 with value 40
% 42.75/42.96 ; 32 with value 22 26 with value 31
% 42.75/42.96 ; The agenda of rows to give has 79924 entries:
% 42.75/42.96 ; 401 with value (4 21) 3114 with value (4 35) 14 with value (4 49)
% 42.75/42.96 ; 645 with value (4 22) 790 with value (4 36) 26 with value (4 50)
% 42.75/42.96 ; 1010 with value (4 23) 377 with value (4 37) 22 with value (4 51)
% 42.75/42.96 ; 1589 with value (4 24) 215 with value (4 38) 3 with value (4 52)
% 42.75/42.96 ; 1737 with value (4 25) 166 with value (4 39) 21 with value (4 53)
% 42.75/42.96 ; 2492 with value (4 26) 96 with value (4 40) 14 with value (4 54)
% 42.75/42.96 ; 3510 with value (4 27) 89 with value (4 41) 1 with value (4 55)
% 42.75/42.96 ; 4846 with value (4 28) 73 with value (4 42) 6 with value (4 56)
% 42.75/42.96 ; 7068 with value (4 29) 48 with value (4 43) 22 with value (4 57)
% 42.75/42.96 ; 9883 with value (4 30) 22 with value (4 44) 18 with value (4 58)
% 42.75/42.96 ; 11276 with value (4 31) 27 with value (4 45) 4 with value (4 59)
% 42.75/42.96 ; 13192 with value (4 32) 59 with value (4 46) 4 with value (4 61)
% 42.75/42.96 ; 10396 with value (4 33) 26 with value (4 47) 2 with value (4 63)
% 42.75/42.96 ; 6598 with value (4 34) 20 with value (4 48) 2 with value (4 65)
% 42.75/42.96 Evaluation took:
% 42.75/42.96 42.496 seconds of real time
% 42.75/42.96 40.762287 seconds of user run time
% 42.75/42.96 1.723651 seconds of system run time
% 42.75/42.96 [Run times include 10.111 seconds GC run time.]
% 42.75/42.96 0 calls to %EVAL
% 42.75/42.96 0 page faults and
% 42.75/42.96 1,565,343,976 bytes consed.
% 42.75/42.96 :PROOF-FOUND
% 42.75/42.96 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-07-04T08:50:10
% 42.75/42.96 :PROOF-FOUND
% 42.75/42.96 *
%------------------------------------------------------------------------------