TSTP Solution File: LDA004-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : LDA004-1 : TPTP v3.4.2. Released v1.0.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 160.1s
% Output : Assurance 160.1s
% 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/LDA/LDA004-1+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: heq
% detected subclass: medium
% detected subclass: short
%
% strategies selected:
% (binary-posweight-order 57 #f 3 5)
% (binary-unit 28 #f 3 5)
% (binary-double 28 #f 3 5)
% (binary 45 #t 3 5)
% (hyper 11 #t 3 5)
% (hyper 28 #f)
% (binary-unit-uniteq 16 #f)
% (binary-weightorder 22 #f)
% (binary-posweight-order 159 #f)
% (binary-posweight-lex-big-order 57 #f)
% (binary-posweight-lex-small-order 11 #f)
% (binary-order 28 #f)
% (binary-unit 45 #f)
% (binary 65 #t)
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(13,40,1,26,0,1,22899,3,2852,26129,4,4278,38893,5,5702,38894,5,5703,38895,1,5703,38895,50,5705,38895,40,5705,38908,0,5705,53321,3,7106,55239,4,7809,63911,5,8506,63912,5,8506,63912,1,8506,63912,50,8508,63912,40,8508,63925,0,8508,96730,3,9910,105279,4,10609,111789,5,11309,111790,5,11309,111791,1,11309,111791,50,11313,111791,40,11313,111804,0,11313,141319,3,13564,144806,4,14689,147960,5,15814,147961,5,15814,147961,1,15814,147961,50,15815,147961,40,15815,147974,0,15815,147974,50,15815,147987,0,15815,147987,50,15815,148000,0,15821,148000,50,15821,148013,0,15821,148013,50,15821,148026,0,15821,148026,50,15821,148039,0,15826,148039,50,15826,148052,0,15826,148052,50,15826,148065,0,15830,148065,50,15830,148078,0,15830,148078,50,15830,148091,0,15830,148091,50,15830,148104,0,15835,148104,50,15835,148117,0,15835,148117,50,15835,148130,0,15839,148130,50,15839,148143,0,15839,148143,50,15839,148156,0,15839,148156,50,15839,148169,0,15844,148169,50,15844,148182,0,15844,148182,50,15844,148195,0,15848,148195,50,15848,148208,0,15848,148208,50,15848,148208,40,15848,148221,0,15848)
%
%
% START OF PROOF
% 148210 [] equal(f(X,f(Y,Z)),f(f(X,Y),f(X,Z))).
% 148211 [] left(X,f(X,Y)).
% 148212 [] -left(Y,Z) | -left(X,Y) | left(X,Z).
% 148213 [] equal(n2,f(n1,n1)).
% 148214 [] equal(n3,f(n2,n1)).
% 148215 [] equal(u,f(n2,n2)).
% 148216 [] equal(u1,f(u,n1)).
% 148217 [] equal(u2,f(u,n2)).
% 148218 [] equal(u3,f(u,n3)).
% 148219 [] equal(a,f(f(n3,n2),u2)).
% 148220 [] equal(b,f(u1,u3)).
% 148221 [] -left(a,b).
% 148223 [hyper:148212,148211,148211] left(X,f(f(X,Y),Z)).
% 148229 [para:148210.1.2,148211.1.2] left(f(X,Y),f(X,f(Y,Z))).
% 148230 [para:148213.1.2,148210.1.2.1] equal(f(n1,f(n1,X)),f(n2,f(n1,X))).
% 148231 [para:148213.1.2,148210.1.2.2] equal(f(n1,f(X,n1)),f(f(n1,X),n2)).
% 148232 [para:148210.1.2,148210.1.2.1] equal(f(f(X,Y),f(f(X,Z),U)),f(f(X,f(Y,Z)),f(f(X,Y),U))).
% 148233 [para:148210.1.2,148210.1.2.2] equal(f(f(X,Y),f(Z,f(X,U))),f(f(f(X,Y),Z),f(X,f(Y,U)))).
% 148238 [para:148214.1.2,148210.1.2.1] equal(f(n2,f(n1,X)),f(n3,f(n2,X))).
% 148239 [para:148214.1.2,148210.1.2.2] equal(f(n2,f(X,n1)),f(f(n2,X),n3)).
% 148288 [para:148216.1.2,148210.1.2.1] equal(f(u,f(n1,X)),f(u1,f(u,X))).
% 148289 [para:148216.1.2,148210.1.2.2] equal(f(u,f(X,n1)),f(f(u,X),u1)).
% 148319 [para:148217.1.2,148210.1.2.2] equal(f(u,f(X,n2)),f(f(u,X),u2)).
% 148379 [para:148219.1.2,148210.1.2.2] equal(f(f(n3,n2),f(X,u2)),f(f(f(n3,n2),X),a)).
% 148425 [para:148210.1.2,148223.1.2.1] left(f(X,Y),f(f(X,f(Y,Z)),U)).
% 148467 [para:148210.1.2,148229.1.1] left(f(X,f(Y,Z)),f(f(X,Y),f(f(X,Z),U))).
% 148511 [para:148213.1.2,148230.1.1.2,demod:148215,148213] equal(f(n1,n2),u).
% 148548 [para:148511.1.1,148231.1.2.1,demod:148217,148214] equal(f(n1,n3),u2).
% 148575 [para:148215.1.2,148232.1.2.1.2] equal(f(f(X,n2),f(f(X,n2),Y)),f(f(X,u),f(f(X,n2),Y))).
% 148579 [para:148217.1.2,148232.1.2.1.2,demod:148575] equal(f(f(X,n2),f(f(X,n2),Y)),f(f(X,u2),f(f(X,u),Y))).
% 148631 [para:148215.1.2,148233.1.2.2.2] equal(f(f(X,n2),f(Y,f(X,n2))),f(f(f(X,n2),Y),f(X,u))).
% 148681 [para:148214.1.2,148238.1.2.2,demod:148215,148213] equal(u,f(n3,n3)).
% 148682 [para:148215.1.2,148238.1.2.2,demod:148511] equal(f(n2,u),f(n3,u)).
% 148694 [para:148681.1.2,148210.1.2.1] equal(f(n3,f(n3,X)),f(u,f(n3,X))).
% 148695 [para:148681.1.2,148210.1.2.2] equal(f(n3,f(X,n3)),f(f(n3,X),u)).
% 148703 [para:148215.1.2,148239.1.2.1,demod:148218,148214] equal(f(n2,n3),u3).
% 148785 [para:148703.1.1,148238.1.2.2,demod:148548] equal(f(n2,u2),f(n3,u3)).
% 148801 [para:148218.1.2,148288.1.2.2,demod:148220,148548] equal(f(u,u2),b).
% 148847 [para:148217.1.2,148289.1.2.1,demod:148218,148214] equal(u3,f(u2,u1)).
% 148929 [para:148218.1.2,148319.1.2.1,demod:148694] equal(f(n3,f(n3,n2)),f(u3,u2)).
% 150117 [para:148847.1.2,148425.1.2.1.2] left(f(X,u2),f(f(X,u3),Y)).
% 168744 [para:148695.1.2,148631.1.2.1,demod:148210,148682,148785,148703,148929,148694] equal(f(f(n3,n2),f(u3,u2)),f(n2,f(u2,u))).
% 177695 [para:148379.1.2,150117.1.2,demod:168744,148219] left(a,f(n2,f(u2,u))).
% 177726 [hyper:148212,177695,148467,demod:148215,148579] left(a,f(u,f(u,X))).
% 177759 [para:148217.1.2,177726.1.2.2,demod:148801,cut:148221] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using hyperresolution
% not using sos strategy
% using positive unit paramodulation strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% seconds given: 28
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 27111
% derived clauses: 1175019
% kept clauses: 115380
% kept size sum: 733638
% kept mid-nuclei: 31921
% kept new demods: 8428
% forw unit-subs: 745306
% forw double-subs: 130376
% forw overdouble-subs: 27066
% backward subs: 1414
% fast unit cutoff: 6443
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 167.2
% process. runtime: 167.2
% specific non-discr-tree subsumption statistics:
% tried: 1340713
% length fails: 35269
% strength fails: 347994
% predlist fails: 44582
% aux str. fails: 162057
% by-lit fails: 603
% full subs tried: 743046
% full subs fail: 715904
%
% ; 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/LDA/LDA004-1+eq_r.in")
%
%------------------------------------------------------------------------------