TSTP Solution File: LCL024-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : LCL024-1 : TPTP v3.4.2. Released v1.0.0.
% Transfm : add_equality:r
% Format : otter:hypothesis:set(auto),clear(print_given)
% Command : gandalf-wrapper -time %d %s
% Computer : art09.cs.miami.edu
% Model : i686 unknown
% CPU : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2793MHz
% Memory : 1000MB
% OS : Linux 2.4.22-21mdk-i686-up-4GB
% CPULimit : 600s
% Result : Unsatisfiable 80.1s
% Output : Assurance 80.1s
% Verified :
% SZS Type : None (Parsing solution fails)
% Syntax : Number of formulae : 0
% Comments :
%------------------------------------------------------------------------------
%----NO SOLUTION OUTPUT BY SYSTEM
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
%
% Gandalf c-2.6 r1 starting to prove: /home/graph/tptp/TSTP/PreparedTPTP/otter:hypothesis:set(auto),clear(print_given)---add_equality:r/LCL/LCL024-1+noeq.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: hne
% detected subclass: small
% detected subclass: short
%
% strategies selected:
% (hyper 29 #f 5 5)
% (binary-unit 11 #f 5 5)
% (binary-double 17 #f 5 5)
% (hyper 29 #f)
% (binary-unit 34 #f)
% (binary-weightorder 40 #f)
% (binary 17 #t)
% (binary-order 29 #f)
% (binary-posweight-order 111 #f 5 5)
% (binary-posweight-order 283 #f)
%
%
% **** EMPTY CLAUSE DERIVED ****
%
%
% timer checkpoints: c(3,40,0,6,0,0,9,50,0,12,0,0,17,50,0,20,0,0,25,50,0,28,0,0,41964,4,2185,42169,5,2904,42170,1,2907,42170,50,2911,42170,40,2911,42173,0,2911,42176,50,2911,42179,0,2915,42187,50,2915,42190,0,2915,42202,50,2915,42205,0,2916,46623,3,3427,47569,4,3680,48465,5,3917,48467,5,3917,48467,1,3917,48467,50,3918,48467,40,3918,48470,0,3923,100119,3,4776,110251,4,5206,113681,5,5624,113682,5,5625,113682,1,5625,113682,50,5628,113682,40,5628,113685,0,5628,169563,4,7806)
%
%
% START OF PROOF
% 113683 [] -is_a_theorem(equivalent(X,Y)) | -is_a_theorem(X) | is_a_theorem(Y).
% 113684 [] is_a_theorem(equivalent(X,equivalent(equivalent(Y,equivalent(Z,X)),equivalent(Z,Y)))).
% 113685 [] -is_a_theorem(equivalent(equivalent(equivalent(a,equivalent(b,c)),c),equivalent(b,a))).
% 113688 [hyper:113683,113684,113684] is_a_theorem(equivalent(equivalent(X,equivalent(Y,equivalent(Z,equivalent(equivalent(U,equivalent(V,Z)),equivalent(V,U))))),equivalent(Y,X))).
% 113693 [hyper:113683,113688,113684] is_a_theorem(equivalent(equivalent(equivalent(equivalent(X,equivalent(Y,Z)),equivalent(Y,X)),equivalent(Z,U)),U)).
% 113696 [hyper:113683,113688,113684] is_a_theorem(equivalent(equivalent(X,equivalent(Y,equivalent(equivalent(Z,equivalent(U,equivalent(V,equivalent(equivalent(W,equivalent(X1,V)),equivalent(X1,W))))),equivalent(U,Z)))),equivalent(Y,X))).
% 113701 [hyper:113683,113693,113693] is_a_theorem(equivalent(X,X)).
% 113718 [hyper:113683,113701,113684] is_a_theorem(equivalent(equivalent(X,equivalent(Y,equivalent(Z,Z))),equivalent(Y,X))).
% 113723 [hyper:113683,113718,113684] is_a_theorem(equivalent(equivalent(X,equivalent(X,Y)),Y)).
% 113727 [hyper:113683,113718,113701] is_a_theorem(equivalent(X,equivalent(X,equivalent(Y,Y)))).
% 113730 [hyper:113683,113718,113684] is_a_theorem(equivalent(equivalent(X,equivalent(Y,equivalent(equivalent(Z,equivalent(U,equivalent(V,V))),equivalent(U,Z)))),equivalent(Y,X))).
% 113738 [hyper:113683,113723,113684] is_a_theorem(equivalent(equivalent(X,equivalent(Y,equivalent(equivalent(Z,equivalent(Z,U)),U))),equivalent(Y,X))).
% 113741 [hyper:113683,113723,113718] is_a_theorem(equivalent(X,equivalent(Y,equivalent(Y,equivalent(X,equivalent(Z,Z)))))).
% 113752 [hyper:113683,113727,113684] is_a_theorem(equivalent(equivalent(X,equivalent(Y,equivalent(Z,equivalent(Z,equivalent(U,U))))),equivalent(Y,X))).
% 113762 [hyper:113683,113696,113684] is_a_theorem(equivalent(equivalent(equivalent(X,Y),equivalent(equivalent(Y,equivalent(X,equivalent(Z,equivalent(equivalent(U,equivalent(V,Z)),equivalent(V,U))))),W)),W)).
% 113812 [hyper:113683,113741,113688] is_a_theorem(equivalent(X,equivalent(Y,equivalent(Y,X)))).
% 113832 [hyper:113683,113812,113684] is_a_theorem(equivalent(equivalent(X,equivalent(Y,equivalent(Z,equivalent(U,equivalent(U,Z))))),equivalent(Y,X))).
% 114331 [hyper:113683,113738,113723] is_a_theorem(equivalent(X,equivalent(Y,equivalent(Y,equivalent(X,equivalent(equivalent(Z,equivalent(Z,U)),U)))))).
% 114535 [hyper:113683,113752,113723] is_a_theorem(equivalent(X,equivalent(Y,equivalent(Y,equivalent(X,equivalent(Z,equivalent(Z,equivalent(U,U)))))))).
% 115451 [hyper:113683,113832,113684] is_a_theorem(equivalent(equivalent(equivalent(X,equivalent(X,Y)),equivalent(Y,Z)),Z)).
% 120507 [hyper:113683,114331,113688] is_a_theorem(equivalent(X,equivalent(Y,equivalent(equivalent(Z,equivalent(Z,Y)),X)))).
% 120735 [hyper:113683,120507,115451] is_a_theorem(equivalent(equivalent(X,equivalent(X,Y)),equivalent(Z,equivalent(Z,Y)))).
% 121301 [hyper:113683,120735,113730] is_a_theorem(equivalent(equivalent(X,equivalent(Y,equivalent(Z,Z))),equivalent(U,equivalent(U,equivalent(Y,X))))).
% 124780 [hyper:113683,114535,113688] is_a_theorem(equivalent(X,equivalent(equivalent(Y,equivalent(Z,Z)),equivalent(Y,X)))).
% 125064 [hyper:113683,124780,113762] is_a_theorem(equivalent(X,equivalent(equivalent(Y,equivalent(equivalent(Z,equivalent(U,Y)),equivalent(U,Z))),X))).
% 151219 [hyper:113683,121301,113688] is_a_theorem(equivalent(X,equivalent(equivalent(Y,Z),equivalent(equivalent(Z,equivalent(Y,X)),equivalent(U,U))))).
% 163873 [hyper:113683,125064,113684] is_a_theorem(equivalent(equivalent(X,equivalent(Y,equivalent(Z,equivalent(equivalent(U,equivalent(equivalent(V,equivalent(W,U)),equivalent(W,V))),Z)))),equivalent(Y,X))).
% 169564 [binary:113683.3,113685] -is_a_theorem(equivalent(X,equivalent(equivalent(equivalent(a,equivalent(b,c)),c),equivalent(b,a)))) | -is_a_theorem(X).
% 169616 [binary:163873,169564,slowcut:151219] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% not using sos strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% seconds given: 29
%
%
% old unit clauses discarded
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 1798
% derived clauses: 761156
% kept clauses: 154152
% kept size sum: 0
% kept mid-nuclei: 7116
% kept new demods: 0
% forw unit-subs: 313779
% forw double-subs: 71741
% forw overdouble-subs: 28019
% backward subs: 269
% fast unit cutoff: 2048
% full unit cutoff: 5
% dbl unit cutoff: 4
% real runtime : 80.20
% process. runtime: 80.17
% specific non-discr-tree subsumption statistics:
% tried: 175632
% length fails: 13288
% strength fails: 6027
% predlist fails: 48996
% aux str. fails: 3081
% by-lit fails: 569
% full subs tried: 100684
% full subs fail: 72665
%
% ; program args: ("/home/graph/tptp/Systems/Gandalf---c-2.6/gandalf" "-time" "600" "/home/graph/tptp/TSTP/PreparedTPTP/otter:hypothesis:set(auto),clear(print_given)---add_equality:r/LCL/LCL024-1+noeq.in")
%
%------------------------------------------------------------------------------