TSTP Solution File: SYN614-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SYN614-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 : art09.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 19.6s
% Output : Assurance 19.6s
% 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/SYN614-1+noeq.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: hne
% detected subclass: medium
% detected subclass: long
%
% strategies selected:
% (hyper 57 #f 9 7)
% (binary-unit 28 #f 9 7)
% (binary-double 28 #f)
% (binary-posweight-order 28 #f 9 7)
% (binary 28 #t 9 7)
% (hyper 28 #t)
% (hyper 159 #f)
% (binary-posweight-order 85 #f)
% (binary-weightorder 39 #f)
% (binary-order 28 #f)
% (binary-unit 45 #f)
% (binary 47 #t)
%
%
% SOS clause
% -p19(X,f3(f4(f5(c22)))) | -p20(Y,f6(f3(f4(f5(c22))),c21)) | -p2(f14(f16(c28,f17(c21,c27)),c25),f3(c22)) | -p7(c25,f8(f10(f12(f11(f3(f5(c22)))),X),f8(f10(f11(f3(f4(f5(c22)))),f14(f16(c28,f17(c21,c27)),c25)),f9(f11(Y),f10(f11(f3(f4(f5(c22)))),c27))))).
% was split for some strategies as:
% -p19(X,f3(f4(f5(c22)))) | -p7(c25,f8(f10(f12(f11(f3(f5(c22)))),X),f8(f10(f11(f3(f4(f5(c22)))),f14(f16(c28,f17(c21,c27)),c25)),f9(f11(Y),f10(f11(f3(f4(f5(c22)))),c27))))) | -p20(Y,f6(f3(f4(f5(c22))),c21)).
% -p2(f14(f16(c28,f17(c21,c27)),c25),f3(c22)).
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(31,40,0,62,0,0,919160,4,2102,920156,5,2801,920157,1,2801,920157,50,2806,920157,40,2806,920188,0,2806)
%
%
% START OF PROOF
% 920158 [] p7(c25,f8(f10(f12(f11(f3(f5(c22)))),c23),f8(f10(f11(f3(f4(f5(c22)))),c26),f9(f11(c24),f10(f11(f3(f4(f5(c22)))),c27))))).
% 920163 [] p7(f10(X,Y),f10(Z,U)) | -p2(Y,U) | -p7(X,Z).
% 920164 [] p7(f8(X,Y),f8(Z,U)) | -p7(X,Z) | -p7(Y,U).
% 920169 [] p19(f6(f3(f4(f5(c22))),f18(c21,f3(f5(c22)))),c24).
% 920172 [] -p7(X,Z) | -p7(X,Y) | p7(Z,Y).
% 920174 [] p2(c26,f14(f16(c28,f17(c21,c27)),c25)).
% 920175 [] p7(f11(X),f11(Y)) | -p2(X,Y).
% 920176 [] p2(f5(X),f5(Y)) | -p2(X,Y).
% 920177 [] p2(f4(X),f4(Y)) | -p2(X,Y).
% 920178 [] p2(f3(X),f3(Y)) | -p2(X,Y).
% 920180 [] p20(c24,f6(f3(f4(f5(c22))),c21)).
% 920181 [] p19(c23,f3(f4(f5(c22)))).
% 920183 [] p2(X,X).
% 920184 [] p7(X,X).
% 920188 [] -p7(c25,f8(f10(f12(f11(f3(f5(c22)))),X),f8(f10(f11(f3(f4(f5(c22)))),f14(f16(c28,f17(c21,c27)),c25)),f9(f11(Y),f10(f11(f3(f4(f5(c22)))),c27))))) | -p19(f6(f3(f4(f5(c22))),f18(c21,f3(f5(c22)))),Y) | -p20(Y,f6(f3(f4(f5(c22))),c21)) | -p19(X,f3(f4(f5(c22)))).
% 920209 [binary:920188.3,920180,cut:920169] -p7(c25,f8(f10(f12(f11(f3(f5(c22)))),X),f8(f10(f11(f3(f4(f5(c22)))),f14(f16(c28,f17(c21,c27)),c25)),f9(f11(c24),f10(f11(f3(f4(f5(c22)))),c27))))) | -p19(X,f3(f4(f5(c22)))).
% 920220 [binary:920184,920172.2] -p7(X,Y) | p7(Y,X).
% 920227 [binary:920158,920220] p7(f8(f10(f12(f11(f3(f5(c22)))),c23),f8(f10(f11(f3(f4(f5(c22)))),c26),f9(f11(c24),f10(f11(f3(f4(f5(c22)))),c27)))),c25).
% 920258 [binary:920181,920209.2] -p7(c25,f8(f10(f12(f11(f3(f5(c22)))),c23),f8(f10(f11(f3(f4(f5(c22)))),f14(f16(c28,f17(c21,c27)),c25)),f9(f11(c24),f10(f11(f3(f4(f5(c22)))),c27))))).
% 920290 [binary:920174,920163.2] p7(f10(X,c26),f10(Y,f14(f16(c28,f17(c21,c27)),c25))) | -p7(X,Y).
% 920295 [binary:920172.3,920258] -p7(X,f8(f10(f12(f11(f3(f5(c22)))),c23),f8(f10(f11(f3(f4(f5(c22)))),f14(f16(c28,f17(c21,c27)),c25)),f9(f11(c24),f10(f11(f3(f4(f5(c22)))),c27))))) | -p7(X,c25).
% 920303 [binary:920184,920164.2] p7(f8(X,Y),f8(X,Z)) | -p7(Y,Z).
% 920304 [binary:920184,920164.3] p7(f8(X,Y),f8(Z,Y)) | -p7(X,Z).
% 920638 [binary:920295.2,920227,binarydemod:920176,920177,920178,920175,920290,920304,920303,cut:920183] 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 7
% clause depth limited to 9
% seconds given: 13
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 778
% derived clauses: 1007632
% kept clauses: 58940
% kept size sum: 6108
% kept mid-nuclei: 13147
% kept new demods: 0
% forw unit-subs: 82873
% forw double-subs: 18
% forw overdouble-subs: 13
% backward subs: 2
% fast unit cutoff: 12
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime: 28.52
% process. runtime: 28.7
% specific non-discr-tree subsumption statistics:
% tried: 1430
% length fails: 0
% strength fails: 37
% predlist fails: 1318
% aux str. fails: 1
% by-lit fails: 4
% full subs tried: 66
% full subs fail: 53
%
% ; 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/SYN614-1+noeq.in")
%
%------------------------------------------------------------------------------