↑ Up

Gandalf---c-2.6.UNS-Ass.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : LCL446-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 : art03.cs.miami.edu
% Model    : i686 i686
% CPU      : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2793MHz
% Memory   : 1003MB
% OS       : Linux 2.6.11-1.1369_FC4
% CPULimit : 600s

% Result   : Unsatisfiable 164.6s
% Output   : Assurance 164.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/SystemOnTPTP19560/LCL/LCL446-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)
% 
% 
% **** EMPTY CLAUSE DERIVED ****
% 
% 
% timer checkpoints: c(1372,40,6,2744,0,13,467773,4,2120,486750,5,2814,486750,1,2814,486750,50,2821,486750,40,2821,488122,0,2822,525182,3,4223,526702,4,4923,533858,5,5623,533859,5,5623,533859,1,5623,533859,50,5627,533859,40,5627,535231,0,5628,558485,3,6179,563792,4,6454,574248,62,6729,574248,5,6730,574248,1,6730,574248,50,6732,574248,40,6732,575620,0,6734,614550,3,7585,637049,4,8010,649966,5,8435,649968,5,8436,649968,1,8436,649968,50,8441,649968,40,8441,651340,0,8442,683367,3,9294,693588,4,9718,699501,5,10143,699502,5,10144,699503,1,10144,699503,50,10147,699503,40,10147,700875,0,10148,847147,3,14511,852757,4,16674)
% 
% 
% START OF PROOF
% 700872 [] c_in(c_^prop^log_^opl_^oop_^a_^n_62(X,c_^prop^log_^opl_^oop_^a_^n_62(Y,X,Z),Z),c_^prop^log_^othms(U,Z),tc_^prop^log_^opl(Z)).
% 700873 [] -c_in(c_^prop^log_^opl_^oop_^a_^n_62(X,Y,Z),c_^prop^log_^othms(U,Z),tc_^prop^log_^opl(Z)) | -c_in(X,c_^prop^log_^othms(U,Z),tc_^prop^log_^opl(Z)) | c_in(Y,c_^prop^log_^othms(U,Z),tc_^prop^log_^opl(Z)).
% 700874 [] c_in(c_^prop^log_^opl_^oop_^a_^n_62(c_^prop^log_^opl_^oop_^a_^n_62(X,c_^prop^log_^opl_^oop_^a_^n_62(Y,Z,U),U),c_^prop^log_^opl_^oop_^a_^n_62(c_^prop^log_^opl_^oop_^a_^n_62(X,Y,U),c_^prop^log_^opl_^oop_^a_^n_62(X,Z,U),U),U),c_^prop^log_^othms(V,U),tc_^prop^log_^opl(U)).
% 700875 [] -c_in(c_^prop^log_^opl_^oop_^a_^n_62(v_p,v_p,t_a),c_^prop^log_^othms(v_^h,t_a),tc_^prop^log_^opl(t_a)).
% 700889 [binary:700873.3,700875] -c_in(c_^prop^log_^opl_^oop_^a_^n_62(X,c_^prop^log_^opl_^oop_^a_^n_62(v_p,v_p,t_a),t_a),c_^prop^log_^othms(v_^h,t_a),tc_^prop^log_^opl(t_a)) | -c_in(X,c_^prop^log_^othms(v_^h,t_a),tc_^prop^log_^opl(t_a)).
% 701795 [binary:700873.3,700889] -c_in(c_^prop^log_^opl_^oop_^a_^n_62(X,c_^prop^log_^opl_^oop_^a_^n_62(Y,c_^prop^log_^opl_^oop_^a_^n_62(v_p,v_p,t_a),t_a),t_a),c_^prop^log_^othms(v_^h,t_a),tc_^prop^log_^opl(t_a)) | -c_in(X,c_^prop^log_^othms(v_^h,t_a),tc_^prop^log_^opl(t_a)) | -c_in(Y,c_^prop^log_^othms(v_^h,t_a),tc_^prop^log_^opl(t_a)).
% 853780 [binary:700874,701795,cut:700872,slowcut:700872] contradiction
% END OF PROOF
% 
% Proof found by the following strategy:
% 
% using binary resolution
% using sos strategy
% using unit paramodulation strategy
% using unit 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: 87
% 
% 
% old unit clauses discarded
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    17110
%  derived clauses:   1857938
%  kept clauses:      276696
%  kept size sum:     0
%  kept mid-nuclei:   42819
%  kept new demods:   163
%  forw unit-subs:    185992
%  forw double-subs: 36118
%  forw overdouble-subs: 5569
%  backward subs:     117
%  fast unit cutoff:  12971
%  full unit cutoff:  5527
%  dbl  unit cutoff:  123
%  real runtime  :  168.29
%  process. runtime:  167.73
% specific non-discr-tree subsumption statistics: 
%  tried:           1549303
%  length fails:    63529
%  strength fails:  192446
%  predlist fails:  365420
%  aux str. fails:  38169
%  by-lit fails:    282633
%  full subs tried: 437785
%  full subs fail:  432210
% 
% ; program args: ("/home/graph/tptp/Systems/Gandalf---c-2.6/gandalf" "-time" "600" "/tmp/SystemOnTPTP19560/LCL/LCL446-1+eq_r.in")
% WARNING: TreeLimitedRun lost 164.57s, total lost is 164.57s
% 
%------------------------------------------------------------------------------