TSTP Solution File: SYN690-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SYN690-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 : 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 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/SYN690-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(62,40,1,124,0,1,50326,4,2038,125611,5,2702,125611,1,2702,125611,50,2702,125611,40,2702,125673,0,2702,126104,50,2704,126166,0,2704)
%
%
% START OF PROOF
% 126105 [] -p4(f5(X,f18(f20(f22(f24(c45,Y),Z),U),X)),f5(f7(Z,X),f18(f20(f22(f24(c45,Y),Z),U),X))) | -p4(f5(U,f18(f20(f22(f24(c45,Y),Z),U),X)),f5(f7(Z,U),f18(f20(f22(f24(c45,Y),Z),U),X))) | -p4(f5(f7(Z,f26(f28(c43,Y),Z)),f30(f32(c42,Y),Z)),f5(f7(Z,f26(f28(c44,Y),Z)),f30(f32(c42,Y),Z))) | -p34(c36,Y) | p2(U,X).
% 126106 [] -p4(f5(U,f18(f20(f22(f24(c45,Y),Z),U),X)),f5(f7(Z,U),f18(f20(f22(f24(c45,Y),Z),U),X))) | -p4(f5(X,f18(f20(f22(f24(c45,Y),Z),U),X)),f5(f7(Z,X),f18(f20(f22(f24(c45,Y),Z),U),X))) | p4(f5(f26(f28(c43,Y),Z),V),f5(f26(f28(c44,Y),Z),V)) | -p35(f10(Y,V),f30(f32(c42,Y),Z)) | -p34(c36,Y) | p2(U,X).
% 126109 [] -p4(f5(X,f12(f14(f16(c41,X),Y),Z)),f5(Y,f12(f14(f16(c41,X),Y),Z))) | p4(f5(f7(c39,X),Z),f5(f7(c39,Y),Z)).
% 126110 [] p35(f10(c37,f12(f14(f16(c41,X),Y),Z)),Z) | p4(f5(f7(c39,X),Z),f5(f7(c39,Y),Z)).
% 126145 [] p4(f5(c38,X),f5(f7(c39,c38),X)).
% 126146 [] p4(f5(c40,X),f5(f7(c39,c40),X)).
% 126147 [] p34(c36,c37).
% 126166 [] -p2(c38,c40).
% 126168 [binary:126166,126105.5] -p4(f5(c38,f18(f20(f22(f24(c45,X),Y),c38),c40)),f5(f7(Y,c38),f18(f20(f22(f24(c45,X),Y),c38),c40))) | -p4(f5(c40,f18(f20(f22(f24(c45,X),Y),c38),c40)),f5(f7(Y,c40),f18(f20(f22(f24(c45,X),Y),c38),c40))) | -p4(f5(f7(Y,f26(f28(c43,X),Y)),f30(f32(c42,X),Y)),f5(f7(Y,f26(f28(c44,X),Y)),f30(f32(c42,X),Y))) | -p34(c36,X).
% 126170 [binary:126166,126106.6] -p4(f5(c40,f18(f20(f22(f24(c45,X),Y),c38),c40)),f5(f7(Y,c40),f18(f20(f22(f24(c45,X),Y),c38),c40))) | -p4(f5(c38,f18(f20(f22(f24(c45,X),Y),c38),c40)),f5(f7(Y,c38),f18(f20(f22(f24(c45,X),Y),c38),c40))) | p4(f5(f26(f28(c43,X),Y),Z),f5(f26(f28(c44,X),Y),Z)) | -p35(f10(X,Z),f30(f32(c42,X),Y)) | -p34(c36,X).
% 126277 [binary:126168,126145,cut:126146] -p4(f5(f7(c39,f26(f28(c43,X),c39)),f30(f32(c42,X),c39)),f5(f7(c39,f26(f28(c44,X),c39)),f30(f32(c42,X),c39))) | -p34(c36,X).
% 126337 [binary:126147,126277.2] -p4(f5(f7(c39,f26(f28(c43,c37),c39)),f30(f32(c42,c37),c39)),f5(f7(c39,f26(f28(c44,c37),c39)),f30(f32(c42,c37),c39))).
% 126350 [binary:126109.2,126337] -p4(f5(f26(f28(c43,c37),c39),f12(f14(f16(c41,f26(f28(c43,c37),c39)),f26(f28(c44,c37),c39)),f30(f32(c42,c37),c39))),f5(f26(f28(c44,c37),c39),f12(f14(f16(c41,f26(f28(c43,c37),c39)),f26(f28(c44,c37),c39)),f30(f32(c42,c37),c39)))).
% 126351 [binary:126110.2,126337] p35(f10(c37,f12(f14(f16(c41,f26(f28(c43,c37),c39)),f26(f28(c44,c37),c39)),f30(f32(c42,c37),c39))),f30(f32(c42,c37),c39)).
% 126459 [binary:126170.4,126351,cut:126350,cut:126145,cut:126146,cut:126147] 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 7
% seconds given: 10
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 753
% derived clauses: 530750
% kept clauses: 19911
% kept size sum: 10305
% kept mid-nuclei: 16217
% kept new demods: 0
% forw unit-subs: 66944
% forw double-subs: 152944
% forw overdouble-subs: 40658
% backward subs: 29
% fast unit cutoff: 81087
% full unit cutoff: 1353
% dbl unit cutoff: 0
% real runtime: 27.8
% process. runtime: 27.5
% specific non-discr-tree subsumption statistics:
% tried: 3206948
% length fails: 32541
% strength fails: 43766
% predlist fails: 453322
% aux str. fails: 25010
% by-lit fails: 349357
% full subs tried: 2023484
% full subs fail: 1986687
%
% ; 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/SYN690-1+noeq.in")
%
%------------------------------------------------------------------------------