TSTP Solution File: SEU376+1 by SPASS---3.9

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : SEU376+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm  : none
% Format   : tptp
% Command  : run_spass %d %s

% Computer : n004.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 600s
% DateTime : Tue Jul 19 14:36:45 EDT 2022

% Result   : Theorem 1.01s 1.20s
% Output   : Refutation 1.01s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   15
% Syntax   : Number of clauses     :   33 (  13 unt;   8 nHn;  33 RR)
%            Number of literals    :  106 (   0 equ;  65 neg)
%            Maximal clause size   :    8 (   3 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :   11 (  10 usr;   1 prp; 0-3 aty)
%            Number of functors    :   12 (  12 usr;   7 con; 0-3 aty)
%            Number of variables   :    0 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    one_sorted_str(skc14),
    file('SEU376+1.p',unknown),
    [] ).

cnf(3,axiom,
    directed_relstr(skc15),
    file('SEU376+1.p',unknown),
    [] ).

cnf(31,axiom,
    ~ empty_carrier(skc15),
    file('SEU376+1.p',unknown),
    [] ).

cnf(32,axiom,
    ~ empty_carrier(skc14),
    file('SEU376+1.p',unknown),
    [] ).

cnf(33,axiom,
    net_str(skc15,skc14),
    file('SEU376+1.p',unknown),
    [] ).

cnf(38,axiom,
    is_eventually_in(skc14,skc15,skc16),
    file('SEU376+1.p',unknown),
    [] ).

cnf(41,axiom,
    ~ is_often_in(skc14,skc15,skc16),
    file('SEU376+1.p',unknown),
    [] ).

cnf(54,axiom,
    element(skf14(u,v,w),the_carrier(w)),
    file('SEU376+1.p',unknown),
    [] ).

cnf(55,axiom,
    element(skf17(u,v,w),the_carrier(w)),
    file('SEU376+1.p',unknown),
    [] ).

cnf(56,axiom,
    element(skf18(u,v,w),the_carrier(w)),
    file('SEU376+1.p',unknown),
    [] ).

cnf(68,axiom,
    ( ~ one_sorted_str(u)
    | ~ net_str(v,u)
    | rel_str(v) ),
    file('SEU376+1.p',unknown),
    [] ).

cnf(89,axiom,
    ( ~ rel_str(u)
    | ~ directed_relstr(u)
    | ~ element(v,the_carrier(u))
    | ~ element(w,the_carrier(u))
    | empty_carrier(u)
    | related(u,w,skf18(w,v,u)) ),
    file('SEU376+1.p',unknown),
    [] ).

cnf(90,axiom,
    ( ~ rel_str(u)
    | ~ directed_relstr(u)
    | ~ element(v,the_carrier(u))
    | ~ element(w,the_carrier(u))
    | empty_carrier(u)
    | related(u,v,skf18(w,v,u)) ),
    file('SEU376+1.p',unknown),
    [] ).

cnf(96,axiom,
    ( ~ one_sorted_str(u)
    | ~ net_str(v,u)
    | ~ element(w,the_carrier(v))
    | ~ in(apply_netmap(u,v,w),x)
    | ~ related(v,skf17(x,u,v),w)
    | empty_carrier(v)
    | empty_carrier(u)
    | is_often_in(u,v,x) ),
    file('SEU376+1.p',unknown),
    [] ).

cnf(97,axiom,
    ( ~ one_sorted_str(u)
    | ~ net_str(v,u)
    | ~ element(w,the_carrier(v))
    | ~ is_eventually_in(u,v,x)
    | ~ related(v,skf14(x,u,v),w)
    | empty_carrier(v)
    | empty_carrier(u)
    | in(apply_netmap(u,v,w),x) ),
    file('SEU376+1.p',unknown),
    [] ).

cnf(102,plain,
    ( ~ rel_str(skc15)
    | ~ element(u,the_carrier(skc15))
    | ~ element(v,the_carrier(skc15))
    | related(skc15,v,skf18(u,v,skc15))
    | empty_carrier(skc15) ),
    inference(res,[status(thm),theory(equality)],[3,90]),
    [iquote('0:Res:3.0,90.0')] ).

cnf(103,plain,
    ( ~ rel_str(skc15)
    | ~ element(u,the_carrier(skc15))
    | ~ element(v,the_carrier(skc15))
    | related(skc15,u,skf18(u,v,skc15))
    | empty_carrier(skc15) ),
    inference(res,[status(thm),theory(equality)],[3,89]),
    [iquote('0:Res:3.0,89.0')] ).

cnf(125,plain,
    ( ~ one_sorted_str(skc14)
    | ~ related(skc15,skf17(u,skc14,skc15),v)
    | ~ in(apply_netmap(skc14,skc15,v),u)
    | ~ element(v,the_carrier(skc15))
    | is_often_in(skc14,skc15,u)
    | empty_carrier(skc14)
    | empty_carrier(skc15) ),
    inference(res,[status(thm),theory(equality)],[33,96]),
    [iquote('0:Res:33.0,96.4')] ).

cnf(133,plain,
    ( ~ one_sorted_str(skc14)
    | rel_str(skc15) ),
    inference(res,[status(thm),theory(equality)],[33,68]),
    [iquote('0:Res:33.0,68.1')] ).

cnf(134,plain,
    ( ~ one_sorted_str(skc14)
    | ~ element(u,the_carrier(skc15))
    | ~ related(skc15,skf14(v,skc14,skc15),u)
    | ~ is_eventually_in(skc14,skc15,v)
    | in(apply_netmap(skc14,skc15,u),v)
    | empty_carrier(skc14)
    | empty_carrier(skc15) ),
    inference(res,[status(thm),theory(equality)],[33,97]),
    [iquote('0:Res:33.0,97.4')] ).

cnf(197,plain,
    rel_str(skc15),
    inference(mrr,[status(thm)],[133,1]),
    [iquote('0:MRR:133.0,1.0')] ).

cnf(209,plain,
    ( ~ element(u,the_carrier(skc15))
    | ~ element(v,the_carrier(skc15))
    | related(skc15,v,skf18(v,u,skc15)) ),
    inference(mrr,[status(thm)],[103,197,31]),
    [iquote('0:MRR:103.0,103.4,197.0,31.0')] ).

cnf(210,plain,
    ( ~ element(u,the_carrier(skc15))
    | ~ element(v,the_carrier(skc15))
    | related(skc15,u,skf18(v,u,skc15)) ),
    inference(mrr,[status(thm)],[102,197,31]),
    [iquote('0:MRR:102.0,102.4,197.0,31.0')] ).

cnf(221,plain,
    ( ~ element(u,the_carrier(skc15))
    | ~ is_eventually_in(skc14,skc15,v)
    | ~ related(skc15,skf14(v,skc14,skc15),u)
    | in(apply_netmap(skc14,skc15,u),v) ),
    inference(mrr,[status(thm)],[134,1,32,31]),
    [iquote('0:MRR:134.0,134.5,134.6,1.0,32.0,31.0')] ).

cnf(222,plain,
    ( ~ element(u,the_carrier(skc15))
    | ~ in(apply_netmap(skc14,skc15,u),v)
    | ~ related(skc15,skf17(v,skc14,skc15),u)
    | is_often_in(skc14,skc15,v) ),
    inference(mrr,[status(thm)],[125,1,32,31]),
    [iquote('0:MRR:125.0,125.5,125.6,1.0,32.0,31.0')] ).

cnf(1289,plain,
    ( ~ element(skf17(u,skc14,skc15),the_carrier(skc15))
    | ~ element(v,the_carrier(skc15))
    | ~ element(skf18(v,skf17(u,skc14,skc15),skc15),the_carrier(skc15))
    | ~ in(apply_netmap(skc14,skc15,skf18(v,skf17(u,skc14,skc15),skc15)),u)
    | is_often_in(skc14,skc15,u) ),
    inference(res,[status(thm),theory(equality)],[210,222]),
    [iquote('0:Res:210.2,222.2')] ).

cnf(1293,plain,
    ( ~ element(u,the_carrier(skc15))
    | ~ in(apply_netmap(skc14,skc15,skf18(u,skf17(v,skc14,skc15),skc15)),v)
    | is_often_in(skc14,skc15,v) ),
    inference(mrr,[status(thm)],[1289,55,56]),
    [iquote('0:MRR:1289.0,1289.2,55.0,56.0')] ).

cnf(1313,plain,
    ( ~ element(u,the_carrier(skc15))
    | ~ element(skf14(v,skc14,skc15),the_carrier(skc15))
    | ~ element(skf18(skf14(v,skc14,skc15),u,skc15),the_carrier(skc15))
    | ~ is_eventually_in(skc14,skc15,v)
    | in(apply_netmap(skc14,skc15,skf18(skf14(v,skc14,skc15),u,skc15)),v) ),
    inference(res,[status(thm),theory(equality)],[209,221]),
    [iquote('0:Res:209.2,221.2')] ).

cnf(1314,plain,
    ( ~ element(u,the_carrier(skc15))
    | ~ is_eventually_in(skc14,skc15,v)
    | in(apply_netmap(skc14,skc15,skf18(skf14(v,skc14,skc15),u,skc15)),v) ),
    inference(mrr,[status(thm)],[1313,54,56]),
    [iquote('0:MRR:1313.1,1313.2,54.0,56.0')] ).

cnf(3254,plain,
    ( ~ element(skf17(u,skc14,skc15),the_carrier(skc15))
    | ~ is_eventually_in(skc14,skc15,u)
    | ~ element(skf14(u,skc14,skc15),the_carrier(skc15))
    | is_often_in(skc14,skc15,u) ),
    inference(res,[status(thm),theory(equality)],[1314,1293]),
    [iquote('0:Res:1314.2,1293.1')] ).

cnf(3256,plain,
    ( ~ is_eventually_in(skc14,skc15,u)
    | is_often_in(skc14,skc15,u) ),
    inference(mrr,[status(thm)],[3254,55,54]),
    [iquote('0:MRR:3254.0,3254.2,55.0,54.0')] ).

cnf(3257,plain,
    ~ is_eventually_in(skc14,skc15,skc16),
    inference(res,[status(thm),theory(equality)],[3256,41]),
    [iquote('0:Res:3256.1,41.0')] ).

cnf(3263,plain,
    $false,
    inference(mrr,[status(thm)],[3257,38]),
    [iquote('0:MRR:3257.0,38.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SEU376+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.13  % Command  : run_spass %d %s
% 0.13/0.34  % Computer : n004.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 600
% 0.13/0.35  % DateTime : Mon Jun 20 10:01:08 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 1.01/1.20  
% 1.01/1.20  SPASS V 3.9 
% 1.01/1.20  SPASS beiseite: Proof found.
% 1.01/1.20  % SZS status Theorem
% 1.01/1.20  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 1.01/1.20  SPASS derived 2775 clauses, backtracked 0 clauses, performed 0 splits and kept 1558 clauses.
% 1.01/1.20  SPASS allocated 101467 KBytes.
% 1.01/1.20  SPASS spent	0:00:00.82 on the problem.
% 1.01/1.20  		0:00:00.03 for the input.
% 1.01/1.20  		0:00:00.04 for the FLOTTER CNF translation.
% 1.01/1.20  		0:00:00.07 for inferences.
% 1.01/1.20  		0:00:00.00 for the backtracking.
% 1.01/1.20  		0:00:00.60 for the reduction.
% 1.01/1.20  
% 1.01/1.20  
% 1.01/1.20  Here is a proof with depth 4, length 33 :
% 1.01/1.20  % SZS output start Refutation
% See solution above
% 1.01/1.20  Formulae used in the proof : t28_yellow_6 d11_waybel_0 existence_m1_subset_1 d12_waybel_0 d5_yellow_6 dt_l1_waybel_0
% 1.01/1.20  
%------------------------------------------------------------------------------