%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SWC108-1 : TPTP v3.4.2. Released v2.4.0.
% Transfm : add_equality:r
% Format : otter:hypothesis:set(auto),clear(print_given)
% Command : gandalf-wrapper -time %d %s
% Computer : art10.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 80.0s
% Output : Assurance 80.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/SWC/SWC108-1+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: neq
% detected subclass: big
%
% strategies selected:
% (hyper 28 #f 5 19)
% (binary-unit 28 #f 5 19)
% (binary-double 11 #f 5 19)
% (binary-double 17 #f)
% (binary-double 17 #t)
% (binary 87 #t 5 19)
% (binary-order 28 #f 5 19)
% (binary-posweight-order 58 #f)
% (binary-posweight-lex-big-order 28 #f)
% (binary-posweight-lex-small-order 11 #f)
% (binary-order-sos 28 #t)
% (binary-unit-uniteq 28 #f)
% (binary-weightorder 28 #f)
% (binary-weightorder-sos 17 #f)
% (binary-order 28 #f)
% (hyper-order 17 #f)
% (binary 141 #t)
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(200,40,1,400,0,1,55522,4,2192,57533,5,2802,57534,1,2803,57534,50,2806,57534,40,2806,57734,0,2806,151594,3,4208,175768,4,4909,193567,5,5607,193568,5,5608,193569,1,5608,193569,50,5612,193569,40,5612,193769,0,5612,235677,3,6163,247054,4,6441,261006,5,6713,261006,5,6714,261007,1,6714,261007,50,6716,261007,40,6716,261207,0,6716,321459,3,7568,336162,4,7992)
%
%
% START OF PROOF
% 223417 [?] ?
% 223829 [?] ?
% 261016 [] ss^list(nil).
% 261058 [] ss^list(skaf46(X,Y)).
% 261081 [] equal(app(X,nil),X) | -ss^list(X).
% 261139 [] equal(app(skaf46(X,Y),Y),X) | -rearseg^p(X,Y) | -ss^list(X) | -ss^list(Y).
% 261181 [] -equal(app(app(X,Y),Z),U) | segment^p(U,Y) | -ss^list(U) | -ss^list(Y) | -ss^list(Z) | -ss^list(X).
% 261194 [] ss^list(sk1).
% 261195 [] ss^list(sk2).
% 261198 [] equal(sk2,sk4).
% 261199 [] equal(sk1,sk3).
% 261201 [] -neq(sk1,nil) | -segment^p(sk2,sk1) | equal(nil,sk2).
% 261204 [] neq(sk3,nil) | equal(nil,sk4).
% 261205 [] rearseg^p(sk4,sk3) | equal(nil,sk4).
% 261540 [para:261204.2.2,261198.1.2,cut:223829] neq(sk3,nil).
% 261542 [para:261199.1.2,261540.1.1] neq(sk1,nil).
% 261545 [para:261205.2.2,261198.1.2,cut:223829] rearseg^p(sk4,sk3).
% 261547 [binary:261201,261542] -segment^p(sk2,sk1) | equal(nil,sk2).
% 261549 [para:261198.1.2,261545.1.1] rearseg^p(sk2,sk3).
% 261551 [para:261199.1.2,261549.1.2] rearseg^p(sk2,sk1).
% 261959 [para:261547.2.2,261549.1.1,cut:223417] -segment^p(sk2,sk1).
% 266876 [binary:261551,261139.2,cut:261195,cut:261194] equal(app(skaf46(sk2,sk1),sk1),sk2).
% 274303 [para:261081.1.1,261181.1.1,cut:261016] -equal(app(X,Y),Z) | -ss^list(app(X,Y)) | segment^p(Z,Y) | -ss^list(X) | -ss^list(Y) | -ss^list(Z).
% 343894 [binary:266876,274303,demod:266876,cut:261959,cut:261058,cut:261194,cut:261195] 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 double strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% using clause demodulation
% seconds given: 17
%
%
% old unit clauses discarded
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 4124
% derived clauses: 493114
% kept clauses: 238477
% kept size sum: 0
% kept mid-nuclei: 54411
% kept new demods: 34898
% forw unit-subs: 60715
% forw double-subs: 15690
% forw overdouble-subs: 9256
% backward subs: 90
% fast unit cutoff: 47894
% full unit cutoff: 1
% dbl unit cutoff: 872
% real runtime : 81.85
% process. runtime: 81.85
% specific non-discr-tree subsumption statistics:
% tried: 2678909
% length fails: 36803
% strength fails: 204003
% predlist fails: 1936495
% aux str. fails: 66785
% by-lit fails: 44114
% full subs tried: 329634
% full subs fail: 319100
%
% ; 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/SWC/SWC108-1+eq_r.in")
%
%------------------------------------------------------------------------------