TSTP Solution File: SET860-2 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SET860-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 54.5s
% Output : Assurance 54.5s
% 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/SystemOnTPTP28802/SET/SET860-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 5)
% (binary-unit 9 #f 3 5)
% (binary-double 9 #f 3 5)
% (binary-double 15 #f)
% (binary-double 15 #t)
% (binary 50 #t 3 5)
% (binary-order 25 #f 3 5)
% (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(25,40,0,50,0,0,26802,4,1891,93884,5,2501,93884,1,2501,93884,50,2502,93884,40,2502,93909,0,2502,103701,3,2953,104576,4,3178,105352,5,3403,105352,1,3403,105352,50,3404,105352,40,3404,105377,0,3404,130763,3,3855,137600,4,4091,142404,5,4305,142405,5,4305,142405,1,4305,142405,50,4307,142405,40,4307,142430,0,4307,166966,3,5058,172082,4,5433,179320,5,5808,179320,5,5808,179320,1,5808,179320,50,5810,179320,40,5810,179345,0,5810)
%
%
% START OF PROOF
% 179322 [] -c_in(X,c_uminus(Y,tc_set(Z)),Z) | -c_in(X,Y,Z).
% 179323 [] c_in(X,c_uminus(Y,tc_set(Z)),Z) | c_in(X,Y,Z).
% 179332 [] c_in(c_^main_^o^union^e__1(X,Y,Z),Y,tc_set(Z)) | -c_in(X,c_^union(Y,Z),Z).
% 179333 [] c_in(X,c_^main_^o^union^e__1(X,Y,Z),Z) | -c_in(X,c_^union(Y,Z),Z).
% 179334 [] c_in(X,c_^union(Y,Z),Z) | -c_in(U,Y,tc_set(Z)) | -c_in(X,U,Z).
% 179339 [] -c_lessequals(X,Y,tc_set(Z)) | -c_in(U,X,Z) | c_in(U,Y,Z).
% 179340 [] c_in(c_^main_^osubset^i__1(X,Y,Z),X,Z) | c_lessequals(X,Y,tc_set(Z)).
% 179341 [] -c_in(c_^main_^osubset^i__1(X,Y,Z),Y,Z) | c_lessequals(X,Y,tc_set(Z)).
% 179343 [] -c_lessequals(c_^union(v_^c,t_a),v_^a,tc_set(t_a)).
% 179344 [] -c_lessequals(v_^b,c_^union(v_^c,t_a),tc_set(t_a)).
% 179345 [] -c_in(X,v_^c,tc_set(t_a)) | c_lessequals(X,v_^a,tc_set(t_a)) | c_lessequals(v_^b,X,tc_set(t_a)).
% 179347 [binary:179340.2,179343] c_in(c_^main_^osubset^i__1(c_^union(v_^c,t_a),v_^a,t_a),c_^union(v_^c,t_a),t_a).
% 179348 [binary:179341.2,179343] -c_in(c_^main_^osubset^i__1(c_^union(v_^c,t_a),v_^a,t_a),v_^a,t_a).
% 179350 [binary:179340.2,179344] c_in(c_^main_^osubset^i__1(v_^b,c_^union(v_^c,t_a),t_a),v_^b,t_a).
% 179351 [binary:179341.2,179344] -c_in(c_^main_^osubset^i__1(v_^b,c_^union(v_^c,t_a),t_a),c_^union(v_^c,t_a),t_a).
% 179358 [binary:179339.3,179348] -c_in(c_^main_^osubset^i__1(c_^union(v_^c,t_a),v_^a,t_a),X,t_a) | -c_lessequals(X,v_^a,tc_set(t_a)).
% 179365 [binary:179339.2,179350] c_in(c_^main_^osubset^i__1(v_^b,c_^union(v_^c,t_a),t_a),X,t_a) | -c_lessequals(v_^b,X,tc_set(t_a)).
% 179370 [binary:179332.2,179347] c_in(c_^main_^o^union^e__1(c_^main_^osubset^i__1(c_^union(v_^c,t_a),v_^a,t_a),v_^c,t_a),v_^c,tc_set(t_a)).
% 179371 [binary:179333.2,179347] c_in(c_^main_^osubset^i__1(c_^union(v_^c,t_a),v_^a,t_a),c_^main_^o^union^e__1(c_^main_^osubset^i__1(c_^union(v_^c,t_a),v_^a,t_a),v_^c,t_a),t_a).
% 179418 [binary:179334,179351] -c_in(c_^main_^osubset^i__1(v_^b,c_^union(v_^c,t_a),t_a),X,t_a) | -c_in(X,v_^c,tc_set(t_a)).
% 179662 [binary:179323.2,179358] c_in(c_^main_^osubset^i__1(c_^union(v_^c,t_a),v_^a,t_a),c_uminus(X,tc_set(t_a)),t_a) | -c_lessequals(X,v_^a,tc_set(t_a)).
% 179899 [binary:179345.3,179365.2,binarycut:179418] -c_in(X,v_^c,tc_set(t_a)) | c_lessequals(X,v_^a,tc_set(t_a)).
% 179932 [binary:179370,179899] c_lessequals(c_^main_^o^union^e__1(c_^main_^osubset^i__1(c_^union(v_^c,t_a),v_^a,t_a),v_^c,t_a),v_^a,tc_set(t_a)).
% 180153 [binary:179322.2,179371,binarydemod:179662,cut:179932] 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: 15
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 5955
% derived clauses: 1640501
% kept clauses: 116151
% kept size sum: 15433
% kept mid-nuclei: 50660
% kept new demods: 80
% forw unit-subs: 517635
% forw double-subs: 255423
% forw overdouble-subs: 120226
% backward subs: 613
% fast unit cutoff: 11325
% full unit cutoff: 2699
% dbl unit cutoff: 107
% real runtime : 58.66
% process. runtime: 58.13
% specific non-discr-tree subsumption statistics:
% tried: 5360829
% length fails: 902360
% strength fails: 2330448
% predlist fails: 638258
% aux str. fails: 157625
% by-lit fails: 52327
% full subs tried: 1144282
% full subs fail: 1024705
%
% ; program args: ("/home/graph/tptp/Systems/Gandalf---c-2.6/gandalf" "-time" "600" "/tmp/SystemOnTPTP28802/SET/SET860-2+eq_r.in")
% WARNING: TreeLimitedRun lost 54.51s, total lost is 54.51s
%
%------------------------------------------------------------------------------