TSTP Solution File: SWV274-2 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SWV274-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 : art05.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2795MHz
% Memory : 1003MB
% OS : Linux 2.6.11-1.1369_FC4
% CPULimit : 600s
% Result : Unsatisfiable 20.0s
% Output : Assurance 20.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/SystemOnTPTP20030/SWV/SWV274-2+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: neq
% detected subclass: small
%
% strategies selected:
% (hyper 27 #f 3 5)
% (binary-unit 10 #f 3 5)
% (binary-double 10 #f 3 5)
% (binary-double 16 #f)
% (binary-double 10 #t)
% (binary 16 #t 3 5)
% (binary-order 27 #f 3 5)
% (binary-posweight-order 125 #f)
% (binary-posweight-lex-big-order 43 #f)
% (binary-posweight-lex-small-order 16 #f)
% (binary-order-sos 54 #t)
% (binary-unit-uniteq 54 #f)
% (binary-weightorder 65 #f)
% (binary-order 27 #f)
% (hyper-order 37 #f)
% (binary 63 #t)
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(9,40,0,18,0,0,23593,4,2044)
%
%
% START OF PROOF
% 11 [] c_in(X,c_^message_^osynth(Y),tc_^message_^omsg) | -c_in(X,Y,tc_^message_^omsg).
% 12 [] -c_lessequals(X,c_^message_^osynth(Y),tc_set(tc_^message_^omsg)) | -c_in(Z,c_^message_^osynth(X),tc_^message_^omsg) | c_in(Z,c_^message_^osynth(Y),tc_^message_^omsg).
% 13 [] -c_in(X,c_insert(Y,Z,U),U) | c_in(X,Z,U) | equal(X,Y).
% 14 [] c_in(c_^main_^osubset^i__1(X,Y,Z),X,Z) | c_lessequals(X,Y,tc_set(Z)).
% 15 [] -c_in(c_^main_^osubset^i__1(X,Y,Z),Y,Z) | c_lessequals(X,Y,tc_set(Z)).
% 16 [] c_in(v_^y,c_^message_^osynth(c_insert(v_^x,v_^h,tc_^message_^omsg)),tc_^message_^omsg).
% 17 [] c_in(v_^x,c_^message_^osynth(v_^h),tc_^message_^omsg).
% 18 [] -c_in(v_^y,c_^message_^osynth(v_^h),tc_^message_^omsg).
% 31 [hyper:12,14,16] c_in(c_^main_^osubset^i__1(c_insert(v_^x,v_^h,tc_^message_^omsg),c_^message_^osynth(X),tc_^message_^omsg),c_insert(v_^x,v_^h,tc_^message_^omsg),tc_^message_^omsg) | c_in(v_^y,c_^message_^osynth(X),tc_^message_^omsg).
% 153 [hyper:18,31] c_in(c_^main_^osubset^i__1(c_insert(v_^x,v_^h,tc_^message_^omsg),c_^message_^osynth(v_^h),tc_^message_^omsg),c_insert(v_^x,v_^h,tc_^message_^omsg),tc_^message_^omsg).
% 162 [hyper:13,153] c_in(c_^main_^osubset^i__1(c_insert(v_^x,v_^h,tc_^message_^omsg),c_^message_^osynth(v_^h),tc_^message_^omsg),v_^h,tc_^message_^omsg) | equal(c_^main_^osubset^i__1(c_insert(v_^x,v_^h,tc_^message_^omsg),c_^message_^osynth(v_^h),tc_^message_^omsg),v_^x).
% 224 [hyper:11,162] c_in(c_^main_^osubset^i__1(c_insert(v_^x,v_^h,tc_^message_^omsg),c_^message_^osynth(v_^h),tc_^message_^omsg),c_^message_^osynth(v_^h),tc_^message_^omsg) | equal(c_^main_^osubset^i__1(c_insert(v_^x,v_^h,tc_^message_^omsg),c_^message_^osynth(v_^h),tc_^message_^omsg),v_^x).
% 679 [hyper:15,224] equal(c_^main_^osubset^i__1(c_insert(v_^x,v_^h,tc_^message_^omsg),c_^message_^osynth(v_^h),tc_^message_^omsg),v_^x) | c_lessequals(c_insert(v_^x,v_^h,tc_^message_^omsg),c_^message_^osynth(v_^h),tc_set(tc_^message_^omsg)).
% 899 [hyper:12,679,16,cut:18] equal(c_^main_^osubset^i__1(c_insert(v_^x,v_^h,tc_^message_^omsg),c_^message_^osynth(v_^h),tc_^message_^omsg),v_^x).
% 23898 [binary:12.3,18] -c_lessequals(X,c_^message_^osynth(v_^h),tc_set(tc_^message_^omsg)) | -c_in(v_^y,c_^message_^osynth(X),tc_^message_^omsg).
% 27624 [binary:16,23898.2] -c_lessequals(c_insert(v_^x,v_^h,tc_^message_^omsg),c_^message_^osynth(v_^h),tc_set(tc_^message_^omsg)).
% 28008 [binary:15.2,27624,demod:899,cut:17] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% not using sos 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: 27
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 215
% derived clauses: 105184
% kept clauses: 15766
% kept size sum: 655948
% kept mid-nuclei: 887
% kept new demods: 1
% forw unit-subs: 1551
% forw double-subs: 5385
% forw overdouble-subs: 31784
% backward subs: 17
% fast unit cutoff: 2
% full unit cutoff: 0
% dbl unit cutoff: 125
% real runtime : 21.49
% process. runtime: 21.46
% specific non-discr-tree subsumption statistics:
% tried: 11366899
% length fails: 1098252
% strength fails: 2851835
% predlist fails: 3177311
% aux str. fails: 236726
% by-lit fails: 210607
% full subs tried: 3265163
% full subs fail: 3233285
%
% ; program args: ("/home/graph/tptp/Systems/Gandalf---c-2.6/gandalf" "-time" "600" "/tmp/SystemOnTPTP20030/SWV/SWV274-2+eq_r.in")
% WARNING: TreeLimitedRun lost 19.97s, total lost is 19.97s
%
%------------------------------------------------------------------------------