TSTP Solution File: LCL061-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : LCL061-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 : art06.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 237.7s
% Output : Assurance 237.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/LCL061-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,15760,4,2176,15760,50,2179,15760,40,2179,15765,0,2179,26687,3,2731,28701,4,3007,29093,5,3280,29094,5,3281,29094,1,3281,29094,50,3282,29094,40,3282,29099,0,3282,68702,3,4133,79079,4,4558,84072,5,4987,84073,5,4988,84073,1,4988,84073,50,4991,84073,40,4991,84078,0,4991,130370,4,7170,130660,5,7892,130661,1,7894,130661,50,7899,130661,40,7899,130666,0,7899,152788,3,9601,160536,4,10451,165584,5,11301,165584,5,11302,165585,1,11302,165585,50,11305,165585,40,11305,165590,0,11305,200290,3,13306,206590,4,14306,233618,5,15306,233622,5,15306,233622,1,15306,233622,50,15308,233622,40,15308,233627,0,15308,246458,5,17057,246464,1,17059,246464,50,17060,246464,40,17060,246469,0,17060,291466,3,18517,297509,4,19236,310424,5,19961,310426,5,19962,310427,1,19962,310427,50,19964,310427,40,19964,310432,0,19964)
%
%
% START OF PROOF
% 310428 [] -is_a_theorem(implies(X,Y)) | -is_a_theorem(X) | is_a_theorem(Y).
% 310429 [] is_a_theorem(implies(implies(X,Y),implies(implies(Y,Z),implies(X,Z)))).
% 310430 [] is_a_theorem(implies(implies(not(X),X),X)).
% 310431 [] is_a_theorem(implies(X,implies(not(X),Y))).
% 310432 [] -is_a_theorem(implies(implies(not(a),c),implies(implies(b,c),implies(implies(a,b),c)))).
% 310435 [binary:310431,310428] is_a_theorem(implies(not(X),Y)) | -is_a_theorem(X).
% 310438 [binary:310428,310429] is_a_theorem(implies(implies(X,Y),implies(Z,Y))) | -is_a_theorem(implies(Z,X)).
% 310440 [binary:310430,310438.2] is_a_theorem(implies(implies(X,Y),implies(implies(not(X),X),Y))).
% 310441 [binary:310431,310438.2] is_a_theorem(implies(implies(implies(not(X),Y),Z),implies(X,Z))).
% 310442 [binary:310429,310438.2] is_a_theorem(implies(implies(implies(implies(X,Y),implies(Z,Y)),U),implies(implies(Z,X),U))).
% 310443 [binary:310428,310440] is_a_theorem(implies(implies(not(X),X),Y)) | -is_a_theorem(implies(X,Y)).
% 310444 [binary:310428,310441] -is_a_theorem(implies(implies(not(X),Y),Z)) | is_a_theorem(implies(X,Z)).
% 310446 [binary:310431,310443.2] is_a_theorem(implies(implies(not(X),X),implies(not(X),Y))).
% 310449 [binary:310428,310442] -is_a_theorem(implies(implies(implies(X,Y),implies(Z,Y)),U)) | is_a_theorem(implies(implies(Z,X),U)).
% 310451 [binary:310438.2,310446] is_a_theorem(implies(implies(implies(not(X),Y),Z),implies(implies(not(X),X),Z))).
% 310454 [binary:310430,310444] is_a_theorem(implies(X,X)).
% 310467 [binary:310428,310451] -is_a_theorem(implies(implies(not(X),Y),Z)) | is_a_theorem(implies(implies(not(X),X),Z)).
% 310473 [binary:310441,310449] is_a_theorem(implies(implies(X,not(Y)),implies(Y,implies(X,Z)))).
% 310474 [binary:310442,310449] is_a_theorem(implies(implies(X,implies(Y,Z)),implies(implies(U,Y),implies(X,implies(U,Z))))).
% 310478 [binary:310438.2,310473] is_a_theorem(implies(implies(implies(X,implies(Y,Z)),U),implies(implies(Y,not(X)),U))).
% 310480 [binary:310467,310473] is_a_theorem(implies(implies(not(X),X),implies(Y,implies(not(X),Z)))).
% 310484 [binary:310428,310480] is_a_theorem(implies(X,implies(not(Y),Z))) | -is_a_theorem(implies(not(Y),Y)).
% 310489 [binary:310428,310478] -is_a_theorem(implies(implies(X,implies(Y,Z)),U)) | is_a_theorem(implies(implies(Y,not(X)),U)).
% 310490 [binary:310449,310478] is_a_theorem(implies(implies(X,Y),implies(implies(Z,not(Y)),implies(X,implies(Z,U))))).
% 310495 [binary:310428,310490] is_a_theorem(implies(implies(X,not(Y)),implies(Z,implies(X,U)))) | -is_a_theorem(implies(Z,Y)).
% 310500 [binary:310428,310474] is_a_theorem(implies(implies(X,Y),implies(Z,implies(X,U)))) | -is_a_theorem(implies(Z,implies(Y,U))).
% 310514 [binary:310440,310500.2] is_a_theorem(implies(implies(X,implies(not(Y),Y)),implies(implies(Y,Z),implies(X,Z)))).
% 310517 [binary:310428,310514] -is_a_theorem(implies(X,implies(not(Y),Y))) | is_a_theorem(implies(implies(Y,Z),implies(X,Z))).
% 310518 [binary:310428,310514,binarydemod:310435,310484] is_a_theorem(implies(implies(X,Y),implies(Z,Y))) | -is_a_theorem(X).
% 310522 [binary:310454,310518.2] is_a_theorem(implies(implies(implies(X,X),Y),implies(Z,Y))).
% 310523 [binary:310428,310522] -is_a_theorem(implies(implies(X,X),Y)) | is_a_theorem(implies(Z,Y)).
% 310526 [binary:310495.2,310522] is_a_theorem(implies(implies(X,not(implies(Y,Z))),implies(implies(implies(U,U),Z),implies(X,V)))).
% 310531 [binary:310440,310523] is_a_theorem(implies(X,implies(implies(not(Y),Y),Y))).
% 310541 [binary:310500.2,310531] is_a_theorem(implies(implies(X,implies(not(Y),Y)),implies(Z,implies(X,Y)))).
% 310563 [binary:310428,310541] -is_a_theorem(implies(X,implies(not(Y),Y))) | is_a_theorem(implies(Z,implies(X,Y))).
% 310565 [binary:310449,310541] is_a_theorem(implies(implies(not(X),Y),implies(Z,implies(implies(Y,X),X)))).
% 310566 [binary:310489,310541] is_a_theorem(implies(implies(not(X),not(Y)),implies(Z,implies(Y,X)))).
% 310573 [binary:310438.2,310566] is_a_theorem(implies(implies(implies(X,implies(Y,Z)),U),implies(implies(not(Z),not(Y)),U))).
% 310574 [binary:310444,310566] is_a_theorem(implies(X,implies(Y,implies(Z,X)))).
% 310588 [binary:310574,310517] is_a_theorem(implies(implies(implies(X,Y),Z),implies(Y,Z))).
% 310590 [binary:310428,310588] -is_a_theorem(implies(implies(X,Y),Z)) | is_a_theorem(implies(Y,Z)).
% 310629 [binary:310566,310590] is_a_theorem(implies(not(X),implies(Y,implies(X,Z)))).
% 310647 [binary:310517,310629] is_a_theorem(implies(implies(implies(X,Y),Z),implies(not(X),Z))).
% 310666 [binary:310428,310647] -is_a_theorem(implies(implies(X,Y),Z)) | is_a_theorem(implies(not(X),Z)).
% 310668 [binary:310449,310647] is_a_theorem(implies(implies(X,Y),implies(not(Y),implies(X,Z)))).
% 310769 [binary:310428,310668] is_a_theorem(implies(not(X),implies(Y,Z))) | -is_a_theorem(implies(Y,X)).
% 310895 [binary:310522,310563] is_a_theorem(implies(X,implies(implies(implies(Y,Y),Z),Z))).
% 310897 [binary:310647,310563] is_a_theorem(implies(X,implies(implies(implies(Y,Z),Y),Y))).
% 310903 [binary:310590,310565] is_a_theorem(implies(X,implies(Y,implies(implies(X,Z),Z)))).
% 310921 [?] ?
% 310928 [binary:310428,310895,slowcut:310921] is_a_theorem(implies(implies(implies(X,X),Y),Y)).
% 310931 [binary:310428,310928] -is_a_theorem(implies(implies(X,X),Y)) | is_a_theorem(Y).
% 310940 [binary:310526,310931] is_a_theorem(implies(implies(implies(X,X),Y),implies(not(implies(Z,Y)),U))).
% 310942 [binary:310428,310897,slowcut:310940] is_a_theorem(implies(implies(implies(X,Y),X),X)).
% 310947 [binary:310428,310942] -is_a_theorem(implies(implies(X,Y),X)) | is_a_theorem(X).
% 310948 [binary:310449,310942] is_a_theorem(implies(implies(X,implies(X,Y)),implies(X,Y))).
% 310977 [binary:310947,310573] is_a_theorem(implies(implies(not(X),not(Y)),implies(Y,X))).
% 310983 [binary:310563,310903] is_a_theorem(implies(X,implies(Y,implies(implies(Y,Z),Z)))).
% 310991 [binary:310428,310948] -is_a_theorem(implies(X,implies(X,Y))) | is_a_theorem(implies(X,Y)).
% 311007 [binary:310769.2,310977] is_a_theorem(implies(not(implies(X,Y)),implies(implies(not(Y),not(X)),Z))).
% 311011 [binary:310428,310983,slowcut:311007] is_a_theorem(implies(X,implies(implies(X,Y),Y))).
% 311014 [binary:310500.2,311011] is_a_theorem(implies(implies(X,implies(Y,Z)),implies(Y,implies(X,Z)))).
% 311027 [binary:310565,310991] is_a_theorem(implies(implies(not(X),Y),implies(implies(Y,X),X))).
% 311577 [binary:310428,311014] -is_a_theorem(implies(X,implies(Y,Z))) | is_a_theorem(implies(Y,implies(X,Z))).
% 312135 [binary:311027,311577] is_a_theorem(implies(implies(X,Y),implies(implies(not(Y),X),Y))).
% 312205 [binary:310500.2,312135] is_a_theorem(implies(implies(X,implies(not(Y),Z)),implies(implies(Z,Y),implies(X,Y)))).
% 312207 [binary:310666,312135] is_a_theorem(implies(not(X),implies(implies(not(Y),X),Y))).
% 312220 [binary:311577,312207] is_a_theorem(implies(implies(not(X),Y),implies(not(Y),X))).
% 312223 [binary:310438.2,312220] is_a_theorem(implies(implies(implies(not(X),Y),Z),implies(implies(not(Y),X),Z))).
% 316823 [binary:310428,312223] -is_a_theorem(implies(implies(not(X),Y),Z)) | is_a_theorem(implies(implies(not(Y),X),Z)).
% 322961 [binary:310449,312205] is_a_theorem(implies(implies(not(X),Y),implies(implies(Z,X),implies(implies(Y,Z),X)))).
% 331677 [binary:316823,322961,slowcut:310432] 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: 15612
% derived clauses: 4394484
% kept clauses: 240051
% kept size sum: 321101
% kept mid-nuclei: 53247
% kept new demods: 0
% forw unit-subs: 1074151
% forw double-subs: 208057
% forw overdouble-subs: 54052
% backward subs: 1017
% fast unit cutoff: 6464
% full unit cutoff: 7005
% dbl unit cutoff: 2650
% real runtime : 243.75
% process. runtime: 241.22
% specific non-discr-tree subsumption statistics:
% tried: 18947716
% length fails: 2126698
% strength fails: 2905756
% predlist fails: 2480569
% aux str. fails: 1119611
% by-lit fails: 312504
% full subs tried: 9773020
% full subs fail: 9711679
%
% ; 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/LCL061-1+noeq.in")
%
%------------------------------------------------------------------------------