TSTP Solution File: SYN650-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SYN650-1 : TPTP v3.4.2. Released v2.5.0.
% Transfm : add_equality:r
% Format : otter:hypothesis:set(auto),clear(print_given)
% Command : gandalf-wrapper -time %d %s
% Computer : art03.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 20.0s
% Output : Assurance 20.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/SYN/SYN650-1+noeq.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: nne
% detected subclass: medium
%
% strategies selected:
% (hyper 27 #f 6 11)
% (binary-unit 10 #f 6 11)
% (binary-double 16 #f 6 11)
% (binary 54 #t 6 11)
% (binary-order 27 #f 6 11)
% (binary-posweight-order 125 #f)
% (binary-order-sos 54 #t)
% (binary-unit-uniteq 27 #f)
% (binary-weightorder 54 #f)
% (binary-order 54 #f)
% (hyper-order 43 #f)
% (binary 109 #t)
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(45,40,0,90,0,0,172480,4,2036,183382,50,2108,183382,40,2108,183427,0,2108)
%
%
% START OF PROOF
% 183383 [] p23(f18(f11(X,f12(Y,Z)),f9(f11(X,f12(Y,Z)),c31,U))) | -p25(f16(f17(U,V)),f16(f17(U,f21(X,Y,Z,U,V)))) | p8(V,f9(f11(X,f12(Y,Z)),c31,U)) | -p24(V,f20(f11(X,f12(Y,Z)))) | -p22(f3(f4(f5(c26))),Y).
% 183384 [] p23(f18(f11(X,f12(Y,Z)),f9(f11(X,f12(Y,Z)),c31,U))) | p24(f21(X,Y,Z,U,V),f20(f11(X,f12(Y,Z)))) | p8(V,f9(f11(X,f12(Y,Z)),c31,U)) | -p24(V,f20(f11(X,f12(Y,Z)))) | -p22(f3(f4(f5(c26))),Y).
% 183388 [] p25(f16(f17(X,f9(f11(Y,f12(Z,U)),c31,X))),f16(f17(X,V))) | -p24(V,f20(f11(Y,f12(Z,U)))) | -p22(f3(f4(f5(c26))),Z).
% 183390 [] p8(f16(f17(c32,f9(f11(c29,f12(c27,c30)),c31,c32))),f13(f15(f11(c29,f12(c27,c30)),c32),f14(f3(f4(f5(c26)))))).
% 183393 [] p8(f16(f17(c32,c33)),f13(f15(f11(c29,f12(c27,c30)),c32),f14(f3(f4(f5(c26)))))).
% 183402 [] -p25(X,Y) | -p8(Y,U) | -p8(X,Z) | p25(Z,U).
% 183408 [] -p8(X,Z) | -p8(X,Y) | p8(Z,Y).
% 183416 [] p24(c33,f20(f11(c29,f12(c27,c30)))).
% 183418 [] p22(f3(f4(f5(c26))),c27).
% 183423 [] p8(X,X).
% 183426 [] -p8(c33,f9(f11(c29,f12(c27,c30)),c31,c32)).
% 183427 [] -p23(f18(f11(c29,f12(c27,c30)),f9(f11(c29,f12(c27,c30)),c31,c32))).
% 183465 [binary:183426,183383.3,cut:183427,cut:183416,cut:183418] -p25(f16(f17(c32,c33)),f16(f17(c32,f21(c29,c27,c30,c32,c33)))).
% 183476 [binary:183426,183384.3,cut:183427,cut:183416,cut:183418] p24(f21(c29,c27,c30,c32,c33),f20(f11(c29,f12(c27,c30)))).
% 183495 [binary:183423,183408.2] -p8(X,Y) | p8(Y,X).
% 183513 [binary:183476,183388.2,cut:183418] p25(f16(f17(X,f9(f11(c29,f12(c27,c30)),c31,X))),f16(f17(X,f21(c29,c27,c30,c32,c33)))).
% 183589 [binary:183423,183402.2] -p25(X,Y) | -p8(X,Z) | p25(Z,Y).
% 183599 [binary:183465,183589.3] -p25(X,f16(f17(c32,f21(c29,c27,c30,c32,c33)))) | -p8(X,f16(f17(c32,c33))).
% 183611 [binary:183495,183393] p8(f13(f15(f11(c29,f12(c27,c30)),c32),f14(f3(f4(f5(c26))))),f16(f17(c32,c33))).
% 184374 [binary:183589,183513] -p8(f16(f17(X,f9(f11(c29,f12(c27,c30)),c31,X))),Y) | p25(Y,f16(f17(X,f21(c29,c27,c30,c32,c33)))).
% 184637 [binary:183390,184374] p25(f13(f15(f11(c29,f12(c27,c30)),c32),f14(f3(f4(f5(c26))))),f16(f17(c32,f21(c29,c27,c30,c32,c33)))).
% 184720 [binary:183599,184637,cut:183611] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% not using sos strategy
% using unit 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 11
% clause depth limited to 6
% seconds given: 10
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 504
% derived clauses: 565114
% kept clauses: 28853
% kept size sum: 27309
% kept mid-nuclei: 23428
% kept new demods: 0
% forw unit-subs: 24918
% forw double-subs: 10827
% forw overdouble-subs: 8025
% backward subs: 0
% fast unit cutoff: 601
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime: 21.12
% process. runtime: 21.13
% specific non-discr-tree subsumption statistics:
% tried: 493730
% length fails: 104
% strength fails: 1148
% predlist fails: 153644
% aux str. fails: 0
% by-lit fails: 1877
% full subs tried: 335230
% full subs fail: 326968
%
% ; 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/SYN/SYN650-1+noeq.in")
%
%------------------------------------------------------------------------------