%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SWV255-2 : TPTP v3.4.2. Released v3.2.0.
% Transfm : add_equality:r
% Format : otter:hypothesis:set(auto),clear(print_given)
% Command : gandalf-wrapper -time %d %s
% Computer : art03.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2793MHz
% Memory : 1003MB
% OS : Linux 2.6.11-1.1369_FC4
% CPULimit : 600s
% Result : Unsatisfiable 0.0s
% Output : Assurance 0.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: /tmp/SystemOnTPTP22436/SWV/SWV255-2+noeq.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: nne
% detected subclass: small
%
% strategies selected:
% (hyper 27 #f 3 3)
% (binary-unit 10 #f 3 3)
% (binary-double 16 #f)
% (binary 16 #t 3 3)
% (binary-posweight-order 181 #f)
% (binary-order-sos 54 #t)
% (binary-unit-uniteq 54 #f)
% (binary-order 27 #f 3 3)
% (binary-weightorder 71 #f)
% (binary-order 27 #f)
% (hyper-order 54 #f)
% (binary 63 #t)
%
%
% **** EMPTY CLAUSE DERIVED ****
%
%
% timer checkpoints: c(6,40,0,12,0,0,31,50,0,37,0,0)
%
%
% START OF PROOF
% 32 [] -c_lessequals(c_plus(X,Y,tc_nat),Z,tc_nat) | c_lessequals(Y,Z,tc_nat).
% 33 [] -c_lessequals(c_plus(X,Y,tc_nat),Z,tc_nat) | c_lessequals(X,Z,tc_nat).
% 34 [] c_lessequals(X,v_xb(X),tc_nat).
% 35 [] -c_in(c_^message_^omsg_^o^nonce(X),c_^message_^oparts(c_insert(v_msg1,c_emptyset,tc_^message_^omsg)),tc_^message_^omsg) | -c_lessequals(v_x,X,tc_nat).
% 36 [] -c_in(c_^message_^omsg_^o^nonce(X),c_^message_^oparts(c_insert(v_msg2,c_emptyset,tc_^message_^omsg)),tc_^message_^omsg) | -c_lessequals(v_xa,X,tc_nat).
% 37 [] c_in(c_^message_^omsg_^o^nonce(v_xb(X)),c_^message_^oparts(c_insert(v_msg2,c_emptyset,tc_^message_^omsg)),tc_^message_^omsg) | c_in(c_^message_^omsg_^o^nonce(v_xb(X)),c_^message_^oparts(c_insert(v_msg1,c_emptyset,tc_^message_^omsg)),tc_^message_^omsg).
% 40 [hyper:32,34] c_lessequals(X,v_xb(c_plus(Y,X,tc_nat)),tc_nat).
% 41 [hyper:33,34] c_lessequals(X,v_xb(c_plus(X,Y,tc_nat)),tc_nat).
% 49 [hyper:33,41] c_lessequals(X,v_xb(c_plus(c_plus(X,Y,tc_nat),Z,tc_nat)),tc_nat).
% 57 [hyper:35,37,40] c_in(c_^message_^omsg_^o^nonce(v_xb(c_plus(X,v_x,tc_nat))),c_^message_^oparts(c_insert(v_msg2,c_emptyset,tc_^message_^omsg)),tc_^message_^omsg).
% 70 [hyper:36,57,slowcut:49] 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
% clause length limited to 3
% clause depth limited to 4
% seconds given: 27
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 25
% derived clauses: 131
% kept clauses: 16
% kept size sum: 168
% kept mid-nuclei: 24
% kept new demods: 0
% forw unit-subs: 16
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 0
% fast unit cutoff: 0
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 0.1
% process. runtime: 0.0
% specific non-discr-tree subsumption statistics:
% tried: 0
% length fails: 0
% strength fails: 0
% predlist fails: 0
% aux str. fails: 0
% by-lit fails: 0
% full subs tried: 0
% full subs fail: 0
%
% ; program args: ("/home/graph/tptp/Systems/Gandalf---c-2.6/gandalf" "-time" "600" "/tmp/SystemOnTPTP22436/SWV/SWV255-2+noeq.in")
%
%------------------------------------------------------------------------------