TSTP Solution File: SET865-2 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SET865-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 : art01.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/SystemOnTPTP29410/SET/SET865-2+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: long
%
% strategies selected:
% (hyper 57 #f 4 7)
% (binary-posweight-order 28 #f 4 7)
% (binary-unit 28 #f 4 7)
% (hyper 188 #f)
% (binary-unit-uniteq 16 #f)
% (binary-weightorder 22 #f)
% (binary-posweight-order 114 #f)
% (binary-posweight-lex-big-order 28 #f)
% (binary-posweight-lex-small-order 11 #f)
% (binary-order 28 #f)
% (binary 22 #t)
% (binary-unit 58 #f)
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(9,40,0,18,0,0)
%
%
% START OF PROOF
% 11 [] -c_lessequals(X,Y,tc_set(Z)) | -c_in(U,X,Z) | c_in(U,Y,Z).
% 12 [] c_in(c_^zorn_^o^hausdorff__1(X,Y),c_^zorn_^omaxchain(X,Y),tc_set(tc_set(Y))).
% 13 [] -c_in(X,c_^zorn_^omaxchain(Y,Z),tc_set(tc_set(Z))) | -c_lessequals(c_^union(X,Z),U,tc_set(Z)) | -c_in(U,Y,tc_set(Z)) | equal(c_^union(X,Z),U).
% 14 [] c_lessequals(c_^zorn_^omaxchain(X,Y),c_^zorn_^ochain(X,Y),tc_set(tc_set(tc_set(Y)))).
% 15 [] -c_in(X,c_^zorn_^ochain(v_^s,t_a),tc_set(tc_set(t_a))) | c_in(c_^union(X,t_a),v_^s,tc_set(t_a)).
% 16 [] c_in(v_x(X),v_^s,tc_set(t_a)) | -c_in(X,v_^s,tc_set(t_a)).
% 17 [] c_lessequals(X,v_x(X),tc_set(t_a)) | -c_in(X,v_^s,tc_set(t_a)).
% 18 [] -c_in(X,v_^s,tc_set(t_a)) | -equal(X,v_x(X)).
% 25 [hyper:11,14,12] c_in(c_^zorn_^o^hausdorff__1(X,Y),c_^zorn_^ochain(X,Y),tc_set(tc_set(Y))).
% 26 [hyper:15,25] c_in(c_^union(c_^zorn_^o^hausdorff__1(v_^s,t_a),t_a),v_^s,tc_set(t_a)).
% 31 [hyper:16,26] c_in(v_x(c_^union(c_^zorn_^o^hausdorff__1(v_^s,t_a),t_a)),v_^s,tc_set(t_a)).
% 32 [hyper:17,26] c_lessequals(c_^union(c_^zorn_^o^hausdorff__1(v_^s,t_a),t_a),v_x(c_^union(c_^zorn_^o^hausdorff__1(v_^s,t_a),t_a)),tc_set(t_a)).
% 43 [hyper:13,32,31,cut:12] equal(c_^union(c_^zorn_^o^hausdorff__1(v_^s,t_a),t_a),v_x(c_^union(c_^zorn_^o^hausdorff__1(v_^s,t_a),t_a))).
% 47 [hyper:18,43,cut:26] 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 7
% clause depth limited to 4
% seconds given: 57
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 13
% derived clauses: 40
% kept clauses: 5
% kept size sum: 55
% kept mid-nuclei: 18
% kept new demods: 1
% forw unit-subs: 4
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 0
% fast unit cutoff: 2
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 0.1
% process. runtime: 0.0
% specific non-discr-tree subsumption statistics:
% tried: 4
% length fails: 0
% strength fails: 0
% predlist fails: 4
% aux str. fails: 0
% by-lit fails: 0
% full subs tried: 0
% full subs fail: 0
%
% ; program args: ("/home/graph/tptp/Systems/Gandalf---c-2.6/gandalf" "-time" "600" "/tmp/SystemOnTPTP29410/SET/SET865-2+eq_r.in")
%
%------------------------------------------------------------------------------