TSTP Solution File: LCL375-1 by Gandalf---c-2.6

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : LCL375-1 : TPTP v3.4.2. Released v2.3.0.
% Transfm  : add_equality:r
% Format   : otter:hypothesis:set(auto),clear(print_given)
% Command  : gandalf-wrapper -time %d %s

% Computer : art01.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 239.6s
% Output   : Assurance 239.6s
% 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/LCL375-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(5,40,0,10,0,0,15772,4,2177,15772,50,2180,15772,40,2180,15777,0,2180,25387,3,2740,27774,4,3007,28194,5,3281,28195,5,3281,28195,1,3281,28195,50,3282,28195,40,3282,28200,0,3282,68704,3,4135,81267,4,4566,86120,5,4983,86120,5,4984,86120,1,4984,86120,50,4987,86120,40,4987,86125,0,4987,132623,4,7164,132906,5,7889,132907,1,7891,132907,50,7896,132907,40,7896,132912,0,7896,155248,3,9598,163043,4,10456,168188,5,11297,168189,5,11299,168189,1,11299,168189,50,11302,168189,40,11302,168194,0,11302,202774,3,13350,209055,4,14303,243219,5,15303,243221,5,15303,243222,1,15303,243222,50,15305,243222,40,15305,243227,0,15305,256076,5,17046,256082,1,17048,256082,50,17049,256082,40,17049,256087,0,17049,301499,3,18562,307876,4,19242,319807,5,19950,319808,5,19951,319808,1,19951,319808,50,19953,319808,40,19953,319813,0,19953)
% 
% 
% START OF PROOF
% 319809 [] -is_a_theorem(implies(X,Y)) | -is_a_theorem(X) | is_a_theorem(Y).
% 319810 [] is_a_theorem(implies(implies(X,Y),implies(implies(Y,Z),implies(X,Z)))).
% 319811 [] is_a_theorem(implies(implies(not(X),X),X)).
% 319812 [] is_a_theorem(implies(X,implies(not(X),Y))).
% 319813 [] -is_a_theorem(implies(implies(implies(x,y),z),implies(implies(x,u),implies(implies(u,z),z)))).
% 319816 [binary:319812,319809] is_a_theorem(implies(not(X),Y)) | -is_a_theorem(X).
% 319819 [binary:319809,319810] is_a_theorem(implies(implies(X,Y),implies(Z,Y))) | -is_a_theorem(implies(Z,X)).
% 319821 [binary:319811,319819.2] is_a_theorem(implies(implies(X,Y),implies(implies(not(X),X),Y))).
% 319822 [binary:319812,319819.2] is_a_theorem(implies(implies(implies(not(X),Y),Z),implies(X,Z))).
% 319823 [binary:319810,319819.2] is_a_theorem(implies(implies(implies(implies(X,Y),implies(Z,Y)),U),implies(implies(Z,X),U))).
% 319824 [binary:319809,319821] is_a_theorem(implies(implies(not(X),X),Y)) | -is_a_theorem(implies(X,Y)).
% 319825 [binary:319809,319822] -is_a_theorem(implies(implies(not(X),Y),Z)) | is_a_theorem(implies(X,Z)).
% 319827 [binary:319812,319824.2] is_a_theorem(implies(implies(not(X),X),implies(not(X),Y))).
% 319830 [binary:319809,319823] -is_a_theorem(implies(implies(implies(X,Y),implies(Z,Y)),U)) | is_a_theorem(implies(implies(Z,X),U)).
% 319832 [binary:319819.2,319827] is_a_theorem(implies(implies(implies(not(X),Y),Z),implies(implies(not(X),X),Z))).
% 319835 [binary:319811,319825] is_a_theorem(implies(X,X)).
% 319848 [binary:319809,319832] -is_a_theorem(implies(implies(not(X),Y),Z)) | is_a_theorem(implies(implies(not(X),X),Z)).
% 319854 [binary:319822,319830] is_a_theorem(implies(implies(X,not(Y)),implies(Y,implies(X,Z)))).
% 319855 [binary:319823,319830] is_a_theorem(implies(implies(X,implies(Y,Z)),implies(implies(U,Y),implies(X,implies(U,Z))))).
% 319859 [binary:319819.2,319854] is_a_theorem(implies(implies(implies(X,implies(Y,Z)),U),implies(implies(Y,not(X)),U))).
% 319861 [binary:319848,319854] is_a_theorem(implies(implies(not(X),X),implies(Y,implies(not(X),Z)))).
% 319865 [binary:319809,319861] is_a_theorem(implies(X,implies(not(Y),Z))) | -is_a_theorem(implies(not(Y),Y)).
% 319870 [binary:319809,319859] -is_a_theorem(implies(implies(X,implies(Y,Z)),U)) | is_a_theorem(implies(implies(Y,not(X)),U)).
% 319871 [binary:319830,319859] is_a_theorem(implies(implies(X,Y),implies(implies(Z,not(Y)),implies(X,implies(Z,U))))).
% 319876 [binary:319809,319871] is_a_theorem(implies(implies(X,not(Y)),implies(Z,implies(X,U)))) | -is_a_theorem(implies(Z,Y)).
% 319881 [binary:319809,319855] is_a_theorem(implies(implies(X,Y),implies(Z,implies(X,U)))) | -is_a_theorem(implies(Z,implies(Y,U))).
% 319895 [binary:319821,319881.2] is_a_theorem(implies(implies(X,implies(not(Y),Y)),implies(implies(Y,Z),implies(X,Z)))).
% 319898 [binary:319809,319895] -is_a_theorem(implies(X,implies(not(Y),Y))) | is_a_theorem(implies(implies(Y,Z),implies(X,Z))).
% 319899 [binary:319809,319895,binarydemod:319816,319865] is_a_theorem(implies(implies(X,Y),implies(Z,Y))) | -is_a_theorem(X).
% 319903 [binary:319835,319899.2] is_a_theorem(implies(implies(implies(X,X),Y),implies(Z,Y))).
% 319904 [binary:319809,319903] -is_a_theorem(implies(implies(X,X),Y)) | is_a_theorem(implies(Z,Y)).
% 319907 [binary:319876.2,319903] is_a_theorem(implies(implies(X,not(implies(Y,Z))),implies(implies(implies(U,U),Z),implies(X,V)))).
% 319912 [binary:319821,319904] is_a_theorem(implies(X,implies(implies(not(Y),Y),Y))).
% 319922 [binary:319881.2,319912] is_a_theorem(implies(implies(X,implies(not(Y),Y)),implies(Z,implies(X,Y)))).
% 319944 [binary:319809,319922] -is_a_theorem(implies(X,implies(not(Y),Y))) | is_a_theorem(implies(Z,implies(X,Y))).
% 319946 [binary:319830,319922] is_a_theorem(implies(implies(not(X),Y),implies(Z,implies(implies(Y,X),X)))).
% 319947 [binary:319870,319922] is_a_theorem(implies(implies(not(X),not(Y)),implies(Z,implies(Y,X)))).
% 319954 [binary:319819.2,319947] is_a_theorem(implies(implies(implies(X,implies(Y,Z)),U),implies(implies(not(Z),not(Y)),U))).
% 319955 [binary:319825,319947] is_a_theorem(implies(X,implies(Y,implies(Z,X)))).
% 319969 [binary:319955,319898] is_a_theorem(implies(implies(implies(X,Y),Z),implies(Y,Z))).
% 319971 [binary:319809,319969] -is_a_theorem(implies(implies(X,Y),Z)) | is_a_theorem(implies(Y,Z)).
% 320010 [binary:319947,319971] is_a_theorem(implies(not(X),implies(Y,implies(X,Z)))).
% 320028 [binary:319898,320010] is_a_theorem(implies(implies(implies(X,Y),Z),implies(not(X),Z))).
% 320047 [binary:319809,320028] -is_a_theorem(implies(implies(X,Y),Z)) | is_a_theorem(implies(not(X),Z)).
% 320049 [binary:319830,320028] is_a_theorem(implies(implies(X,Y),implies(not(Y),implies(X,Z)))).
% 320150 [binary:319809,320049] is_a_theorem(implies(not(X),implies(Y,Z))) | -is_a_theorem(implies(Y,X)).
% 320276 [binary:319903,319944] is_a_theorem(implies(X,implies(implies(implies(Y,Y),Z),Z))).
% 320278 [binary:320028,319944] is_a_theorem(implies(X,implies(implies(implies(Y,Z),Y),Y))).
% 320284 [binary:319971,319946] is_a_theorem(implies(X,implies(Y,implies(implies(X,Z),Z)))).
% 320302 [?] ?
% 320309 [binary:319809,320276,slowcut:320302] is_a_theorem(implies(implies(implies(X,X),Y),Y)).
% 320312 [binary:319809,320309] -is_a_theorem(implies(implies(X,X),Y)) | is_a_theorem(Y).
% 320321 [binary:319907,320312] is_a_theorem(implies(implies(implies(X,X),Y),implies(not(implies(Z,Y)),U))).
% 320323 [binary:319809,320278,slowcut:320321] is_a_theorem(implies(implies(implies(X,Y),X),X)).
% 320328 [binary:319809,320323] -is_a_theorem(implies(implies(X,Y),X)) | is_a_theorem(X).
% 320329 [binary:319830,320323] is_a_theorem(implies(implies(X,implies(X,Y)),implies(X,Y))).
% 320358 [binary:320328,319954] is_a_theorem(implies(implies(not(X),not(Y)),implies(Y,X))).
% 320361 [binary:319898,320284] is_a_theorem(implies(implies(implies(implies(X,Y),Y),Z),implies(X,Z))).
% 320364 [binary:319944,320284] is_a_theorem(implies(X,implies(Y,implies(implies(Y,Z),Z)))).
% 320372 [binary:319809,320329] -is_a_theorem(implies(X,implies(X,Y))) | is_a_theorem(implies(X,Y)).
% 320388 [binary:320150.2,320358] is_a_theorem(implies(not(implies(X,Y)),implies(implies(not(Y),not(X)),Z))).
% 320392 [binary:319809,320364,slowcut:320388] is_a_theorem(implies(X,implies(implies(X,Y),Y))).
% 320395 [binary:319881.2,320392] is_a_theorem(implies(implies(X,implies(Y,Z)),implies(Y,implies(X,Z)))).
% 320408 [binary:319946,320372] is_a_theorem(implies(implies(not(X),Y),implies(implies(Y,X),X))).
% 320946 [binary:319809,320361] -is_a_theorem(implies(implies(implies(X,Y),Y),Z)) | is_a_theorem(implies(X,Z)).
% 320958 [binary:319809,320395] -is_a_theorem(implies(X,implies(Y,Z))) | is_a_theorem(implies(Y,implies(X,Z))).
% 321441 [binary:319823,320946] is_a_theorem(implies(implies(X,Y),implies(implies(Z,X),implies(Z,Y)))).
% 321885 [binary:319809,321441] is_a_theorem(implies(implies(X,Y),implies(X,Z))) | -is_a_theorem(implies(Y,Z)).
% 322161 [binary:320323,321885.2] is_a_theorem(implies(implies(X,implies(implies(Y,Z),Y)),implies(X,Y))).
% 322175 [binary:320408,321885.2] is_a_theorem(implies(implies(X,implies(not(Y),Z)),implies(X,implies(implies(Z,Y),Y)))).
% 322458 [binary:319830,322161] is_a_theorem(implies(implies(implies(X,Y),Z),implies(implies(Z,X),X))).
% 322582 [binary:320958,322458] is_a_theorem(implies(implies(X,Y),implies(implies(implies(Y,Z),X),Y))).
% 322678 [binary:320047,322582] is_a_theorem(implies(not(X),implies(implies(implies(Y,Z),X),Y))).
% 322691 [binary:320958,322678] is_a_theorem(implies(implies(implies(X,Y),Z),implies(not(Z),X))).
% 322694 [binary:319819.2,322691] is_a_theorem(implies(implies(implies(not(X),Y),Z),implies(implies(implies(Y,U),X),Z))).
% 335358 [binary:319830,322175] is_a_theorem(implies(implies(not(X),Y),implies(implies(Y,Z),implies(implies(Z,X),X)))).
% 335759 [binary:319809,322694] is_a_theorem(implies(implies(implies(X,Y),Z),U)) | -is_a_theorem(implies(implies(not(Z),X),U)).
% 343240 [binary:335358,335759.2,slowcut:319813] contradiction
% END OF PROOF
% 
% Proof found by the following strategy:
% 
% using binary resolution
% using first neg lit preferred strategy
% not using sos strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% using clause demodulation
% clause length limited to 5
% clause depth limited to 5
% seconds given: 111
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    15967
%  derived clauses:   4598948
%  kept clauses:      246421
%  kept size sum:     357261
%  kept mid-nuclei:   58469
%  kept new demods:   0
%  forw unit-subs:    1102576
%  forw double-subs: 216129
%  forw overdouble-subs: 55075
%  backward subs:     903
%  fast unit cutoff:  6457
%  full unit cutoff:  7891
%  dbl  unit cutoff:  2417
%  real runtime  :  248.28
%  process. runtime:  247.61
% specific non-discr-tree subsumption statistics: 
%  tried:           18811822
%  length fails:    2104562
%  strength fails:  2833690
%  predlist fails:  2365228
%  aux str. fails:  1071382
%  by-lit fails:    314632
%  full subs tried: 9893285
%  full subs fail:  9831459
% 
% ; 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/LCL375-1+noeq.in")
% 
%------------------------------------------------------------------------------