TSTP Solution File: SET853-1 by Gandalf---c-2.6

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SET853-1 : TPTP v3.4.2. Released v3.2.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 i686
% CPU      : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2794MHz
% Memory   : 1003MB
% OS       : Linux 2.6.11-1.1369_FC4
% CPULimit : 600s

% Result   : Unsatisfiable 59.8s
% Output   : Assurance 59.8s
% 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: /tmp/SystemOnTPTP32209/SET/SET853-1+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
% 
% prove-all-passes started
% 
% detected problem class: neq
% detected subclass: big
% 
% strategies selected: 
% (hyper 28 #f 4 9)
% (binary-unit 28 #f 4 9)
% (binary-double 11 #f 4 9)
% (binary-double 17 #f)
% (binary-double 17 #t)
% (binary 87 #t 4 9)
% (binary-order 28 #f 4 9)
% (binary-posweight-order 58 #f)
% (binary-posweight-lex-big-order 28 #f)
% (binary-posweight-lex-small-order 11 #f)
% (binary-order-sos 28 #t)
% (binary-unit-uniteq 28 #f)
% (binary-weightorder 28 #f)
% (binary-weightorder-sos 17 #f)
% (binary-order 28 #f)
% (hyper-order 17 #f)
% (binary 141 #t)
% 
% 
% ********* EMPTY CLAUSE DERIVED *********
% 
% 
% timer checkpoints: c(1373,40,6,2746,0,12,460464,4,2125,483121,5,2818,483121,1,2818,483121,50,2824,483121,40,2824,484494,0,2825,520263,3,4226,522079,4,4926,560889,5,5626,560890,5,5627,560890,1,5627,560890,50,5630,560890,40,5630,562263,0,5631)
% 
% 
% START OF PROOF
% 493111 [?] ?
% 561191 [] -c_lessequals(X,Y,tc_set(Z)) | -c_less(Y,X,tc_set(Z)).
% 561193 [] -c_lessequals(X,Y,tc_set(Z)) | c_less(X,Y,tc_set(Z)) | equal(X,Y).
% 561201 [] c_lessequals(X,X,tc_set(Y)).
% 562250 [] c_in(c_^zorn_^o^t^fin__linear__lemma1__1(X,Y,Z),c_^zorn_^o^t^fin(X,Z),tc_set(tc_set(Z))) | c_lessequals(c_^zorn_^osucc(X,Y,Z),U,tc_set(tc_set(Z))) | -c_in(Y,c_^zorn_^o^t^fin(X,Z),tc_set(tc_set(Z))) | -c_in(U,c_^zorn_^o^t^fin(X,Z),tc_set(tc_set(Z))) | c_lessequals(U,Y,tc_set(tc_set(Z))).
% 562251 [] c_lessequals(c_^zorn_^o^t^fin__linear__lemma1__1(X,Y,Z),Y,tc_set(tc_set(Z))) | c_lessequals(c_^zorn_^osucc(X,Y,Z),U,tc_set(tc_set(Z))) | -c_in(Y,c_^zorn_^o^t^fin(X,Z),tc_set(tc_set(Z))) | -c_in(U,c_^zorn_^o^t^fin(X,Z),tc_set(tc_set(Z))) | c_lessequals(U,Y,tc_set(tc_set(Z))).
% 562252 [] c_lessequals(c_^zorn_^osucc(X,Y,Z),U,tc_set(tc_set(Z))) | -c_in(Y,c_^zorn_^o^t^fin(X,Z),tc_set(tc_set(Z))) | -c_in(U,c_^zorn_^o^t^fin(X,Z),tc_set(tc_set(Z))) | c_lessequals(U,Y,tc_set(tc_set(Z))) | -equal(c_^zorn_^o^t^fin__linear__lemma1__1(X,Y,Z),Y).
% 562253 [] -c_lessequals(c_^zorn_^osucc(X,c_^zorn_^o^t^fin__linear__lemma1__1(X,Y,Z),Z),Y,tc_set(tc_set(Z))) | c_lessequals(c_^zorn_^osucc(X,Y,Z),U,tc_set(tc_set(Z))) | -c_in(Y,c_^zorn_^o^t^fin(X,Z),tc_set(tc_set(Z))) | -c_in(U,c_^zorn_^o^t^fin(X,Z),tc_set(tc_set(Z))) | c_lessequals(U,Y,tc_set(tc_set(Z))).
% 562258 [] c_in(v_x,c_^zorn_^o^t^fin(v_^s,t_a),tc_set(tc_set(t_a))).
% 562259 [] c_in(v_xa,c_^zorn_^o^t^fin(v_^s,t_a),tc_set(tc_set(t_a))).
% 562260 [] c_lessequals(v_xa,c_^zorn_^osucc(v_^s,v_x,t_a),tc_set(tc_set(t_a))).
% 562261 [] -equal(v_xa,c_^zorn_^osucc(v_^s,v_x,t_a)).
% 562262 [] -c_lessequals(c_^zorn_^osucc(v_^s,v_xa,t_a),c_^zorn_^osucc(v_^s,v_x,t_a),tc_set(tc_set(t_a))).
% 562263 [] c_lessequals(c_^zorn_^osucc(v_^s,X,t_a),v_x,tc_set(tc_set(t_a))) | -c_in(X,c_^zorn_^o^t^fin(v_^s,t_a),tc_set(tc_set(t_a))) | -c_lessequals(X,v_x,tc_set(tc_set(t_a))) | equal(X,v_x).
% 562281 [binary:562259,562263.2,cut:493111] -c_lessequals(v_xa,v_x,tc_set(tc_set(t_a))) | equal(v_xa,v_x).
% 562286 [para:562281.2.1,562262.1.1.2,cut:561201] -c_lessequals(v_xa,v_x,tc_set(tc_set(t_a))).
% 575724 [binary:562260,561193,cut:562261] c_less(v_xa,c_^zorn_^osucc(v_^s,v_x,t_a),tc_set(tc_set(t_a))).
% 576199 [binary:561191.2,575724] -c_lessequals(c_^zorn_^osucc(v_^s,v_x,t_a),v_xa,tc_set(tc_set(t_a))).
% 579775 [binary:576199,562250.2,cut:562258,cut:562259,cut:562286] c_in(c_^zorn_^o^t^fin__linear__lemma1__1(v_^s,v_x,t_a),c_^zorn_^o^t^fin(v_^s,t_a),tc_set(tc_set(t_a))).
% 579973 [binary:576199,562251.2,cut:562258,cut:562259,cut:562286] c_lessequals(c_^zorn_^o^t^fin__linear__lemma1__1(v_^s,v_x,t_a),v_x,tc_set(tc_set(t_a))).
% 580099 [binary:576199,562252,cut:562258,cut:562259,cut:562286] -equal(c_^zorn_^o^t^fin__linear__lemma1__1(v_^s,v_x,t_a),v_x).
% 580165 [binary:576199,562253.2,cut:562258,cut:562259,cut:562286] -c_lessequals(c_^zorn_^osucc(v_^s,c_^zorn_^o^t^fin__linear__lemma1__1(v_^s,v_x,t_a),t_a),v_x,tc_set(tc_set(t_a))).
% 580314 [binary:562263.4,580099,cut:579973,cut:579775,cut:580165] contradiction
% END OF PROOF
% 
% Proof found by the following strategy:
% 
% using binary resolution
% not using sos strategy
% using double 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 9
% clause depth limited to 4
% seconds given: 11
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    8388
%  derived clauses:   1332516
%  kept clauses:      128743
%  kept size sum:     813624
%  kept mid-nuclei:   46196
%  kept new demods:   89
%  forw unit-subs:    104362
%  forw double-subs: 11267
%  forw overdouble-subs: 1381
%  backward subs:     75
%  fast unit cutoff:  32177
%  full unit cutoff:  2351
%  dbl  unit cutoff:  10
%  real runtime  :  60.71
%  process. runtime:  60.50
% specific non-discr-tree subsumption statistics: 
%  tried:           38144
%  length fails:    1902
%  strength fails:  5331
%  predlist fails:  9530
%  aux str. fails:  2137
%  by-lit fails:    2311
%  full subs tried: 10553
%  full subs fail:  9344
% 
% ; program args: ("/home/graph/tptp/Systems/Gandalf---c-2.6/gandalf" "-time" "600" "/tmp/SystemOnTPTP32209/SET/SET853-1+eq_r.in")
% WARNING: TreeLimitedRun lost 59.83s, total lost is 59.83s
% Killed 1 orphans
% 
%------------------------------------------------------------------------------