TSTP Solution File: LCL026-10 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : LCL026-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:19:38 EDT 2022
% Result : Unsatisfiable 6.01s 6.18s
% Output : Refutation 6.01s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 6
% Syntax : Number of clauses : 36 ( 36 unt; 0 nHn; 2 RR)
% Number of literals : 36 ( 35 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; 4 con; 0-4 aty)
% Number of variables : 82 ( 21 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(ifeq_axiom,axiom,
ifeq(X,X,Y,Z) = Y,
file('/export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p',condensed_detachment) ).
cnf(c0_2,axiom,
is_a_theorem(implies(X,implies(Y,X))) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c0_2) ).
cnf(c0_5,axiom,
is_a_theorem(implies(implies(implies(X,falsehood),falsehood),X)) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c0_5) ).
cnf(c0_6,axiom,
is_a_theorem(implies(implies(X,implies(Y,Z)),implies(implies(X,Y),implies(X,Z)))) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c0_6) ).
cnf(prove_c0_3,negated_conjecture,
is_a_theorem(implies(implies(implies(a,b),a),a)) != true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_c0_3) ).
cnf(7,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,c0_2,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(9,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,c0_2,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(13,plain,
ifeq(is_a_theorem(implies(X,implies(Y,Z))),true,is_a_theorem(implies(implies(X,Y),implies(X,Z))),true) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[condensed_detachment,c0_6,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(17,plain,
is_a_theorem(implies(X,implies(Y,implies(Z,Y)))) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[7,c0_2,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(18,plain,
is_a_theorem(implies(X,implies(implies(implies(Y,falsehood),falsehood),Y))) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[7,c0_5,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(19,plain,
is_a_theorem(implies(X,implies(implies(Y,implies(Z,U)),implies(implies(Y,Z),implies(Y,U))))) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[7,c0_6,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(21,plain,
ifeq(is_a_theorem(implies(implies(X,implies(Y,implies(Z,Y))),U)),true,is_a_theorem(U),true) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[condensed_detachment,17,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(34,plain,
is_a_theorem(implies(implies(X,Y),implies(X,X))) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[9,c0_6,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(35,plain,
is_a_theorem(implies(X,X)) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[9,34,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(40,plain,
ifeq(is_a_theorem(implies(implies(X,X),Y)),true,is_a_theorem(Y),true) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[condensed_detachment,35,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(45,plain,
is_a_theorem(implies(implies(implies(X,Y),X),implies(implies(X,Y),Y))) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[40,c0_6,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(55,plain,
is_a_theorem(implies(implies(X,implies(implies(Y,falsehood),falsehood)),implies(X,Y))) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[13,18,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(70,plain,
is_a_theorem(implies(falsehood,X)) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[9,55,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(72,plain,
ifeq(is_a_theorem(implies(X,implies(implies(Y,falsehood),falsehood))),true,is_a_theorem(implies(X,Y)),true) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[condensed_detachment,55,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(77,plain,
is_a_theorem(implies(X,implies(falsehood,Y))) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[7,70,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(79,plain,
is_a_theorem(implies(implies(X,falsehood),implies(X,Y))) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[13,77,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(86,plain,
ifeq(is_a_theorem(implies(implies(implies(X,falsehood),implies(X,Y)),Z)),true,is_a_theorem(Z),true) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[condensed_detachment,79,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(160,plain,
is_a_theorem(implies(implies(X,implies(Y,implies(Z,U))),implies(X,implies(implies(Y,Z),implies(Y,U))))) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[13,19,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(215,plain,
is_a_theorem(implies(implies(implies(X,falsehood),X),X)) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[72,45,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(222,plain,
is_a_theorem(implies(X,implies(implies(implies(Y,falsehood),Y),Y))) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[7,215,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(240,plain,
is_a_theorem(implies(implies(X,implies(implies(Y,falsehood),Y)),implies(X,Y))) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[13,222,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(504,plain,
ifeq(is_a_theorem(implies(X,implies(implies(Y,falsehood),Y))),true,is_a_theorem(implies(X,Y)),true) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[condensed_detachment,240,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(692,plain,
is_a_theorem(implies(implies(X,Y),implies(implies(Z,X),implies(Z,Y)))) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[9,160,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(705,plain,
is_a_theorem(implies(implies(implies(X,Y),implies(Z,X)),implies(implies(X,Y),implies(Z,Y)))) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[13,692,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(761,plain,
is_a_theorem(implies(implies(implies(X,Y),Z),implies(Y,Z))) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[21,705,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(773,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,761,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(802,plain,
is_a_theorem(implies(implies(X,Y),implies(implies(Y,Z),implies(X,Z)))) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[773,705,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(1557,plain,
is_a_theorem(implies(implies(implies(X,Y),Z),implies(implies(X,falsehood),Z))) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[86,802,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(7248,plain,
is_a_theorem(implies(implies(implies(X,Y),X),X)) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[504,1557,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(7249,plain,
$false,
inference('REWRITE',[status(thm)],[prove_c0_3,7248,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LCL026-10 : TPTP v8.1.0. Released v7.3.0.
% 0.03/0.13 % Command : run-snark %s %d
% 0.13/0.34 % Computer : n021.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 13:45:32 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.45 /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p 2022-07-04T13:45:32
% 0.20/0.47 ; 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-04T13:45:32
% 6.01/6.18
% 6.01/6.18
% 6.01/6.18 #||
% 6.01/6.18 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 6.01/6.18 % SZS output start Refutation
% See solution above
% 6.01/6.20 ||#
% 6.01/6.20
% 6.01/6.20 ; Summary of computation:
% 6.01/6.20 ; 101116 formulas have been input or derived (from 515 formulas).
% 6.01/6.20 ; 7249 ( 7%) were retained. Of these,
% 6.01/6.20 ; 227 ( 3%) were simplified or subsumed later,
% 6.01/6.20 ; 7022 (97%) are still being kept.
% 6.01/6.20 ;
% 6.01/6.20 ; Run time in seconds excluding printing time:
% 6.01/6.20 ; 0.002 0% Read assertion file (1 call)
% 6.01/6.20 ; 0.000 0% Assert (6 calls)
% 6.01/6.20 ; 1.006 18% Process new row (46,329 calls)
% 6.01/6.20 ; 0.122 2% Resolution (1,028 calls)
% 6.01/6.20 ; 2.471 43% Paramodulation (514 calls)
% 6.01/6.20 ; 1.450 25% Forward simplification (46,317 calls)
% 6.01/6.20 ; 0.338 6% Backward simplification (7,249 calls)
% 6.01/6.20 ; 0.138 2% Ordering (141,227 calls)
% 6.01/6.20 ; 0.000 0% Sortal reasoning (32 calls)
% 6.01/6.20 ; 0.000 0% Purity testing (1 call)
% 6.01/6.20 ; 0.182 3% Other
% 6.01/6.20 ; 5.709 Total
% 6.01/6.20 ; 5.731 Real time
% 6.01/6.20 ;
% 6.01/6.20 ; Term-hash-array has 33,024 terms in all.
% 6.01/6.20 ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 6.01/6.20 ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 6.01/6.20 ; Path-index has 32,180 entries (32,189 at peak, 33,053 added, 873 deleted).
% 6.01/6.20 ; Path-index has 4,759 nodes (4,777 at peak, 4,890 added, 131 deleted).
% 6.01/6.20 ; Trie-index has 32,180 entries (32,189 at peak, 33,053 added, 873 deleted).
% 6.01/6.20 ; Trie-index has 74,104 nodes (74,126 at peak, 76,484 added, 2,380 deleted).
% 6.01/6.20 ; Retrieved 574,057 generalization terms in 143,146 calls.
% 6.01/6.20 ; Retrieved 54,542 instance terms in 7,248 calls.
% 6.01/6.20 ; Retrieved 984,960 unifiable terms in 5,130 calls.
% 6.01/6.20 ;
% 6.01/6.20 ; The agenda of rows to process has 653 entries:
% 6.01/6.20 ; 21 with value 30 35 with value 40 34 with value 50
% 6.01/6.20 ; 7 with value 31 41 with value 41 29 with value 51
% 6.01/6.20 ; 17 with value 32 31 with value 42 4 with value 52
% 6.01/6.20 ; 31 with value 33 34 with value 43 20 with value 53
% 6.01/6.20 ; 21 with value 34 30 with value 44 16 with value 54
% 6.01/6.20 ; 39 with value 35 25 with value 45 13 with value 55
% 6.01/6.20 ; 28 with value 36 25 with value 46 1 with value 56
% 6.01/6.20 ; 40 with value 37 15 with value 47 4 with value 57
% 6.01/6.20 ; 15 with value 38 13 with value 48 5 with value 58
% 6.01/6.20 ; 23 with value 39 32 with value 49 4 with value 59
% 6.01/6.20 ; The agenda of rows to give has 6563 entries:
% 6.01/6.20 ; 1 with value (4 25) 736 with value (4 40) 11 with value (4 48)
% 6.01/6.20 ; 146 with value (4 32) 741 with value (4 41) 7 with value (4 49)
% 6.01/6.20 ; 294 with value (4 33) 380 with value (4 42) 3 with value (4 50)
% 6.01/6.20 ; 413 with value (4 34) 267 with value (4 43) 8 with value (4 51)
% 6.01/6.20 ; 518 with value (4 35) 279 with value (4 44) 8 with value (4 52)
% 6.01/6.20 ; 533 with value (4 36) 87 with value (4 45) 4 with value (4 53)
% 6.01/6.20 ; 709 with value (4 37) 39 with value (4 46) 3 with value (4 54)
% 6.01/6.20 ; 799 with value (4 38) 17 with value (4 47) 2 with value (4 55)
% 6.01/6.20 ; 558 with value (4 39)
% 6.01/6.20 Evaluation took:
% 6.01/6.20 5.732 seconds of real time
% 6.01/6.20 5.286325 seconds of user run time
% 6.01/6.20 0.445852 seconds of system run time
% 6.01/6.20 [Run times include 0.773 seconds GC run time.]
% 6.01/6.20 0 calls to %EVAL
% 6.01/6.20 0 page faults and
% 6.01/6.20 404,247,464 bytes consed.
% 6.01/6.20 :PROOF-FOUND
% 6.01/6.20 ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-07-04T13:45:37
% 6.01/6.20 :PROOF-FOUND
% 6.01/6.20 *
%------------------------------------------------------------------------------