TSTP Solution File: LAT012-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : LAT012-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 : 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/LAT012-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(6,40,1,12,0,1,490,50,478,496,0,478)
%
%
% START OF PROOF
% 492 [] equal(join(X,meet(Y,meet(X,Z))),X).
% 493 [] equal(meet(X,join(Y,join(X,Z))),X).
% 494 [] equal(join(join(meet(X,Y),meet(Y,Z)),Y),Y).
% 495 [] equal(meet(meet(join(X,Y),join(Y,Z)),Y),Y).
% 496 [] -equal(meet(b,a),meet(a,b)).
% 497 [para:493.1.1,492.1.1.2.2] equal(join(X,meet(Y,X)),X).
% 498 [para:492.1.1,493.1.1.2.2] equal(meet(X,join(Y,X)),X).
% 500 [para:492.1.1,494.1.1.1] equal(join(meet(X,Y),Y),Y).
% 508 [para:494.1.1,498.1.1.2] equal(meet(X,X),X).
% 509 [para:508.1.1,492.1.1.2] equal(join(X,meet(X,Y)),X).
% 512 [para:498.1.1,500.1.1.1] equal(join(X,join(Y,X)),join(Y,X)).
% 519 [para:497.1.1,495.1.1.1.1] equal(meet(meet(X,join(meet(Y,X),Z)),meet(Y,X)),meet(Y,X)).
% 532 [para:509.1.1,512.1.1.2,demod:509] equal(join(meet(X,Y),X),X).
% 981 [para:532.1.1,519.1.1.1.2] equal(meet(meet(X,Y),meet(Y,X)),meet(Y,X)).
% 1661 [para:981.1.1,509.1.1.2] equal(join(meet(X,Y),meet(Y,X)),meet(X,Y)).
% 1663 [para:981.1.1,532.1.1.1,demod:1661,slowcut:496] 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 5
% seconds given: 60
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 596
% derived clauses: 382036
% kept clauses: 1643
% kept size sum: 28585
% kept mid-nuclei: 0
% kept new demods: 1647
% forw unit-subs: 184374
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 0
% fast unit cutoff: 0
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 4.93
% process. runtime: 4.92
% 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/LAT012-1+eq_r.in")
%
%------------------------------------------------------------------------------