%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : LCL214-1 : TPTP v3.4.2. Released v1.1.0.
% Transfm : add_equality:r
% Format : otter:hypothesis:set(auto),clear(print_given)
% Command : gandalf-wrapper -time %d %s
% Computer : art09.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 30.0s
% Output : Assurance 30.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/LCL/LCL214-1+noeq.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: hne
% detected subclass: small
% detected subclass: short
%
% strategies selected:
% (hyper 29 #f 6 5)
% (binary-unit 11 #f 6 5)
% (binary-double 17 #f 6 5)
% (hyper 29 #f)
% (binary-unit 34 #f)
% (binary-weightorder 40 #f)
% (binary 17 #t)
% (binary-order 29 #f)
% (binary-posweight-order 111 #f 6 5)
% (binary-posweight-order 283 #f)
%
%
% **** EMPTY CLAUSE DERIVED ****
%
%
% timer checkpoints: c(9,40,1,18,0,1,21786,4,2177,27406,1,2902,27406,50,2903,27406,40,2903,27415,0,2903)
%
%
% START OF PROOF
% 27407 [] axiom(or(not(or(X,X)),X)).
% 27409 [] axiom(or(not(or(X,Y)),or(Y,X))).
% 27410 [] axiom(or(not(or(X,or(Y,Z))),or(Y,or(X,Z)))).
% 27411 [] axiom(or(not(or(not(X),Y)),or(not(or(Z,X)),or(Z,Y)))).
% 27412 [] -axiom(X) | theorem(X).
% 27413 [] -axiom(or(not(X),Y)) | -theorem(X) | theorem(Y).
% 27414 [] -theorem(or(not(X),Y)) | -axiom(or(not(Z),X)) | theorem(or(not(Z),Y)).
% 27415 [] -theorem(or(not(or(p,q)),or(not(or(not(p),q)),q))).
% 27417 [binary:27412,27407] theorem(or(not(or(X,X)),X)).
% 27424 [binary:27417,27413.2] -axiom(or(not(or(not(or(X,X)),X)),Y)) | theorem(Y).
% 27439 [binary:27413,27410] -theorem(or(X,or(Y,Z))) | theorem(or(Y,or(X,Z))).
% 27470 [binary:27415,27414.3] -theorem(or(not(X),or(not(or(not(p),q)),q))) | -axiom(or(not(or(p,q)),X)).
% 27477 [binary:27411,27414.2] -theorem(or(not(or(not(or(X,Y)),or(X,Z))),U)) | theorem(or(not(or(not(Y),Z)),U)).
% 27526 [binary:27411,27424] theorem(or(not(or(X,or(Y,Y))),or(X,Y))).
% 28032 [binary:27409,27470.2] -theorem(or(not(or(q,p)),or(not(or(not(p),q)),q))).
% 28823 [binary:27477,27526] theorem(or(not(or(not(X),Y)),or(not(or(Y,X)),Y))).
% 36744 [binary:27439,28823,slowcut:28032] 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 6
% seconds given: 11
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 9334
% derived clauses: 137576
% kept clauses: 18913
% kept size sum: 358144
% kept mid-nuclei: 17137
% kept new demods: 0
% forw unit-subs: 40306
% forw double-subs: 1779
% forw overdouble-subs: 578
% backward subs: 37
% fast unit cutoff: 0
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 30.98
% process. runtime: 30.97
% specific non-discr-tree subsumption statistics:
% tried: 4857
% length fails: 162
% strength fails: 1244
% predlist fails: 16
% aux str. fails: 14
% by-lit fails: 31
% full subs tried: 3350
% full subs fail: 2772
%
% ; 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/LCL/LCL214-1+noeq.in")
%
%------------------------------------------------------------------------------