TSTP Solution File: LAT274-2 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : LAT274-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 : art05.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2795MHz
% 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/SystemOnTPTP16115/LAT/LAT274-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 9)
% (binary-unit 9 #f 3 9)
% (binary-double 9 #f 3 9)
% (binary-double 15 #f)
% (binary-double 15 #t)
% (binary 50 #t 3 9)
% (binary-order 25 #f 3 9)
% (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(16,40,0,32,0,0)
%
%
% START OF PROOF
% 18 [] c_in(c_^pair(X,Y,t_a,t_a),v_r,tc_prod(t_a,t_a)) | c_in(v_sko__4mk(Y,Z,v_r),Z,t_a) | c_in(v_sko__4mj(Z,X,v_r),Z,t_a) | -c_lessequals(Z,U,tc_set(t_a)) | equal(Z,c_emptyset).
% 19 [] -c_in(c_^pair(v_sko__4mk(X,Y,v_r),X,t_a,t_a),v_r,tc_prod(t_a,t_a)) | c_in(c_^pair(Z,X,t_a,t_a),v_r,tc_prod(t_a,t_a)) | c_in(v_sko__4mj(Y,Z,v_r),Y,t_a) | -c_lessequals(Y,U,tc_set(t_a)) | equal(Y,c_emptyset).
% 20 [] -c_in(c_^pair(X,v_sko__4mj(Y,X,v_r),t_a,t_a),v_r,tc_prod(t_a,t_a)) | c_in(c_^pair(X,Z,t_a,t_a),v_r,tc_prod(t_a,t_a)) | c_in(v_sko__4mk(Z,Y,v_r),Y,t_a) | -c_lessequals(Y,U,tc_set(t_a)) | equal(Y,c_emptyset).
% 21 [] -c_in(c_^pair(X,v_sko__4mj(Y,X,v_r),t_a,t_a),v_r,tc_prod(t_a,t_a)) | -c_in(c_^pair(v_sko__4mk(Z,Y,v_r),Z,t_a,t_a),v_r,tc_prod(t_a,t_a)) | c_in(c_^pair(X,Z,t_a,t_a),v_r,tc_prod(t_a,t_a)) | -c_lessequals(Y,U,tc_set(t_a)) | equal(Y,c_emptyset).
% 22 [] c_in(c_^pair(X,Y,Z,Z),U,tc_prod(Z,Z)) | -c_lessequals(V,c_^tarski_^ointerval(U,X,W,Z),tc_set(Z)) | -c_in(Y,V,Z).
% 23 [] c_in(c_^pair(X,Y,Z,Z),U,tc_prod(Z,Z)) | -c_lessequals(V,c_^tarski_^ointerval(U,W,Y,Z),tc_set(Z)) | -c_in(X,V,Z).
% 24 [] -c_in(c_^pair(V,X,Z,Z),U,tc_prod(Z,Z)) | -c_in(c_^pair(X,Y,Z,Z),U,tc_prod(Z,Z)) | c_in(X,c_^tarski_^ointerval(U,V,Y,Z),Z).
% 25 [] c_in(c_^pair(X,Y,t_a,t_a),v_r,tc_prod(t_a,t_a)) | -c_^tarski_^ois^lub(Z,v_cl,Y,t_a) | -c_in(X,Z,t_a).
% 26 [] c_in(c_^pair(X,Y,t_a,t_a),v_r,tc_prod(t_a,t_a)) | c_in(v_sko__4mi(Z,v_r,Y),Z,t_a) | -c_^tarski_^ois^lub(Z,v_cl,X,t_a) | -c_in(Y,v_^a,t_a).
% 27 [] -c_in(c_^pair(v_sko__4mi(X,v_r,Y),Y,t_a,t_a),v_r,tc_prod(t_a,t_a)) | c_in(c_^pair(Z,Y,t_a,t_a),v_r,tc_prod(t_a,t_a)) | -c_^tarski_^ois^lub(X,v_cl,Z,t_a) | -c_in(Y,v_^a,t_a).
% 28 [] c_in(v_b,v_^a,t_a).
% 29 [] c_lessequals(v_^s,c_^tarski_^ointerval(v_r,v_a,v_b,t_a),tc_set(t_a)).
% 30 [] -equal(v_^s,c_emptyset).
% 31 [] c_^tarski_^ois^lub(v_^s,v_cl,v_^l,t_a).
% 32 [] -c_in(v_^l,c_^tarski_^ointerval(v_r,v_a,v_b,t_a),t_a).
% 40 [hyper:26,31,28] c_in(c_^pair(v_^l,v_b,t_a,t_a),v_r,tc_prod(t_a,t_a)) | c_in(v_sko__4mi(v_^s,v_r,v_b),v_^s,t_a).
% 42 [hyper:18,29,cut:30] c_in(c_^pair(X,Y,t_a,t_a),v_r,tc_prod(t_a,t_a)) | c_in(v_sko__4mk(Y,v_^s,v_r),v_^s,t_a) | c_in(v_sko__4mj(v_^s,X,v_r),v_^s,t_a).
% 54 [hyper:23,40,29] c_in(c_^pair(v_sko__4mi(v_^s,v_r,v_b),v_b,t_a,t_a),v_r,tc_prod(t_a,t_a)) | c_in(c_^pair(v_^l,v_b,t_a,t_a),v_r,tc_prod(t_a,t_a)).
% 162 [hyper:27,54,31,cut:28] c_in(c_^pair(v_^l,v_b,t_a,t_a),v_r,tc_prod(t_a,t_a)).
% 170 [hyper:24,162,42] c_in(v_sko__4mk(v_^l,v_^s,v_r),v_^s,t_a) | c_in(v_^l,c_^tarski_^ointerval(v_r,X,v_b,t_a),t_a) | c_in(v_sko__4mj(v_^s,X,v_r),v_^s,t_a).
% 202 [hyper:32,170] c_in(v_sko__4mk(v_^l,v_^s,v_r),v_^s,t_a) | c_in(v_sko__4mj(v_^s,v_a,v_r),v_^s,t_a).
% 231 [hyper:22,202,29] c_in(c_^pair(v_a,v_sko__4mj(v_^s,v_a,v_r),t_a,t_a),v_r,tc_prod(t_a,t_a)) | c_in(v_sko__4mk(v_^l,v_^s,v_r),v_^s,t_a).
% 264 [hyper:20,231,slowcut:29,factor:cut:30] c_in(c_^pair(v_a,v_^l,t_a,t_a),v_r,tc_prod(t_a,t_a)) | c_in(v_sko__4mk(v_^l,v_^s,v_r),v_^s,t_a).
% 295 [hyper:24,264,162,cut:32] c_in(v_sko__4mk(v_^l,v_^s,v_r),v_^s,t_a).
% 306 [hyper:25,295,31] c_in(c_^pair(v_sko__4mk(v_^l,v_^s,v_r),v_^l,t_a,t_a),v_r,tc_prod(t_a,t_a)).
% 354 [hyper:19,306,slowcut:29,cut:30] c_in(c_^pair(X,v_^l,t_a,t_a),v_r,tc_prod(t_a,t_a)) | c_in(v_sko__4mj(v_^s,X,v_r),v_^s,t_a).
% 369 [hyper:24,354,162] c_in(v_^l,c_^tarski_^ointerval(v_r,X,v_b,t_a),t_a) | c_in(v_sko__4mj(v_^s,X,v_r),v_^s,t_a).
% 391 [hyper:32,369] c_in(v_sko__4mj(v_^s,v_a,v_r),v_^s,t_a).
% 421 [hyper:22,391,29] c_in(c_^pair(v_a,v_sko__4mj(v_^s,v_a,v_r),t_a,t_a),v_r,tc_prod(t_a,t_a)).
% 434 [hyper:21,421,306,slowcut:29,cut:30] c_in(c_^pair(v_a,v_^l,t_a,t_a),v_r,tc_prod(t_a,t_a)).
% 448 [hyper:24,434,162,cut:32] 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 9
% clause depth limited to 3
% seconds given: 25
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 38
% derived clauses: 547
% kept clauses: 120
% kept size sum: 2922
% kept mid-nuclei: 265
% kept new demods: 0
% forw unit-subs: 20
% forw double-subs: 32
% forw overdouble-subs: 55
% backward subs: 9
% fast unit cutoff: 21
% full unit cutoff: 8
% dbl unit cutoff: 0
% real runtime : 0.4
% process. runtime: 0.2
% specific non-discr-tree subsumption statistics:
% tried: 466
% length fails: 0
% strength fails: 58
% predlist fails: 185
% aux str. fails: 49
% by-lit fails: 11
% full subs tried: 163
% full subs fail: 107
%
% ; program args: ("/home/graph/tptp/Systems/Gandalf---c-2.6/gandalf" "-time" "600" "/tmp/SystemOnTPTP16115/LAT/LAT274-2+eq_r.in")
%
%------------------------------------------------------------------------------