TSTP Solution File: LAT019-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : LAT019-1 : TPTP v3.4.2. Released v2.2.0.
% Transfm : add_equality:r
% Format : otter:hypothesis:set(auto),clear(print_given)
% Command : gandalf-wrapper -time %d %s
% Computer : art01.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/LAT019-1+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: ueq
%
% strategies selected:
% (binary-posweight-kb-big-order 60 #f 4 1)
% (binary-posweight-lex-big-order 30 #f 4 1)
% (binary 30 #t)
% (binary-posweight-kb-big-order 180 #f)
% (binary-posweight-lex-big-order 120 #f)
% (binary-posweight-firstpref-order 60 #f)
% (binary-posweight-kb-small-order 60 #f)
% (binary-posweight-lex-small-order 60 #f)
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(11,40,0,22,0,0)
%
%
% START OF PROOF
% 13 [] equal(meet(X,X),X).
% 14 [] equal(join(X,X),X).
% 15 [] equal(meet(X,Y),meet(Y,X)).
% 16 [] equal(join(X,Y),join(Y,X)).
% 17 [] equal(meet(meet(X,Y),Z),meet(X,meet(Y,Z))).
% 18 [] equal(join(join(X,Y),Z),join(X,join(Y,Z))).
% 19 [] equal(join(meet(X,join(Y,Z)),meet(X,Y)),meet(X,join(Y,Z))).
% 20 [] equal(meet(join(X,meet(Y,Z)),join(X,Y)),join(X,meet(Y,Z))).
% 21 [] equal(meet(X,join(Y,Z)),join(meet(X,Y),meet(X,Z))).
% 22 [] -equal(join(a,meet(b,c)),meet(join(a,b),join(a,c))).
% 23 [para:13.1.1,21.1.2.1] equal(meet(X,join(X,Y)),join(X,meet(X,Y))).
% 24 [para:13.1.1,21.1.2.2] equal(meet(X,join(Y,X)),join(meet(X,Y),X)).
% 25 [para:15.1.1,21.1.2.1] equal(meet(X,join(Y,Z)),join(meet(Y,X),meet(X,Z))).
% 27 [para:21.1.2,16.1.1,demod:21] equal(meet(X,join(Y,Z)),meet(X,join(Z,Y))).
% 29 [para:13.1.1,17.1.1.1] equal(meet(X,Y),meet(X,meet(X,Y))).
% 33 [para:29.1.2,15.1.1,demod:17] equal(meet(X,Y),meet(X,meet(Y,X))).
% 34 [para:29.1.2,21.1.2.1,demod:21] equal(meet(X,join(meet(X,Y),Z)),meet(X,join(Y,Z))).
% 35 [para:29.1.2,21.1.2.2,demod:21] equal(meet(X,join(Y,meet(X,Z))),meet(X,join(Y,Z))).
% 41 [para:14.1.1,18.1.1.1] equal(join(X,Y),join(X,join(X,Y))).
% 46 [para:15.1.1,23.1.2.2] equal(meet(X,join(X,Y)),join(X,meet(Y,X))).
% 48 [para:23.1.2,18.1.1.1] equal(join(meet(X,join(X,Y)),Z),join(X,join(meet(X,Y),Z))).
% 54 [para:41.1.2,16.1.1,demod:18] equal(join(X,Y),join(X,join(Y,X))).
% 57 [para:15.1.1,24.1.2.1] equal(meet(X,join(Y,X)),join(meet(Y,X),X)).
% 60 [para:27.1.1,13.1.1] equal(meet(join(X,Y),join(Y,X)),join(X,Y)).
% 61 [para:27.1.1,15.1.1] equal(meet(X,join(Y,Z)),meet(join(Z,Y),X)).
% 100 [para:33.1.2,46.1.2.2,demod:14,25,29,17,57] equal(meet(X,meet(Y,join(X,Y))),meet(Y,X)).
% 102 [para:20.1.1,15.1.1] equal(join(X,meet(Y,Z)),meet(join(X,Y),join(X,meet(Y,Z)))).
% 103 [para:15.1.1,20.1.1.1.2] equal(meet(join(X,meet(Y,Z)),join(X,Z)),join(X,meet(Z,Y))).
% 105 [para:16.1.1,20.1.1.2] equal(meet(join(X,meet(Y,Z)),join(Y,X)),join(X,meet(Y,Z))).
% 154 [para:60.1.1,19.1.1.1,demod:60,54,46,18] equal(join(X,meet(Y,join(Y,X))),join(X,Y)).
% 156 [para:15.1.1,25.1.2.2] equal(meet(X,join(Y,Z)),join(meet(Y,X),meet(Z,X))).
% 177 [para:61.1.1,20.1.1] equal(meet(join(X,Y),join(Y,meet(X,Z))),join(Y,meet(X,Z))).
% 212 [para:100.1.1,20.1.1.1.2,demod:100,103] equal(join(X,meet(Y,Z)),join(X,meet(Z,Y))).
% 242 [para:34.1.1,15.1.1] equal(meet(X,join(Y,Z)),meet(join(meet(X,Y),Z),X)).
% 251 [para:61.1.1,154.1.1.2] equal(join(X,meet(join(X,Y),Y)),join(X,Y)).
% 335 [para:251.1.1,16.1.1] equal(join(X,Y),join(meet(join(X,Y),Y),X)).
% 396 [para:335.1.2,20.1.1.2,demod:177,242] equal(join(X,meet(Y,Z)),join(meet(join(Y,X),X),meet(Y,Z))).
% 466 [para:61.1.1,48.1.1.1] equal(join(meet(join(X,Y),Y),Z),join(Y,join(meet(Y,X),Z))).
% 583 [para:41.1.2,102.1.2.1,demod:35] equal(join(X,meet(join(X,Y),Z)),meet(join(X,Y),join(X,Z))).
% 597 [para:335.1.2,103.1.1.2,demod:396,105,156,466] equal(join(X,meet(Y,join(X,Z))),join(X,meet(Y,Z))).
% 615 [para:15.1.1,597.1.1.2,demod:583] equal(meet(join(X,Y),join(X,Z)),join(X,meet(Z,Y))).
% 633 [para:615.1.1,22.1.2,cut:212] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% using first neg lit preferred strategy
% not using sos strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% using clause demodulation
% clause length limited to 1
% clause depth limited to 4
% seconds given: 60
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 145
% derived clauses: 28286
% kept clauses: 610
% kept size sum: 9512
% kept mid-nuclei: 0
% kept new demods: 248
% forw unit-subs: 12518
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 2
% fast unit cutoff: 1
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 0.41
% process. runtime: 0.39
% specific non-discr-tree subsumption statistics:
% tried: 0
% length fails: 0
% strength fails: 0
% 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" "/home/graph/tptp/TSTP/PreparedTPTP/otter:hypothesis:set(auto),clear(print_given)---add_equality:r/LAT/LAT019-1+eq_r.in")
%
%------------------------------------------------------------------------------