TSTP Solution File: LCL192-3 by Gandalf---c-2.6

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : LCL192-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 : art02.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 538.9s
% Output   : Assurance 538.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/LCL192-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,12004,3,1501,15458,4,2258,18446,5,3001,18448,5,3002,18448,1,3002,18448,50,3003,18448,40,3003,18458,0,3003,22266,50,3424,22276,0,3424,60618,3,9180,74802,4,12062,76708,5,14925,76709,5,14929,76711,1,14929,76711,50,14939,76711,40,14939,76721,0,14939,563346,3,26940,988916,4,32947,990324,5,38942,990326,5,38949,990327,1,38949,990327,50,38964,990327,40,38964,990337,0,38964,1117789,3,41969,1179350,4,43466,1179709,5,44968,1179710,5,44973,1179710,1,44973,1179710,50,44985,1179710,40,44985,1179720,0,44985,1224502,3,45586,1230972,4,45890,1231079,5,46188,1231079,5,46191,1231079,1,46191,1231079,50,46199,1231079,40,46199,1231089,0,46199,1248454,3,47425,1252371,4,48011,1255112,5,48600,1255113,1,48601,1255113,50,48603,1255113,40,48603,1255123,0,48603,1312680,4,50858,1312947,5,51604,1312948,1,51607,1312948,50,51612,1312948,40,51612,1312958,0,51612,1335115,3,52813,1336769,4,53413,1340420,1,54013,1340420,50,54014,1340420,40,54014,1340430,0,54014)
% 
% 
% START OF PROOF
% 1340422 [] axiom(implies(or(X,X),X)).
% 1340423 [] axiom(implies(X,or(Y,X))).
% 1340424 [] axiom(implies(or(X,Y),or(Y,X))).
% 1340425 [] axiom(implies(or(X,or(Y,Z)),or(Y,or(X,Z)))).
% 1340426 [] axiom(implies(implies(X,Y),implies(or(Z,X),or(Z,Y)))).
% 1340427 [] equal(implies(X,Y),or(not(X),Y)).
% 1340428 [] -axiom(X) | theorem(X).
% 1340429 [] -theorem(implies(X,Y)) | -theorem(X) | theorem(Y).
% 1340430 [] -theorem(implies(or(or(p,q),r),or(p,or(q,r)))).
% 1340432 [binary:1340428,1340422] theorem(implies(or(X,X),X)).
% 1340433 [binary:1340428,1340423] theorem(implies(X,or(Y,X))).
% 1340435 [binary:1340428,1340424] theorem(implies(or(X,Y),or(Y,X))).
% 1340442 [binary:1340428,1340425] theorem(implies(or(X,or(Y,Z)),or(Y,or(X,Z)))).
% 1340443 [para:1340427.1.2,1340425.1.1.1,demod:1340427] axiom(implies(implies(X,or(Y,Z)),or(Y,implies(X,Z)))).
% 1340444 [para:1340427.1.2,1340425.1.1.1.2,demod:1340427] axiom(implies(or(X,implies(Y,Z)),implies(Y,or(X,Z)))).
% 1340446 [binary:1340428.2,1340429] -axiom(implies(X,Y)) | -theorem(X) | theorem(Y).
% 1340447 [binary:1340432,1340429] -theorem(or(X,X)) | theorem(X).
% 1340467 [binary:1340429,1340435] -theorem(or(X,Y)) | theorem(or(Y,X)).
% 1340487 [binary:1340425,1340446] -theorem(or(X,or(Y,Z))) | theorem(or(Y,or(X,Z))).
% 1340489 [binary:1340426,1340446] theorem(implies(or(X,Y),or(X,Z))) | -theorem(implies(Y,Z)).
% 1340501 [para:1340427.1.2,1340442.1.1.1.2,demod:1340427] theorem(implies(or(X,implies(Y,Z)),implies(Y,or(X,Z)))).
% 1340513 [binary:1340446,1340443] -theorem(implies(X,or(Y,Z))) | theorem(or(Y,implies(X,Z))).
% 1340520 [binary:1340446,1340444] -theorem(or(X,implies(Y,Z))) | theorem(implies(Y,or(X,Z))).
% 1340560 [binary:1340429,1340489] -theorem(or(Z,X)) | -theorem(implies(X,Y)) | theorem(or(Z,Y)).
% 1340598 [binary:1340433,1340513] theorem(or(X,implies(Y,Y))).
% 1340612 [binary:1340447,1340598] theorem(implies(X,X)).
% 1340616 [binary:1340513,1340612] theorem(or(X,implies(or(X,Y),Y))).
% 1340620 [binary:1340430,1340520.2] -theorem(or(p,implies(or(or(p,q),r),or(q,r)))).
% 1340639 [binary:1340467,1340616] theorem(or(implies(or(X,Y),Y),X)).
% 1340650 [binary:1340487,1340639] theorem(or(X,or(implies(or(or(X,Y),Z),Z),Y))).
% 1340791 [binary:1340435,1340560.2] -theorem(or(X,or(Y,Z))) | theorem(or(X,or(Z,Y))).
% 1340825 [binary:1340501,1340560.2] -theorem(or(X,or(Y,implies(Z,U)))) | theorem(or(X,implies(Z,or(Y,U)))).
% 1345608 [binary:1340650,1340791] theorem(or(X,or(Y,implies(or(or(X,Y),Z),Z)))).
% 1350520 [binary:1340620,1340825.2,cut:1345608] contradiction
% END OF PROOF
% 
% Proof found by the following strategy:
% 
% using binary resolution
% using term-depth-order 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
% seconds given: 30
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    30929
%  derived clauses:   4585306
%  kept clauses:      378722
%  kept size sum:     567598
%  kept mid-nuclei:   13032
%  kept new demods:   10
%  forw unit-subs:    1313232
%  forw double-subs: 34646
%  forw overdouble-subs: 5546
%  backward subs:     364
%  fast unit cutoff:  85
%  full unit cutoff:  541
%  dbl  unit cutoff:  2
%  real runtime  :  543.0
%  process. runtime:  541.39
% specific non-discr-tree subsumption statistics: 
%  tried:           462459
%  length fails:    41765
%  strength fails:  73132
%  predlist fails:  100827
%  aux str. fails:  8174
%  by-lit fails:    5698
%  full subs tried: 227427
%  full subs fail:  221141
% 
% ; 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/LCL192-3+eq_r.in")
% 
%------------------------------------------------------------------------------