TSTP Solution File: SWV275-2 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SWV275-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 : 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 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/SystemOnTPTP9054/SWV/SWV275-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(10,40,0,20,0,0,39555,4,2092,39555,50,2119,39555,40,2119,39565,0,2119,39580,50,2119,39590,0,2119)
%
%
% START OF PROOF
% 103 [?] ?
% 39582 [] c_in(X,c_^message_^osynth(Y),tc_^message_^omsg) | -c_in(X,Y,tc_^message_^omsg).
% 39585 [] c_in(X,c_insert(X,Y,Z),Z).
% 39586 [] -c_in(X,c_insert(Y,Z,U),U) | c_in(X,Z,U) | equal(X,Y).
% 39587 [] -c_lessequals(X,Y,tc_set(Z)) | -c_in(U,X,Z) | c_in(U,Y,Z).
% 39588 [] c_in(c_^main_^osubset^i__1(X,Y,Z),X,Z) | c_lessequals(X,Y,tc_set(Z)).
% 39589 [] -c_in(c_^main_^osubset^i__1(X,Y,Z),Y,Z) | c_lessequals(X,Y,tc_set(Z)).
% 39590 [] -c_lessequals(c_insert(v_^x,c_^message_^osynth(v_^h),tc_^message_^omsg),c_^message_^osynth(c_insert(v_^x,v_^h,tc_^message_^omsg)),tc_set(tc_^message_^omsg)).
% 39592 [binary:39585,39582.2] c_in(X,c_^message_^osynth(c_insert(X,Y,tc_^message_^omsg)),tc_^message_^omsg).
% 39600 [binary:39590,39588.2] c_in(c_^main_^osubset^i__1(c_insert(v_^x,c_^message_^osynth(v_^h),tc_^message_^omsg),c_^message_^osynth(c_insert(v_^x,v_^h,tc_^message_^omsg)),tc_^message_^omsg),c_insert(v_^x,c_^message_^osynth(v_^h),tc_^message_^omsg),tc_^message_^omsg).
% 39603 [binary:39590,39589.2] -c_in(c_^main_^osubset^i__1(c_insert(v_^x,c_^message_^osynth(v_^h),tc_^message_^omsg),c_^message_^osynth(c_insert(v_^x,v_^h,tc_^message_^omsg)),tc_^message_^omsg),c_^message_^osynth(c_insert(v_^x,v_^h,tc_^message_^omsg)),tc_^message_^omsg).
% 39621 [binary:39586,39600] c_in(c_^main_^osubset^i__1(c_insert(v_^x,c_^message_^osynth(v_^h),tc_^message_^omsg),c_^message_^osynth(c_insert(v_^x,v_^h,tc_^message_^omsg)),tc_^message_^omsg),c_^message_^osynth(v_^h),tc_^message_^omsg) | equal(c_^main_^osubset^i__1(c_insert(v_^x,c_^message_^osynth(v_^h),tc_^message_^omsg),c_^message_^osynth(c_insert(v_^x,v_^h,tc_^message_^omsg)),tc_^message_^omsg),v_^x).
% 39624 [binary:39587.3,39603] -c_in(c_^main_^osubset^i__1(c_insert(v_^x,c_^message_^osynth(v_^h),tc_^message_^omsg),c_^message_^osynth(c_insert(v_^x,v_^h,tc_^message_^omsg)),tc_^message_^omsg),X,tc_^message_^omsg) | -c_lessequals(X,c_^message_^osynth(c_insert(v_^x,v_^h,tc_^message_^omsg)),tc_set(tc_^message_^omsg)).
% 39655 [para:39621.2.1,39603.1.1,cut:39592] c_in(c_^main_^osubset^i__1(c_insert(v_^x,c_^message_^osynth(v_^h),tc_^message_^omsg),c_^message_^osynth(c_insert(v_^x,v_^h,tc_^message_^omsg)),tc_^message_^omsg),c_^message_^osynth(v_^h),tc_^message_^omsg).
% 39674 [binary:39655,39624,cut:103] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% not using sos strategy
% using unit 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 4
% seconds given: 10
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 324
% derived clauses: 171737
% kept clauses: 19497
% kept size sum: 723656
% kept mid-nuclei: 1075
% kept new demods: 0
% forw unit-subs: 1181
% forw double-subs: 11198
% forw overdouble-subs: 42452
% backward subs: 11
% fast unit cutoff: 2
% full unit cutoff: 0
% dbl unit cutoff: 454
% real runtime : 21.23
% process. runtime: 21.20
% specific non-discr-tree subsumption statistics:
% tried: 7278210
% length fails: 438990
% strength fails: 1737301
% predlist fails: 767769
% aux str. fails: 434664
% by-lit fails: 347579
% full subs tried: 2989935
% full subs fail: 2947349
%
% ; program args: ("/home/graph/tptp/Systems/Gandalf---c-2.6/gandalf" "-time" "600" "/tmp/SystemOnTPTP9054/SWV/SWV275-2+eq_r.in")
% WARNING: TreeLimitedRun lost 19.97s, total lost is 19.97s
%
%------------------------------------------------------------------------------