TSTP Solution File: SWV258-2 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SWV258-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/SystemOnTPTP22578/SWV/SWV258-2+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 3 5)
% (binary-unit 11 #f 3 5)
% (binary-double 17 #f 3 5)
% (hyper 29 #f)
% (binary-unit 34 #f)
% (binary-weightorder 40 #f)
% (binary 17 #t)
% (binary-order 29 #f)
% (binary-posweight-order 111 #f 3 5)
% (binary-posweight-order 283 #f)
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(6,40,0,12,0,0)
%
%
% START OF PROOF
% 7 [] -c_lessequals(c_^message_^oparts(X),c_^message_^oparts(Y),tc_set(tc_^message_^omsg)) | c_lessequals(X,c_^message_^oparts(Y),tc_set(tc_^message_^omsg)).
% 8 [] c_lessequals(c_^message_^oparts(X),c_^message_^oparts(Y),tc_set(tc_^message_^omsg)) | -c_lessequals(X,c_^message_^oparts(Y),tc_set(tc_^message_^omsg)).
% 9 [] c_lessequals(c_insert(X,Y,Z),U,tc_set(Z)) | -c_lessequals(Y,U,tc_set(Z)) | -c_in(X,U,Z).
% 10 [] c_lessequals(X,X,tc_set(Y)).
% 11 [] c_in(v_^x,c_^message_^oparts(v_^h),tc_^message_^omsg).
% 12 [] -c_lessequals(c_^message_^oparts(c_insert(v_^x,v_^h,tc_^message_^omsg)),c_^message_^oparts(v_^h),tc_set(tc_^message_^omsg)).
% 13 [hyper:7,10] c_lessequals(X,c_^message_^oparts(X),tc_set(tc_^message_^omsg)).
% 20 [hyper:9,13,11] c_lessequals(c_insert(v_^x,v_^h,tc_^message_^omsg),c_^message_^oparts(v_^h),tc_set(tc_^message_^omsg)).
% 22 [hyper:8,20,cut:12] 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 5
% clause depth limited to 3
% seconds given: 29
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 7
% derived clauses: 16
% kept clauses: 5
% kept size sum: 40
% kept mid-nuclei: 4
% kept new demods: 0
% forw unit-subs: 3
% forw double-subs: 0
% forw overdouble-subs: 0
% backward subs: 0
% fast unit cutoff: 1
% 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/SystemOnTPTP22578/SWV/SWV258-2+noeq.in")
%
%------------------------------------------------------------------------------