TSTP Solution File: LAT028-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : LAT028-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 : art08.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 89.5s
% Output : Assurance 89.5s
% 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/LAT028-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(12,40,0,24,0,0,21647,3,3006,27054,4,4509,29396,5,6011,29396,1,6011,29396,50,6013,29396,40,6013,29408,0,6013,41893,3,7519,45859,4,8280,47669,5,9017,47669,1,9017,47669,50,9019,47669,40,9019,47681,0,9019,47684,50,9019,47684,40,9019,47696,0,9024)
%
%
% START OF PROOF
% 47686 [] equal(meet(X,X),X).
% 47687 [] equal(join(X,X),X).
% 47688 [] equal(meet(X,Y),meet(Y,X)).
% 47689 [] equal(join(X,Y),join(Y,X)).
% 47690 [] equal(meet(meet(join(X,Y),join(Z,Y)),Y),Y).
% 47691 [] equal(join(join(meet(X,Y),meet(Z,Y)),Y),Y).
% 47692 [] equal(meet2(X,X),X).
% 47693 [] equal(meet2(X,Y),meet2(Y,X)).
% 47694 [] equal(meet2(meet2(join(X,Y),join(Z,Y)),Y),Y).
% 47695 [] equal(join(join(meet2(X,Y),meet2(Z,Y)),Y),Y).
% 47696 [] -equal(meet(a,b),meet2(a,b)).
% 47698 [para:47693.1.1,47696.1.2] -equal(meet(a,b),meet2(b,a)).
% 47700 [para:47686.1.1,47690.1.1.1] equal(meet(join(X,Y),Y),Y).
% 47705 [para:47700.1.1,47688.1.1] equal(X,meet(X,join(Y,X))).
% 47707 [para:47689.1.1,47705.1.2.2] equal(X,meet(X,join(X,Y))).
% 47710 [para:47687.1.1,47691.1.1.1] equal(join(meet(X,Y),Y),Y).
% 47720 [para:47688.1.1,47710.1.1.1] equal(join(meet(X,Y),X),X).
% 47721 [para:47710.1.1,47689.1.1] equal(X,join(X,meet(Y,X))).
% 47726 [para:47720.1.1,47689.1.1] equal(X,join(X,meet(X,Y))).
% 47733 [para:47707.1.2,47721.1.2.2] equal(join(X,Y),join(join(X,Y),X)).
% 47743 [para:47721.1.2,47694.1.1.1.1] equal(meet2(meet2(X,join(Y,meet(Z,X))),meet(Z,X)),meet(Z,X)).
% 47756 [para:47687.1.1,47695.1.1.1] equal(join(meet2(X,Y),Y),Y).
% 47757 [para:47692.1.1,47695.1.1.1.1,demod:47733] equal(join(X,meet2(Y,X)),X).
% 47769 [para:47693.1.1,47756.1.1.1] equal(join(meet2(X,Y),X),X).
% 47774 [para:47693.1.1,47757.1.1.2] equal(join(X,meet2(X,Y)),X).
% 47775 [para:47757.1.1,47690.1.1.1.1] equal(meet(meet(X,join(Y,meet2(Z,X))),meet2(Z,X)),meet2(Z,X)).
% 47780 [para:47769.1.1,47707.1.2.2] equal(meet2(X,Y),meet(meet2(X,Y),X)).
% 49133 [para:47726.1.2,47743.1.1.1.2] equal(meet2(meet2(X,Y),meet(Y,X)),meet(Y,X)).
% 49275 [para:49133.1.1,47780.1.2.1,demod:49133] equal(meet(X,Y),meet(meet(X,Y),meet2(Y,X))).
% 49718 [para:47774.1.1,47775.1.1.1.2,demod:49275,slowcut:47698] 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
% seconds given: 180
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 2270
% derived clauses: 5561701
% kept clauses: 49656
% kept size sum: 46251
% kept mid-nuclei: 0
% kept new demods: 3307
% forw unit-subs: 1744054
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 534
% fast unit cutoff: 0
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 90.99
% process. runtime: 90.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/LAT028-1+eq_r.in")
%
%------------------------------------------------------------------------------