%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : LCL215-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 : art05.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 29.5s
% Output : Assurance 29.5s
% 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/LCL215-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 5 5)
% (binary-unit 11 #f 5 5)
% (binary-double 17 #f 5 5)
% (hyper 29 #f)
% (binary-unit 34 #f)
% (binary-weightorder 40 #f)
% (binary 17 #t)
% (binary-order 29 #f)
% (binary-posweight-order 111 #f 5 5)
% (binary-posweight-order 283 #f)
%
%
% **** EMPTY CLAUSE DERIVED ****
%
%
% timer checkpoints: c(9,40,0,18,0,1,836,50,5,845,0,5,22268,4,2106,25406,5,2806,25406,1,2806,25406,50,2806,25406,40,2806,25415,0,2806,29319,50,3145,29328,0,3145,41977,3,3496)
%
%
% START OF PROOF
% 29320 [] axiom(or(not(or(X,X)),X)).
% 29322 [] axiom(or(not(or(X,Y)),or(Y,X))).
% 29323 [] axiom(or(not(or(X,or(Y,Z))),or(Y,or(X,Z)))).
% 29324 [] axiom(or(not(or(not(X),Y)),or(not(or(Z,X)),or(Z,Y)))).
% 29325 [] -axiom(X) | theorem(X).
% 29326 [] -axiom(or(not(X),Y)) | -theorem(X) | theorem(Y).
% 29327 [] -theorem(or(not(X),Y)) | -axiom(or(not(Z),X)) | theorem(or(not(Z),Y)).
% 29328 [] -theorem(or(not(or(not(p),q)),or(not(or(p,q)),q))).
% 29330 [binary:29325,29320] theorem(or(not(or(X,X)),X)).
% 29337 [binary:29330,29326.2] -axiom(or(not(or(not(or(X,X)),X)),Y)) | theorem(Y).
% 29339 [binary:29328,29326.3] -axiom(or(not(X),or(not(or(not(p),q)),or(not(or(p,q)),q)))) | -theorem(X).
% 29355 [binary:29326,29323] -theorem(or(X,or(Y,Z))) | theorem(or(Y,or(X,Z))).
% 29386 [binary:29322,29327.2] -theorem(or(not(or(X,Y)),Z)) | theorem(or(not(or(Y,X)),Z)).
% 29392 [binary:29324,29327.2] -theorem(or(not(or(not(or(X,Y)),or(X,Z))),U)) | theorem(or(not(or(not(Y),Z)),U)).
% 29443 [binary:29324,29337] theorem(or(not(or(X,or(Y,Y))),or(X,Y))).
% 29491 [binary:29323,29339] -theorem(or(not(or(p,q)),or(not(or(not(p),q)),q))).
% 31077 [binary:29392,29443] theorem(or(not(or(not(X),Y)),or(not(or(Y,X)),Y))).
% 31606 [binary:29386.2,29491] -theorem(or(not(or(q,p)),or(not(or(not(p),q)),q))).
% 42100 [binary:29355,31077,slowcut:31606] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% not using sos strategy
% using unit paramodulation 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: 12339
% derived clauses: 935117
% kept clauses: 26447
% kept size sum: 475438
% kept mid-nuclei: 14605
% kept new demods: 0
% forw unit-subs: 46262
% forw double-subs: 432
% forw overdouble-subs: 109
% backward subs: 273
% fast unit cutoff: 2
% full unit cutoff: 2
% dbl unit cutoff: 0
% real runtime : 35.64
% process. runtime: 35.14
% specific non-discr-tree subsumption statistics:
% tried: 396
% length fails: 8
% strength fails: 52
% predlist fails: 46
% aux str. fails: 34
% by-lit fails: 6
% full subs tried: 250
% full subs fail: 141
%
% ; 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/LCL215-1+noeq.in")
%
%------------------------------------------------------------------------------