TSTP Solution File: SWV323-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SWV323-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 : 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 313.6s
% Output : Assurance 313.6s
% 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/SystemOnTPTP22672/SWV/SWV323-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 11 7)
% (binary-unit 28 #f 11 7)
% (binary-double 11 #f 11 7)
% (binary-double 17 #f)
% (binary-double 17 #t)
% (binary 87 #t 11 7)
% (binary-order 28 #f 11 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(1479,40,7,2958,0,13,228956,4,2121,230409,5,2814,230410,5,2820,230411,1,2820,230411,50,2826,230411,40,2826,231890,0,2827,297161,3,4228,313669,4,4928,316096,5,5630,316097,5,5635,316098,1,5635,316098,50,5642,316098,40,5642,317577,0,5644,348201,3,6209,358888,4,6470,360448,5,6745,360449,5,6747,360450,1,6747,360450,50,6750,360450,40,6750,361929,0,6751,402626,3,7603,420374,4,8027,422154,5,8453,422155,5,8454,422156,1,8454,422156,50,8459,422156,40,8459,423635,0,8461,489131,3,9312,503583,4,9737,509241,5,10162,509242,5,10163,509243,1,10163,509243,50,10170,509243,40,10170,510722,0,10171,723835,3,14523,798024,4,16698,880587,5,18872,880588,1,18872,880588,50,18879,880588,40,18879,882067,0,18880,935667,3,20281,936319,4,20981,1033110,5,21681,1033112,5,21681,1033112,1,21681,1033112,50,21683,1033112,40,21683,1034591,0,21685,1149504,3,24587,1229769,4,26037,1288278,5,27486,1288279,1,27486,1288279,50,27494,1288279,40,27494,1289758,0,27495,1343636,3,28896,1373147,4,29597,1420097,5,30296,1420098,1,30296,1420098,50,30305,1420098,40,30305,1421577,0,30306,1446290,3,30857,1450442,4,31132,1472641,5,31407,1472641,1,31407,1472641,50,31409,1472641,40,31409,1474120,0,31411)
%
%
% START OF PROOF
% 1422149 [?] ?
% 1472644 [] c_in(X,c_union(c_^message_^osynth(c_^message_^oanalz(Y)),c_^message_^oparts(Y),tc_^message_^omsg),tc_^message_^omsg) | -c_in(X,c_^message_^oparts(c_insert(Z,Y,tc_^message_^omsg)),tc_^message_^omsg) | -c_in(Z,c_^message_^osynth(c_^message_^oanalz(Y)),tc_^message_^omsg).
% 1472646 [] -c_in(X,c_^message_^oanalz(Y),tc_^message_^omsg) | c_in(X,c_^message_^oparts(Y),tc_^message_^omsg).
% 1472653 [] c_in(c_^message_^omsg_^o^key(c_^public_^oshr^k(X)),c_^event_^oknows(c_^message_^oagent_^o^spy,Y),tc_^message_^omsg) | -c_in(X,c_^event_^obad,tc_^message_^oagent).
% 1472713 [] -c_in(c_^message_^omsg_^o^key(X),c_^message_^osynth(Y),tc_^message_^omsg) | c_in(c_^message_^omsg_^o^key(X),Y,tc_^message_^omsg).
% 1472734 [] c_in(X,c_^message_^oanalz(Y),tc_^message_^omsg) | -c_in(X,Y,tc_^message_^omsg).
% 1472924 [] -c_in(X,c_union(Y,Z,U),U) | c_in(X,Z,U) | c_in(X,Y,U).
% 1472930 [] c_in(X,c_insert(Y,Z,U),U) | -c_in(X,Z,U).
% 1474117 [] -c_in(c_^message_^omsg_^o^key(c_^public_^oshr^k(v_^a)),c_^message_^oparts(c_^event_^oknows(c_^message_^oagent_^o^spy,v_evs4)),tc_^message_^omsg) | c_in(v_^a,c_^event_^obad,tc_^message_^oagent).
% 1474119 [] -c_in(c_^message_^omsg_^o^key(c_^public_^oshr^k(v_^a)),c_^message_^oparts(c_insert(v_^x,c_^event_^oknows(c_^message_^oagent_^o^spy,v_evs4),tc_^message_^omsg)),tc_^message_^omsg) | -c_in(v_^a,c_^event_^obad,tc_^message_^oagent).
% 1474120 [] c_in(c_^message_^omsg_^o^key(c_^public_^oshr^k(v_^a)),c_^message_^oparts(c_insert(v_^x,c_^event_^oknows(c_^message_^oagent_^o^spy,v_evs4),tc_^message_^omsg)),tc_^message_^omsg) | c_in(v_^a,c_^event_^obad,tc_^message_^oagent).
% 1474147 [binary:1474120,1472644.2,cut:1422149] c_in(c_^message_^omsg_^o^key(c_^public_^oshr^k(v_^a)),c_union(c_^message_^osynth(c_^message_^oanalz(c_^event_^oknows(c_^message_^oagent_^o^spy,v_evs4))),c_^message_^oparts(c_^event_^oknows(c_^message_^oagent_^o^spy,v_evs4)),tc_^message_^omsg),tc_^message_^omsg) | c_in(v_^a,c_^event_^obad,tc_^message_^oagent).
% 1474153 [binary:1474117,1472646.2] -c_in(c_^message_^omsg_^o^key(c_^public_^oshr^k(v_^a)),c_^message_^oanalz(c_^event_^oknows(c_^message_^oagent_^o^spy,v_evs4)),tc_^message_^omsg) | c_in(v_^a,c_^event_^obad,tc_^message_^oagent).
% 1474154 [binary:1474119,1472646.2] -c_in(c_^message_^omsg_^o^key(c_^public_^oshr^k(v_^a)),c_^message_^oanalz(c_insert(v_^x,c_^event_^oknows(c_^message_^oagent_^o^spy,v_evs4),tc_^message_^omsg)),tc_^message_^omsg) | -c_in(v_^a,c_^event_^obad,tc_^message_^oagent).
% 1474482 [binary:1474154,1472734] -c_in(c_^message_^omsg_^o^key(c_^public_^oshr^k(v_^a)),c_insert(v_^x,c_^event_^oknows(c_^message_^oagent_^o^spy,v_evs4),tc_^message_^omsg),tc_^message_^omsg) | -c_in(v_^a,c_^event_^obad,tc_^message_^oagent).
% 1475871 [binary:1474147,1472924,binarycut:1474117] c_in(c_^message_^omsg_^o^key(c_^public_^oshr^k(v_^a)),c_^message_^osynth(c_^message_^oanalz(c_^event_^oknows(c_^message_^oagent_^o^spy,v_evs4))),tc_^message_^omsg) | c_in(v_^a,c_^event_^obad,tc_^message_^oagent).
% 1475884 [binary:1472713,1475871,binarycut:1474153] c_in(v_^a,c_^event_^obad,tc_^message_^oagent).
% 1476022 [binary:1474482,1472930,cut:1475884,binarydemod:1472653,cut:1475884] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% using term-depth-order strategy
% using sos strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% using clause demodulation
% seconds given: 28
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 33146
% derived clauses: 1887142
% kept clauses: 628710
% kept size sum: 477036
% kept mid-nuclei: 276403
% kept new demods: 334
% forw unit-subs: 281523
% forw double-subs: 123731
% forw overdouble-subs: 36695
% backward subs: 418
% fast unit cutoff: 52120
% full unit cutoff: 12007
% dbl unit cutoff: 331
% real runtime : 316.9
% process. runtime: 314.65
% specific non-discr-tree subsumption statistics:
% tried: 3111944
% length fails: 78470
% strength fails: 650992
% predlist fails: 1234873
% aux str. fails: 210859
% by-lit fails: 110185
% full subs tried: 713384
% full subs fail: 675645
%
% ; program args: ("/home/graph/tptp/Systems/Gandalf---c-2.6/gandalf" "-time" "600" "/tmp/SystemOnTPTP22672/SWV/SWV323-1+eq_r.in")
% WARNING: TreeLimitedRun lost 313.60s, total lost is 313.60s
%
%------------------------------------------------------------------------------