%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SYN003-1.006 : 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 : art06.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/SYN003-1.006+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 5)
% (binary-unit 30 #f 1 5)
% (binary-posweight-order 90 #f 1 5)
% (binary-double 30 #f)
% (binary 48 #t 1 5)
% (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 *********
% 
% 
% timer checkpoints: c(24,40,1,48,0,1,48,50,1,72,0,1,72,50,1,96,0,1,96,50,1,120,0,1,120,50,1,144,0,2,144,50,2,168,0,2,168,50,2,192,0,2,192,50,2,216,0,2,216,50,2,240,0,2,240,50,2,264,0,2,264,50,2,288,0,2,288,50,2,312,0,2,312,50,2,336,0,2,336,50,2,360,0,2,360,50,2,384,0,2,384,50,2,408,0,2,408,50,2,432,0,2,432,50,2,456,0,2,456,50,2,480,0,2,480,50,2,504,0,2,504,50,2,528,0,2,528,50,2,528,40,2,552,0,2)
% 
% 
% START OF PROOF
% 529 [] r(0).
% 531 [] p_1(0).
% 532 [?] ?
% 533 [?] ?
% 534 [?] ?
% 535 [?] ?
% 536 [?] ?
% 542 [?] ?
% 543 [?] ?
% 544 [?] ?
% 545 [?] ?
% 546 [?] ?
% 552 [] -p_6(0).
% 553 [input:532,cut:529] r_5(0).
% 554 [input:533,cut:529] r_4(0).
% 555 [input:534,cut:529] r_3(0).
% 556 [input:535,cut:529] r_2(0).
% 557 [input:536,cut:529] r_1(0).
% 563 [input:542,cut:552] -r_5(0) | -p_5(0).
% 564 [binary:553,563] -p_5(0).
% 565 [input:543,cut:564] -r_4(0) | -p_4(0).
% 566 [binary:554,565] -p_4(0).
% 567 [input:544,cut:566] -r_3(0) | -p_3(0).
% 568 [binary:555,567] -p_3(0).
% 569 [input:545,cut:568] -r_2(0) | -p_2(0).
% 570 [binary:556,569] -p_2(0).
% 571 [input:546,cut:531,cut:570] -r_1(0).
% 572 [binary:557,571] 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 5
% clause depth limited to 1
% seconds given: 30
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    44
%  derived clauses:   20
%  kept clauses:      4
%  kept size sum:     8
%  kept mid-nuclei:   0
%  kept new demods:   0
%  forw unit-subs:    0
%  forw double-subs: 0
%  forw overdouble-subs: 0
%  backward subs:     12
%  fast unit cutoff:  15
%  full unit cutoff:  0
%  dbl  unit cutoff:  0
%  real runtime:  0.1
%  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/SYN003-1.006+noeq.in")
% 
%------------------------------------------------------------------------------