TSTP Solution File: LCL218-10 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : LCL218-10 : TPTP v8.1.0. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n021.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:17 EDT 2022
% Result : Unsatisfiable 3.16s 3.37s
% Output : Refutation 3.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of clauses : 18 ( 18 unt; 0 nHn; 2 RR)
% Number of literals : 18 ( 17 equ; 1 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-4 aty)
% Number of variables : 41 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(ifeq_axiom,axiom,
ifeq(X,X,Y,Z) = Y,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ifeq_axiom) ).
cnf(axiom_1_3,axiom,
axiom(or(not(X),or(Y,X))) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1_3) ).
cnf(axiom_1_4,axiom,
axiom(or(not(or(X,Y)),or(Y,X))) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1_4) ).
cnf(axiom_1_5,axiom,
axiom(or(not(or(X,or(Y,Z))),or(Y,or(X,Z)))) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1_5) ).
cnf(rule_1,axiom,
ifeq(axiom(X),true,theorem(X),true) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_1) ).
cnf(rule_2,axiom,
ifeq(theorem(X),true,ifeq(axiom(or(not(X),Y)),true,theorem(Y),true),true) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_2) ).
cnf(rule_3,axiom,
ifeq(theorem(or(not(X),Y)),true,ifeq(axiom(or(not(Z),X)),true,theorem(or(not(Z),Y)),true),true) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_3) ).
cnf(prove_this,negated_conjecture,
theorem(or(not(or(not(or(p,q)),q)),or(not(p),q))) != true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
cnf(13,plain,
theorem(or(not(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(19,plain,
ifeq(theorem(or(X,or(Y,Z))),true,theorem(or(Y,or(X,Z))),true) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[rule_2,axiom_1_5,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(22,plain,
ifeq(theorem(or(not(or(X,Y)),Z)),true,theorem(or(not(Y),Z)),true) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[rule_3,axiom_1_3,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(24,plain,
ifeq(theorem(or(not(or(X,Y)),Z)),true,theorem(or(not(or(Y,X)),Z)),true) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[rule_3,axiom_1_4,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(110,plain,
theorem(or(X,or(not(or(Y,X)),Y))) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[19,13,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(1291,plain,
theorem(or(not(or(X,Y)),or(not(or(Z,not(or(Y,X)))),Z))) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[24,110,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(3520,plain,
theorem(or(not(X),or(not(or(Y,not(or(X,Z)))),Y))) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[22,1291,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(3528,plain,
theorem(or(not(or(X,not(or(Y,Z)))),or(not(Y),X))) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[19,3520,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(3537,plain,
theorem(or(not(or(not(or(X,Y)),Z)),or(not(X),Z))) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[24,3528,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(3538,plain,
$false,
inference('REWRITE',[status(thm)],[prove_this,3537,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : LCL218-10 : TPTP v8.1.0. Released v7.3.0.
% 0.11/0.13 % Command : run-snark %s %d
% 0.12/0.33 % Computer : n021.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.33 % DateTime : Mon Jul 4 18:01:17 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.45 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.46 *
% 0.19/0.46 *
% 0.19/0.46 #<PACKAGE "SNARK-USER">
% 0.19/0.46 *
% 0.19/0.46 SNARK-TPTP-OPTIONS
% 0.19/0.46 *
% 0.19/0.46 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.19/0.46 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.19/0.46 (USE-FACTORING :POS)
% 0.19/0.46 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.19/0.46 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.19/0.46 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.19/0.46 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.19/0.46 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.19/0.46 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.19/0.46 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.19/0.46 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.19/0.46 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.19/0.46 (DECLARE-TPTP-SYMBOLS2))
% 0.19/0.46 *
% 0.19/0.46 "."
% 0.19/0.46 *
% 0.19/0.46 ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-07-04T18:01:17
% 0.19/0.46 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n021.cluster.edu at 2022-07-04T18:01:17
% 3.16/3.37
% 3.16/3.37
% 3.16/3.37 #||
% 3.16/3.37 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.16/3.37 % SZS output start Refutation
% See solution above
% 3.16/3.39 ||#
% 3.16/3.39
% 3.16/3.39 ; Summary of computation:
% 3.16/3.39 ; 108779 formulas have been input or derived (from 797 formulas).
% 3.16/3.39 ; 3538 ( 3%) were retained. Of these,
% 3.16/3.39 ; 13 ( 0%) were simplified or subsumed later,
% 3.16/3.39 ; 3525 (100%) are still being kept.
% 3.16/3.39 ;
% 3.16/3.39 ; Run time in seconds excluding printing time:
% 3.16/3.39 ; 0.002 0% Read assertion file (1 call)
% 3.16/3.39 ; 0.000 0% Assert (10 calls)
% 3.16/3.39 ; 0.448 15% Process new row (22,651 calls)
% 3.16/3.39 ; 0.110 4% Resolution (1,592 calls)
% 3.16/3.39 ; 1.477 51% Paramodulation (796 calls)
% 3.16/3.39 ; 0.523 18% Forward simplification (22,651 calls)
% 3.16/3.39 ; 0.102 4% Backward simplification (3,538 calls)
% 3.16/3.39 ; 0.125 4% Ordering (138,637 calls)
% 3.16/3.39 ; 0.001 0% Sortal reasoning (32 calls)
% 3.16/3.39 ; 0.000 0% Purity testing (1 call)
% 3.16/3.39 ; 0.118 4% Other
% 3.16/3.39 ; 2.906 Total
% 3.16/3.39 ; 2.923 Real time
% 3.16/3.39 ;
% 3.16/3.39 ; Term-hash-array has 14,489 terms in all.
% 3.16/3.39 ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 3.16/3.39 ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 3.16/3.39 ; Path-index has 14,431 entries (14,442 at peak, 14,499 added, 68 deleted).
% 3.16/3.39 ; Path-index has 8,215 nodes (8,241 at peak, 8,322 added, 107 deleted).
% 3.16/3.39 ; Trie-index has 14,431 entries (14,442 at peak, 14,499 added, 68 deleted).
% 3.16/3.39 ; Trie-index has 34,676 nodes (34,713 at peak, 35,092 added, 416 deleted).
% 3.16/3.39 ; Retrieved 157,691 generalization terms in 66,898 calls.
% 3.16/3.39 ; Retrieved 11,902 instance terms in 3,537 calls.
% 3.16/3.39 ; Retrieved 361,007 unifiable terms in 7,648 calls.
% 3.16/3.39 ;
% 3.16/3.39 ; The agenda of rows to process has 28 entries:
% 3.16/3.39 ; 6 with value 33 2 with value 40 1 with value 43
% 3.16/3.39 ; 3 with value 34 2 with value 41 1 with value 44
% 3.16/3.39 ; 2 with value 36 8 with value 42 1 with value 47
% 3.16/3.39 ; 2 with value 38
% 3.16/3.39 ; The agenda of rows to give has 2729 entries:
% 3.16/3.39 ; 176 with value (4 28) 178 with value (4 34) 198 with value (4 39)
% 3.16/3.39 ; 292 with value (4 29) 104 with value (4 35) 92 with value (4 40)
% 3.16/3.39 ; 259 with value (4 30) 141 with value (4 36) 2 with value (4 41)
% 3.16/3.39 ; 369 with value (4 31) 152 with value (4 37) 4 with value (4 43)
% 3.16/3.39 ; 304 with value (4 32) 173 with value (4 38) 2 with value (4 45)
% 3.16/3.39 ; 283 with value (4 33)
% 3.16/3.39 Evaluation took:
% 3.16/3.39 2.924 seconds of real time
% 3.16/3.39 2.62019 seconds of user run time
% 3.16/3.39 0.304103 seconds of system run time
% 3.16/3.39 [Run times include 0.274 seconds GC run time.]
% 3.16/3.39 0 calls to %EVAL
% 3.16/3.39 0 page faults and
% 3.16/3.39 228,016,824 bytes consed.
% 3.16/3.39 :PROOF-FOUND
% 3.16/3.39 ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-07-04T18:01:20
% 3.16/3.39 :PROOF-FOUND
% 3.16/3.39 *
%------------------------------------------------------------------------------