TSTP Solution File: SYN651-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SYN651-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 : art10.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/SYN651-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 6 7)
% (binary-unit 28 #f 6 7)
% (binary-double 28 #f)
% (binary-posweight-order 28 #f 6 7)
% (binary 28 #t 6 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(45,40,1,90,0,1)
%
%
% START OF PROOF
% 46 [] p23(f5(f7(f10(c24,X),Y),Z),f14(f16(f18(f20(c31,X),Z),Y),U)) | -p23(f5(f7(f10(c24,f12(c25,X)),Y),Z),U).
% 47 [] p23(f5(f7(f10(c24,f12(c25,c26)),c27),X),Y) | -p23(f5(f7(f10(c24,c26),c27),Z),Y) | -p23(f5(c27,X),Z).
% 48 [] p23(f5(f7(f10(c24,f12(c25,X)),Y),Z),U) | -p23(f5(f7(f10(c24,X),Y),Z),V) | -p23(f5(Y,V),U).
% 50 [] p23(f5(X,f14(f16(f18(f20(c31,Y),Z),X),U)),U) | -p23(f5(f7(f10(c24,f12(c25,Y)),X),Z),U).
% 64 [] p23(f5(f7(f10(c24,f12(c25,c26)),c27),c30),c29).
% 77 [] p23(f5(c27,c28),c30).
% 90 [] -p23(f5(f7(f10(c24,f12(c25,f12(c25,c26))),c27),c28),c29).
% 152 [hyper:46,64] p23(f5(f7(f10(c24,c26),c27),c30),f14(f16(f18(f20(c31,c26),c30),c27),c29)).
% 157 [hyper:50,64] p23(f5(c27,f14(f16(f18(f20(c31,c26),c30),c27),c29)),c29).
% 252 [hyper:47,152,77] p23(f5(f7(f10(c24,f12(c25,c26)),c27),c28),f14(f16(f18(f20(c31,c26),c30),c27),c29)).
% 288 [hyper:48,252,157,cut:90] 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 6
% seconds given: 57
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 55
% derived clauses: 328
% kept clauses: 18
% kept size sum: 354
% kept mid-nuclei: 149
% kept new demods: 0
% forw unit-subs: 79
% forw double-subs: 2
% forw overdouble-subs: 0
% backward subs: 0
% fast unit cutoff: 1
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime: 0.1
% process. runtime: 0.1
% specific non-discr-tree subsumption statistics:
% tried: 2
% length fails: 0
% strength fails: 2
% 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/SYN/SYN651-1+noeq.in")
%
%------------------------------------------------------------------------------