TSTP Solution File: SET858-2 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SET858-2 : 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 0.0s
% Output : Assurance 0.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/SystemOnTPTP32546/SET/SET858-2+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: neq
% detected subclass: medium
%
% strategies selected:
% (hyper 25 #f 3 9)
% (binary-unit 9 #f 3 9)
% (binary-double 9 #f 3 9)
% (binary-double 15 #f)
% (binary-double 15 #t)
% (binary 50 #t 3 9)
% (binary-order 25 #f 3 9)
% (binary-posweight-order 101 #f)
% (binary-posweight-lex-big-order 25 #f)
% (binary-posweight-lex-small-order 9 #f)
% (binary-order-sos 50 #t)
% (binary-unit-uniteq 25 #f)
% (binary-weightorder 50 #f)
% (binary-order 50 #f)
% (hyper-order 30 #f)
% (binary 112 #t)
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(12,40,0,24,0,0)
%
%
% START OF PROOF
% 14 [] -c_lessequals(U,X,tc_set(Z)) | -c_lessequals(X,Y,tc_set(Z)) | c_lessequals(U,Y,tc_set(Z)).
% 15 [] c_lessequals(X,c_^zorn_^osucc(Y,X,Z),tc_set(tc_set(Z))).
% 16 [] 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))).
% 17 [] 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))).
% 18 [] 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).
% 19 [] -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))).
% 20 [] 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).
% 21 [] c_in(v_m,c_^zorn_^o^t^fin(v_^s,t_a),tc_set(tc_set(t_a))).
% 22 [] c_in(v_n,c_^zorn_^o^t^fin(v_^s,t_a),tc_set(tc_set(t_a))).
% 23 [] -c_lessequals(v_n,v_m,tc_set(tc_set(t_a))).
% 24 [] -c_lessequals(v_m,v_n,tc_set(tc_set(t_a))).
% 39 [hyper:16,22,21,cut:24] c_in(c_^zorn_^o^t^fin__linear__lemma1__1(v_^s,v_n,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_n,t_a),v_m,tc_set(tc_set(t_a))).
% 44 [hyper:17,22,21,cut:24] c_lessequals(c_^zorn_^osucc(v_^s,v_n,t_a),v_m,tc_set(tc_set(t_a))) | c_lessequals(c_^zorn_^o^t^fin__linear__lemma1__1(v_^s,v_n,t_a),v_n,tc_set(tc_set(t_a))).
% 73 [hyper:14,44,15,cut:23] c_lessequals(c_^zorn_^o^t^fin__linear__lemma1__1(v_^s,v_n,t_a),v_n,tc_set(tc_set(t_a))).
% 139 [hyper:14,39,15,cut:23] c_in(c_^zorn_^o^t^fin__linear__lemma1__1(v_^s,v_n,t_a),c_^zorn_^o^t^fin(v_^s,t_a),tc_set(tc_set(t_a))).
% 182 [hyper:20,139,73,cut:22] c_lessequals(c_^zorn_^osucc(v_^s,c_^zorn_^o^t^fin__linear__lemma1__1(v_^s,v_n,t_a),t_a),v_n,tc_set(tc_set(t_a))) | equal(c_^zorn_^o^t^fin__linear__lemma1__1(v_^s,v_n,t_a),v_n).
% 200 [hyper:19,182,21,cut:22,cut:24] c_lessequals(c_^zorn_^osucc(v_^s,v_n,t_a),v_m,tc_set(tc_set(t_a))) | equal(c_^zorn_^o^t^fin__linear__lemma1__1(v_^s,v_n,t_a),v_n).
% 211 [hyper:18,200,21,cut:22,cut:24] c_lessequals(c_^zorn_^osucc(v_^s,v_n,t_a),v_m,tc_set(tc_set(t_a))).
% 230 [hyper:14,211,15,cut:23] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using hyperresolution
% not using sos strategy
% using positive unit paramodulation strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% clause length limited to 9
% clause depth limited to 3
% seconds given: 25
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 26
% derived clauses: 347
% kept clauses: 54
% kept size sum: 1252
% kept mid-nuclei: 142
% kept new demods: 1
% forw unit-subs: 79
% forw double-subs: 10
% forw overdouble-subs: 23
% backward subs: 5
% fast unit cutoff: 25
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 0.2
% process. runtime: 0.1
% specific non-discr-tree subsumption statistics:
% tried: 188
% length fails: 0
% strength fails: 81
% predlist fails: 69
% aux str. fails: 0
% by-lit fails: 0
% full subs tried: 15
% full subs fail: 15
%
% ; program args: ("/home/graph/tptp/Systems/Gandalf---c-2.6/gandalf" "-time" "600" "/tmp/SystemOnTPTP32546/SET/SET858-2+eq_r.in")
%
%------------------------------------------------------------------------------