TSTP Solution File: LCL239-10 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : LCL239-10 : TPTP v8.1.0. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n026.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:32 EDT 2022
% Result : Unsatisfiable 0.69s 0.86s
% Output : Refutation 0.69s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 10
% Syntax : Number of clauses : 27 ( 27 unt; 0 nHn; 2 RR)
% Number of literals : 27 ( 26 equ; 1 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 2 con; 0-4 aty)
% Number of variables : 47 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(ifeq_axiom,axiom,
ifeq(X,X,Y,Z) = Y,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ifeq_axiom) ).
cnf(axiom_1_2,axiom,
axiom(implies(or(X,X),X)) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1_2) ).
cnf(axiom_1_3,axiom,
axiom(implies(X,or(Y,X))) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1_3) ).
cnf(axiom_1_4,axiom,
axiom(implies(or(X,Y),or(Y,X))) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1_4) ).
cnf(axiom_1_6,axiom,
axiom(implies(implies(X,Y),implies(or(Z,X),or(Z,Y)))) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1_6) ).
cnf(implies_definition,axiom,
implies(X,Y) = or(not(X),Y),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',implies_definition) ).
cnf(rule_1,axiom,
ifeq(axiom(X),true,theorem(X),true) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_1) ).
cnf(rule_2,axiom,
ifeq(theorem(implies(X,Y)),true,ifeq(theorem(X),true,theorem(Y),true),true) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_2) ).
cnf(and_defn,axiom,
and(X,Y) = not(or(not(X),not(Y))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',and_defn) ).
cnf(11,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(not(and(p,not(p)))) != true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
cnf(15,plain,
theorem(implies(or(X,X),X)) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[rule_1,axiom_1_2,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(16,plain,
theorem(implies(X,or(Y,X))) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[rule_1,axiom_1_3,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(21,plain,
theorem(implies(or(X,Y),or(Y,X))) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[rule_1,axiom_1_4,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(25,plain,
axiom(implies(implies(X,Y),implies(implies(Z,X),implies(Z,Y)))) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[axiom_1_6,implies_definition,theory(equality)]),implies_definition,theory(equality)]) ).
cnf(30,plain,
ifeq(theorem(implies(implies(or(X,X),X),Y)),true,theorem(Y),true) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[rule_2,15,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(33,plain,
ifeq(theorem(implies(implies(X,or(Y,X)),Z)),true,theorem(Z),true) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[rule_2,16,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(38,plain,
theorem(implies(implies(X,Y),or(Y,not(X)))) = true,
inference('PARAMODULATE',[status(thm)],[21,implies_definition,theory(equality)]) ).
cnf(78,plain,
ifeq(theorem(implies(X,Y)),true,theorem(or(Y,not(X))),true) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[rule_2,38,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(143,plain,
theorem(implies(implies(X,Y),implies(implies(Z,X),implies(Z,Y)))) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[rule_1,25,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(428,plain,
theorem(implies(implies(X,or(Y,Y)),implies(X,Y))) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[30,143,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(460,plain,
theorem(implies(X,X)) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[33,428,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(465,plain,
theorem(or(X,not(X))) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[78,460,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(476,plain,
theorem(implies(X,not(not(X)))) = true,
inference('PARAMODULATE',[status(thm)],[465,implies_definition,theory(equality)]) ).
cnf(508,plain,
ifeq(theorem(X),true,theorem(not(not(X))),true) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[rule_2,476,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(992,plain,
theorem(not(and(X,not(X)))) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[508,476,theory(equality)]),ifeq_axiom,11,theory(equality)]) ).
cnf(993,plain,
$false,
inference('REWRITE',[status(thm)],[prove_this,992,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LCL239-10 : TPTP v8.1.0. Released v7.5.0.
% 0.11/0.13 % Command : run-snark %s %d
% 0.13/0.34 % Computer : n026.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 : Mon Jul 4 15:31:52 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.47 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.48 *
% 0.20/0.48 *
% 0.20/0.49 #<PACKAGE "SNARK-USER">
% 0.20/0.49 *
% 0.20/0.49 SNARK-TPTP-OPTIONS
% 0.20/0.49 *
% 0.20/0.49 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.20/0.49 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.20/0.49 (USE-FACTORING :POS)
% 0.20/0.49 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.20/0.49 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.20/0.49 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.20/0.49 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.20/0.49 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.20/0.49 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.20/0.49 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.20/0.49 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.20/0.49 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.20/0.49 (DECLARE-TPTP-SYMBOLS2))
% 0.20/0.49 *
% 0.20/0.49 "."
% 0.20/0.49 *
% 0.20/0.49 ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-07-04T15:31:52
% 0.20/0.49 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n026.cluster.edu at 2022-07-04T15:31:52
% 0.69/0.86
% 0.69/0.86
% 0.69/0.86 #||
% 0.69/0.86 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.69/0.86 % SZS output start Refutation
% See solution above
% 0.69/0.88 ||#
% 0.69/0.88
% 0.69/0.88 ; Summary of computation:
% 0.69/0.88 ; 4577 formulas have been input or derived (from 185 formulas).
% 0.69/0.88 ; 993 (22%) were retained. Of these,
% 0.69/0.88 ; 31 ( 3%) were simplified or subsumed later,
% 0.69/0.88 ; 962 (97%) are still being kept.
% 0.69/0.88 ;
% 0.69/0.88 ; Run time in seconds excluding printing time:
% 0.69/0.88 ; 0.002 1% Read assertion file (1 call)
% 0.69/0.88 ; 0.001 0% Assert (11 calls)
% 0.69/0.88 ; 0.102 28% Process new row (3,183 calls)
% 0.69/0.88 ; 0.010 3% Resolution (368 calls)
% 0.69/0.88 ; 0.097 26% Paramodulation (184 calls)
% 0.69/0.88 ; 0.080 22% Forward simplification (3,183 calls)
% 0.69/0.88 ; 0.025 7% Backward simplification (992 calls)
% 0.69/0.88 ; 0.010 3% Ordering (6,586 calls)
% 0.69/0.88 ; 0.001 0% Sortal reasoning (32 calls)
% 0.69/0.88 ; 0.000 0% Purity testing (1 call)
% 0.69/0.88 ; 0.040 11% Other
% 0.69/0.88 ; 0.368 Total
% 0.69/0.88 ; 0.387 Real time
% 0.69/0.88 ;
% 0.69/0.88 ; Term-hash-array has 3,521 terms in all.
% 0.69/0.88 ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 0.69/0.88 ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 0.69/0.88 ; Path-index has 3,430 entries (3,436 at peak, 3,533 added, 103 deleted).
% 0.69/0.88 ; Path-index has 12,489 nodes (12,499 at peak, 12,593 added, 104 deleted).
% 0.69/0.88 ; Trie-index has 3,430 entries (3,436 at peak, 3,533 added, 103 deleted).
% 0.69/0.88 ; Trie-index has 18,907 nodes (18,922 at peak, 19,446 added, 539 deleted).
% 0.69/0.88 ; Retrieved 7,520 generalization terms in 15,597 calls.
% 0.69/0.88 ; Retrieved 2,342 instance terms in 991 calls.
% 0.69/0.88 ; Retrieved 11,984 unifiable terms in 1,432 calls.
% 0.69/0.88 ;
% 0.69/0.88 ; The agenda of rows to process has 124 entries:
% 0.69/0.88 ; 9 with value 31 21 with value 34 1 with value 37
% 0.69/0.88 ; 30 with value 32 31 with value 35 3 with value 38
% 0.69/0.88 ; 17 with value 33 12 with value 36
% 0.69/0.88 ; The agenda of rows to give has 778 entries:
% 0.69/0.88 ; 1 with value (4 21) 64 with value (4 29) 5 with value (4 36)
% 0.69/0.88 ; 19 with value (4 23) 54 with value (4 30) 9 with value (4 37)
% 0.69/0.88 ; 81 with value (4 24) 41 with value (4 31) 9 with value (4 38)
% 0.69/0.88 ; 91 with value (4 25) 53 with value (4 32) 1 with value (4 39)
% 0.69/0.88 ; 85 with value (4 26) 58 with value (4 33) 3 with value (4 41)
% 0.69/0.88 ; 96 with value (4 27) 25 with value (4 34) 1 with value (4 42)
% 0.69/0.88 ; 51 with value (4 28) 31 with value (4 35)
% 0.69/0.88 Evaluation took:
% 0.69/0.88 0.387 seconds of real time
% 0.69/0.88 0.34699 seconds of user run time
% 0.69/0.88 0.040426 seconds of system run time
% 0.69/0.88 [Run times include 0.033 seconds GC run time.]
% 0.69/0.88 0 calls to %EVAL
% 0.69/0.88 0 page faults and
% 0.69/0.88 25,580,736 bytes consed.
% 0.69/0.88 :PROOF-FOUND
% 0.69/0.88 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-07-04T15:31:52
% 0.69/0.88 :PROOF-FOUND
% 0.69/0.88 *
%------------------------------------------------------------------------------