TSTP Solution File: SET858-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SET858-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 : art10.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 84.7s
% Output : Assurance 84.7s
% 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/SystemOnTPTP6298/SET/SET858-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(1369,40,6,2738,0,12,461896,4,2122,479768,5,2813,479768,1,2813,479768,50,2819,479768,40,2819,481137,0,2825,517717,3,4226,519529,4,4926,532495,5,5626,532496,5,5627,532496,1,5627,532496,50,5631,532496,40,5631,533865,0,5632,554362,3,6184,560521,4,6459,570814,5,6733,570816,1,6733,570816,50,6736,570816,40,6736,572185,0,6737,612857,3,7588,639816,4,8013,653456,5,8438,653456,5,8439,653457,1,8439,653457,50,8446,653457,40,8446,654826,0,8447)
%
%
% START OF PROOF
% 654816 [] -c_lessequals(X,Y,tc_set(Z)) | -c_lessequals(Y,U,tc_set(Z)) | c_lessequals(X,U,tc_set(Z)).
% 654817 [] c_lessequals(X,c_^zorn_^osucc(Y,X,Z),tc_set(tc_set(Z))).
% 654818 [] 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))).
% 654819 [] 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))).
% 654820 [] 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).
% 654821 [] -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))).
% 654822 [] 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(Y,U,tc_set(tc_set(Z))) | equal(Y,U).
% 654823 [] c_in(v_m,c_^zorn_^o^t^fin(v_^s,t_a),tc_set(tc_set(t_a))).
% 654824 [] c_in(v_n,c_^zorn_^o^t^fin(v_^s,t_a),tc_set(tc_set(t_a))).
% 654825 [] -c_lessequals(v_n,v_m,tc_set(tc_set(t_a))).
% 654826 [] -c_lessequals(v_m,v_n,tc_set(tc_set(t_a))).
% 654854 [binary:654816.3,654826] -c_lessequals(X,v_n,tc_set(tc_set(t_a))) | -c_lessequals(v_m,X,tc_set(tc_set(t_a))).
% 654882 [binary:654818.3,654823] c_in(c_^zorn_^o^t^fin__linear__lemma1__1(v_^s,v_m,t_a),c_^zorn_^o^t^fin(v_^s,t_a),tc_set(tc_set(t_a))) | c_lessequals(c_^zorn_^osucc(v_^s,v_m,t_a),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_m,tc_set(tc_set(t_a))).
% 654884 [binary:654819.3,654823] c_lessequals(c_^zorn_^o^t^fin__linear__lemma1__1(v_^s,v_m,t_a),v_m,tc_set(tc_set(t_a))) | c_lessequals(c_^zorn_^osucc(v_^s,v_m,t_a),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_m,tc_set(tc_set(t_a))).
% 654886 [binary:654820.2,654823] -equal(c_^zorn_^o^t^fin__linear__lemma1__1(v_^s,v_m,t_a),v_m) | c_lessequals(c_^zorn_^osucc(v_^s,v_m,t_a),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_m,tc_set(tc_set(t_a))).
% 654888 [binary:654821.3,654823] -c_lessequals(c_^zorn_^osucc(v_^s,c_^zorn_^o^t^fin__linear__lemma1__1(v_^s,v_m,t_a),t_a),v_m,tc_set(tc_set(t_a))) | c_lessequals(c_^zorn_^osucc(v_^s,v_m,t_a),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_m,tc_set(tc_set(t_a))).
% 654891 [binary:654822.3,654823] 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).
% 657262 [binary:654817,654854.2] -c_lessequals(c_^zorn_^osucc(X,v_m,t_a),v_n,tc_set(tc_set(t_a))).
% 662303 [binary:654825,654882.4,cut:654824,cut:657262] c_in(c_^zorn_^o^t^fin__linear__lemma1__1(v_^s,v_m,t_a),c_^zorn_^o^t^fin(v_^s,t_a),tc_set(tc_set(t_a))).
% 662754 [binary:654825,654884.4,cut:654824,cut:657262] c_lessequals(c_^zorn_^o^t^fin__linear__lemma1__1(v_^s,v_m,t_a),v_m,tc_set(tc_set(t_a))).
% 662968 [binary:654825,654886.4,cut:654824,cut:657262] -equal(c_^zorn_^o^t^fin__linear__lemma1__1(v_^s,v_m,t_a),v_m).
% 663451 [binary:654825,654888.4,cut:654824,cut:657262] -c_lessequals(c_^zorn_^osucc(v_^s,c_^zorn_^o^t^fin__linear__lemma1__1(v_^s,v_m,t_a),t_a),v_m,tc_set(tc_set(t_a))).
% 664141 [binary:662754,654891.3,cut:662303,cut:663451,cut:662968] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% 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
% seconds given: 17
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 11477
% derived clauses: 1499545
% kept clauses: 203207
% kept size sum: 194048
% kept mid-nuclei: 41247
% kept new demods: 138
% forw unit-subs: 146697
% forw double-subs: 25333
% forw overdouble-subs: 2200
% backward subs: 106
% fast unit cutoff: 11197
% full unit cutoff: 6116
% dbl unit cutoff: 7
% real runtime : 85.67
% process. runtime: 85.29
% specific non-discr-tree subsumption statistics:
% tried: 73086
% length fails: 1662
% strength fails: 3476
% predlist fails: 21812
% aux str. fails: 1867
% by-lit fails: 3339
% full subs tried: 28758
% full subs fail: 26561
%
% ; program args: ("/home/graph/tptp/Systems/Gandalf---c-2.6/gandalf" "-time" "600" "/tmp/SystemOnTPTP6298/SET/SET858-1+eq_r.in")
% WARNING: TreeLimitedRun lost 84.68s, total lost is 84.68s
%
%------------------------------------------------------------------------------