TSTP Solution File: LAT090-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : LAT090-1 : TPTP v3.4.2. Released v2.6.0.
% Transfm : add_equality:r
% Format : otter:hypothesis:set(auto),clear(print_given)
% Command : gandalf-wrapper -time %d %s
% Computer : art06.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/LAT090-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(7,40,1,14,0,1)
%
%
% START OF PROOF
% 8 [] equal(X,X).
% 9 [] equal(join(meet(X,Y),meet(X,join(X,Y))),X).
% 10 [] equal(join(meet(X,X),meet(Y,join(X,X))),X).
% 11 [] equal(join(meet(X,Y),meet(Y,join(X,Y))),Y).
% 12 [] equal(meet(meet(join(X,Y),join(Z,X)),X),X).
% 13 [] equal(join(join(meet(X,Y),meet(Z,X)),X),X).
% 14 [] -equal(join(a,a),a).
% 15 [para:12.1.1,10.1.1.2] equal(join(meet(X,X),join(X,X)),X).
% 16 [para:15.1.1,9.1.1.2.2] equal(join(meet(meet(X,X),join(X,X)),meet(meet(X,X),X)),meet(X,X)).
% 18 [para:13.1.1,12.1.1.1.2] equal(meet(meet(join(X,Y),X),X),X).
% 20 [para:9.1.1,18.1.1.1.1] equal(meet(meet(X,meet(X,Y)),meet(X,Y)),meet(X,Y)).
% 22 [para:12.1.1,20.1.1.1.2,demod:12] equal(meet(X,X),X).
% 25 [para:22.1.1,10.1.1.2,demod:22] equal(join(X,join(X,X)),X).
% 26 [para:22.1.1,12.1.1.1] equal(meet(join(X,X),X),X).
% 29 [para:22.1.1,16.1.1.1.1,demod:22] equal(join(meet(X,join(X,X)),X),X).
% 30 [para:25.1.1,11.1.1.2.2,demod:29,26] equal(X,join(X,X)).
% 32 [para:30.1.2,14.1.1,cut:8] 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: 15
% derived clauses: 111
% kept clauses: 17
% kept size sum: 163
% kept mid-nuclei: 0
% kept new demods: 22
% forw unit-subs: 54
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 0
% fast unit cutoff: 1
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 0.1
% process. runtime: 0.0
% 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/LAT090-1+eq_r.in")
%
%------------------------------------------------------------------------------