%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : LCL218-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 49.5s
% Output : Assurance 49.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/LCL218-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,0,18,0,0,21852,4,2176,25112,5,2901,25112,1,2901,25112,50,2902,25112,40,2902,25121,0,2902,39186,3,3453,40342,4,3728,45505,1,4003,45505,50,4005,45505,40,4005,45514,0,4005,74191,3,4857,82811,4,5281,88488,5,5706,88489,5,5706,88489,1,5706,88489,50,5709,88489,40,5709,88498,0,5709)
%
%
% START OF PROOF
% 88490 [] axiom(or(not(or(X,X)),X)).
% 88491 [] axiom(or(not(X),or(Y,X))).
% 88492 [] axiom(or(not(or(X,Y)),or(Y,X))).
% 88493 [] axiom(or(not(or(X,or(Y,Z))),or(Y,or(X,Z)))).
% 88495 [] -axiom(X) | theorem(X).
% 88496 [] -axiom(or(not(X),Y)) | -theorem(X) | theorem(Y).
% 88497 [] -theorem(or(not(X),Y)) | -axiom(or(not(Z),X)) | theorem(or(not(Z),Y)).
% 88498 [] -theorem(or(not(or(not(or(p,q)),q)),or(not(p),q))).
% 88500 [hyper:88495,88490] theorem(or(not(or(X,X)),X)).
% 88510 [hyper:88497,88500,88491] theorem(or(not(X),X)).
% 88543 [hyper:88496,88493,88510] theorem(or(X,or(not(or(X,Y)),Y))).
% 88735 [hyper:88497,88543,88492] theorem(or(not(or(X,Y)),or(not(or(not(or(Y,X)),Z)),Z))).
% 90741 [hyper:88497,88735,88491] theorem(or(not(X),or(not(or(not(or(X,Y)),Z)),Z))).
% 94680 [hyper:88496,90741,88493,slowcut:88498] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using hyperresolution
% not using sos strategy
% using positive unit paramodulation strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% seconds given: 29
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 12866
% derived clauses: 1195336
% kept clauses: 66609
% kept size sum: 58491
% kept mid-nuclei: 26513
% kept new demods: 0
% forw unit-subs: 194602
% forw double-subs: 47262
% forw overdouble-subs: 7474
% backward subs: 24
% fast unit cutoff: 1
% full unit cutoff: 17
% dbl unit cutoff: 0
% real runtime : 58.16
% process. runtime: 57.68
% specific non-discr-tree subsumption statistics:
% tried: 141792
% length fails: 7016
% strength fails: 639
% predlist fails: 53058
% aux str. fails: 222
% by-lit fails: 138
% full subs tried: 73371
% full subs fail: 65897
%
% ; 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/LCL218-1+noeq.in")
%
%------------------------------------------------------------------------------