%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : NUM003-1 : 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 : art02.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/NUM/NUM003-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: short
%
% strategies selected:
% (hyper 12 #t 3 5)
% (binary-unit 30 #f 3 5)
% (binary-posweight-order 90 #f 3 5)
% (binary-double 30 #f)
% (binary 48 #t 3 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(13,40,1,26,0,1,26,50,1,39,0,1,39,50,1,52,0,1,52,50,1,65,0,1,65,50,1,78,0,1,78,50,1,91,0,1,91,50,1,104,0,1,104,50,1,117,0,1,117,50,1,130,0,1,130,50,1,143,0,1,143,50,1,156,0,1,156,50,1,169,0,1,169,50,1,182,0,1,182,50,1,195,0,1,195,50,1,208,0,1,208,50,1,221,0,2,221,50,2,234,0,2,234,50,2,247,0,2,247,50,2,260,0,2,260,50,2,260,40,2,273,0,2)
%
%
% START OF PROOF
% 261 [] equalish(X,X).
% 262 [] -equalish(Y,Z) | -equalish(X,Y) | equalish(X,Z).
% 263 [] equalish(add(X,Y),add(Y,X)).
% 267 [] equalish(add(subtract(X,Y),Z),subtract(add(X,Z),Y)).
% 268 [] equalish(subtract(add(X,Y),Z),add(subtract(X,Z),Y)).
% 271 [] -equalish(X,subtract(Y,Z)) | equalish(X,subtract(U,Z)) | -equalish(Y,U).
% 273 [] -equalish(add(a,subtract(b,c)),add(subtract(a,c),b)).
% 280 [binary:263,262.2] -equalish(add(X,Y),Z) | equalish(add(Y,X),Z).
% 285 [binary:262.3,273] -equalish(add(a,subtract(b,c)),X) | -equalish(X,add(subtract(a,c),b)).
% 302 [binary:262.2,267] -equalish(subtract(add(X,Y),Z),U) | equalish(add(subtract(X,Z),Y),U).
% 367 [binary:261,271] equalish(subtract(X,Y),subtract(Z,Y)) | -equalish(X,Z).
% 385 [binary:268,285.2] -equalish(add(a,subtract(b,c)),subtract(add(a,b),c)).
% 387 [binary:263,367.2] equalish(subtract(add(X,Y),Z),subtract(add(Y,X),Z)).
% 414 [binary:280.2,385] -equalish(add(subtract(b,c),a),subtract(add(a,b),c)).
% 571 [binary:414,302.2,cut:387] 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 3
% seconds given: 30
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 120
% derived clauses: 1628
% kept clauses: 228
% kept size sum: 2605
% kept mid-nuclei: 0
% kept new demods: 0
% forw unit-subs: 264
% forw double-subs: 3
% forw overdouble-subs: 0
% backward subs: 1
% fast unit cutoff: 1
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 0.3
% process. runtime: 0.3
% specific non-discr-tree subsumption statistics:
% tried: 4
% length fails: 0
% strength fails: 4
% 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/NUM/NUM003-1+noeq.in")
%
%------------------------------------------------------------------------------