TSTP Solution File: LCL393-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : LCL393-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 : art07.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 238.9s
% Output : Assurance 238.9s
% 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/LCL393-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,15778,4,2176,15778,50,2178,15778,40,2178,15783,0,2178,25505,3,2729,28640,4,3004,29016,5,3279,29016,5,3280,29017,1,3280,29017,50,3281,29017,40,3281,29022,0,3281,69166,3,4132,81318,4,4558,86134,5,4982,86136,5,4983,86136,1,4983,86136,50,4986,86136,40,4986,86141,0,4986,133809,4,7168,134071,5,7888,134072,1,7890,134072,50,7895,134072,40,7895,134077,0,7895,157306,3,9596,164838,4,10454,169979,5,11296,169980,5,11298,169980,1,11298,169980,50,11301,169980,40,11301,169985,0,11301,204652,3,13404,210321,4,14302,251228,5,15302,251230,5,15303,251231,1,15303,251231,50,15304,251231,40,15304,251236,0,15304,264085,5,17025,264091,1,17028,264091,50,17028,264091,40,17028,264096,0,17028,311722,3,18522,318328,4,19206,330798,5,19929,330800,5,19930,330800,1,19930,330800,50,19932,330800,40,19932,330805,0,19932)
%
%
% START OF PROOF
% 330801 [] -is_a_theorem(implies(X,Y)) | -is_a_theorem(X) | is_a_theorem(Y).
% 330802 [] is_a_theorem(implies(implies(X,Y),implies(implies(Y,Z),implies(X,Z)))).
% 330803 [] is_a_theorem(implies(implies(not(X),X),X)).
% 330804 [] is_a_theorem(implies(X,implies(not(X),Y))).
% 330805 [] -is_a_theorem(implies(implies(not(x),y),implies(implies(x,z),implies(implies(z,y),y)))).
% 330808 [binary:330804,330801] is_a_theorem(implies(not(X),Y)) | -is_a_theorem(X).
% 330811 [binary:330801,330802] is_a_theorem(implies(implies(X,Y),implies(Z,Y))) | -is_a_theorem(implies(Z,X)).
% 330813 [binary:330803,330811.2] is_a_theorem(implies(implies(X,Y),implies(implies(not(X),X),Y))).
% 330814 [binary:330804,330811.2] is_a_theorem(implies(implies(implies(not(X),Y),Z),implies(X,Z))).
% 330815 [binary:330802,330811.2] is_a_theorem(implies(implies(implies(implies(X,Y),implies(Z,Y)),U),implies(implies(Z,X),U))).
% 330816 [binary:330801,330813] is_a_theorem(implies(implies(not(X),X),Y)) | -is_a_theorem(implies(X,Y)).
% 330817 [binary:330801,330814] -is_a_theorem(implies(implies(not(X),Y),Z)) | is_a_theorem(implies(X,Z)).
% 330819 [binary:330804,330816.2] is_a_theorem(implies(implies(not(X),X),implies(not(X),Y))).
% 330822 [binary:330801,330815] -is_a_theorem(implies(implies(implies(X,Y),implies(Z,Y)),U)) | is_a_theorem(implies(implies(Z,X),U)).
% 330824 [binary:330811.2,330819] is_a_theorem(implies(implies(implies(not(X),Y),Z),implies(implies(not(X),X),Z))).
% 330827 [binary:330803,330817] is_a_theorem(implies(X,X)).
% 330840 [binary:330801,330824] -is_a_theorem(implies(implies(not(X),Y),Z)) | is_a_theorem(implies(implies(not(X),X),Z)).
% 330846 [binary:330814,330822] is_a_theorem(implies(implies(X,not(Y)),implies(Y,implies(X,Z)))).
% 330847 [binary:330815,330822] is_a_theorem(implies(implies(X,implies(Y,Z)),implies(implies(U,Y),implies(X,implies(U,Z))))).
% 330851 [binary:330811.2,330846] is_a_theorem(implies(implies(implies(X,implies(Y,Z)),U),implies(implies(Y,not(X)),U))).
% 330853 [binary:330840,330846] is_a_theorem(implies(implies(not(X),X),implies(Y,implies(not(X),Z)))).
% 330857 [binary:330801,330853] is_a_theorem(implies(X,implies(not(Y),Z))) | -is_a_theorem(implies(not(Y),Y)).
% 330862 [binary:330801,330851] -is_a_theorem(implies(implies(X,implies(Y,Z)),U)) | is_a_theorem(implies(implies(Y,not(X)),U)).
% 330863 [binary:330822,330851] is_a_theorem(implies(implies(X,Y),implies(implies(Z,not(Y)),implies(X,implies(Z,U))))).
% 330868 [binary:330801,330863] is_a_theorem(implies(implies(X,not(Y)),implies(Z,implies(X,U)))) | -is_a_theorem(implies(Z,Y)).
% 330873 [binary:330801,330847] is_a_theorem(implies(implies(X,Y),implies(Z,implies(X,U)))) | -is_a_theorem(implies(Z,implies(Y,U))).
% 330887 [binary:330813,330873.2] is_a_theorem(implies(implies(X,implies(not(Y),Y)),implies(implies(Y,Z),implies(X,Z)))).
% 330890 [binary:330801,330887] -is_a_theorem(implies(X,implies(not(Y),Y))) | is_a_theorem(implies(implies(Y,Z),implies(X,Z))).
% 330891 [binary:330801,330887,binarydemod:330808,330857] is_a_theorem(implies(implies(X,Y),implies(Z,Y))) | -is_a_theorem(X).
% 330895 [binary:330827,330891.2] is_a_theorem(implies(implies(implies(X,X),Y),implies(Z,Y))).
% 330896 [binary:330801,330895] -is_a_theorem(implies(implies(X,X),Y)) | is_a_theorem(implies(Z,Y)).
% 330899 [binary:330868.2,330895] is_a_theorem(implies(implies(X,not(implies(Y,Z))),implies(implies(implies(U,U),Z),implies(X,V)))).
% 330904 [binary:330813,330896] is_a_theorem(implies(X,implies(implies(not(Y),Y),Y))).
% 330914 [binary:330873.2,330904] is_a_theorem(implies(implies(X,implies(not(Y),Y)),implies(Z,implies(X,Y)))).
% 330936 [binary:330801,330914] -is_a_theorem(implies(X,implies(not(Y),Y))) | is_a_theorem(implies(Z,implies(X,Y))).
% 330938 [binary:330822,330914] is_a_theorem(implies(implies(not(X),Y),implies(Z,implies(implies(Y,X),X)))).
% 330939 [binary:330862,330914] is_a_theorem(implies(implies(not(X),not(Y)),implies(Z,implies(Y,X)))).
% 330946 [binary:330811.2,330939] is_a_theorem(implies(implies(implies(X,implies(Y,Z)),U),implies(implies(not(Z),not(Y)),U))).
% 330947 [binary:330817,330939] is_a_theorem(implies(X,implies(Y,implies(Z,X)))).
% 330961 [binary:330947,330890] is_a_theorem(implies(implies(implies(X,Y),Z),implies(Y,Z))).
% 330963 [binary:330801,330961] -is_a_theorem(implies(implies(X,Y),Z)) | is_a_theorem(implies(Y,Z)).
% 331002 [binary:330939,330963] is_a_theorem(implies(not(X),implies(Y,implies(X,Z)))).
% 331020 [binary:330890,331002] is_a_theorem(implies(implies(implies(X,Y),Z),implies(not(X),Z))).
% 331039 [binary:330801,331020] -is_a_theorem(implies(implies(X,Y),Z)) | is_a_theorem(implies(not(X),Z)).
% 331041 [binary:330822,331020] is_a_theorem(implies(implies(X,Y),implies(not(Y),implies(X,Z)))).
% 331142 [binary:330801,331041] is_a_theorem(implies(not(X),implies(Y,Z))) | -is_a_theorem(implies(Y,X)).
% 331268 [binary:330895,330936] is_a_theorem(implies(X,implies(implies(implies(Y,Y),Z),Z))).
% 331270 [binary:331020,330936] is_a_theorem(implies(X,implies(implies(implies(Y,Z),Y),Y))).
% 331276 [binary:330963,330938] is_a_theorem(implies(X,implies(Y,implies(implies(X,Z),Z)))).
% 331294 [?] ?
% 331301 [binary:330801,331268,slowcut:331294] is_a_theorem(implies(implies(implies(X,X),Y),Y)).
% 331304 [binary:330801,331301] -is_a_theorem(implies(implies(X,X),Y)) | is_a_theorem(Y).
% 331313 [binary:330899,331304] is_a_theorem(implies(implies(implies(X,X),Y),implies(not(implies(Z,Y)),U))).
% 331315 [binary:330801,331270,slowcut:331313] is_a_theorem(implies(implies(implies(X,Y),X),X)).
% 331320 [binary:330801,331315] -is_a_theorem(implies(implies(X,Y),X)) | is_a_theorem(X).
% 331321 [binary:330822,331315] is_a_theorem(implies(implies(X,implies(X,Y)),implies(X,Y))).
% 331350 [binary:331320,330946] is_a_theorem(implies(implies(not(X),not(Y)),implies(Y,X))).
% 331353 [binary:330890,331276] is_a_theorem(implies(implies(implies(implies(X,Y),Y),Z),implies(X,Z))).
% 331356 [binary:330936,331276] is_a_theorem(implies(X,implies(Y,implies(implies(Y,Z),Z)))).
% 331364 [binary:330801,331321] -is_a_theorem(implies(X,implies(X,Y))) | is_a_theorem(implies(X,Y)).
% 331380 [binary:331142.2,331350] is_a_theorem(implies(not(implies(X,Y)),implies(implies(not(Y),not(X)),Z))).
% 331384 [binary:330801,331356,slowcut:331380] is_a_theorem(implies(X,implies(implies(X,Y),Y))).
% 331387 [binary:330873.2,331384] is_a_theorem(implies(implies(X,implies(Y,Z)),implies(Y,implies(X,Z)))).
% 331400 [binary:330938,331364] is_a_theorem(implies(implies(not(X),Y),implies(implies(Y,X),X))).
% 331938 [binary:330801,331353] -is_a_theorem(implies(implies(implies(X,Y),Y),Z)) | is_a_theorem(implies(X,Z)).
% 331950 [binary:330801,331387] -is_a_theorem(implies(X,implies(Y,Z))) | is_a_theorem(implies(Y,implies(X,Z))).
% 332433 [binary:330815,331938] is_a_theorem(implies(implies(X,Y),implies(implies(Z,X),implies(Z,Y)))).
% 332508 [binary:331400,331950] is_a_theorem(implies(implies(X,Y),implies(implies(not(Y),X),Y))).
% 332580 [binary:331039,332508] is_a_theorem(implies(not(X),implies(implies(not(Y),X),Y))).
% 332593 [binary:331950,332580] is_a_theorem(implies(implies(not(X),Y),implies(not(Y),X))).
% 332596 [binary:330811.2,332593] is_a_theorem(implies(implies(implies(not(X),Y),Z),implies(implies(not(Y),X),Z))).
% 332877 [binary:330801,332433] is_a_theorem(implies(implies(X,Y),implies(X,Z))) | -is_a_theorem(implies(Y,Z)).
% 333167 [binary:331400,332877.2] is_a_theorem(implies(implies(X,implies(not(Y),Z)),implies(X,implies(implies(Z,Y),Y)))).
% 337196 [binary:330801,332596] -is_a_theorem(implies(implies(not(X),Y),Z)) | is_a_theorem(implies(implies(not(Y),X),Z)).
% 346350 [binary:330822,333167] is_a_theorem(implies(implies(not(X),Y),implies(implies(Y,Z),implies(implies(Z,X),X)))).
% 353443 [binary:337196,346350,slowcut:330805] 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: 15798
% derived clauses: 4546146
% kept clauses: 247200
% kept size sum: 344261
% kept mid-nuclei: 64924
% kept new demods: 0
% forw unit-subs: 1098670
% forw double-subs: 216708
% forw overdouble-subs: 56278
% backward subs: 955
% fast unit cutoff: 7105
% full unit cutoff: 9046
% dbl unit cutoff: 2834
% real runtime : 247.33
% process. runtime: 245.69
% specific non-discr-tree subsumption statistics:
% tried: 19986184
% length fails: 2159334
% strength fails: 2957336
% predlist fails: 2730013
% aux str. fails: 1272548
% by-lit fails: 338009
% full subs tried: 10295183
% full subs fail: 10231259
%
% ; 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/LCL393-1+noeq.in")
%
%------------------------------------------------------------------------------