TSTP Solution File: SWV242-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SWV242-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 : art01.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 34.7s
% Output : Assurance 34.7s
% 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/SystemOnTPTP29830/SWV/SWV242-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)
%
%
% SOS clause
% -c_lessequals(v_^h,c_^message_^oanalz(c_union(v_^g_^h,v_^h_^h,tc_^message_^omsg)),tc_set(tc_^message_^omsg)) | -c_lessequals(v_^g,c_^message_^oanalz(c_union(v_^g_^h,v_^h_^h,tc_^message_^omsg)),tc_set(tc_^message_^omsg)).
% was split for some strategies as:
% -c_lessequals(v_^h,c_^message_^oanalz(c_union(v_^g_^h,v_^h_^h,tc_^message_^omsg)),tc_set(tc_^message_^omsg)).
% -c_lessequals(v_^g,c_^message_^oanalz(c_union(v_^g_^h,v_^h_^h,tc_^message_^omsg)),tc_set(tc_^message_^omsg)).
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(1393,40,6,2786,0,12,87578,4,990,100207,5,1313,100207,1,1313,100207,50,1319,100207,40,1319,101600,0,1321,133605,3,1972,145376,4,2297,146476,5,2622,146477,5,2624,146478,1,2624,146478,50,2628,146478,40,2628,147871,0,2629,158928,3,2880,162054,4,3005,165169,5,3130,165169,5,3130,165170,1,3130,165170,50,3131,165170,40,3131,166563,0,3132,186867,3,3533,195246,4,3733,201280,5,3933,201280,5,3933,201281,1,3933,201281,50,3936,201281,40,3936,202674,0,3937)
%
%
% START OF PROOF
% 201417 [] -c_lessequals(c_^set^interval_^oat^least(X,Y),c_^set^interval_^oat^least(Z,Y),tc_set(Y)) | c_lessequals(Z,X,Y) | -class_^orderings_^oorder(Y).
% 201418 [] c_lessequals(c_^set^interval_^oat^least(X,Y),c_^set^interval_^oat^least(Z,Y),tc_set(Y)) | -c_lessequals(Z,X,Y) | -class_^orderings_^oorder(Y).
% 201729 [] class_^orderings_^oorder(tc_set(X)).
% 202654 [] c_lessequals(c_^message_^oanalz(X),c_^message_^oanalz(Y),tc_set(tc_^message_^omsg)) | -c_lessequals(X,Y,tc_set(tc_^message_^omsg)).
% 202669 [] c_lessequals(X,c_union(X,Y,Z),tc_set(Z)).
% 202670 [] c_lessequals(X,c_union(Y,X,Z),tc_set(Z)).
% 202671 [] -c_lessequals(X,Y,tc_set(Z)) | -c_lessequals(Y,U,tc_set(Z)) | c_lessequals(X,U,tc_set(Z)).
% 202672 [] c_lessequals(v_^g,c_^message_^oanalz(v_^g_^h),tc_set(tc_^message_^omsg)).
% 202673 [] c_lessequals(v_^h,c_^message_^oanalz(v_^h_^h),tc_set(tc_^message_^omsg)).
% 202674 [] -c_lessequals(v_^h,c_^message_^oanalz(c_union(v_^g_^h,v_^h_^h,tc_^message_^omsg)),tc_set(tc_^message_^omsg)) | -c_lessequals(v_^g,c_^message_^oanalz(c_union(v_^g_^h,v_^h_^h,tc_^message_^omsg)),tc_set(tc_^message_^omsg)).
% 202689 [binary:202671,202672] -c_lessequals(c_^message_^oanalz(v_^g_^h),X,tc_set(tc_^message_^omsg)) | c_lessequals(v_^g,X,tc_set(tc_^message_^omsg)).
% 202705 [binary:202671,202673] -c_lessequals(c_^message_^oanalz(v_^h_^h),X,tc_set(tc_^message_^omsg)) | c_lessequals(v_^h,X,tc_set(tc_^message_^omsg)).
% 203536 [binary:202654,202689] c_lessequals(v_^g,c_^message_^oanalz(X),tc_set(tc_^message_^omsg)) | -c_lessequals(v_^g_^h,X,tc_set(tc_^message_^omsg)).
% 203630 [binary:201418.2,202705.2,cut:201729] c_lessequals(c_^set^interval_^oat^least(X,tc_set(tc_^message_^omsg)),c_^set^interval_^oat^least(v_^h,tc_set(tc_^message_^omsg)),tc_set(tc_set(tc_^message_^omsg))) | -c_lessequals(c_^message_^oanalz(v_^h_^h),X,tc_set(tc_^message_^omsg)).
% 204846 [binary:202674.2,203536,cut:202669] -c_lessequals(v_^h,c_^message_^oanalz(c_union(v_^g_^h,v_^h_^h,tc_^message_^omsg)),tc_set(tc_^message_^omsg)).
% 204912 [binary:201417.2,204846,cut:201729,binarydemod:203630] -c_lessequals(c_^message_^oanalz(v_^h_^h),c_^message_^oanalz(c_union(v_^g_^h,v_^h_^h,tc_^message_^omsg)),tc_set(tc_^message_^omsg)).
% 204936 [binary:202654,204912,cut:202670] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% using sos strategy
% using double strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% using clause demodulation
% seconds given: 8
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 8757
% derived clauses: 446562
% kept clauses: 156190
% kept size sum: 38374
% kept mid-nuclei: 22998
% kept new demods: 121
% forw unit-subs: 116683
% forw double-subs: 20177
% forw overdouble-subs: 1920
% backward subs: 64
% fast unit cutoff: 5652
% full unit cutoff: 1183
% dbl unit cutoff: 1
% real runtime : 39.89
% process. runtime: 39.54
% specific non-discr-tree subsumption statistics:
% tried: 33199
% length fails: 585
% strength fails: 1090
% predlist fails: 6573
% aux str. fails: 436
% by-lit fails: 650
% full subs tried: 14577
% full subs fail: 12724
%
% ; program args: ("/home/graph/tptp/Systems/Gandalf---c-2.6/gandalf" "-time" "600" "/tmp/SystemOnTPTP29830/SWV/SWV242-1+eq_r.in")
% WARNING: TreeLimitedRun lost 34.67s, total lost is 34.67s
%
%------------------------------------------------------------------------------