TSTP Solution File: ALG004-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : ALG004-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 : 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/ALG/ALG004-1+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 5)
% (binary-unit 12 #f)
% (binary-unit-uniteq 12 #f)
% (binary-posweight-kb-big-order 60 #f 3 5)
% (binary-posweight-lex-big-order 30 #f 3 5)
% (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(8,40,1,16,0,2,346,50,5,354,0,5)
%
%
% START OF PROOF
% 347 [] equal(X,X).
% 348 [] -equal(multiply(U,Y),Z) | -equal(multiply(X,Y),Z) | equal(X,U).
% 349 [] -equal(multiply(X,U),Z) | -equal(multiply(X,Y),Z) | equal(Y,U).
% 350 [] equal(multiply(multiply(X,Y),multiply(Z,U)),multiply(multiply(X,Z),multiply(Y,U))).
% 351 [] equal(multiply(b,b0),multiply(a,a0)).
% 352 [] equal(multiply(d,b0),multiply(c,a0)).
% 353 [] equal(multiply(b,d0),multiply(a,c0)).
% 354 [] -equal(multiply(d,d0),multiply(c,c0)).
% 393 [para:351.1.2,350.1.1.1] equal(multiply(multiply(b,b0),multiply(X,Y)),multiply(multiply(a,X),multiply(a0,Y))).
% 397 [para:352.1.2,350.1.1.1] equal(multiply(multiply(d,b0),multiply(X,Y)),multiply(multiply(c,X),multiply(a0,Y))).
% 402 [para:353.1.2,350.1.1.2] equal(multiply(multiply(X,Y),multiply(b,d0)),multiply(multiply(X,a),multiply(Y,c0))).
% 409 [para:350.1.1,350.1.1.1] equal(multiply(multiply(multiply(X,Y),multiply(Z,U)),multiply(V,W)),multiply(multiply(multiply(X,Z),V),multiply(multiply(Y,U),W))).
% 410 [para:350.1.1,350.1.1.2] equal(multiply(multiply(X,Y),multiply(multiply(Z,U),multiply(V,W))),multiply(multiply(X,multiply(Z,V)),multiply(Y,multiply(U,W)))).
% 474 [para:397.1.2,350.1.1.2] equal(multiply(multiply(X,Y),multiply(multiply(d,b0),multiply(Z,U))),multiply(multiply(X,multiply(c,Z)),multiply(Y,multiply(a0,U)))).
% 529 [para:402.1.1,350.1.1] equal(multiply(multiply(X,a),multiply(Y,c0)),multiply(multiply(X,b),multiply(Y,d0))).
% 603 [para:393.1.2,409.1.2.2] equal(multiply(multiply(multiply(X,a),multiply(Y,Z)),multiply(U,multiply(a0,V))),multiply(multiply(multiply(X,Y),U),multiply(multiply(b,b0),multiply(Z,V)))).
% 670 [para:529.1.1,350.1.2.1] equal(multiply(multiply(multiply(X,a),Y),multiply(multiply(Z,c0),U)),multiply(multiply(multiply(X,b),multiply(Z,d0)),multiply(Y,U))).
% 1524 [para:474.1.1,410.1.1] equal(multiply(multiply(X,multiply(c,Y)),multiply(Z,multiply(a0,U))),multiply(multiply(X,multiply(d,Y)),multiply(Z,multiply(b0,U)))).
% 2380 [hyper:349,603,670] equal(multiply(multiply(X,c0),multiply(b0,Y)),multiply(multiply(X,d0),multiply(a0,Y))).
% 2419 [para:2380.1.1,350.1.1.2] equal(multiply(multiply(X,Y),multiply(multiply(Z,d0),multiply(a0,U))),multiply(multiply(X,multiply(Z,c0)),multiply(Y,multiply(b0,U)))).
% 2797 [hyper:348,2419,1524] equal(multiply(X,multiply(c,c0)),multiply(X,multiply(d,d0))).
% 2816 [hyper:349,2797,347,cut:354] 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
% clause length limited to 5
% clause depth limited to 4
% seconds given: 30
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 187
% derived clauses: 140643
% kept clauses: 1344
% kept size sum: 36300
% kept mid-nuclei: 1443
% kept new demods: 136
% forw unit-subs: 57876
% 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 : 2.96
% process. runtime: 2.95
% 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/ALG/ALG004-1+eq_r.in")
%
%------------------------------------------------------------------------------