TSTP Solution File: SWV245-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SWV245-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 64.5s
% Output : Assurance 64.5s
% 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/SystemOnTPTP30212/SWV/SWV245-1+eq_r.in
%
% Some predicates or functions were curried and renamed.
% 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(1404,40,6,2808,0,11,257083,4,2112,262390,5,2812,262391,1,2812,262391,50,2819,262391,40,2819,263795,0,2820,311975,3,4221,318266,4,4921,319408,5,5622,319409,5,5625,319409,1,5625,319409,50,5630,319409,40,5630,320813,0,5631,344605,3,6183,354469,4,6457)
%
%
% START OF PROOF
% 319416 [] -c_in(c_^message_^omsg_^o^m^pair(X,Y),c_^message_^oanalz(Z),tc_^message_^omsg) | c_in(X,c_^message_^oanalz(Z),tc_^message_^omsg).
% 319420 [] -c_in(c_^message_^omsg_^o^m^pair(X,Y),c_^message_^osynth(Z),tc_^message_^omsg) | c_in(c_^message_^omsg_^o^m^pair(X,Y),Z,tc_^message_^omsg) | c_in(X,c_^message_^osynth(Z),tc_^message_^omsg).
% 319430 [] c_in(X,c_^message_^oanalz(Y),tc_^message_^omsg) | -c_in(X,Y,tc_^message_^omsg).
% 319617 [] c_in(X,c_union(Y,Z,U),U) | -c_in(X,Z,U).
% 319618 [] c_in(X,c_union(Y,Z,U),U) | -c_in(X,Y,U).
% 319619 [] -c_in(X,c_union(Y,Z,U),U) | c_in(X,Z,U) | c_in(X,Y,U).
% 320812 [] c_in(c_^message_^omsg_^o^m^pair(v_^x,v_^y),c_union(c_^message_^oanalz(c_union(v_^g,v_^h,tc_^message_^omsg)),c_^message_^osynth(v_^g),tc_^message_^omsg),tc_^message_^omsg).
% 320813 [] -c_in(v_^x,c_union(c_^message_^oanalz(c_union(v_^g,v_^h,tc_^message_^omsg)),c_^message_^osynth(v_^g),tc_^message_^omsg),tc_^message_^omsg).
% 327216 [binary:320813,319617] -c_in(v_^x,c_^message_^osynth(v_^g),tc_^message_^omsg).
% 327322 [binary:320813,319618] -c_in(v_^x,c_^message_^oanalz(c_union(v_^g,v_^h,tc_^message_^omsg)),tc_^message_^omsg).
% 328793 [binary:319416.2,327322] -c_in(c_^message_^omsg_^o^m^pair(v_^x,X),c_^message_^oanalz(c_union(v_^g,v_^h,tc_^message_^omsg)),tc_^message_^omsg).
% 339969 [binary:319430,328793] -c_in(c_^message_^omsg_^o^m^pair(v_^x,X),c_union(v_^g,v_^h,tc_^message_^omsg),tc_^message_^omsg).
% 340085 [binary:319618,339969] -c_in(c_^message_^omsg_^o^m^pair(v_^x,X),v_^g,tc_^message_^omsg).
% 340398 [binary:319420.2,340085,cut:327216] -c_in(c_^message_^omsg_^o^m^pair(v_^x,X),c_^message_^osynth(v_^g),tc_^message_^omsg).
% 354537 [binary:320812,319619,cut:340398,cut:328793] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% not using sos strategy
% using unit paramodulation strategy
% using unit strategy
% using double 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 7
% clause depth limited to 4
% seconds given: 11
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 7795
% derived clauses: 803802
% kept clauses: 162469
% kept size sum: 526485
% kept mid-nuclei: 14600
% kept new demods: 95
% forw unit-subs: 117959
% forw double-subs: 11430
% forw overdouble-subs: 1143
% backward subs: 145
% fast unit cutoff: 1959
% full unit cutoff: 677
% dbl unit cutoff: 1
% real runtime : 65.23
% process. runtime: 64.71
% specific non-discr-tree subsumption statistics:
% tried: 19853
% length fails: 653
% strength fails: 635
% predlist fails: 6969
% aux str. fails: 181
% by-lit fails: 170
% full subs tried: 10846
% full subs fail: 9703
%
% ; program args: ("/home/graph/tptp/Systems/Gandalf---c-2.6/gandalf" "-time" "600" "/tmp/SystemOnTPTP30212/SWV/SWV245-1+eq_r.in")
% WARNING: TreeLimitedRun lost 64.52s, total lost is 64.52s
% Killed 1 orphans
%
%------------------------------------------------------------------------------