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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SET851-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 : art09.cs.miami.edu
% Model    : i686 i686
% CPU      : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2793MHz
% Memory   : 1003MB
% OS       : Linux 2.6.11-1.1369_FC4
% CPULimit : 600s

% Result   : Unsatisfiable 10.0s
% Output   : Assurance 10.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: /tmp/SystemOnTPTP7952/SET/SET851-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 7)
% (binary-unit 28 #f 4 7)
% (binary-double 11 #f 4 7)
% (binary-double 17 #f)
% (binary-double 17 #t)
% (binary 87 #t 4 7)
% (binary-order 28 #f 4 7)
% (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)
% 
% 
% SOS clause 
% c_lessequals(c_^zorn_^osucc(v_^s,v_m,t_a),v_x,tc_set(tc_set(t_a))) | c_lessequals(v_x,v_m,tc_set(tc_set(t_a))).
% was split for some strategies as: 
% c_lessequals(c_^zorn_^osucc(v_^s,v_m,t_a),v_x,tc_set(tc_set(t_a))).
% c_lessequals(v_x,v_m,tc_set(tc_set(t_a))).
% 
% ********* EMPTY CLAUSE DERIVED *********
% 
% 
% timer checkpoints: c(1368,40,6,2736,0,13,103037,4,989,112868,5,1314,112869,1,1314,112869,50,1320,112869,40,1320,114237,0,1321)
% 
% 
% START OF PROOF
% 113180 [] c_lessequals(X,X,tc_set(Y)).
% 114231 [] c_lessequals(X,c_^zorn_^osucc(Y,Z,U),tc_set(tc_set(U))) | -c_lessequals(X,Z,tc_set(tc_set(U))).
% 114233 [] c_in(v_x,c_^zorn_^o^t^fin(v_^s,t_a),tc_set(tc_set(t_a))).
% 114234 [] -c_lessequals(c_^zorn_^osucc(v_^s,v_x,t_a),v_m,tc_set(tc_set(t_a))).
% 114235 [] -c_lessequals(c_^zorn_^osucc(v_^s,v_m,t_a),c_^zorn_^osucc(v_^s,v_x,t_a),tc_set(tc_set(t_a))).
% 114236 [] c_lessequals(c_^zorn_^osucc(v_^s,v_m,t_a),v_x,tc_set(tc_set(t_a))) | c_lessequals(v_x,v_m,tc_set(tc_set(t_a))).
% 114237 [] c_lessequals(c_^zorn_^osucc(v_^s,X,t_a),v_m,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_m,tc_set(tc_set(t_a))) | equal(X,v_m).
% 114254 [binary:114233,114237.2,cut:114234] -c_lessequals(v_x,v_m,tc_set(tc_set(t_a))) | equal(v_x,v_m).
% 114259 [para:114254.2.1,114235.1.2.2,cut:113180] -c_lessequals(v_x,v_m,tc_set(tc_set(t_a))).
% 114263 [binary:114236.2,114259] c_lessequals(c_^zorn_^osucc(v_^s,v_m,t_a),v_x,tc_set(tc_set(t_a))).
% 121582 [binary:114235,114231,cut:114263] contradiction
% END OF PROOF
% 
% Proof found by the following strategy:
% 
% using binary resolution
% not using sos strategy
% using unit 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 7
% clause depth limited to 4
% seconds given: 13
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    3681
%  derived clauses:   327478
%  kept clauses:      83149
%  kept size sum:     83796
%  kept mid-nuclei:   5750
%  kept new demods:   54
%  forw unit-subs:    83342
%  forw double-subs: 1584
%  forw overdouble-subs: 563
%  backward subs:     64
%  fast unit cutoff:  531
%  full unit cutoff:  133
%  dbl  unit cutoff:  1
%  real runtime  :  14.64
%  process. runtime:  14.61
% specific non-discr-tree subsumption statistics: 
%  tried:           2370
%  length fails:    63
%  strength fails:  137
%  predlist fails:  613
%  aux str. fails:  73
%  by-lit fails:    126
%  full subs tried: 1182
%  full subs fail:  638
% 
% ; program args: ("/home/graph/tptp/Systems/Gandalf---c-2.6/gandalf" "-time" "600" "/tmp/SystemOnTPTP7952/SET/SET851-1+eq_r.in")
% WARNING: TreeLimitedRun lost 9.96s, total lost is 9.96s
% 
%------------------------------------------------------------------------------