TSTP Solution File: SWV263-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SWV263-1 : 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 : art10.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2794MHz
% 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/SystemOnTPTP8367/SWV/SWV263-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 4 7)
% (binary-unit 28 #f 4 7)
% (binary-double 11 #f 4 7)
% (binary-double 17 #f)
% (binary-double 17 #t)
% (binary 87 #t 4 7)
% (binary-order 28 #f 4 7)
% (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(1381,40,6,2762,0,13)
%
%
% START OF PROOF
% 1539 [] -c_in(X,c_minus(Y,Z,tc_set(U)),U) | -c_in(X,Z,U).
% 1541 [] c_in(X,c_minus(Y,Z,tc_set(U)),U) | -c_in(X,Y,U) | c_in(X,Z,U).
% 1688 [] -c_lessequals(X,Y,tc_set(Z)) | -c_in(U,X,Z) | c_in(U,Y,Z).
% 2758 [] c_in(X,c_^message_^oparts(Y),tc_^message_^omsg) | -c_in(X,Y,tc_^message_^omsg).
% 2760 [] c_lessequals(v_^g,v_^h,tc_set(tc_^message_^omsg)).
% 2761 [] c_in(v_^x,v_^g,tc_^message_^omsg).
% 2762 [] -c_in(v_^x,c_^message_^oparts(v_^h),tc_^message_^omsg).
% 2778 [hyper:1541,2761] c_in(v_^x,c_minus(v_^g,X,tc_set(tc_^message_^omsg)),tc_^message_^omsg) | c_in(v_^x,X,tc_^message_^omsg).
% 2792 [hyper:1688,2761,2760] c_in(v_^x,v_^h,tc_^message_^omsg).
% 6564 [hyper:2758,2778] c_in(v_^x,c_minus(v_^g,X,tc_set(tc_^message_^omsg)),tc_^message_^omsg) | c_in(v_^x,c_^message_^oparts(X),tc_^message_^omsg).
% 8684 [hyper:2762,6564] c_in(v_^x,c_minus(v_^g,v_^h,tc_set(tc_^message_^omsg)),tc_^message_^omsg).
% 8949 [hyper:1539,8684,cut:2792] 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 7
% clause depth limited to 4
% seconds given: 28
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 1306
% derived clauses: 23111
% kept clauses: 2983
% kept size sum: 52124
% kept mid-nuclei: 2204
% kept new demods: 24
% forw unit-subs: 7246
% forw double-subs: 932
% forw overdouble-subs: 180
% backward subs: 12
% fast unit cutoff: 58
% full unit cutoff: 0
% dbl unit cutoff: 1
% real runtime : 1.45
% process. runtime: 1.43
% specific non-discr-tree subsumption statistics:
% tried: 430
% length fails: 17
% strength fails: 11
% predlist fails: 14
% aux str. fails: 2
% by-lit fails: 10
% full subs tried: 373
% full subs fail: 195
%
% ; program args: ("/home/graph/tptp/Systems/Gandalf---c-2.6/gandalf" "-time" "600" "/tmp/SystemOnTPTP8367/SWV/SWV263-1+eq_r.in")
%
%------------------------------------------------------------------------------