TSTP Solution File: LCL113-10 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : LCL113-10 : TPTP v8.1.0. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n027.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:18 EDT 2022
% Result : Unsatisfiable 115.60s 115.79s
% Output : Refutation 115.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 7
% Syntax : Number of clauses : 37 ( 37 unt; 0 nHn; 2 RR)
% Number of literals : 37 ( 36 equ; 1 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-4 aty)
% Number of variables : 93 ( 18 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(ifeq_axiom,axiom,
ifeq(X,X,Y,Z) = Y,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ifeq_axiom) ).
cnf(condensed_detachment,axiom,
ifeq(is_a_theorem(implies(X,Y)),true,ifeq(is_a_theorem(X),true,is_a_theorem(Y),true),true) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',condensed_detachment) ).
cnf(mv_1,axiom,
is_a_theorem(implies(X,implies(Y,X))) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mv_1) ).
cnf(mv_2,axiom,
is_a_theorem(implies(implies(X,Y),implies(implies(Y,Z),implies(X,Z)))) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mv_2) ).
cnf(mv_3,axiom,
is_a_theorem(implies(implies(implies(X,Y),Y),implies(implies(Y,X),X))) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mv_3) ).
cnf(mv_5,axiom,
is_a_theorem(implies(implies(not(X),not(Y)),implies(Y,X))) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mv_5) ).
cnf(prove_mv_33,negated_conjecture,
is_a_theorem(implies(implies(not(a),b),implies(not(b),a))) != true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_mv_33) ).
cnf(8,plain,
ifeq(is_a_theorem(X),true,is_a_theorem(implies(Y,X)),true) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[condensed_detachment,mv_1,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(9,plain,
ifeq(is_a_theorem(implies(not(X),not(Y))),true,is_a_theorem(implies(Y,X)),true) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[condensed_detachment,mv_5,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(10,plain,
ifeq(is_a_theorem(implies(implies(X,implies(Y,X)),Z)),true,is_a_theorem(Z),true) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[condensed_detachment,mv_1,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(12,plain,
ifeq(is_a_theorem(implies(implies(X,Y),Y)),true,is_a_theorem(implies(implies(Y,X),X)),true) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[condensed_detachment,mv_3,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(13,plain,
ifeq(is_a_theorem(implies(X,Y)),true,is_a_theorem(implies(implies(Y,Z),implies(X,Z))),true) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[condensed_detachment,mv_2,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(21,plain,
is_a_theorem(implies(X,implies(Y,implies(Z,Y)))) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[8,mv_1,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(23,plain,
is_a_theorem(implies(X,implies(implies(not(Y),not(Z)),implies(Z,Y)))) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[8,mv_5,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(30,plain,
is_a_theorem(implies(implies(implies(X,Y),Z),implies(Y,Z))) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[10,mv_2,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(32,plain,
ifeq(is_a_theorem(implies(implies(X,Y),Z)),true,is_a_theorem(implies(Y,Z)),true) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[condensed_detachment,30,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(48,plain,
is_a_theorem(implies(implies(implies(X,implies(Y,X)),Z),Z)) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[12,21,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(56,plain,
is_a_theorem(implies(implies(implies(X,Y),Z),implies(implies(not(Y),not(X)),Z))) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[13,mv_5,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(60,plain,
is_a_theorem(implies(implies(implies(implies(X,Y),implies(Z,Y)),U),implies(implies(Z,X),U))) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[13,mv_2,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(63,plain,
is_a_theorem(implies(implies(implies(implies(not(X),not(Y)),implies(Y,X)),Z),implies(U,Z))) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[13,23,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(66,plain,
is_a_theorem(implies(not(X),implies(X,Y))) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[32,mv_5,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(67,plain,
is_a_theorem(implies(X,implies(implies(X,Y),Y))) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[32,mv_3,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(76,plain,
is_a_theorem(implies(implies(implies(X,Y),Z),implies(not(X),Z))) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[13,66,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(83,plain,
ifeq(is_a_theorem(X),true,is_a_theorem(implies(implies(X,Y),Y)),true) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[condensed_detachment,67,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(123,plain,
ifeq(is_a_theorem(implies(implies(X,Y),Z)),true,is_a_theorem(implies(not(X),Z)),true) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[condensed_detachment,76,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(175,plain,
ifeq(is_a_theorem(implies(implies(X,Y),Z)),true,is_a_theorem(implies(implies(not(Y),not(X)),Z)),true) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[condensed_detachment,56,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(331,plain,
ifeq(is_a_theorem(implies(implies(implies(X,Y),implies(Z,Y)),U)),true,is_a_theorem(implies(implies(Z,X),U)),true) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[condensed_detachment,60,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(998,plain,
is_a_theorem(implies(implies(not(X),not(implies(Y,implies(Z,Y)))),X)) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[175,48,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(1074,plain,
is_a_theorem(implies(not(not(X)),X)) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[123,998,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(1086,plain,
is_a_theorem(implies(X,not(not(X)))) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[9,1074,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(1110,plain,
is_a_theorem(implies(implies(implies(X,not(not(X))),Y),Y)) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[83,1086,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(7645,plain,
is_a_theorem(implies(implies(X,Y),implies(X,not(not(Y))))) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[331,1110,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(7647,plain,
is_a_theorem(implies(implies(X,implies(not(Y),not(Z))),implies(U,implies(X,implies(Z,Y))))) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[331,63,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(8071,plain,
ifeq(is_a_theorem(implies(X,implies(not(Y),not(Z)))),true,is_a_theorem(implies(U,implies(X,implies(Z,Y)))),true) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[condensed_detachment,7647,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(76878,plain,
is_a_theorem(implies(X,implies(implies(not(Y),Z),implies(not(Z),Y)))) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[8071,7645,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(77136,plain,
is_a_theorem(implies(implies(not(X),Y),implies(not(Y),X))) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[10,76878,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(77137,plain,
$false,
inference('REWRITE',[status(thm)],[prove_mv_33,77136,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.10 % Problem : LCL113-10 : TPTP v8.1.0. Released v7.3.0.
% 0.02/0.11 % Command : run-snark %s %d
% 0.10/0.31 % Computer : n027.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 300
% 0.10/0.31 % WCLimit : 600
% 0.10/0.31 % DateTime : Mon Jul 4 11:06:41 EDT 2022
% 0.10/0.32 % CPUTime :
% 0.17/0.41 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.17/0.42 *
% 0.17/0.42 *
% 0.17/0.43 #<PACKAGE "SNARK-USER">
% 0.17/0.43 *
% 0.17/0.43 SNARK-TPTP-OPTIONS
% 0.17/0.43 *
% 0.17/0.43 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.17/0.43 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.17/0.43 (USE-FACTORING :POS)
% 0.17/0.43 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.17/0.43 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.17/0.43 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.17/0.43 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.17/0.43 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.17/0.43 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.17/0.43 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.17/0.43 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.17/0.43 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.17/0.43 (DECLARE-TPTP-SYMBOLS2))
% 0.17/0.43 *
% 0.17/0.43 "."
% 0.17/0.43 *
% 0.17/0.43 ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-07-04T11:06:41
% 0.17/0.43 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n027.cluster.edu at 2022-07-04T11:06:41
% 115.60/115.79
% 115.60/115.79
% 115.60/115.79 #||
% 115.60/115.79 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 115.60/115.79 % SZS output start Refutation
% See solution above
% 115.60/115.79 ||#
% 115.60/115.79
% 115.60/115.79 ; Summary of computation:
% 115.60/115.79 ; 750460 formulas have been input or derived (from 1765 formulas).
% 115.60/115.79 ; 77137 (10%) were retained. Of these,
% 115.60/115.79 ; 241 ( 0%) were simplified or subsumed later,
% 115.60/115.79 ; 76896 (100%) are still being kept.
% 115.60/115.79 ;
% 115.60/115.79 ; Run time in seconds excluding printing time:
% 115.60/115.79 ; 0.001 0% Read assertion file (1 call)
% 115.60/115.79 ; 0.001 0% Assert (7 calls)
% 115.60/115.79 ; 19.832 17% Process new row (348,939 calls)
% 115.60/115.79 ; 3.359 3% Resolution (3,528 calls)
% 115.60/115.79 ; 57.886 50% Paramodulation (1,764 calls)
% 115.60/115.79 ; 24.894 22% Forward simplification (348,934 calls)
% 115.60/115.79 ; 7.066 6% Backward simplification (77,137 calls)
% 115.60/115.79 ; 1.062 1% Ordering (1,103,510 calls)
% 115.60/115.79 ; 0.000 0% Sortal reasoning (32 calls)
% 115.60/115.79 ; 0.000 0% Purity testing (1 call)
% 115.60/115.79 ; 1.241 1% Other
% 115.60/115.79 ; 115.342 Total
% 115.60/115.79 ; 115.360 Real time
% 115.60/115.80 ;
% 115.60/115.80 ; Term-hash-array has 328,417 terms in all.
% 115.60/115.80 ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 115.60/115.80 ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 115.60/115.80 ; Path-index has 327,512 entries (327,523 at peak, 328,444 added, 932 deleted).
% 115.60/115.80 ; Path-index has 71,993 nodes (72,013 at peak, 72,108 added, 115 deleted).
% 115.60/115.80 ; Trie-index has 327,512 entries (327,523 at peak, 328,444 added, 932 deleted).
% 115.60/115.80 ; Trie-index has 957,973 nodes (958,003 at peak, 960,431 added, 2,458 deleted).
% 115.60/115.80 ; Retrieved 5,936,346 generalization terms in 1,108,889 calls.
% 115.60/115.80 ; Retrieved 462,740 instance terms in 77,136 calls.
% 115.60/115.80 ; Retrieved 20,592,363 unifiable terms in 18,790 calls.
% 115.60/115.80 ;
% 115.60/115.80 ; The agenda of rows to process has 199 entries:
% 115.60/115.80 ; 6 with value 34 20 with value 41 9 with value 47
% 115.60/115.80 ; 3 with value 35 11 with value 42 15 with value 48
% 115.60/115.80 ; 1 with value 36 19 with value 43 6 with value 49
% 115.60/115.80 ; 18 with value 37 11 with value 44 6 with value 50
% 115.60/115.80 ; 3 with value 38 19 with value 45 2 with value 51
% 115.60/115.80 ; 13 with value 39 16 with value 46 1 with value 53
% 115.60/115.80 ; 20 with value 40
% 115.60/115.80 ; The agenda of rows to give has 75144 entries:
% 115.60/115.80 ; 1 with value (4 29) 7635 with value (4 41) 242 with value (4 51)
% 115.60/115.80 ; 422 with value (4 32) 7847 with value (4 42) 167 with value (4 52)
% 115.60/115.80 ; 1283 with value (4 33) 7370 with value (4 43) 100 with value (4 53)
% 115.60/115.80 ; 2085 with value (4 34) 6859 with value (4 44) 2 with value (4 54)
% 115.60/115.80 ; 3072 with value (4 35) 4888 with value (4 45) 66 with value (4 55)
% 115.60/115.80 ; 4042 with value (4 36) 2634 with value (4 46) 68 with value (4 56)
% 115.60/115.80 ; 4626 with value (4 37) 1797 with value (4 47) 4 with value (4 57)
% 115.60/115.80 ; 5595 with value (4 38) 724 with value (4 48) 3 with value (4 59)
% 115.60/115.80 ; 5989 with value (4 39) 285 with value (4 49) 4 with value (4 60)
% 115.60/115.80 ; 7154 with value (4 40) 180 with value (4 50)
% 115.60/115.80 Evaluation took:
% 115.60/115.80 115.37 seconds of real time
% 115.60/115.80 110.624725 seconds of user run time
% 115.60/115.80 4.729771 seconds of system run time
% 115.60/115.80 [Run times include 38.987 seconds GC run time.]
% 115.60/115.80 0 calls to %EVAL
% 115.60/115.80 0 page faults and
% 115.60/115.80 4,558,277,000 bytes consed.
% 115.60/115.80 :PROOF-FOUND
% 115.60/115.80 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-07-04T11:08:36
% 115.60/115.80 :PROOF-FOUND
% 115.60/115.80 *
%------------------------------------------------------------------------------