TSTP Solution File: SET820-2 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SET820-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 : art03.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2793MHz
% Memory : 1003MB
% OS : Linux 2.6.11-1.1369_FC4
% CPULimit : 600s
% Result : Unsatisfiable 19.8s
% Output : Assurance 19.8s
% 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/SystemOnTPTP19869/SET/SET820-2+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: neq
% detected subclass: small
%
% strategies selected:
% (hyper 27 #f 2 5)
% (binary-unit 10 #f 2 5)
% (binary-double 10 #f 2 5)
% (binary-double 16 #f)
% (binary-double 10 #t)
% (binary 16 #t 2 5)
% (binary-order 27 #f 2 5)
% (binary-posweight-order 125 #f)
% (binary-posweight-lex-big-order 43 #f)
% (binary-posweight-lex-small-order 16 #f)
% (binary-order-sos 54 #t)
% (binary-unit-uniteq 54 #f)
% (binary-weightorder 65 #f)
% (binary-order 27 #f)
% (hyper-order 37 #f)
% (binary 63 #t)
%
%
% **** EMPTY CLAUSE DERIVED ****
%
%
% timer checkpoints: c(7,40,0,14,0,0,17,50,0,24,0,0,40,50,0,47,0,0,82,50,0,89,0,0,173,50,1,180,0,1,414,50,3,421,0,3,1293,50,16,1300,0,16,4454,50,91,4461,0,91,15351,50,800,15358,0,800,33178,4,2226)
%
%
% START OF PROOF
% 15353 [] -c_in(X,c_emptyset,Y).
% 15354 [] c_in(X,c_insert(X,Y,Z),Z).
% 15355 [] -c_in(X,c_insert(Y,Z,U),U) | c_in(X,Z,U) | equal(X,Y).
% 15356 [] v_^p(v_a).
% 15357 [] c_in(v_x(X),X,tc_^int^def_^oint) | -c_in(Y,X,tc_^int^def_^oint).
% 15358 [] -v_^p(v_x(X)) | -c_in(Y,X,tc_^int^def_^oint).
% 15359 [hyper:15357,15354] c_in(v_x(c_insert(X,Y,tc_^int^def_^oint)),c_insert(X,Y,tc_^int^def_^oint),tc_^int^def_^oint).
% 15364 [hyper:15355,15359] c_in(v_x(c_insert(X,Y,tc_^int^def_^oint)),Y,tc_^int^def_^oint) | equal(v_x(c_insert(X,Y,tc_^int^def_^oint)),X).
% 15371 [hyper:15355,15364] c_in(v_x(c_insert(X,c_insert(Y,Z,tc_^int^def_^oint),tc_^int^def_^oint)),Z,tc_^int^def_^oint) | equal(v_x(c_insert(X,c_insert(Y,Z,tc_^int^def_^oint),tc_^int^def_^oint)),Y) | equal(v_x(c_insert(X,c_insert(Y,Z,tc_^int^def_^oint),tc_^int^def_^oint)),X).
% 15383 [hyper:15355,15371] c_in(v_x(c_insert(X,c_insert(Y,c_insert(Z,U,tc_^int^def_^oint),tc_^int^def_^oint),tc_^int^def_^oint)),U,tc_^int^def_^oint) | equal(v_x(c_insert(X,c_insert(Y,c_insert(Z,U,tc_^int^def_^oint),tc_^int^def_^oint),tc_^int^def_^oint)),Z) | equal(v_x(c_insert(X,c_insert(Y,c_insert(Z,U,tc_^int^def_^oint),tc_^int^def_^oint),tc_^int^def_^oint)),Y) | equal(v_x(c_insert(X,c_insert(Y,c_insert(Z,U,tc_^int^def_^oint),tc_^int^def_^oint),tc_^int^def_^oint)),X).
% 15425 [hyper:15355,15383,factor:factor:factor:factor:factor:factor:factor:factor:factor:factor] c_in(v_x(c_insert(X,c_insert(X,c_insert(X,c_insert(X,Y,tc_^int^def_^oint),tc_^int^def_^oint),tc_^int^def_^oint),tc_^int^def_^oint)),Y,tc_^int^def_^oint) | equal(v_x(c_insert(X,c_insert(X,c_insert(X,c_insert(X,Y,tc_^int^def_^oint),tc_^int^def_^oint),tc_^int^def_^oint),tc_^int^def_^oint)),X).
% 15457 [hyper:15355,15425,factor] c_in(v_x(c_insert(X,c_insert(X,c_insert(X,c_insert(X,c_insert(X,Y,tc_^int^def_^oint),tc_^int^def_^oint),tc_^int^def_^oint),tc_^int^def_^oint),tc_^int^def_^oint)),Y,tc_^int^def_^oint) | equal(v_x(c_insert(X,c_insert(X,c_insert(X,c_insert(X,c_insert(X,Y,tc_^int^def_^oint),tc_^int^def_^oint),tc_^int^def_^oint),tc_^int^def_^oint),tc_^int^def_^oint)),X).
% 15467 [hyper:15355,15457,factor] c_in(v_x(c_insert(X,c_insert(X,c_insert(X,c_insert(X,c_insert(X,c_insert(X,Y,tc_^int^def_^oint),tc_^int^def_^oint),tc_^int^def_^oint),tc_^int^def_^oint),tc_^int^def_^oint),tc_^int^def_^oint)),Y,tc_^int^def_^oint) | equal(v_x(c_insert(X,c_insert(X,c_insert(X,c_insert(X,c_insert(X,c_insert(X,Y,tc_^int^def_^oint),tc_^int^def_^oint),tc_^int^def_^oint),tc_^int^def_^oint),tc_^int^def_^oint),tc_^int^def_^oint)),X).
% 15482 [hyper:15355,15467] c_in(v_x(c_insert(X,c_insert(X,c_insert(X,c_insert(X,c_insert(X,c_insert(X,c_insert(Y,Z,tc_^int^def_^oint),tc_^int^def_^oint),tc_^int^def_^oint),tc_^int^def_^oint),tc_^int^def_^oint),tc_^int^def_^oint),tc_^int^def_^oint)),Z,tc_^int^def_^oint) | equal(v_x(c_insert(X,c_insert(X,c_insert(X,c_insert(X,c_insert(X,c_insert(X,c_insert(Y,Z,tc_^int^def_^oint),tc_^int^def_^oint),tc_^int^def_^oint),tc_^int^def_^oint),tc_^int^def_^oint),tc_^int^def_^oint),tc_^int^def_^oint)),Y) | equal(v_x(c_insert(X,c_insert(X,c_insert(X,c_insert(X,c_insert(X,c_insert(X,c_insert(Y,Z,tc_^int^def_^oint),tc_^int^def_^oint),tc_^int^def_^oint),tc_^int^def_^oint),tc_^int^def_^oint),tc_^int^def_^oint),tc_^int^def_^oint)),X).
% 15721 [hyper:15355,15482,factor:factor:factor:factor] c_in(v_x(c_insert(X,c_insert(X,c_insert(X,c_insert(X,c_insert(X,c_insert(X,c_insert(X,c_insert(X,Y,tc_^int^def_^oint),tc_^int^def_^oint),tc_^int^def_^oint),tc_^int^def_^oint),tc_^int^def_^oint),tc_^int^def_^oint),tc_^int^def_^oint),tc_^int^def_^oint)),Y,tc_^int^def_^oint) | equal(v_x(c_insert(X,c_insert(X,c_insert(X,c_insert(X,c_insert(X,c_insert(X,c_insert(X,c_insert(X,Y,tc_^int^def_^oint),tc_^int^def_^oint),tc_^int^def_^oint),tc_^int^def_^oint),tc_^int^def_^oint),tc_^int^def_^oint),tc_^int^def_^oint),tc_^int^def_^oint)),X).
% 15847 [hyper:15357,15721] equal(v_x(c_insert(X,c_insert(X,c_insert(X,c_insert(X,c_insert(X,c_insert(X,c_insert(X,c_insert(X,Y,tc_^int^def_^oint),tc_^int^def_^oint),tc_^int^def_^oint),tc_^int^def_^oint),tc_^int^def_^oint),tc_^int^def_^oint),tc_^int^def_^oint),tc_^int^def_^oint)),X) | c_in(v_x(Y),Y,tc_^int^def_^oint).
% 54869 [para:15847.1.1,15358.1.1,slowcut:15359,slowcut:15353,slowcut:15356] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% not using sos strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% clause length limited to 5
% clause depth limited to 10
% seconds given: 27
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 5648
% derived clauses: 71839
% kept clauses: 8199
% kept size sum: 682811
% kept mid-nuclei: 8240
% kept new demods: 36
% forw unit-subs: 712
% forw double-subs: 6413
% forw overdouble-subs: 22090
% backward subs: 0
% fast unit cutoff: 0
% full unit cutoff: 9093
% dbl unit cutoff: 0
% real runtime : 23.59
% process. runtime: 23.40
% specific non-discr-tree subsumption statistics:
% tried: 1091586
% length fails: 7628
% strength fails: 176730
% predlist fails: 167776
% aux str. fails: 65401
% by-lit fails: 43
% full subs tried: 674008
% full subs fail: 648356
%
% ; program args: ("/home/graph/tptp/Systems/Gandalf---c-2.6/gandalf" "-time" "600" "/tmp/SystemOnTPTP19869/SET/SET820-2+eq_r.in")
% WARNING: TreeLimitedRun lost 19.82s, total lost is 19.82s
%
%------------------------------------------------------------------------------