TSTP Solution File: LAT269-2 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : LAT269-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/SystemOnTPTP15969/LAT/LAT269-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 4 7)
% (binary-unit 10 #f 4 7)
% (binary-double 10 #f 4 7)
% (binary-double 16 #f)
% (binary-double 10 #t)
% (binary 16 #t 4 7)
% (binary-order 27 #f 4 7)
% (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,18,50,0,25,0,0)
%
%
% START OF PROOF
% 20 [] c_in(c_^tarski_^o^top(v_cl,t_a),v_^a,t_a).
% 21 [] c_in(c_^tarski_^opotype_^opotype__ext(c_^tarski_^ointerval(v_r,X,Y,t_a),c_^tarski_^oinduced(c_^tarski_^ointerval(v_r,X,Y,t_a),v_r,t_a),c_^product__^type_^o^unity,t_a,tc_^product__^type_^ounit),c_^tarski_^o^complete^lattice,tc_^tarski_^opotype_^opotype__ext__type(t_a,tc_^product__^type_^ounit)) | equal(c_^tarski_^ointerval(v_r,X,Y,t_a),c_emptyset) | -c_in(Y,v_^a,t_a) | -c_in(X,v_^a,t_a).
% 22 [] equal(v_int^y1,c_^tarski_^ointerval(v_r,c_^tarski_^olub(v_^y,v_cl,t_a),c_^tarski_^o^top(v_cl,t_a),t_a)).
% 23 [] c_in(c_^tarski_^olub(v_^y,v_cl,t_a),v_^a,t_a).
% 24 [] -equal(c_^tarski_^ointerval(v_r,X,c_^tarski_^o^top(v_cl,t_a),t_a),c_emptyset) | -c_in(X,v_^a,t_a).
% 25 [] -c_in(c_^tarski_^opotype_^opotype__ext(v_int^y1,c_^tarski_^oinduced(v_int^y1,v_r,t_a),c_^product__^type_^o^unity,t_a,tc_^product__^type_^ounit),c_^tarski_^o^complete^lattice,tc_^tarski_^opotype_^opotype__ext__type(t_a,tc_^product__^type_^ounit)).
% 34 [hyper:21,23,20,demod:22,cut:25] equal(v_int^y1,c_emptyset).
% 35 [hyper:24,23,demod:22,cut:34] 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 7
% clause depth limited to 5
% seconds given: 27
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 10
% derived clauses: 24
% kept clauses: 4
% kept size sum: 135
% kept mid-nuclei: 7
% kept new demods: 3
% forw unit-subs: 2
% forw double-subs: 2
% forw overdouble-subs: 0
% backward subs: 0
% fast unit cutoff: 2
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 0.1
% process. runtime: 0.0
% specific non-discr-tree subsumption statistics:
% tried: 4
% length fails: 0
% strength fails: 0
% predlist fails: 4
% aux str. fails: 0
% by-lit fails: 0
% full subs tried: 0
% full subs fail: 0
%
% ; program args: ("/home/graph/tptp/Systems/Gandalf---c-2.6/gandalf" "-time" "600" "/tmp/SystemOnTPTP15969/LAT/LAT269-2+eq_r.in")
%
%------------------------------------------------------------------------------