TSTP Solution File: LAT005-4 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : LAT005-4 : 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 : art05.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 19.4s
% Output : Assurance 19.4s
% 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-4+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: peq
%
% strategies selected:
% (hyper 30 #f 3 3)
% (binary-unit 12 #f)
% (binary-unit-uniteq 12 #f)
% (binary-posweight-kb-big-order 60 #f 3 3)
% (binary-posweight-lex-big-order 30 #f 3 3)
% (binary 30 #t)
% (binary-posweight-kb-big-order 156 #f)
% (binary-posweight-lex-big-order 102 #f)
% (binary-posweight-firstpref-order 60 #f)
% (binary-order 30 #f)
% (binary-posweight-kb-small-order 48 #f)
% (binary-posweight-lex-small-order 30 #f)
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(21,40,0,42,0,0,455,50,50,476,0,50,9957,4,2234)
%
%
% START OF PROOF
% 456 [] equal(X,X).
% 457 [] equal(meet(X,X),X).
% 459 [] equal(meet(X,join(X,Y)),X).
% 460 [] equal(join(X,meet(X,Y)),X).
% 461 [] equal(meet(X,Y),meet(Y,X)).
% 462 [] equal(join(X,Y),join(Y,X)).
% 463 [] equal(meet(meet(X,Y),Z),meet(X,meet(Y,Z))).
% 464 [] equal(join(join(X,Y),Z),join(X,join(Y,Z))).
% 465 [] equal(meet(X,n0),n0).
% 466 [] equal(join(X,n0),X).
% 469 [] equal(meet(X,join(Y,Z)),join(Y,meet(Z,X))) | -equal(meet(Y,X),Y).
% 471 [] equal(meet(r2,meet(a,b)),n0).
% 473 [] equal(meet(r1,join(a,b)),n0).
% 474 [] equal(join(r1,meet(a,r2)),b2).
% 475 [] equal(join(r1,meet(b,r2)),a2).
% 476 [] -equal(meet(a2,b2),r1).
% 477 [hyper:469,457,demod:459] equal(X,join(X,meet(Y,X))).
% 479 [hyper:469,459] equal(meet(join(X,Y),join(X,Z)),join(X,meet(Z,join(X,Y)))).
% 483 [para:461.1.1,459.1.1] equal(meet(join(X,Y),X),X).
% 485 [para:461.1.1,471.1.1.2] equal(meet(r2,meet(b,a)),n0).
% 488 [para:473.1.1,461.1.1] equal(n0,meet(join(a,b),r1)).
% 491 [para:462.1.1,459.1.1.2] equal(meet(X,join(Y,X)),X).
% 494 [para:462.1.1,460.1.1] equal(join(meet(X,Y),X),X).
% 497 [para:477.1.2,462.1.1] equal(X,join(meet(Y,X),X)).
% 498 [para:474.1.1,459.1.1.2] equal(meet(r1,b2),r1).
% 500 [para:474.1.1,462.1.1] equal(b2,join(meet(a,r2),r1)).
% 501 [hyper:469,498] equal(meet(b2,join(r1,X)),join(r1,meet(X,b2))).
% 512 [para:457.1.1,463.1.1.1] equal(meet(X,Y),meet(X,meet(X,Y))).
% 513 [para:459.1.1,463.1.1.1] equal(meet(X,Y),meet(X,meet(join(X,Z),Y))).
% 516 [para:463.1.1,461.1.1] equal(meet(X,meet(Y,Z)),meet(Z,meet(X,Y))).
% 518 [para:461.1.1,463.1.1.1,demod:463] equal(meet(X,meet(Y,Z)),meet(Y,meet(X,Z))).
% 527 [para:462.1.1,483.1.1.1] equal(meet(join(X,Y),Y),Y).
% 533 [para:491.1.1,463.1.1.1] equal(meet(X,Y),meet(X,meet(join(Z,X),Y))).
% 538 [para:460.1.1,464.1.1.1] equal(join(X,Y),join(X,join(meet(X,Z),Y))).
% 543 [para:477.1.2,464.1.1.1] equal(join(X,Y),join(X,join(meet(Z,X),Y))).
% 565 [para:485.1.1,461.1.1,demod:463] equal(n0,meet(b,meet(a,r2))).
% 576 [para:473.1.1,479.1.2.2,demod:466] equal(meet(join(a,b),join(a,r1)),a).
% 579 [para:479.1.2,491.1.1.2,demod:512,463] equal(meet(X,meet(join(Y,Z),join(Y,X))),meet(X,join(Y,Z))).
% 580 [para:494.1.1,479.1.2.2.2,demod:494] equal(meet(X,join(meet(X,Y),Z)),join(meet(X,Y),meet(Z,X))).
% 581 [para:497.1.2,479.1.2.2.2,demod:497] equal(meet(X,join(meet(Y,X),Z)),join(meet(Y,X),meet(Z,X))).
% 617 [para:461.1.1,501.1.2.2] equal(meet(b2,join(r1,X)),join(r1,meet(b2,X))).
% 619 [para:463.1.1,501.1.2.2] equal(meet(b2,join(r1,meet(X,Y))),join(r1,meet(X,meet(Y,b2)))).
% 672 [para:488.1.2,513.1.2.2,demod:465] equal(meet(a,r1),n0).
% 679 [para:672.1.1,461.1.1] equal(n0,meet(r1,a)).
% 733 [para:527.1.1,516.1.1.2] equal(meet(X,Y),meet(Y,meet(X,join(Z,Y)))).
% 791 [para:485.1.1,518.1.1.2,demod:465] equal(n0,meet(r2,meet(X,meet(b,a)))).
% 1003 [para:500.1.2,538.1.2.2] equal(join(a,r1),join(a,b2)).
% 1019 [para:1003.1.2,533.1.2.2.1] equal(meet(b2,X),meet(b2,meet(join(a,r1),X))).
% 1236 [para:543.1.2,533.1.2.2.1] equal(meet(join(meet(X,Y),Z),U),meet(join(meet(X,Y),Z),meet(join(Y,Z),U))).
% 1427 [para:576.1.1,533.1.2.2] equal(meet(b,join(a,r1)),meet(b,a)).
% 1451 [para:462.1.1,579.1.1.2.1,demod:733] equal(meet(join(X,Y),Z),meet(Z,join(Y,X))).
% 1475 [para:679.1.2,580.1.2.2,demod:466] equal(meet(a,join(meet(a,X),r1)),meet(a,X)).
% 1899 [?] ?
% 2066 [para:1427.1.1,461.1.1] equal(meet(b,a),meet(join(a,r1),b)).
% 2984 [para:2066.1.2,1019.1.2.2] equal(meet(b2,b),meet(b2,meet(b,a))).
% 3006 [para:2984.1.2,461.1.1,demod:463] equal(meet(b2,b),meet(b,meet(a,b2))).
% 3020 [para:2984.1.2,791.1.2.2] equal(n0,meet(r2,meet(b2,b))).
% 3108 [para:3020.1.2,461.1.1,demod:463] equal(n0,meet(b2,meet(b,r2))).
% 3139 [para:3108.1.2,617.1.2.2,demod:466,475] equal(meet(b2,a2),r1).
% 3141 [para:3139.1.1,461.1.1] equal(r1,meet(a2,b2)).
% 4065 [para:500.1.2,1475.1.1.2] equal(meet(a,b2),meet(a,r2)).
% 4075 [para:4065.1.2,565.1.2.2,demod:3006] equal(n0,meet(b2,b)).
% 4128 [para:4075.1.2,461.1.1] equal(n0,meet(b,b2)).
% 4141 [para:4128.1.2,581.1.2.2,demod:466] equal(meet(b2,join(meet(X,b2),b)),meet(X,b2)).
% 4142 [para:4128.1.2,619.1.2.2.2,demod:466,465] equal(meet(b2,join(r1,meet(X,b))),r1).
% 5254 [para:4141.1.1,1451.1.2] equal(meet(join(b,meet(X,b2)),b2),meet(X,b2)).
% 9017 [para:5254.1.1,1236.1.2.2,demod:527] equal(meet(join(meet(X,b),meet(Y,b2)),b2),meet(Y,b2)).
% 9958 [para:9017.1.2,476.1.1,demod:4142,1899,3141,cut:456] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% not using sos strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% clause length limited to 3
% clause depth limited to 4
% seconds given: 30
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 2533
% derived clauses: 926804
% kept clauses: 9892
% kept size sum: 152438
% kept mid-nuclei: 0
% kept new demods: 9275
% forw unit-subs: 677165
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 25
% fast unit cutoff: 1
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 23.2
% process. runtime: 22.43
% 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/LAT005-4+eq_r.in")
%
%------------------------------------------------------------------------------