TSTP Solution File: LDA002-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : LDA002-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 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/LDA/LDA002-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 3 1)
% (binary-posweight-lex-big-order 30 #f 3 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(13,40,0,26,0,0,345,50,10,358,0,10)
%
%
% START OF PROOF
% 347 [] equal(f(X,f(Y,Z)),f(f(X,Y),f(X,Z))).
% 348 [] equal(n2,f(n1,n1)).
% 349 [] equal(n3,f(n2,n1)).
% 350 [] equal(u,f(n2,n2)).
% 351 [] equal(u1,f(u,n1)).
% 352 [] equal(u2,f(u,n2)).
% 353 [] equal(u3,f(u,n3)).
% 354 [] equal(uu,f(u,u)).
% 355 [] equal(a,f(f(n3,n2),u2)).
% 356 [] equal(b,f(u1,u3)).
% 357 [] equal(v,f(uu,uu)).
% 358 [] -equal(f(a,v),f(b,v)).
% 359 [para:348.1.2,347.1.2.1] equal(f(n1,f(n1,X)),f(n2,f(n1,X))).
% 360 [para:348.1.2,347.1.2.2] equal(f(n1,f(X,n1)),f(f(n1,X),n2)).
% 361 [para:349.1.2,347.1.2.1] equal(f(n2,f(n1,X)),f(n3,f(n2,X))).
% 363 [para:350.1.2,347.1.2.1] equal(f(n2,f(n2,X)),f(u,f(n2,X))).
% 365 [para:351.1.2,347.1.2.1] equal(f(u,f(n1,X)),f(u1,f(u,X))).
% 367 [para:352.1.2,347.1.2.1,demod:363] equal(f(n2,f(n2,X)),f(u2,f(u,X))).
% 368 [para:352.1.2,347.1.2.2] equal(f(u,f(X,n2)),f(f(u,X),u2)).
% 369 [para:353.1.2,347.1.2.1] equal(f(u,f(n3,X)),f(u3,f(u,X))).
% 371 [para:354.1.2,347.1.2.1] equal(f(u,f(u,X)),f(uu,f(u,X))).
% 373 [para:356.1.2,347.1.2.1] equal(f(u1,f(u3,X)),f(b,f(u1,X))).
% 375 [para:357.1.2,347.1.2.1] equal(f(uu,f(uu,X)),f(v,f(uu,X))).
% 376 [para:357.1.2,347.1.2.2] equal(f(uu,f(X,uu)),f(f(uu,X),v)).
% 379 [para:355.1.2,347.1.2.1] equal(f(f(n3,n2),f(u2,X)),f(a,f(f(n3,n2),X))).
% 381 [para:348.1.2,359.1.1.2,demod:350,348] equal(f(n1,n2),u).
% 387 [para:381.1.1,359.1.1.2,demod:381] equal(f(n1,u),f(n2,u)).
% 391 [para:381.1.1,360.1.2.1,demod:352,349] equal(f(n1,n3),u2).
% 394 [para:350.1.2,361.1.2.2,demod:381] equal(f(n2,u),f(n3,u)).
% 396 [para:361.1.2,347.1.2.2] equal(f(n3,f(X,f(n2,Y))),f(f(n3,X),f(n2,f(n1,Y)))).
% 420 [para:350.1.2,363.1.2.2,demod:354,350] equal(f(n2,u),uu).
% 427 [para:420.1.1,361.1.2.2,demod:420,387] equal(f(n2,uu),f(n3,uu)).
% 430 [para:420.1.1,363.1.2.2,demod:420] equal(f(n2,uu),f(u,uu)).
% 448 [para:353.1.2,365.1.2.2,demod:356,391] equal(f(u,u2),b).
% 449 [para:354.1.2,365.1.2.2,demod:430,420,387] equal(f(n2,uu),f(u1,uu)).
% 471 [para:352.1.2,367.1.2.2,demod:420,350] equal(uu,f(u2,u2)).
% 473 [para:354.1.2,367.1.2.2,demod:420] equal(f(n2,uu),f(u2,uu)).
% 491 [para:354.1.2,368.1.2.1,demod:448,352] equal(b,f(uu,u2)).
% 515 [para:354.1.2,369.1.2.2,demod:430,420,394] equal(f(n2,uu),f(u3,uu)).
% 557 [para:354.1.2,371.1.2.2,demod:357,430,354] equal(f(n2,uu),v).
% 560 [para:430.1.2,371.1.2.2,demod:557,430] equal(f(u,v),f(uu,v)).
% 574 [para:557.1.1,363.1.2.2,demod:557] equal(f(n2,v),f(u,v)).
% 597 [para:449.1.2,373.1.2.2,demod:557,515] equal(f(u1,v),f(b,v)).
% 600 [para:597.1.2,358.1.2] -equal(f(a,v),f(u1,v)).
% 621 [para:357.1.2,375.1.2.2,demod:574,560,357] equal(f(n2,v),f(v,v)).
% 639 [para:491.1.2,376.1.2.1,demod:597,574,560,557,473] equal(f(n2,v),f(u1,v)).
% 646 [para:639.1.2,600.1.2] -equal(f(a,v),f(n2,v)).
% 921 [para:471.1.2,379.1.1.2,demod:355] equal(f(f(n3,n2),uu),f(a,a)).
% 1190 [para:381.1.1,396.1.2.2.2,demod:420,350] equal(f(n3,f(X,u)),f(f(n3,X),uu)).
% 1209 [para:1190.1.2,921.1.1,demod:557,427,420] equal(v,f(a,a)).
% 1211 [para:1209.1.2,347.1.2.1] equal(f(a,f(a,X)),f(v,f(a,X))).
% 1237 [para:1209.1.2,1211.1.2.2,demod:621,1209,cut:646] 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: 493
% derived clauses: 6342
% kept clauses: 1197
% kept size sum: 16355
% kept mid-nuclei: 0
% kept new demods: 1215
% forw unit-subs: 2574
% 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.16
% process. runtime: 0.16
% 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/LDA/LDA002-1+eq_r.in")
%
%------------------------------------------------------------------------------