TSTP Solution File: LCL377-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : LCL377-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 : art04.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 258.7s
% Output : Assurance 258.7s
% 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/LCL377-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,15741,4,2177,15741,50,2180,15741,40,2180,15746,0,2180,28047,3,2731,31159,4,3006,31767,5,3282,31767,5,3282,31767,1,3282,31767,50,3284,31767,40,3284,31772,0,3284,70840,3,4143,81553,4,4561,85908,5,4985,85909,5,4986,85911,1,4986,85911,50,4990,85911,40,4990,85916,0,4990,131413,4,7177,131709,5,7891,131710,1,7893,131710,50,7897,131710,40,7897,131715,0,7897,152985,3,9599,160584,4,10451,166749,5,11298,166749,5,11298,166750,1,11298,166750,50,11301,166750,40,11301,166755,0,11301,203444,3,13351,209435,4,14341,242469,5,15302,242471,5,15302,242471,1,15302,242471,50,15304,242471,40,15304,242476,0,15304,261123,3,16155,265537,4,16580,275972,5,17005,275974,5,17005,275975,1,17005,275975,50,17006,275975,40,17006,275980,0,17006,319592,3,18496,326918,4,19182,340744,5,19907,340744,5,19908,340744,1,19908,340744,50,19910,340744,40,19910,340749,0,19910,364790,3,25462)
%
%
% START OF PROOF
% 340745 [] -is_a_theorem(implies(X,Y)) | -is_a_theorem(X) | is_a_theorem(Y).
% 340746 [] is_a_theorem(implies(implies(X,Y),implies(implies(Y,Z),implies(X,Z)))).
% 340747 [] is_a_theorem(implies(implies(not(X),X),X)).
% 340748 [] is_a_theorem(implies(X,implies(not(X),Y))).
% 340749 [] -is_a_theorem(implies(implies(x,implies(y,implies(z,u))),implies(implies(z,x),implies(y,implies(z,u))))).
% 340752 [binary:340748,340745] is_a_theorem(implies(not(X),Y)) | -is_a_theorem(X).
% 340755 [binary:340745,340746] is_a_theorem(implies(implies(X,Y),implies(Z,Y))) | -is_a_theorem(implies(Z,X)).
% 340757 [binary:340747,340755.2] is_a_theorem(implies(implies(X,Y),implies(implies(not(X),X),Y))).
% 340758 [binary:340748,340755.2] is_a_theorem(implies(implies(implies(not(X),Y),Z),implies(X,Z))).
% 340759 [binary:340746,340755.2] is_a_theorem(implies(implies(implies(implies(X,Y),implies(Z,Y)),U),implies(implies(Z,X),U))).
% 340760 [binary:340745,340757] is_a_theorem(implies(implies(not(X),X),Y)) | -is_a_theorem(implies(X,Y)).
% 340761 [binary:340745,340758] -is_a_theorem(implies(implies(not(X),Y),Z)) | is_a_theorem(implies(X,Z)).
% 340763 [binary:340748,340760.2] is_a_theorem(implies(implies(not(X),X),implies(not(X),Y))).
% 340766 [binary:340745,340759] -is_a_theorem(implies(implies(implies(X,Y),implies(Z,Y)),U)) | is_a_theorem(implies(implies(Z,X),U)).
% 340768 [binary:340755.2,340763] is_a_theorem(implies(implies(implies(not(X),Y),Z),implies(implies(not(X),X),Z))).
% 340771 [binary:340747,340761] is_a_theorem(implies(X,X)).
% 340784 [binary:340745,340768] -is_a_theorem(implies(implies(not(X),Y),Z)) | is_a_theorem(implies(implies(not(X),X),Z)).
% 340790 [binary:340758,340766] is_a_theorem(implies(implies(X,not(Y)),implies(Y,implies(X,Z)))).
% 340791 [binary:340759,340766] is_a_theorem(implies(implies(X,implies(Y,Z)),implies(implies(U,Y),implies(X,implies(U,Z))))).
% 340795 [binary:340755.2,340790] is_a_theorem(implies(implies(implies(X,implies(Y,Z)),U),implies(implies(Y,not(X)),U))).
% 340797 [binary:340784,340790] is_a_theorem(implies(implies(not(X),X),implies(Y,implies(not(X),Z)))).
% 340801 [binary:340745,340797] is_a_theorem(implies(X,implies(not(Y),Z))) | -is_a_theorem(implies(not(Y),Y)).
% 340806 [binary:340745,340795] -is_a_theorem(implies(implies(X,implies(Y,Z)),U)) | is_a_theorem(implies(implies(Y,not(X)),U)).
% 340807 [binary:340766,340795] is_a_theorem(implies(implies(X,Y),implies(implies(Z,not(Y)),implies(X,implies(Z,U))))).
% 340812 [binary:340745,340807] is_a_theorem(implies(implies(X,not(Y)),implies(Z,implies(X,U)))) | -is_a_theorem(implies(Z,Y)).
% 340817 [binary:340745,340791] is_a_theorem(implies(implies(X,Y),implies(Z,implies(X,U)))) | -is_a_theorem(implies(Z,implies(Y,U))).
% 340819 [binary:340806,340791] is_a_theorem(implies(implies(X,not(Y)),implies(implies(Z,X),implies(Y,implies(Z,U))))).
% 340831 [binary:340757,340817.2] is_a_theorem(implies(implies(X,implies(not(Y),Y)),implies(implies(Y,Z),implies(X,Z)))).
% 340834 [binary:340745,340831] -is_a_theorem(implies(X,implies(not(Y),Y))) | is_a_theorem(implies(implies(Y,Z),implies(X,Z))).
% 340835 [binary:340745,340831,binarydemod:340752,340801] is_a_theorem(implies(implies(X,Y),implies(Z,Y))) | -is_a_theorem(X).
% 340839 [binary:340771,340835.2] is_a_theorem(implies(implies(implies(X,X),Y),implies(Z,Y))).
% 340840 [binary:340745,340839] -is_a_theorem(implies(implies(X,X),Y)) | is_a_theorem(implies(Z,Y)).
% 340842 [binary:340766,340839] is_a_theorem(implies(implies(X,Y),implies(Z,implies(X,Y)))).
% 340843 [binary:340812.2,340839] is_a_theorem(implies(implies(X,not(implies(Y,Z))),implies(implies(implies(U,U),Z),implies(X,V)))).
% 340848 [binary:340757,340840] is_a_theorem(implies(X,implies(implies(not(Y),Y),Y))).
% 340858 [binary:340817.2,340848] is_a_theorem(implies(implies(X,implies(not(Y),Y)),implies(Z,implies(X,Y)))).
% 340862 [binary:340745,340842] is_a_theorem(implies(X,implies(Y,Z))) | -is_a_theorem(implies(Y,Z)).
% 340880 [binary:340745,340858] -is_a_theorem(implies(X,implies(not(Y),Y))) | is_a_theorem(implies(Z,implies(X,Y))).
% 340882 [binary:340766,340858] is_a_theorem(implies(implies(not(X),Y),implies(Z,implies(implies(Y,X),X)))).
% 340883 [binary:340806,340858] is_a_theorem(implies(implies(not(X),not(Y)),implies(Z,implies(Y,X)))).
% 340890 [binary:340755.2,340883] is_a_theorem(implies(implies(implies(X,implies(Y,Z)),U),implies(implies(not(Z),not(Y)),U))).
% 340891 [binary:340761,340883] is_a_theorem(implies(X,implies(Y,implies(Z,X)))).
% 340905 [binary:340891,340834] is_a_theorem(implies(implies(implies(X,Y),Z),implies(Y,Z))).
% 340907 [binary:340745,340905] -is_a_theorem(implies(implies(X,Y),Z)) | is_a_theorem(implies(Y,Z)).
% 340913 [binary:340840,340905] is_a_theorem(implies(X,implies(Y,implies(Z,Y)))).
% 340914 [binary:340862.2,340905] is_a_theorem(implies(X,implies(implies(implies(Y,Z),U),implies(Z,U)))).
% 340916 [binary:340745,340913,slowcut:340914] is_a_theorem(implies(X,implies(Y,X))).
% 340922 [binary:340745,340916] is_a_theorem(implies(X,Y)) | -is_a_theorem(Y).
% 340946 [binary:340883,340907] is_a_theorem(implies(not(X),implies(Y,implies(X,Z)))).
% 340964 [binary:340834,340946] is_a_theorem(implies(implies(implies(X,Y),Z),implies(not(X),Z))).
% 340983 [binary:340745,340964] -is_a_theorem(implies(implies(X,Y),Z)) | is_a_theorem(implies(not(X),Z)).
% 340985 [binary:340766,340964] is_a_theorem(implies(implies(X,Y),implies(not(Y),implies(X,Z)))).
% 340988 [binary:340840,340964] is_a_theorem(implies(X,implies(not(Y),implies(Y,Z)))).
% 340990 [binary:340922.2,340964] is_a_theorem(implies(X,implies(implies(implies(Y,Z),U),implies(not(Y),U)))).
% 340993 [binary:340745,340988,slowcut:340990] is_a_theorem(implies(not(X),implies(X,Y))).
% 341000 [binary:340834,340993] is_a_theorem(implies(implies(X,Y),implies(not(not(X)),Y))).
% 341004 [binary:340745,341000] is_a_theorem(implies(not(not(X)),Y)) | -is_a_theorem(implies(X,Y)).
% 341053 [binary:340819,340983] is_a_theorem(implies(not(X),implies(implies(Y,X),implies(Z,implies(Y,U))))).
% 341086 [binary:340745,340985] is_a_theorem(implies(not(X),implies(Y,Z))) | -is_a_theorem(implies(Y,X)).
% 341212 [binary:340839,340880] is_a_theorem(implies(X,implies(implies(implies(Y,Y),Z),Z))).
% 341214 [binary:340964,340880] is_a_theorem(implies(X,implies(implies(implies(Y,Z),Y),Y))).
% 341220 [binary:340907,340882] is_a_theorem(implies(X,implies(Y,implies(implies(X,Z),Z)))).
% 341238 [?] ?
% 341245 [binary:340745,341212,slowcut:341238] is_a_theorem(implies(implies(implies(X,X),Y),Y)).
% 341248 [binary:340745,341245] -is_a_theorem(implies(implies(X,X),Y)) | is_a_theorem(Y).
% 341257 [binary:340843,341248] is_a_theorem(implies(implies(implies(X,X),Y),implies(not(implies(Z,Y)),U))).
% 341259 [binary:340745,341214,slowcut:341257] is_a_theorem(implies(implies(implies(X,Y),X),X)).
% 341264 [binary:340745,341259] -is_a_theorem(implies(implies(X,Y),X)) | is_a_theorem(X).
% 341265 [binary:340766,341259] is_a_theorem(implies(implies(X,implies(X,Y)),implies(X,Y))).
% 341294 [binary:341264,340890] is_a_theorem(implies(implies(not(X),not(Y)),implies(Y,X))).
% 341300 [binary:340880,341220] is_a_theorem(implies(X,implies(Y,implies(implies(Y,Z),Z)))).
% 341308 [binary:340745,341265] -is_a_theorem(implies(X,implies(X,Y))) | is_a_theorem(implies(X,Y)).
% 341324 [binary:341086.2,341294] is_a_theorem(implies(not(implies(X,Y)),implies(implies(not(Y),not(X)),Z))).
% 341328 [binary:340745,341300,slowcut:341324] is_a_theorem(implies(X,implies(implies(X,Y),Y))).
% 341330 [binary:340745,341328] is_a_theorem(implies(implies(X,Y),Y)) | -is_a_theorem(X).
% 341331 [binary:340817.2,341328] is_a_theorem(implies(implies(X,implies(Y,Z)),implies(Y,implies(X,Z)))).
% 341333 [binary:341004.2,341328] is_a_theorem(implies(not(not(X)),implies(implies(X,Y),Y))).
% 341339 [binary:340916,341330.2] is_a_theorem(implies(implies(implies(X,implies(Y,X)),Z),Z)).
% 341344 [binary:340882,341308] is_a_theorem(implies(implies(not(X),Y),implies(implies(Y,X),X))).
% 341364 [binary:340766,341339] is_a_theorem(implies(implies(X,Y),implies(X,implies(Z,Y)))).
% 341372 [binary:340755.2,341364] is_a_theorem(implies(implies(implies(X,implies(Y,Z)),U),implies(implies(X,Z),U))).
% 341493 [binary:340745,341344] is_a_theorem(implies(implies(X,Y),Y)) | -is_a_theorem(implies(not(Y),X)).
% 341598 [binary:341333,341493.2] is_a_theorem(implies(implies(implies(implies(X,Y),Y),not(X)),not(X))).
% 341894 [binary:340745,341331] -is_a_theorem(implies(X,implies(Y,Z))) | is_a_theorem(implies(Y,implies(X,Z))).
% 342156 [binary:340983,341598] is_a_theorem(implies(not(implies(implies(X,Y),Y)),not(X))).
% 342161 [binary:341493.2,342156] is_a_theorem(implies(implies(not(X),implies(implies(X,Y),Y)),implies(implies(X,Y),Y))).
% 342485 [binary:341894,341053] is_a_theorem(implies(implies(X,Y),implies(not(Y),implies(Z,implies(X,U))))).
% 344489 [binary:340745,341372] -is_a_theorem(implies(implies(X,implies(Y,Z)),U)) | is_a_theorem(implies(implies(X,Z),U)).
% 350704 [binary:344489,342161] is_a_theorem(implies(implies(not(X),Y),implies(implies(X,Y),Y))).
% 350713 [binary:341894,350704] is_a_theorem(implies(implies(X,Y),implies(implies(not(X),Y),Y))).
% 350732 [binary:340817.2,350713] is_a_theorem(implies(implies(X,implies(not(Y),Z)),implies(implies(Y,Z),implies(X,Z)))).
% 360704 [binary:340745,350732] -is_a_theorem(implies(X,implies(not(Y),Z))) | is_a_theorem(implies(implies(Y,Z),implies(X,Z))).
% 366002 [binary:342485,360704,slowcut:340749] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% using first neg lit preferred strategy
% not using sos strategy
% using unit paramodulation strategy
% using unit 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: 18991
% derived clauses: 5038847
% kept clauses: 254866
% kept size sum: 380467
% kept mid-nuclei: 70120
% kept new demods: 0
% forw unit-subs: 1191073
% forw double-subs: 206488
% forw overdouble-subs: 57624
% backward subs: 1015
% fast unit cutoff: 6159
% full unit cutoff: 7973
% dbl unit cutoff: 2312
% real runtime : 264.3
% process. runtime: 262.41
% specific non-discr-tree subsumption statistics:
% tried: 14729182
% length fails: 984705
% strength fails: 1730485
% predlist fails: 2630032
% aux str. fails: 1711913
% by-lit fails: 251183
% full subs tried: 7246023
% full subs fail: 7182283
%
% ; 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/LCL377-1+noeq.in")
%
%------------------------------------------------------------------------------