TSTP Solution File: SET822-2 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SET822-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 : art04.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 24.8s
% Output : Assurance 24.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/SystemOnTPTP7972/SET/SET822-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,27,50,0,34,0,0,47,50,0,54,0,0,84,50,0,91,0,0,175,50,1,182,0,1,506,50,4,513,0,4,1757,50,19,1764,0,19,6184,50,132,6191,0,132,19838,50,1184,19845,0,1184,37257,4,2310)
%
%
% START OF PROOF
% 19840 [] -c_in(X,c_emptyset,Y).
% 19841 [] c_in(X,c_insert(X,Y,Z),Z).
% 19842 [] -c_in(X,c_insert(Y,Z,U),U) | c_in(X,Z,U) | equal(X,Y).
% 19843 [] v_^p(v_f(v_b)).
% 19844 [] c_in(v_x(X,Y),Y,tc_^int^def_^oint) | -c_in(v_f(X),Y,tc_^int^def_^oint).
% 19845 [] -c_in(v_f(X),Y,tc_^int^def_^oint) | -v_^p(v_x(X,Y)).
% 19846 [hyper:19844,19841] c_in(v_x(X,c_insert(v_f(X),Y,tc_^int^def_^oint)),c_insert(v_f(X),Y,tc_^int^def_^oint),tc_^int^def_^oint).
% 19852 [hyper:19842,19846] c_in(v_x(X,c_insert(v_f(X),Y,tc_^int^def_^oint)),Y,tc_^int^def_^oint) | equal(v_x(X,c_insert(v_f(X),Y,tc_^int^def_^oint)),v_f(X)).
% 19855 [hyper:19842,19852] c_in(v_x(X,c_insert(v_f(X),c_insert(Y,Z,tc_^int^def_^oint),tc_^int^def_^oint)),Z,tc_^int^def_^oint) | equal(v_x(X,c_insert(v_f(X),c_insert(Y,Z,tc_^int^def_^oint),tc_^int^def_^oint)),v_f(X)) | equal(v_x(X,c_insert(v_f(X),c_insert(Y,Z,tc_^int^def_^oint),tc_^int^def_^oint)),Y).
% 19864 [hyper:19842,19855,factor:factor:factor:factor] c_in(v_x(X,c_insert(v_f(X),c_insert(v_f(X),c_insert(v_f(X),Y,tc_^int^def_^oint),tc_^int^def_^oint),tc_^int^def_^oint)),Y,tc_^int^def_^oint) | equal(v_x(X,c_insert(v_f(X),c_insert(v_f(X),c_insert(v_f(X),Y,tc_^int^def_^oint),tc_^int^def_^oint),tc_^int^def_^oint)),v_f(X)).
% 19870 [hyper:19842,19864,factor] c_in(v_x(X,c_insert(v_f(X),c_insert(v_f(X),c_insert(v_f(X),c_insert(v_f(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(X,c_insert(v_f(X),c_insert(v_f(X),c_insert(v_f(X),c_insert(v_f(X),Y,tc_^int^def_^oint),tc_^int^def_^oint),tc_^int^def_^oint),tc_^int^def_^oint)),v_f(X)).
% 19874 [hyper:19842,19870,factor] c_in(v_x(X,c_insert(v_f(X),c_insert(v_f(X),c_insert(v_f(X),c_insert(v_f(X),c_insert(v_f(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(X,c_insert(v_f(X),c_insert(v_f(X),c_insert(v_f(X),c_insert(v_f(X),c_insert(v_f(X),Y,tc_^int^def_^oint),tc_^int^def_^oint),tc_^int^def_^oint),tc_^int^def_^oint),tc_^int^def_^oint)),v_f(X)).
% 19905 [hyper:19842,19874,factor] c_in(v_x(X,c_insert(v_f(X),c_insert(v_f(X),c_insert(v_f(X),c_insert(v_f(X),c_insert(v_f(X),c_insert(v_f(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(X,c_insert(v_f(X),c_insert(v_f(X),c_insert(v_f(X),c_insert(v_f(X),c_insert(v_f(X),c_insert(v_f(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)),v_f(X)).
% 20025 [hyper:19842,19905,factor] c_in(v_x(X,c_insert(v_f(X),c_insert(v_f(X),c_insert(v_f(X),c_insert(v_f(X),c_insert(v_f(X),c_insert(v_f(X),c_insert(v_f(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)),Y,tc_^int^def_^oint) | equal(v_x(X,c_insert(v_f(X),c_insert(v_f(X),c_insert(v_f(X),c_insert(v_f(X),c_insert(v_f(X),c_insert(v_f(X),c_insert(v_f(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)),v_f(X)).
% 20031 [hyper:19842,20025,factor] c_in(v_x(X,c_insert(v_f(X),c_insert(v_f(X),c_insert(v_f(X),c_insert(v_f(X),c_insert(v_f(X),c_insert(v_f(X),c_insert(v_f(X),c_insert(v_f(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(X,c_insert(v_f(X),c_insert(v_f(X),c_insert(v_f(X),c_insert(v_f(X),c_insert(v_f(X),c_insert(v_f(X),c_insert(v_f(X),c_insert(v_f(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)),v_f(X)).
% 20241 [hyper:19840,20031] equal(v_x(X,c_insert(v_f(X),c_insert(v_f(X),c_insert(v_f(X),c_insert(v_f(X),c_insert(v_f(X),c_insert(v_f(X),c_insert(v_f(X),c_insert(v_f(X),c_emptyset,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)),v_f(X)).
% 60381 [para:20241.1.1,19845.2.1,cut:19841,slowcut:19843] 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 11
% seconds given: 27
%
%
% old unit clauses discarded
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 8182
% derived clauses: 85353
% kept clauses: 11099
% kept size sum: 0
% kept mid-nuclei: 677
% kept new demods: 36
% forw unit-subs: 660
% forw double-subs: 6490
% forw overdouble-subs: 20241
% backward subs: 3
% fast unit cutoff: 11846
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 25.14
% process. runtime: 24.95
% specific non-discr-tree subsumption statistics:
% tried: 754603
% length fails: 67887
% strength fails: 215735
% predlist fails: 1441
% aux str. fails: 39488
% by-lit fails: 31849
% full subs tried: 298784
% full subs fail: 274807
%
% ; program args: ("/home/graph/tptp/Systems/Gandalf---c-2.6/gandalf" "-time" "600" "/tmp/SystemOnTPTP7972/SET/SET822-2+eq_r.in")
% WARNING: TreeLimitedRun lost 24.83s, total lost is 24.83s
% Killed 1 orphans
%
%------------------------------------------------------------------------------