TSTP Solution File: SET821-2 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SET821-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 : art07.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 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/SystemOnTPTP30487/SET/SET821-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(11,40,0,22,0,0,1820,50,110,1831,0,110,11616,4,1838)
%
%
% START OF PROOF
% 1822 [] -c_less(X,X,Y) | -class_^orderings_^oorder(Y).
% 1823 [] -c_in(X,c_uminus(Y,tc_set(Z)),Z) | -c_in(X,Y,Z).
% 1824 [] c_in(X,c_uminus(Y,tc_set(Z)),Z) | c_in(X,Y,Z).
% 1825 [] c_in(X,c_insert(Y,Z,U),U) | -c_in(X,Z,U).
% 1826 [] c_in(X,c_insert(X,Y,Z),Z).
% 1827 [] -c_in(X,c_insert(Y,Z,U),U) | c_in(X,Z,U) | equal(X,Y).
% 1828 [] class_^orderings_^oorder(tc_^int^def_^oint).
% 1829 [] c_less(v_a,v_b,tc_^int^def_^oint).
% 1830 [] c_less(v_b,v_c,tc_^int^def_^oint).
% 1831 [] -c_in(v_b,X,tc_^int^def_^oint) | c_in(v_a,X,tc_^int^def_^oint) | c_in(v_c,X,tc_^int^def_^oint).
% 1837 [hyper:1825,1826] c_in(X,c_insert(Y,c_insert(X,Z,U),U),U).
% 1843 [hyper:1831,1824] c_in(v_a,c_uminus(X,tc_set(tc_^int^def_^oint)),tc_^int^def_^oint) | c_in(v_c,c_uminus(X,tc_set(tc_^int^def_^oint)),tc_^int^def_^oint) | c_in(v_b,X,tc_^int^def_^oint).
% 1847 [hyper:1823,1824,1826] c_in(X,c_uminus(c_uminus(c_insert(X,Y,Z),tc_set(Z)),tc_set(Z)),Z).
% 1848 [hyper:1825,1824] c_in(X,c_insert(Y,c_uminus(Z,tc_set(U)),U),U) | c_in(X,Z,U).
% 1850 [hyper:1827,1824] c_in(X,c_uminus(c_insert(Y,Z,U),tc_set(U)),U) | c_in(X,Z,U) | equal(X,Y).
% 1980 [hyper:1823,1843,1826] c_in(v_a,c_uminus(c_insert(v_c,X,tc_^int^def_^oint),tc_set(tc_^int^def_^oint)),tc_^int^def_^oint) | c_in(v_b,c_insert(v_c,X,tc_^int^def_^oint),tc_^int^def_^oint).
% 1988 [hyper:1827,1843] c_in(v_c,c_uminus(c_insert(X,Y,tc_^int^def_^oint),tc_set(tc_^int^def_^oint)),tc_^int^def_^oint) | c_in(v_a,c_uminus(c_insert(X,Y,tc_^int^def_^oint),tc_set(tc_^int^def_^oint)),tc_^int^def_^oint) | c_in(v_b,Y,tc_^int^def_^oint) | equal(v_b,X).
% 2496 [hyper:1823,1980,1848] c_in(v_b,c_insert(v_c,c_uminus(X,tc_set(tc_^int^def_^oint)),tc_^int^def_^oint),tc_^int^def_^oint) | c_in(v_a,X,tc_^int^def_^oint).
% 2566 [hyper:1827,2496] equal(v_b,v_c) | c_in(v_b,c_uminus(X,tc_set(tc_^int^def_^oint)),tc_^int^def_^oint) | c_in(v_a,X,tc_^int^def_^oint).
% 2601 [hyper:1823,2566,1850,factor] equal(v_b,v_c) | c_in(v_b,c_uminus(c_insert(v_c,X,tc_^int^def_^oint),tc_set(tc_^int^def_^oint)),tc_^int^def_^oint) | c_in(v_a,X,tc_^int^def_^oint).
% 3458 [hyper:1823,1988,2601] equal(v_b,v_c) | c_in(v_c,c_uminus(c_insert(X,c_insert(v_c,Y,tc_^int^def_^oint),tc_^int^def_^oint),tc_set(tc_^int^def_^oint)),tc_^int^def_^oint) | c_in(v_a,c_uminus(c_insert(X,c_insert(v_c,Y,tc_^int^def_^oint),tc_^int^def_^oint),tc_set(tc_^int^def_^oint)),tc_^int^def_^oint) | c_in(v_a,Y,tc_^int^def_^oint) | equal(v_b,X).
% 11622 [binary:1828,1822.2] -c_less(X,X,tc_^int^def_^oint).
% 19578 [binary:1847,1823] -c_in(X,c_uminus(c_insert(X,Y,Z),tc_set(Z)),Z).
% 19581 [binary:1837,1823.2] -c_in(X,c_uminus(c_insert(Y,c_insert(X,Z,U),U),tc_set(U)),U).
% 20582 [binary:3458.3,19578,cut:19581,slowcut:19581] equal(v_b,v_a) | equal(v_b,v_c).
% 22781 [para:20582.2.2,1830.1.2,cut:11622] equal(v_b,v_a).
% 26029 [para:22781.1.2,1829.1.1,cut:11622] 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 4
% seconds given: 25
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 1369
% derived clauses: 950752
% kept clauses: 16789
% kept size sum: 572821
% kept mid-nuclei: 6710
% kept new demods: 2
% forw unit-subs: 56426
% forw double-subs: 84400
% forw overdouble-subs: 141623
% backward subs: 966
% fast unit cutoff: 257
% full unit cutoff: 15
% dbl unit cutoff: 1
% real runtime : 21.86
% process. runtime: 21.66
% specific non-discr-tree subsumption statistics:
% tried: 4289030
% length fails: 595340
% strength fails: 753840
% predlist fails: 253226
% aux str. fails: 62569
% by-lit fails: 11183
% full subs tried: 2606803
% full subs fail: 2465134
%
% ; program args: ("/home/graph/tptp/Systems/Gandalf---c-2.6/gandalf" "-time" "600" "/tmp/SystemOnTPTP30487/SET/SET821-2+eq_r.in")
% WARNING: TreeLimitedRun lost 19.81s, total lost is 19.81s
%
%------------------------------------------------------------------------------