%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SYN085-1.010 : TPTP v3.4.2. Released v1.0.0.
% Transfm  : add_equality:r
% Format   : otter:hypothesis:set(auto),clear(print_given)
% Command  : gandalf-wrapper -time %d %s

% Computer : art08.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/SYN085-1.010+noeq.in
% Using automatic strategy selection.
% Time limit in seconds: 600
% 
% prove-all-passes started
% 
% detected problem class: hne
% detected subclass: medium
% detected subclass: short
% 
% strategies selected: 
% (hyper 12 #t 1 21)
% (binary-unit 30 #f 1 21)
% (binary-posweight-order 90 #f 1 21)
% (binary-double 30 #f)
% (binary 48 #t 1 21)
% (hyper 30 #f)
% (binary-posweight-order 180 #f)
% (binary-weightorder 42 #f)
% (binary-order 30 #f)
% (binary-unit 48 #f)
% (binary 60 #t)
% 
% 
% ********* EMPTY CLAUSE DERIVED *********
% 
% **** EMPTY CLAUSE DERIVED ****
% By given clause simplification.
% 
% 
% timer checkpoints: c(12,40,0,24,0,0,24,50,0,36,0,0,36,50,0,48,0,0,48,50,0,60,0,0,60,50,0,72,0,0,72,50,0,84,0,0,84,50,0,96,0,0,96,50,0,108,0,1,108,50,1,120,0,1,120,50,1,132,0,1,132,50,1,144,0,1,144,50,1,156,0,1,156,50,1,168,0,1,168,50,1,180,0,1,180,50,1,192,0,1,192,50,1,204,0,1,204,50,1,216,0,1,216,50,1,228,0,1,228,50,1,240,0,1,240,50,1,252,0,1,252,50,1,264,0,1,264,50,1,264,40,1,276,0,1)
% 
% 
% START OF PROOF
% 265 [] -p_10(0) | -p_9(0) | -p_8(0) | -p_7(0) | -p_6(0) | -p_5(0) | -p_4(0) | -p_3(0) | -p_2(0) | -p_1(0) | p_0(0).
% 266 [] p_1(0).
% 267 [] p_2(0).
% 268 [] p_3(0).
% 269 [] p_4(0).
% 270 [] p_5(0).
% 271 [] p_6(0).
% 272 [] p_7(0).
% 273 [] p_8(0).
% 274 [] p_9(0).
% 275 [] p_10(0).
% 276 [] -p_0(0).
% 277 [input:265,cut:275,cut:274,cut:273,cut:272,cut:271,cut:270,cut:269,cut:268,cut:267,cut:266,cut:276] 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 21
% clause depth limited to 1
% seconds given: 30
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    27
%  derived clauses:   1
%  kept clauses:      0
%  kept size sum:     0
%  kept mid-nuclei:   0
%  kept new demods:   0
%  forw unit-subs:    0
%  forw double-subs: 0
%  forw overdouble-subs: 0
%  backward subs:     0
%  fast unit cutoff:  1
%  full unit cutoff:  0
%  dbl  unit cutoff:  0
%  real runtime:  0.0
%  process. runtime:  0.1
% specific non-discr-tree subsumption statistics: 
%  tried:           0
%  length fails:    0
%  strength fails:  0
%  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/SYN085-1.010+noeq.in")
% 
%------------------------------------------------------------------------------