TSTP Solution File: LCL181-3 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : LCL181-3 : 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 : art10.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 40.0s
% Output : Assurance 40.0s
% 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/LCL181-3+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: heq
% detected subclass: small
% detected subclass: short
%
% strategies selected:
% (binary-unit-uniteq 30 #f)
% (binary-posweight-order 120 #f 4 5)
% (binary-posweight-order 240 #f)
% (binary-posweight-lex-big-order 60 #f)
% (binary-posweight-lex-small-order 12 #f)
% (binary-weightorder 24 #f)
% (hyper 30 #f)
% (binary 24 #t)
% (binary-order 30 #f)
% (binary-unit 30 #f)
%
%
% **** EMPTY CLAUSE DERIVED ****
%
%
% timer checkpoints: c(10,40,0,20,0,0,11666,3,1509,14110,4,2256,17115,5,3001,17116,5,3001,17117,1,3001,17117,50,3003,17117,40,3003,17127,0,3003,20935,50,3411,20945,0,3411)
%
%
% START OF PROOF
% 20937 [] axiom(implies(or(X,X),X)).
% 20938 [] axiom(implies(X,or(Y,X))).
% 20939 [] axiom(implies(or(X,Y),or(Y,X))).
% 20940 [] axiom(implies(or(X,or(Y,Z)),or(Y,or(X,Z)))).
% 20941 [] axiom(implies(implies(X,Y),implies(or(Z,X),or(Z,Y)))).
% 20942 [] equal(implies(X,Y),or(not(X),Y)).
% 20943 [] -axiom(X) | theorem(X).
% 20944 [] -theorem(implies(X,Y)) | -theorem(X) | theorem(Y).
% 20945 [] -theorem(implies(implies(not(p),q),implies(not(q),p))).
% 20947 [binary:20943,20937] theorem(implies(or(X,X),X)).
% 20948 [binary:20943,20938] theorem(implies(X,or(Y,X))).
% 20949 [binary:20943,20939] theorem(implies(or(X,Y),or(Y,X))).
% 20953 [para:20942.1.2,20948.1.1.2] theorem(implies(X,implies(Y,X))).
% 20956 [binary:20943,20940] theorem(implies(or(X,or(Y,Z)),or(Y,or(X,Z)))).
% 20960 [binary:20947,20944] -theorem(or(X,X)) | theorem(X).
% 20961 [binary:20948,20944] theorem(or(X,Y)) | -theorem(Y).
% 20975 [binary:20944,20949] -theorem(or(X,Y)) | theorem(or(Y,X)).
% 20979 [binary:20943,20941] theorem(implies(implies(X,Y),implies(or(Z,X),or(Z,Y)))).
% 21010 [para:20942.1.2,20975.1.1] theorem(or(X,not(Y))) | -theorem(implies(Y,X)).
% 21024 [para:20942.1.2,20956.1.1.1,demod:20942] theorem(implies(implies(X,or(Y,Z)),or(Y,implies(X,Z)))).
% 21025 [para:20942.1.2,20956.1.1.1.2,demod:20942] theorem(implies(or(X,implies(Y,Z)),implies(Y,or(X,Z)))).
% 21026 [binary:20944,20956] -theorem(or(X,or(Y,Z))) | theorem(or(Y,or(X,Z))).
% 21039 [binary:20948,21010.2] theorem(or(or(X,Y),not(Y))).
% 21050 [binary:20961.2,21039] theorem(or(X,or(or(Y,Z),not(Z)))).
% 21087 [para:20942.1.2,20979.1.1.2.1,demod:20942] theorem(implies(implies(X,Y),implies(implies(Z,X),implies(Z,Y)))).
% 21088 [binary:20944,20979] theorem(implies(or(X,Y),or(X,Z))) | -theorem(implies(Y,Z)).
% 21107 [para:20942.1.2,21024.1.1.1.2,demod:20942] theorem(implies(implies(X,implies(Y,Z)),implies(Y,implies(X,Z)))).
% 21108 [binary:20944,21024] -theorem(implies(X,or(Y,Z))) | theorem(or(Y,implies(X,Z))).
% 21113 [binary:20944,21025] -theorem(or(X,implies(Y,Z))) | theorem(implies(Y,or(X,Z))).
% 21122 [binary:21050,21026] theorem(or(or(X,Y),or(Z,not(Y)))).
% 21131 [binary:20975,21122] theorem(or(or(X,not(Y)),or(Z,Y))).
% 21145 [binary:21026,21131] theorem(or(X,or(or(Y,not(Z)),Z))).
% 21158 [binary:20960,21145] theorem(or(or(X,not(Y)),Y)).
% 21161 [binary:20975,21158] theorem(or(X,or(Y,not(X)))).
% 21170 [binary:21026,21161] theorem(or(X,or(Y,not(Y)))).
% 21176 [binary:20960,21170] theorem(or(X,not(X))).
% 21181 [para:20942.1.2,21176.1.1] theorem(implies(X,not(not(X)))).
% 21182 [binary:20975,21176,demod:20942] theorem(implies(X,X)).
% 21286 [binary:20944,21087] theorem(implies(implies(X,Y),implies(X,Z))) | -theorem(implies(Y,Z)).
% 21297 [binary:20947,21088.2] theorem(implies(or(X,or(Y,Y)),or(X,Y))).
% 21299 [binary:20953,21088.2] theorem(implies(or(X,Y),or(X,implies(Z,Y)))).
% 21300 [binary:20949,21088.2] theorem(implies(or(X,or(Y,Z)),or(X,or(Z,Y)))).
% 21309 [binary:21181,21088.2] theorem(implies(or(X,Y),or(X,not(not(Y))))).
% 21325 [para:20942.1.2,21297.1.1.1,demod:20942] theorem(implies(implies(X,or(Y,Y)),implies(X,Y))).
% 21347 [binary:20944,21309] theorem(or(X,not(not(Y)))) | -theorem(or(X,Y)).
% 21350 [binary:20944,21325] -theorem(implies(X,or(Y,Y))) | theorem(implies(X,Y)).
% 21419 [binary:21176,21347.2] theorem(or(X,not(not(not(X))))).
% 21425 [binary:20975,21419,demod:20942] theorem(implies(not(not(X)),X)).
% 21430 [binary:21088.2,21425] theorem(implies(or(X,not(not(Y))),or(X,Y))).
% 21433 [binary:20944,21107] -theorem(implies(X,implies(Y,Z))) | theorem(implies(Y,implies(X,Z))).
% 21458 [binary:21182,21108] theorem(or(X,implies(or(X,Y),Y))).
% 21470 [para:20942.1.2,21458.1.1,demod:20942] theorem(implies(X,implies(implies(X,Y),Y))).
% 21474 [binary:20975,21458] theorem(or(implies(or(X,Y),Y),X)).
% 21485 [binary:20944,21470] theorem(implies(implies(X,Y),Y)) | -theorem(X).
% 21490 [binary:21088.2,21470] theorem(implies(or(X,Y),or(X,implies(implies(Y,Z),Z)))).
% 21497 [binary:21347.2,21474] theorem(or(implies(or(X,Y),Y),not(not(X)))).
% 21500 [binary:20948,21485.2] theorem(implies(implies(implies(X,or(Y,X)),Z),Z)).
% 21555 [binary:21299,21350] theorem(implies(or(implies(X,Y),Y),implies(X,Y))).
% 21811 [binary:20944,21430] -theorem(or(X,not(not(Y)))) | theorem(or(X,Y)).
% 21898 [binary:20975,21497,demod:20942] theorem(implies(not(X),implies(or(X,Y),Y))).
% 21915 [binary:20944,21500] -theorem(implies(implies(X,or(Y,X)),Z)) | theorem(Z).
% 21990 [binary:20944,21555] -theorem(or(implies(X,Y),Y)) | theorem(implies(X,Y)).
% 22080 [binary:20949,21286.2] theorem(implies(implies(X,or(Y,Z)),implies(X,or(Z,Y)))).
% 22252 [binary:20944,21300] -theorem(or(X,or(Y,Z))) | theorem(or(X,or(Z,Y))).
% 22349 [binary:21474,21811,demod:20942] theorem(or(implies(implies(not(X),Y),Y),X)).
% 22350 [binary:20975,22349] theorem(or(X,implies(implies(not(X),Y),Y))).
% 22353 [binary:21113,22350] theorem(implies(implies(not(X),Y),or(X,Y))).
% 23247 [binary:21898,21433] theorem(implies(or(X,Y),implies(not(X),Y))).
% 23259 [binary:20944,23247] theorem(implies(not(X),Y)) | -theorem(or(X,Y)).
% 25747 [binary:21915,22080] theorem(implies(X,or(X,Y))).
% 25765 [binary:21108,25747] theorem(or(X,implies(X,Y))).
% 25798 [binary:20975,25765] theorem(or(implies(X,Y),X)).
% 25847 [binary:21485.2,25798] theorem(implies(implies(or(implies(X,Y),X),Z),Z)).
% 26722 [binary:20944,25847] -theorem(implies(or(implies(X,Y),X),Z)) | theorem(Z).
% 28134 [binary:21490,26722] theorem(or(implies(X,Y),implies(implies(X,Z),Z))).
% 29021 [binary:21113,28134] theorem(implies(implies(X,Y),or(implies(X,Z),Y))).
% 29665 [binary:20944,29021] theorem(or(implies(X,Y),Z)) | -theorem(implies(X,Z)).
% 30070 [binary:22353,29665.2] theorem(or(implies(implies(not(X),Y),Z),or(X,Y))).
% 33576 [binary:22252,30070] theorem(or(implies(implies(not(X),Y),Z),or(Y,X))).
% 35397 [binary:21990,33576] theorem(implies(implies(not(X),Y),or(Y,X))).
% 35413 [binary:21108,35397] theorem(or(X,implies(implies(not(Y),X),Y))).
% 35432 [binary:23259.2,35413] theorem(implies(not(X),implies(implies(not(Y),X),Y))).
% 35497 [binary:21433,35432,slowcut:20945] 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: 120
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 6682
% derived clauses: 654447
% kept clauses: 30548
% kept size sum: 425748
% kept mid-nuclei: 2972
% kept new demods: 3
% forw unit-subs: 159726
% forw double-subs: 2491
% forw overdouble-subs: 0
% backward subs: 20
% fast unit cutoff: 0
% full unit cutoff: 61
% dbl unit cutoff: 0
% real runtime : 46.18
% process. runtime: 46.14
% specific non-discr-tree subsumption statistics:
% tried: 0
% length fails: 0
% strength fails: 0
% predlist fails: 0
% aux str. fails: 0
% by-lit fails: 0
% full subs tried: 0
% full subs fail: 0
%
% ; 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/LCL181-3+eq_r.in")
%
%------------------------------------------------------------------------------