TSTP Solution File: LAT268-2 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : LAT268-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 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/SystemOnTPTP6068/LAT/LAT268-2+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: heq
% detected subclass: medium
% detected subclass: long
%
% strategies selected:
% (hyper 58 #f 3 9)
% (binary-posweight-order 29 #f 3 9)
% (binary-unit 29 #f 3 9)
% (binary-double 29 #f 3 9)
% (binary 29 #t 3 9)
% (hyper 29 #t)
% (hyper 105 #f)
% (binary-unit-uniteq 17 #f)
% (binary-weightorder 23 #f)
% (binary-posweight-order 70 #f)
% (binary-posweight-lex-big-order 29 #f)
% (binary-posweight-lex-small-order 11 #f)
% (binary-order 29 #f)
% (binary-unit 46 #f)
% (binary 67 #t)
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(12,40,0,24,0,0)
%
%
% START OF PROOF
% 14 [] equal(v_^a,c_^tarski_^opotype_^opset(v_cl,t_a,tc_^product__^type_^ounit)).
% 15 [] c_in(c_^pair(X,c_^tarski_^olub(Y,Z,U),U,U),c_^tarski_^opotype_^oorder(Z,U,tc_^product__^type_^ounit),tc_prod(U,U)) | -c_lessequals(Y,c_^tarski_^opotype_^opset(Z,U,tc_^product__^type_^ounit),tc_set(U)) | -c_in(Z,c_^tarski_^o^partial^order,tc_^tarski_^opotype_^opotype__ext__type(U,tc_^product__^type_^ounit)) | -c_in(Z,c_^tarski_^o^complete^lattice,tc_^tarski_^opotype_^opotype__ext__type(U,tc_^product__^type_^ounit)) | -c_in(X,Y,U).
% 16 [] -c_in(c_^pair(X,Y,Z,Z),c_^tarski_^opotype_^oorder(c_^tarski_^odual(U,Z),Z,tc_^product__^type_^ounit),tc_prod(Z,Z)) | c_in(c_^pair(Y,X,Z,Z),c_^tarski_^opotype_^oorder(U,Z,tc_^product__^type_^ounit),tc_prod(Z,Z)).
% 17 [] c_in(c_^tarski_^odual(v_cl,t_a),c_^tarski_^o^complete^lattice,tc_^tarski_^opotype_^opotype__ext__type(t_a,tc_^product__^type_^ounit)).
% 18 [] c_in(c_^tarski_^odual(v_cl,t_a),c_^tarski_^o^partial^order,tc_^tarski_^opotype_^opotype__ext__type(t_a,tc_^product__^type_^ounit)).
% 19 [] equal(c_^tarski_^oglb(X,Y,Z),c_^tarski_^olub(X,c_^tarski_^odual(Y,Z),Z)).
% 20 [] equal(c_^tarski_^opotype_^opset(c_^tarski_^odual(X,Y),Y,tc_^product__^type_^ounit),c_^tarski_^opotype_^opset(X,Y,tc_^product__^type_^ounit)).
% 21 [] equal(v_r,c_^tarski_^opotype_^oorder(v_cl,t_a,tc_^product__^type_^ounit)).
% 22 [] c_lessequals(v_^s,v_^a,tc_set(t_a)).
% 23 [] c_in(v_x,v_^s,t_a).
% 24 [] -c_in(c_^pair(c_^tarski_^oglb(v_^s,v_cl,t_a),v_x,t_a,t_a),v_r,tc_prod(t_a,t_a)).
% 28 [hyper:15,17,23,demod:19,14,20,cut:18,cut:22] c_in(c_^pair(v_x,c_^tarski_^oglb(v_^s,v_cl,t_a),t_a,t_a),c_^tarski_^opotype_^oorder(c_^tarski_^odual(v_cl,t_a),t_a,tc_^product__^type_^ounit),tc_prod(t_a,t_a)).
% 31 [hyper:16,28,demod:21,cut:24] 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: 58
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 11
% derived clauses: 21
% kept clauses: 1
% kept size sum: 18
% kept mid-nuclei: 5
% kept new demods: 4
% forw unit-subs: 11
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 0
% fast unit cutoff: 4
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 0.1
% process. runtime: 0.0
% specific non-discr-tree subsumption statistics:
% tried: 1
% length fails: 0
% strength fails: 1
% predlist fails: 0
% 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/SystemOnTPTP6068/LAT/LAT268-2+eq_r.in")
%
%------------------------------------------------------------------------------