%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : MGT058-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 : 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 19.7s
% Output : Assurance 19.7s
% 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/MGT/MGT058-1+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: neq
% detected subclass: medium
%
% strategies selected:
% (hyper 25 #f 3 5)
% (binary-unit 9 #f 3 5)
% (binary-double 9 #f 3 5)
% (binary-double 15 #f)
% (binary-double 15 #t)
% (binary 50 #t 3 5)
% (binary-order 25 #f 3 5)
% (binary-posweight-order 101 #f)
% (binary-posweight-lex-big-order 25 #f)
% (binary-posweight-lex-small-order 9 #f)
% (binary-order-sos 50 #t)
% (binary-unit-uniteq 25 #f)
% (binary-weightorder 50 #f)
% (binary-order 50 #f)
% (hyper-order 30 #f)
% (binary 112 #t)
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(30,40,0,60,0,0,28738,4,1897,58342,5,2501,58342,1,2501,58342,50,2502,58342,40,2502,58372,0,2502,58418,50,2502,58448,0,2502,58494,50,2502,58524,0,2507,58570,50,2507,58600,0,2507,58646,50,2507,58676,0,2507,58722,50,2508,58752,0,2512,58798,50,2512,58828,0,2512,58874,50,2512,58904,0,2516,58950,50,2516,58980,0,2516,59026,50,2516,59056,0,2516,59102,50,2517,59132,0,2521,59178,50,2521,59208,0,2521,59254,50,2521,59284,0,2525,59330,50,2525,59360,0,2525,59406,50,2525,59436,0,2525,59482,50,2525,59512,0,2530,59558,50,2530,59588,0,2530,59634,50,2530,59664,0,2534,59710,50,2534,59740,0,2534,59786,50,2534,59786,40,2534,59816,0,2534)
%
%
% START OF PROOF
% 59787 [] equal(X,X).
% 59789 [] -smaller(X,Y) | smaller_or_equal(X,Y).
% 59790 [] -equal(X,Y) | smaller_or_equal(X,Y).
% 59791 [] -greater_or_equal(X,Y) | greater(X,Y) | equal(X,Y).
% 59795 [] -greater(X,Y) | smaller(Y,X).
% 59799 [] -smaller_or_equal(age(X,Y),sigma) | positional_advantage(X,Y) | -fragile_position(X).
% 59805 [] -smaller_or_equal(age(X,Y),tau) | -positional_advantage(X,Y) | -robust_position(X).
% 59812 [] equal(age(sk3,sk4),zero).
% 59813 [] greater_or_equal(sigma,zero).
% 59814 [] greater_or_equal(tau,zero).
% 59815 [] fragile_position(sk3).
% 59816 [] robust_position(sk3).
% 59820 [binary:59787,59790] smaller_or_equal(X,X).
% 59830 [binary:59789,59795.2] -greater(X,Y) | smaller_or_equal(Y,X).
% 59834 [binary:59813,59791] greater(sigma,zero) | equal(sigma,zero).
% 59835 [binary:59814,59791] greater(tau,zero) | equal(tau,zero).
% 59915 [para:59812.1.1,59799.1.1,cut:59815] -smaller_or_equal(zero,sigma) | positional_advantage(sk3,sk4).
% 59987 [binary:59830.2,59915] -greater(sigma,zero) | positional_advantage(sk3,sk4).
% 59989 [para:59834.2.2,59915.1.1,cut:59820,binarycut:59987] positional_advantage(sk3,sk4).
% 59993 [para:59812.1.1,59805.1.1,cut:59989,cut:59816] -smaller_or_equal(zero,tau).
% 60008 [binary:59830.2,59993] -greater(tau,zero).
% 60010 [para:59835.2.1,59993.1.2,cut:59820,cut:60008] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% not using sos strategy
% using double 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: 9
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 1690
% derived clauses: 687240
% kept clauses: 45316
% kept size sum: 769374
% kept mid-nuclei: 5753
% kept new demods: 21
% forw unit-subs: 39534
% forw double-subs: 61901
% forw overdouble-subs: 144347
% backward subs: 298
% fast unit cutoff: 8739
% full unit cutoff: 0
% dbl unit cutoff: 649
% real runtime : 25.80
% process. runtime: 25.35
% specific non-discr-tree subsumption statistics:
% tried: 22050044
% length fails: 785985
% strength fails: 3813116
% predlist fails: 13825007
% aux str. fails: 77591
% by-lit fails: 155612
% full subs tried: 3228571
% full subs fail: 3084194
%
% ; 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/MGT/MGT058-1+eq_r.in")
%
%------------------------------------------------------------------------------