TSTP Solution File: LCL199-3 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : LCL199-3 : TPTP v8.1.0. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n003.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:02 EDT 2022
% Result : Unsatisfiable 40.28s 40.49s
% Output : Refutation 40.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 8
% Syntax : Number of clauses : 34 ( 32 unt; 0 nHn; 6 RR)
% Number of literals : 37 ( 1 equ; 6 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 6 ( 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 : 65 ( 16 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(prove_this,negated_conjecture,
~ theorem(implies(not(or(p,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(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(41,plain,
theorem(implies(implies(X,Y),or(Y,not(X)))),
inference('PARAMODULATE',[status(thm)],[12,implies_definition,theory(equality)]) ).
cnf(42,plain,
theorem(implies(or(X,not(Y)),implies(Y,X))),
inference('PARAMODULATE',[status(thm)],[12,implies_definition,theory(equality)]) ).
cnf(92,plain,
theorem(or(or(X,Y),not(Y))),
inference('HYPERRESOLVE',[status(thm)],[rule_2,41,11]) ).
cnf(98,plain,
theorem(implies(implies(X,not(Y)),implies(Y,not(X)))),
inference('PARAMODULATE',[status(thm)],[41,implies_definition,theory(equality)]) ).
cnf(119,plain,
~ theorem(implies(p,not(not(or(p,q))))),
inference('REWRITE',[status(thm)],[inference('UR-RESOLVE',[status(thm)],[rule_2,42,prove_this]),implies_definition,theory(equality)]) ).
cnf(241,plain,
theorem(implies(or(X,or(Y,Y)),or(X,Y))),
inference('HYPERRESOLVE',[status(thm)],[rule_2,21,10]) ).
cnf(242,plain,
theorem(implies(or(X,Y),or(X,or(Z,Y)))),
inference('HYPERRESOLVE',[status(thm)],[rule_2,21,11]) ).
cnf(243,plain,
theorem(implies(or(X,Y),or(X,implies(Z,Y)))),
inference('HYPERRESOLVE',[status(thm)],[rule_2,21,26]) ).
cnf(244,plain,
theorem(implies(or(X,or(Y,Z)),or(X,or(Z,Y)))),
inference('HYPERRESOLVE',[status(thm)],[rule_2,21,12]) ).
cnf(261,plain,
theorem(implies(implies(X,or(Y,Y)),implies(X,Y))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[241,implies_definition,theory(equality)]),implies_definition,theory(equality)]) ).
cnf(272,plain,
theorem(or(or(X,Y),or(Z,not(Y)))),
inference('HYPERRESOLVE',[status(thm)],[rule_2,242,92]) ).
cnf(488,plain,
theorem(implies(X,X)),
inference('HYPERRESOLVE',[status(thm)],[rule_2,261,11]) ).
cnf(492,plain,
theorem(implies(or(implies(X,Y),Y),implies(X,Y))),
inference('HYPERRESOLVE',[status(thm)],[rule_2,261,243]) ).
cnf(514,plain,
theorem(implies(X,not(not(X)))),
inference('HYPERRESOLVE',[status(thm)],[rule_2,488,98]) ).
cnf(576,plain,
theorem(implies(or(X,Y),or(X,not(not(Y))))),
inference('HYPERRESOLVE',[status(thm)],[rule_2,514,21]) ).
cnf(2778,plain,
theorem(or(or(X,Y),implies(Y,Z))),
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[rule_2,244,272]),implies_definition,theory(equality)]) ).
cnf(2823,plain,
theorem(or(implies(X,Y),or(Z,X))),
inference('HYPERRESOLVE',[status(thm)],[rule_2,2778,12]) ).
cnf(2935,plain,
theorem(or(implies(X,Y),or(X,Z))),
inference('HYPERRESOLVE',[status(thm)],[rule_2,2823,244]) ).
cnf(3767,plain,
~ theorem(or(implies(p,not(not(or(p,q)))),not(not(or(p,q))))),
inference('UR-RESOLVE',[status(thm)],[rule_2,492,119]) ).
cnf(75489,plain,
theorem(or(implies(X,Y),not(not(or(X,Z))))),
inference('HYPERRESOLVE',[status(thm)],[rule_2,576,2935]) ).
cnf(75490,plain,
$false,
inference('REWRITE',[status(thm)],[3767,75489]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LCL199-3 : TPTP v8.1.0. Released v2.3.0.
% 0.03/0.13 % Command : run-snark %s %d
% 0.14/0.34 % Computer : n003.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Sat Jul 2 15:23:08 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.20/0.46 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.47 *
% 0.20/0.47 *
% 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-02T15:23:08
% 0.20/0.47 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n003.cluster.edu at 2022-07-02T15:23:08
% 40.28/40.49
% 40.28/40.49
% 40.28/40.49 #||
% 40.28/40.49 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 40.28/40.49 % SZS output start Refutation
% See solution above
% 40.28/40.49 ||#
% 40.28/40.49
% 40.28/40.49 ; Summary of computation:
% 40.28/40.49 ; 149945 formulas have been input or derived (from 644 formulas).
% 40.28/40.49 ; 75490 (50%) were retained. Of these,
% 40.28/40.49 ; 15 ( 0%) were simplified or subsumed later,
% 40.28/40.49 ; 75475 (100%) are still being kept.
% 40.28/40.49 ;
% 40.28/40.49 ; Run time in seconds excluding printing time:
% 40.28/40.49 ; 0.002 0% Read assertion file (1 call)
% 40.28/40.49 ; 0.000 0% Assert (9 calls)
% 40.28/40.49 ; 9.332 23% Process new row (126,236 calls)
% 40.28/40.49 ; 19.645 49% Resolution (1,286 calls)
% 40.28/40.49 ; 1.186 3% Paramodulation (643 calls)
% 40.28/40.49 ; 0.000 0% Condensing (2 calls)
% 40.28/40.49 ; 0.000 0% Forward subsumption (2 calls)
% 40.28/40.49 ; 0.000 0% Backward subsumption (2 calls)
% 40.28/40.49 ; 4.341 11% Forward simplification (126,236 calls)
% 40.28/40.49 ; 4.838 12% Backward simplification (75,490 calls)
% 40.28/40.49 ; 0.004 0% Ordering (629 calls)
% 40.28/40.49 ; 0.000 0% Sortal reasoning (32 calls)
% 40.28/40.49 ; 0.000 0% Purity testing (1 call)
% 40.28/40.49 ; 0.656 2% Other
% 40.28/40.49 ; 40.004 Total
% 40.28/40.49 ; 40.013 Real time
% 40.28/40.49 ;
% 40.28/40.49 ; Term-hash-array has 162,743 terms in all.
% 40.28/40.49 ; Feature-vector-row-index has 2 entries (2 at peak, 2 added, 0 deleted).
% 40.28/40.49 ; Feature-vector-row-index has 6 nodes (6 at peak, 6 added, 0 deleted).
% 40.28/40.49 ; Retrieved 0 possibly forward subsuming rows in 2 calls.
% 40.28/40.49 ; Retrieved 0 possibly backward subsumed rows in 2 calls.
% 40.28/40.49 ; Path-index has 162,724 entries (162,728 at peak, 162,748 added, 24 deleted).
% 40.28/40.49 ; Path-index has 45,092 nodes (45,092 at peak, 45,092 added, 0 deleted).
% 40.28/40.49 ; Trie-index has 162,724 entries (162,728 at peak, 162,748 added, 24 deleted).
% 40.28/40.49 ; Trie-index has 421,410 nodes (421,426 at peak, 421,426 added, 16 deleted).
% 40.28/40.49 ; Retrieved 1,329,176 generalization terms in 345,261 calls.
% 40.28/40.49 ; Retrieved 260,839 instance terms in 75,487 calls.
% 40.28/40.49 ; Retrieved 20,154,004 unifiable terms in 39,714 calls.
% 40.28/40.49 ;
% 40.28/40.49 ; The agenda of rows to process has 554 entries:
% 40.28/40.49 ; 46 with value 23 13 with value 29 27 with value 34
% 40.28/40.49 ; 68 with value 24 26 with value 30 6 with value 35
% 40.28/40.49 ; 84 with value 25 28 with value 31 3 with value 37
% 40.28/40.49 ; 74 with value 26 32 with value 32 1 with value 38
% 40.28/40.49 ; 44 with value 27 51 with value 33 1 with value 40
% 40.28/40.49 ; 50 with value 28
% 40.28/40.49 ; The agenda of rows to give has 74832 entries:
% 40.28/40.49 ; 2 with value (4 20) 3015 with value (4 35) 12 with value (4 50)
% 40.28/40.49 ; 418 with value (4 21) 981 with value (4 36) 9 with value (4 51)
% 40.28/40.49 ; 617 with value (4 22) 569 with value (4 37) 2 with value (4 52)
% 40.28/40.49 ; 1012 with value (4 23) 206 with value (4 38) 12 with value (4 53)
% 40.28/40.49 ; 1588 with value (4 24) 176 with value (4 39) 11 with value (4 54)
% 40.28/40.49 ; 1844 with value (4 25) 106 with value (4 40) 3 with value (4 55)
% 40.28/40.49 ; 2587 with value (4 26) 72 with value (4 41) 14 with value (4 56)
% 40.28/40.49 ; 3583 with value (4 27) 66 with value (4 42) 10 with value (4 57)
% 40.28/40.49 ; 4846 with value (4 28) 29 with value (4 43) 14 with value (4 58)
% 40.28/40.49 ; 6742 with value (4 29) 30 with value (4 44) 1 with value (4 59)
% 40.28/40.49 ; 9017 with value (4 30) 40 with value (4 45) 5 with value (4 60)
% 40.28/40.49 ; 9883 with value (4 31) 31 with value (4 46) 2 with value (4 61)
% 40.28/40.49 ; 11424 with value (4 32) 22 with value (4 47) 3 with value (4 62)
% 40.28/40.49 ; 9479 with value (4 33) 23 with value (4 48) 2 with value (4 68)
% 40.28/40.49 ; 6309 with value (4 34) 13 with value (4 49) 2 with value (4 70)
% 40.28/40.49 Evaluation took:
% 40.28/40.49 40.017 seconds of real time
% 40.28/40.49 38.53114 seconds of user run time
% 40.28/40.49 1.480599 seconds of system run time
% 40.28/40.49 [Run times include 9.193 seconds GC run time.]
% 40.28/40.49 0 calls to %EVAL
% 40.28/40.49 0 page faults and
% 40.28/40.49 1,456,256,576 bytes consed.
% 40.28/40.49 :PROOF-FOUND
% 40.28/40.49 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-07-02T15:23:48
% 40.28/40.49 :PROOF-FOUND
% 40.28/40.49 *
%------------------------------------------------------------------------------