TSTP Solution File: LCL096-10 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : LCL096-10 : TPTP v8.1.0. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n007.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:09 EDT 2022
% Result : Unsatisfiable 19.76s 19.97s
% Output : Refutation 19.76s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 6
% Syntax : Number of clauses : 33 ( 33 unt; 0 nHn; 2 RR)
% Number of literals : 33 ( 32 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 : 7 ( 7 usr; 4 con; 0-4 aty)
% Number of variables : 121 ( 1 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(equivalent(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(lg_2,axiom,
is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(X,Y),equivalent(X,Z)),equivalent(Y,Z)),U),U)) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lg_2) ).
cnf(lg_3,axiom,
is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(equivalent(X,Y),equivalent(X,Z)),U),equivalent(equivalent(Y,Z),U)),V),V)) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lg_3) ).
cnf(lg_4,axiom,
is_a_theorem(equivalent(equivalent(equivalent(equivalent(X,Y),Z),U),equivalent(equivalent(equivalent(X,V),Z),equivalent(equivalent(Y,V),U)))) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lg_4) ).
cnf(prove_lg_1,negated_conjecture,
is_a_theorem(equivalent(equivalent(equivalent(a,equivalent(equivalent(b,b),a)),c),c)) != true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_lg_1) ).
cnf(7,plain,
ifeq(is_a_theorem(equivalent(equivalent(equivalent(equivalent(X,Y),equivalent(X,Z)),equivalent(Y,Z)),U)),true,is_a_theorem(U),true) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[condensed_detachment,lg_2,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(10,plain,
ifeq(is_a_theorem(equivalent(equivalent(equivalent(X,Y),Z),U)),true,is_a_theorem(equivalent(equivalent(equivalent(X,V),Z),equivalent(equivalent(Y,V),U))),true) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[condensed_detachment,lg_4,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(13,plain,
ifeq(is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(X,Y),equivalent(X,Z)),U),equivalent(equivalent(Y,Z),U)),V)),true,is_a_theorem(V),true) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[condensed_detachment,lg_3,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(16,plain,
is_a_theorem(equivalent(equivalent(equivalent(X,Y),equivalent(X,Z)),equivalent(equivalent(U,Y),equivalent(U,Z)))) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[7,lg_4,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(20,plain,
ifeq(is_a_theorem(equivalent(equivalent(X,Y),equivalent(X,Z))),true,is_a_theorem(equivalent(equivalent(U,Y),equivalent(U,Z))),true) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[condensed_detachment,16,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(24,plain,
is_a_theorem(equivalent(equivalent(X,equivalent(Y,Z)),equivalent(X,equivalent(Y,Z)))) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[20,16,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(25,plain,
is_a_theorem(equivalent(equivalent(X,Y),equivalent(X,equivalent(equivalent(Z,Z),Y)))) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[20,lg_4,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(28,plain,
is_a_theorem(equivalent(equivalent(equivalent(X,Y),equivalent(X,Z)),equivalent(Y,Z))) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[7,24,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(35,plain,
ifeq(is_a_theorem(equivalent(equivalent(equivalent(X,Y),equivalent(X,equivalent(equivalent(Z,Z),Y))),U)),true,is_a_theorem(U),true) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[condensed_detachment,25,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(38,plain,
ifeq(is_a_theorem(equivalent(equivalent(X,Y),equivalent(X,Z))),true,is_a_theorem(equivalent(Y,Z)),true) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[condensed_detachment,28,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(143,plain,
is_a_theorem(equivalent(equivalent(equivalent(X,Y),equivalent(X,Z)),equivalent(equivalent(U,Y),equivalent(equivalent(V,U),equivalent(V,Z))))) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[10,16,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(144,plain,
is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(X,Y),equivalent(X,Z)),U),V),equivalent(equivalent(equivalent(Y,Z),U),V))) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[10,lg_2,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(150,plain,
is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(equivalent(X,Y),equivalent(X,Z)),U),V),W),equivalent(equivalent(equivalent(equivalent(Y,Z),U),V),W))) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[10,lg_3,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(158,plain,
is_a_theorem(equivalent(equivalent(X,Y),equivalent(equivalent(Z,X),equivalent(Z,Y)))) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[38,143,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(171,plain,
is_a_theorem(equivalent(equivalent(X,equivalent(equivalent(Y,Z),equivalent(Y,U))),equivalent(X,equivalent(Z,U)))) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[7,158,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(198,plain,
is_a_theorem(equivalent(equivalent(equivalent(X,Y),equivalent(equivalent(Z,X),U)),equivalent(equivalent(Z,Y),U))) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[7,144,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(213,plain,
is_a_theorem(equivalent(equivalent(X,equivalent(equivalent(Y,Y),Z)),equivalent(X,Z))) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[20,198,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(231,plain,
ifeq(is_a_theorem(equivalent(X,equivalent(equivalent(Y,Y),Z))),true,is_a_theorem(equivalent(X,Z)),true) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[condensed_detachment,213,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(261,plain,
is_a_theorem(equivalent(equivalent(equivalent(X,Y),equivalent(equivalent(Y,X),Z)),Z)) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[231,198,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(271,plain,
is_a_theorem(equivalent(equivalent(X,equivalent(equivalent(Y,Z),equivalent(equivalent(Z,Y),U))),equivalent(X,U))) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[20,261,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(932,plain,
ifeq(is_a_theorem(equivalent(X,equivalent(equivalent(Y,Z),equivalent(equivalent(Z,Y),U)))),true,is_a_theorem(equivalent(X,U)),true) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[condensed_detachment,271,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(2099,plain,
is_a_theorem(equivalent(equivalent(equivalent(equivalent(X,X),Y),Z),equivalent(Y,Z))) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[35,171,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(8885,plain,
is_a_theorem(equivalent(equivalent(equivalent(equivalent(X,Y),equivalent(equivalent(Z,X),U)),V),equivalent(equivalent(equivalent(Z,Y),U),V))) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[13,150,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(8951,plain,
ifeq(is_a_theorem(equivalent(equivalent(equivalent(X,Y),equivalent(equivalent(Z,X),U)),V)),true,is_a_theorem(equivalent(equivalent(equivalent(Z,Y),U),V)),true) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[condensed_detachment,8885,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(14344,plain,
is_a_theorem(equivalent(equivalent(equivalent(equivalent(X,X),equivalent(Y,Z)),equivalent(equivalent(Z,Y),U)),U)) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[932,2099,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(20377,plain,
is_a_theorem(equivalent(equivalent(equivalent(X,equivalent(equivalent(Y,Y),X)),Z),Z)) = true,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[8951,14344,theory(equality)]),ifeq_axiom,theory(equality)]) ).
cnf(20378,plain,
$false,
inference('REWRITE',[status(thm)],[prove_lg_1,20377,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : LCL096-10 : TPTP v8.1.0. Released v7.3.0.
% 0.06/0.13 % Command : run-snark %s %d
% 0.12/0.34 % Computer : n007.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Mon Jul 4 04:52:41 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.44 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.45 *
% 0.19/0.45 *
% 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-04T04:52:41
% 0.19/0.46 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n007.cluster.edu at 2022-07-04T04:52:41
% 19.76/19.97
% 19.76/19.97
% 19.76/19.97 #||
% 19.76/19.97 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 19.76/19.97 % SZS output start Refutation
% See solution above
% 19.76/19.97 ||#
% 19.76/19.97
% 19.76/19.97 ; Summary of computation:
% 19.76/19.97 ; 58622 formulas have been input or derived (from 438 formulas).
% 19.76/19.97 ; 20378 (35%) were retained. Of these,
% 19.76/19.97 ; 2360 (12%) were simplified or subsumed later,
% 19.76/19.97 ; 18018 (88%) are still being kept.
% 19.76/19.97 ;
% 19.76/19.97 ; Run time in seconds excluding printing time:
% 19.76/19.97 ; 0.001 0% Read assertion file (1 call)
% 19.76/19.97 ; 0.001 0% Assert (6 calls)
% 19.76/19.97 ; 4.729 24% Process new row (47,231 calls)
% 19.76/19.97 ; 0.208 1% Resolution (874 calls)
% 19.76/19.97 ; 5.847 30% Paramodulation (437 calls)
% 19.76/19.97 ; 4.337 22% Forward simplification (47,219 calls)
% 19.76/19.97 ; 4.033 21% Backward simplification (20,378 calls)
% 19.76/19.97 ; 0.133 1% Ordering (140,088 calls)
% 19.76/19.97 ; 0.000 0% Sortal reasoning (32 calls)
% 19.76/19.97 ; 0.000 0% Purity testing (1 call)
% 19.76/19.97 ; 0.220 1% Other
% 19.76/19.97 ; 19.509 Total
% 19.76/19.97 ; 19.513 Real time
% 19.76/19.98 ;
% 19.76/19.98 ; Term-hash-array has 85,786 terms in all.
% 19.76/19.98 ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 19.76/19.98 ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 19.76/19.98 ; Path-index has 81,048 entries (81,060 at peak, 85,794 added, 4,746 deleted).
% 19.76/19.98 ; Path-index has 6,217 nodes (6,259 at peak, 6,603 added, 386 deleted).
% 19.76/19.98 ; Trie-index has 81,048 entries (81,060 at peak, 85,794 added, 4,746 deleted).
% 19.76/19.98 ; Trie-index has 243,237 nodes (243,294 at peak, 278,538 added, 35,301 deleted).
% 19.76/19.98 ; Retrieved 1,625,754 generalization terms in 148,515 calls.
% 19.76/19.98 ; Retrieved 514,717 instance terms in 20,377 calls.
% 19.76/19.98 ; Retrieved 2,450,221 unifiable terms in 5,041 calls.
% 19.76/19.98 ;
% 19.76/19.98 ; The agenda of rows to process has 561 entries:
% 19.76/19.98 ; 5 with value 37 54 with value 44 19 with value 51
% 19.76/19.98 ; 23 with value 38 62 with value 45 4 with value 52
% 19.76/19.98 ; 15 with value 39 68 with value 46 3 with value 53
% 19.76/19.98 ; 16 with value 40 63 with value 47 13 with value 54
% 19.76/19.98 ; 17 with value 41 31 with value 48 14 with value 55
% 19.76/19.98 ; 34 with value 42 40 with value 49 7 with value 56
% 19.76/19.98 ; 25 with value 43 47 with value 50 1 with value 57
% 19.76/19.98 ; The agenda of rows to give has 17589 entries:
% 19.76/19.98 ; 1 with value (4 32) 976 with value (4 45) 1046 with value (4 55)
% 19.76/19.98 ; 34 with value (4 36) 1515 with value (4 46) 518 with value (4 56)
% 19.76/19.98 ; 202 with value (4 37) 1378 with value (4 47) 681 with value (4 57)
% 19.76/19.98 ; 296 with value (4 38) 819 with value (4 48) 422 with value (4 58)
% 19.76/19.98 ; 420 with value (4 39) 769 with value (4 49) 352 with value (4 59)
% 19.76/19.98 ; 522 with value (4 40) 951 with value (4 50) 53 with value (4 60)
% 19.76/19.98 ; 702 with value (4 41) 1125 with value (4 51) 9 with value (4 61)
% 19.76/19.98 ; 829 with value (4 42) 899 with value (4 52) 13 with value (4 62)
% 19.76/19.98 ; 707 with value (4 43) 688 with value (4 53) 4 with value (4 63)
% 19.76/19.98 ; 828 with value (4 44) 830 with value (4 54)
% 19.76/19.98 Evaluation took:
% 19.76/19.98 19.516 seconds of real time
% 19.76/19.98 18.63312 seconds of user run time
% 19.76/19.98 0.883064 seconds of system run time
% 19.76/19.98 [Run times include 3.908 seconds GC run time.]
% 19.76/19.98 0 calls to %EVAL
% 19.76/19.98 0 page faults and
% 19.76/19.98 1,080,756,576 bytes consed.
% 19.76/19.98 :PROOF-FOUND
% 19.76/19.98 ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-07-04T04:53:01
% 19.76/19.98 :PROOF-FOUND
% 19.76/19.98 *
%------------------------------------------------------------------------------