TSTP Solution File: SWV252-2 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SWV252-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 : 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 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/SystemOnTPTP30894/SWV/SWV252-2+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: heq
% detected subclass: medium
% detected subclass: short
%
% strategies selected:
% (binary-posweight-order 57 #f 4 5)
% (binary-unit 28 #f 4 5)
% (binary-double 28 #f 4 5)
% (binary 45 #t 4 5)
% (hyper 11 #t 4 5)
% (hyper 28 #f)
% (binary-unit-uniteq 16 #f)
% (binary-weightorder 22 #f)
% (binary-posweight-order 159 #f)
% (binary-posweight-lex-big-order 57 #f)
% (binary-posweight-lex-small-order 11 #f)
% (binary-order 28 #f)
% (binary-unit 45 #f)
% (binary 65 #t)
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(20,40,0,40,0,0)
%
%
% START OF PROOF
% 24 [] equal(c_^message_^oparts(c_^message_^oanalz(X)),c_^message_^oparts(X)).
% 25 [] -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)).
% 26 [] 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)).
% 27 [] equal(c_^message_^oparts(c_^message_^osynth(X)),c_union(c_^message_^oparts(X),c_^message_^osynth(X),tc_^message_^omsg)).
% 28 [] c_lessequals(X,X,Y) | -class_^orderings_^oorder(Y).
% 31 [] -c_lessequals(c_union(X,Y,Z),U,tc_set(Z)) | c_lessequals(X,U,tc_set(Z)).
% 32 [] -c_lessequals(c_union(X,Y,Z),U,tc_set(Z)) | c_lessequals(Y,U,tc_set(Z)).
% 33 [] c_lessequals(c_union(X,Y,Z),U,tc_set(Z)) | -c_lessequals(X,U,tc_set(Z)) | -c_lessequals(Y,U,tc_set(Z)).
% 34 [] -c_lessequals(c_insert(X,Y,Z),U,tc_set(Z)) | c_in(X,U,Z).
% 35 [] -c_lessequals(c_insert(X,Y,Z),U,tc_set(Z)) | c_lessequals(Y,U,tc_set(Z)).
% 36 [] c_lessequals(c_insert(X,Y,Z),U,tc_set(Z)) | -c_lessequals(Y,U,tc_set(Z)) | -c_in(X,U,Z).
% 37 [] -c_lessequals(Y,X,tc_set(Z)) | -c_lessequals(X,Y,tc_set(Z)) | equal(Y,X).
% 38 [] class_^orderings_^oorder(tc_set(X)).
% 39 [] c_in(v_^x,c_^message_^osynth(c_^message_^oanalz(v_^h)),tc_^message_^omsg).
% 40 [] -c_lessequals(c_^message_^oparts(c_insert(v_^x,v_^h,tc_^message_^omsg)),c_union(c_^message_^osynth(c_^message_^oanalz(v_^h)),c_^message_^oparts(v_^h),tc_^message_^omsg),tc_set(tc_^message_^omsg)).
% 43 [binary:38,28.2] c_lessequals(X,X,tc_set(Y)).
% 44 [para:24.1.1,27.1.2.1] equal(c_^message_^oparts(c_^message_^osynth(c_^message_^oanalz(X))),c_union(c_^message_^oparts(X),c_^message_^osynth(c_^message_^oanalz(X)),tc_^message_^omsg)).
% 56 [binary:43,25] c_lessequals(X,c_^message_^oparts(X),tc_set(tc_^message_^omsg)).
% 58 [binary:34,56] c_in(X,c_^message_^oparts(c_insert(X,Y,tc_^message_^omsg)),tc_^message_^omsg).
% 74 [binary:43,31] c_lessequals(X,c_union(X,Y,Z),tc_set(Z)).
% 83 [binary:43,32] c_lessequals(X,c_union(Y,X,Z),tc_set(Z)).
% 93 [para:44.1.2,74.1.2] c_lessequals(c_^message_^oparts(X),c_^message_^oparts(c_^message_^osynth(c_^message_^oanalz(X))),tc_set(tc_^message_^omsg)).
% 116 [binary:33.2,83] c_lessequals(c_union(X,Y,Z),c_union(U,X,Z),tc_set(Z)) | -c_lessequals(Y,c_union(U,X,Z),tc_set(Z)).
% 127 [binary:25,93] c_lessequals(X,c_^message_^oparts(c_^message_^osynth(c_^message_^oanalz(X))),tc_set(tc_^message_^omsg)).
% 131 [binary:43,35] c_lessequals(X,c_insert(Y,X,Z),tc_set(Z)).
% 157 [binary:43,36.2] c_lessequals(c_insert(X,Y,Z),Y,tc_set(Z)) | -c_in(X,Y,Z).
% 178 [binary:127,36.2] c_lessequals(c_insert(X,Y,tc_^message_^omsg),c_^message_^oparts(c_^message_^osynth(c_^message_^oanalz(Y))),tc_set(tc_^message_^omsg)) | -c_in(X,c_^message_^oparts(c_^message_^osynth(c_^message_^oanalz(Y))),tc_^message_^omsg).
% 234 [binary:131,37,binarydemod:157] equal(X,c_insert(Y,X,Z)) | -c_in(Y,X,Z).
% 291 [binary:39,234.2] equal(c_^message_^osynth(c_^message_^oanalz(v_^h)),c_insert(v_^x,c_^message_^osynth(c_^message_^oanalz(v_^h)),tc_^message_^omsg)).
% 300 [para:291.1.2,58.1.2.1] c_in(v_^x,c_^message_^oparts(c_^message_^osynth(c_^message_^oanalz(v_^h))),tc_^message_^omsg).
% 983 [binary:74,116.2] c_lessequals(c_union(X,Y,Z),c_union(Y,X,Z),tc_set(Z)).
% 1047 [binary:37,983,cut:983] equal(c_union(X,Y,Z),c_union(Y,X,Z)).
% 1052 [para:1047.1.1,40.1.2,demod:44] -c_lessequals(c_^message_^oparts(c_insert(v_^x,v_^h,tc_^message_^omsg)),c_^message_^oparts(c_^message_^osynth(c_^message_^oanalz(v_^h))),tc_set(tc_^message_^omsg)).
% 1657 [binary:300,178.2] c_lessequals(c_insert(v_^x,v_^h,tc_^message_^omsg),c_^message_^oparts(c_^message_^osynth(c_^message_^oanalz(v_^h))),tc_set(tc_^message_^omsg)).
% 1659 [binary:26.2,1657,cut:1052] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% using first neg lit preferred strategy
% not using sos 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: 57
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 395
% derived clauses: 8852
% kept clauses: 1538
% kept size sum: 25543
% kept mid-nuclei: 0
% kept new demods: 37
% forw unit-subs: 4364
% forw double-subs: 373
% forw overdouble-subs: 0
% backward subs: 10
% fast unit cutoff: 11
% full unit cutoff: 0
% dbl unit cutoff: 0
% real runtime : 0.16
% process. runtime: 0.15
% specific non-discr-tree subsumption statistics:
% tried: 1
% length fails: 0
% strength fails: 0
% predlist fails: 0
% aux str. fails: 0
% by-lit fails: 0
% full subs tried: 1
% full subs fail: 1
%
% ; program args: ("/home/graph/tptp/Systems/Gandalf---c-2.6/gandalf" "-time" "600" "/tmp/SystemOnTPTP30894/SWV/SWV252-2+eq_r.in")
% Killed 1 orphans
%
%------------------------------------------------------------------------------