TSTP Solution File: SET864-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SET864-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 : art08.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/SystemOnTPTP19351/SET/SET864-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)
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(1367,40,6,2734,0,12)
%
%
% START OF PROOF
% 1368 [] equal(X,X).
% 1525 [] -c_in(X,c_minus(Y,Z,tc_set(U)),U) | -c_in(X,Z,U).
% 1527 [] c_in(X,c_minus(Y,Z,tc_set(U)),U) | -c_in(X,Y,U) | c_in(X,Z,U).
% 2727 [] -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).
% 2729 [] c_in(v_c,c_^zorn_^omaxchain(v_^s,t_a),tc_set(tc_set(t_a))).
% 2731 [] c_in(c_^union(v_c,t_a),v_^s,tc_set(t_a)).
% 2732 [] c_in(v_x(X),v_^s,tc_set(t_a)) | -c_in(X,v_^s,tc_set(t_a)).
% 2733 [] c_lessequals(X,v_x(X),tc_set(t_a)) | -c_in(X,v_^s,tc_set(t_a)).
% 2734 [] -c_in(X,v_^s,tc_set(t_a)) | -equal(X,v_x(X)).
% 2754 [hyper:2732,2731] c_in(v_x(c_^union(v_c,t_a)),v_^s,tc_set(t_a)).
% 2755 [hyper:2733,2731] c_lessequals(c_^union(v_c,t_a),v_x(c_^union(v_c,t_a)),tc_set(t_a)).
% 2759 [hyper:1527,2731] c_in(c_^union(v_c,t_a),c_minus(v_^s,X,tc_set(tc_set(t_a))),tc_set(t_a)) | c_in(c_^union(v_c,t_a),X,tc_set(t_a)).
% 2890 [hyper:2727,2755,2754,cut:2729] equal(c_^union(v_c,t_a),v_x(c_^union(v_c,t_a))).
% 4036 [hyper:2734,2759,demod:2890,cut:1368] c_in(c_^union(v_c,t_a),c_minus(v_^s,v_^s,tc_set(tc_set(t_a))),tc_set(t_a)).
% 4120 [hyper:1525,4036,cut:2731] 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: 28
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 625
% derived clauses: 4652
% kept clauses: 414
% kept size sum: 6141
% kept mid-nuclei: 569
% kept new demods: 17
% forw unit-subs: 2449
% forw double-subs: 48
% forw overdouble-subs: 2
% backward subs: 13
% fast unit cutoff: 27
% full unit cutoff: 2
% dbl unit cutoff: 0
% real runtime : 0.34
% process. runtime: 0.33
% specific non-discr-tree subsumption statistics:
% tried: 37
% length fails: 0
% strength fails: 1
% predlist fails: 2
% aux str. fails: 0
% by-lit fails: 0
% full subs tried: 34
% full subs fail: 32
%
% ; program args: ("/home/graph/tptp/Systems/Gandalf---c-2.6/gandalf" "-time" "600" "/tmp/SystemOnTPTP19351/SET/SET864-1+eq_r.in")
% Killed 1 orphans
%
%------------------------------------------------------------------------------