TSTP Solution File: LAT005-6 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : LAT005-6 : TPTP v3.4.2. Released v1.1.0.
% Transfm : add_equality:r
% Format : otter:hypothesis:set(auto),clear(print_given)
% Command : gandalf-wrapper -time %d %s
% Computer : art10.cs.miami.edu
% Model : i686 unknown
% CPU : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2793MHz
% Memory : 1000MB
% OS : Linux 2.4.22-21mdk-i686-up-4GB
% 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: /home/graph/tptp/TSTP/PreparedTPTP/otter:hypothesis:set(auto),clear(print_given)---add_equality:r/LAT/LAT005-6+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 2 9)
% (binary-posweight-order 29 #f 2 9)
% (binary-unit 29 #f 2 9)
% (binary-double 29 #f 2 9)
% (binary 29 #t 2 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(38,40,0,76,0,0)
%
%
% START OF PROOF
% 43 [] meet(n0,X,n0).
% 46 [] -meet(X,Y,Z) | meet(Y,X,Z).
% 47 [] -join(X,Y,Z) | join(Y,X,Z).
% 49 [] -join(X,Y,Z) | meet(X,Z,X).
% 50 [] -meet(U,Z,V) | -meet(U,X,W) | -meet(X,Y,Z) | meet(W,Y,V).
% 51 [] -meet(U,Y,V) | -meet(W,X,U) | -meet(X,Y,Z) | meet(W,Z,V).
% 55 [] -meet(X,Y,Z) | -meet(U,Y,U) | -join(U,Z,W) | -join(U,X,V) | meet(Y,V,W).
% 56 [] meet(X,Y,meet_of(X,Y)).
% 57 [] -meet(X,Y,U) | -meet(X,Y,Z) | equal(Z,U).
% 58 [] join(X,Y,join_of(X,Y)).
% 59 [] -join(X,Y,U) | -join(X,Y,Z) | equal(Z,U).
% 61 [] join(X,n0,X).
% 66 [] meet(a,b,c).
% 68 [] meet(c,r2,n0).
% 69 [] meet(r2,b,e).
% 70 [] join(a,b,c2).
% 72 [] meet(c2,r1,n0).
% 73 [] meet(r2,a,d).
% 74 [] join(r1,e,a2).
% 75 [] join(r1,d,b2).
% 76 [] -meet(a2,b2,r1).
% 797 [hyper:46,68] meet(r2,c,n0).
% 1222 [hyper:46,69] meet(b,r2,e).
% 1350 [hyper:47,70] join(b,a,c2).
% 1351 [hyper:49,70] meet(a,c2,a).
% 1548 [hyper:46,72] meet(r1,c2,n0).
% 1798 [hyper:47,74] join(e,r1,a2).
% 1799 [hyper:49,74] meet(r1,a2,r1).
% 2710 [hyper:50,797,73,66] meet(d,b,n0).
% 3084 [hyper:49,1350] meet(b,c2,b).
% 3898 [hyper:50,1351,73,73] meet(d,c2,d).
% 11026 [hyper:51,2710,43,1222] meet(d,e,n0).
% 13717 [hyper:46,56] meet(X,Y,meet_of(Y,X)).
% 16114 [hyper:57,56,69] equal(e,meet_of(r2,b)).
% 19215 [hyper:50,3084,56,69,demod:16114] meet(e,c2,e).
% 22040 [hyper:59,58,61] equal(X,join_of(X,n0)).
% 22057 [hyper:59,58,1798] equal(a2,join_of(e,r1)).
% 48537 [hyper:55,19215,58,58,1548,demod:22040,22057] meet(c2,a2,e).
% 51545 [hyper:57,13717,3898] equal(d,meet_of(c2,d)).
% 73431 [hyper:50,48537,13717,11026,demod:51545] meet(d,a2,n0).
% 87020 [hyper:55,73431,1799,58,75,demod:22040,cut:76] 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 2
% seconds given: 58
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 172
% derived clauses: 194588
% kept clauses: 5137
% kept size sum: 32204
% kept mid-nuclei: 81633
% kept new demods: 149
% forw unit-subs: 96517
% forw double-subs: 2952
% forw overdouble-subs: 0
% backward subs: 0
% fast unit cutoff: 3400
% full unit cutoff: 159
% dbl unit cutoff: 0
% real runtime : 2.95
% process. runtime: 2.94
% specific non-discr-tree subsumption statistics:
% tried: 14482
% length fails: 0
% strength fails: 11120
% predlist fails: 3252
% aux str. fails: 93
% by-lit fails: 0
% full subs tried: 17
% full subs fail: 17
%
% ; program args: ("/home/graph/tptp/Systems/Gandalf---c-2.6/gandalf" "-time" "600" "/home/graph/tptp/TSTP/PreparedTPTP/otter:hypothesis:set(auto),clear(print_given)---add_equality:r/LAT/LAT005-6+eq_r.in")
%
%------------------------------------------------------------------------------