TSTP Solution File: SYN572-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SYN572-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 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/SYN/SYN572-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 5 7)
% (binary-unit 28 #f 5 7)
% (binary-double 28 #f)
% (binary-posweight-order 28 #f 5 7)
% (binary 28 #t 5 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)
%
%
% **** EMPTY CLAUSE DERIVED ****
%
%
% timer checkpoints: c(20,40,0,40,0,0)
%
%
% START OF PROOF
% 21 [] p2(f3(X,Y),f3(Z,U)) | -p2(X,Z) | -p2(Y,U).
% 22 [] p4(f11(X,Y),f11(Z,U)) | -p4(X,Z) | -p4(Y,U).
% 23 [] -p12(X,Y) | -p4(Y,U) | -p4(X,Z) | p12(Z,U).
% 24 [] p2(f3(X,f3(Y,Z)),f3(f3(X,Y),Z)).
% 25 [] p12(f10(f3(X,Y)),f11(f10(X),f10(Y))).
% 26 [] -p4(X,Z) | -p4(X,Y) | p4(Z,Y).
% 28 [] -p2(X,Z) | -p2(X,Y) | p2(Z,Y).
% 29 [] p2(f3(X,f9(X)),f5(f7(f8(c13)))).
% 31 [] p4(f10(X),f10(Y)) | -p2(X,Y).
% 35 [] p2(f3(X,f5(f7(f8(c13)))),X).
% 36 [] p4(f10(f9(X)),f10(X)).
% 37 [] p4(X,X).
% 39 [] p2(X,X).
% 40 [] -p12(f10(c14),f11(f10(f3(c14,c15)),f10(c15))).
% 58 [hyper:26,36,37] p4(f10(X),f10(f9(X))).
% 64 [hyper:22,58,58] p4(f11(f10(X),f10(Y)),f11(f10(f9(X)),f10(f9(Y)))).
% 71 [hyper:26,58,36] p4(f10(f9(f9(X))),f10(X)).
% 82 [hyper:22,71,36] p4(f11(f10(f9(X)),f10(f9(f9(Y)))),f11(f10(X),f10(Y))).
% 211 [hyper:28,29,39] p2(f5(f7(f8(c13))),f3(X,f9(X))).
% 228 [hyper:21,211,39] p2(f3(X,f5(f7(f8(c13)))),f3(X,f3(Y,f9(Y)))).
% 562 [hyper:23,64,25,37] p12(f10(f3(X,Y)),f11(f10(f9(X)),f10(f9(Y)))).
% 3394 [hyper:28,228,35] p2(f3(X,f3(Y,f9(Y))),X).
% 3459 [hyper:28,3394,24] p2(f3(f3(X,Y),f9(Y)),X).
% 3697 [hyper:31,3459] p4(f10(f3(f3(X,Y),f9(Y))),f10(X)).
% 4308 [hyper:23,3697,562,82,slowcut:40] 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 7
% clause depth limited to 5
% seconds given: 57
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 175
% derived clauses: 29651
% kept clauses: 1528
% kept size sum: 29382
% kept mid-nuclei: 2727
% kept new demods: 0
% forw unit-subs: 12363
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 0
% fast unit cutoff: 0
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime: 0.28
% process. runtime: 0.26
% specific non-discr-tree subsumption statistics:
% tried: 90
% length fails: 0
% strength fails: 1
% predlist fails: 89
% 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/SYN/SYN572-1+noeq.in")
%
%------------------------------------------------------------------------------