TSTP Solution File: SWV283-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : SWV283-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 84.6s
% Output : Assurance 84.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/SystemOnTPTP32383/SWV/SWV283-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(1479,40,7,2961,0,13,254784,4,2128,266359,5,2814,266360,1,2814,266360,50,2821,266360,40,2821,267842,0,2823,327747,3,4225,333598,4,4925,334414,5,5624,334415,5,5626,334416,1,5626,334416,50,5632,334416,40,5632,335898,0,5633,361382,3,6184,374205,4,6462,375075,5,6734,375077,5,6734,375078,1,6734,375078,50,6738,375078,40,6738,376560,0,6739,414758,3,7590,431103,4,8016,433078,5,8440,433079,5,8442,433080,1,8442,433080,50,8447,433080,40,8447,434562,0,8448)
%
%
% START OF PROOF
% 434519 [] -c_in(c_^message_^omsg_^o^nonce(X),c_^message_^oparts(c_insert(Y,c_emptyset,tc_^message_^omsg)),tc_^message_^omsg) | -c_lessequals($ganapfun1($ganc73,Y),X,tc_nat).
% 434520 [] -c_lessequals($ganapfun3($ganc2,X,Y,tc_nat),Z,tc_nat) | c_lessequals(Y,Z,tc_nat).
% 434521 [] -c_lessequals($ganapfun3($ganc2,X,Y,tc_nat),Z,tc_nat) | c_lessequals(X,Z,tc_nat).
% 434550 [?] ?
% 434555 [?] ?
% 434559 [] -c_in(c_^message_^omsg_^o^nonce(X),c_^event_^oused(v_list),tc_^message_^omsg) | -c_lessequals(v_x,X,tc_nat).
% 434564 [input:434550,factor:binarydemod:434559,434519] -c_lessequals($ganapfun1($ganc73,v_xc),v_xd(X),tc_nat) | -c_lessequals(v_x,v_xd(X),tc_nat).
% 434565 [input:434555,factor] c_lessequals(X,v_xd(X),tc_nat).
% 434575 [binary:434520,434565] c_lessequals(X,v_xd($ganapfun3($ganc2,Y,X,tc_nat)),tc_nat).
% 434576 [binary:434521,434565] c_lessequals(X,v_xd($ganapfun3($ganc2,X,Y,tc_nat)),tc_nat).
% 434637 [binary:434521,434576] c_lessequals(X,v_xd($ganapfun3($ganc2,$ganapfun3($ganc2,X,Y,tc_nat),Z,tc_nat)),tc_nat).
% 434938 [binary:434575,434564,slowcut:434637] 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: 17
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 9885
% derived clauses: 869027
% kept clauses: 228753
% kept size sum: 5815
% kept mid-nuclei: 15021
% kept new demods: 133
% forw unit-subs: 127426
% forw double-subs: 18038
% forw overdouble-subs: 1781
% backward subs: 134
% fast unit cutoff: 2682
% full unit cutoff: 2057
% dbl unit cutoff: 11
% real runtime : 84.94
% process. runtime: 84.47
% specific non-discr-tree subsumption statistics:
% tried: 31257
% length fails: 589
% strength fails: 1576
% predlist fails: 12458
% aux str. fails: 364
% by-lit fails: 431
% full subs tried: 15259
% full subs fail: 13449
%
% ; program args: ("/home/graph/tptp/Systems/Gandalf---c-2.6/gandalf" "-time" "600" "/tmp/SystemOnTPTP32383/SWV/SWV283-1+eq_r.in")
% WARNING: TreeLimitedRun lost 84.57s, total lost is 84.57s
% Killed 1 orphans
%
%------------------------------------------------------------------------------