TSTP Solution File: PRO009+4 by SPASS---3.9

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : PRO009+4 : TPTP v8.1.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp
% Command  : run_spass %d %s

% Computer : n016.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 : Mon Jul 18 17:53:47 EDT 2022

% Result   : Theorem 0.39s 0.61s
% Output   : Refutation 0.39s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :   15
% Syntax   : Number of clauses     :   39 (  15 unt;   1 nHn;  39 RR)
%            Number of literals    :   87 (   0 equ;  55 neg)
%            Maximal clause size   :    5 (   2 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    9 (   8 usr;   1 prp; 0-3 aty)
%            Number of functors    :   13 (  13 usr;   9 con; 0-2 aty)
%            Number of variables   :    0 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(6,axiom,
    occurrence_of(skc1,tptp0),
    file('PRO009+4.p',unknown),
    [] ).

cnf(10,axiom,
    occurrence_of(skf29(u),tptp3),
    file('PRO009+4.p',unknown),
    [] ).

cnf(26,axiom,
    ( ~ leaf_occ(u,v)
    | subactivity_occurrence(u,v) ),
    file('PRO009+4.p',unknown),
    [] ).

cnf(33,axiom,
    ( occurrence_of(skf27(u),tptp1)
    | occurrence_of(skf27(u),tptp2) ),
    file('PRO009+4.p',unknown),
    [] ).

cnf(34,axiom,
    ( ~ occurrence_of(u,tptp0)
    | root_occ(skf29(u),u) ),
    file('PRO009+4.p',unknown),
    [] ).

cnf(35,axiom,
    ( ~ occurrence_of(u,tptp0)
    | leaf_occ(skf27(u),u) ),
    file('PRO009+4.p',unknown),
    [] ).

cnf(48,axiom,
    ( ~ next_subocc(u,v,w)
    | min_precedes(u,v,w) ),
    file('PRO009+4.p',unknown),
    [] ).

cnf(50,axiom,
    ( ~ min_precedes(u,v,w)
    | root(skf25(w,x),w) ),
    file('PRO009+4.p',unknown),
    [] ).

cnf(52,axiom,
    ( ~ occurrence_of(u,tptp0)
    | next_subocc(skf28(u),skf27(u),tptp0) ),
    file('PRO009+4.p',unknown),
    [] ).

cnf(61,axiom,
    ( ~ min_precedes(u,v,w)
    | min_precedes(skf25(w,v),v,w) ),
    file('PRO009+4.p',unknown),
    [] ).

cnf(70,axiom,
    ( ~ subactivity_occurrence(u,v)
    | ~ root(u,w)
    | ~ occurrence_of(v,w)
    | root_occ(u,v) ),
    file('PRO009+4.p',unknown),
    [] ).

cnf(72,axiom,
    ( ~ root_occ(u,v)
    | ~ root_occ(w,v)
    | ~ occurrence_of(v,x)
    | equal(w,u) ),
    file('PRO009+4.p',unknown),
    [] ).

cnf(75,axiom,
    ( ~ occurrence_of(u,v)
    | ~ subactivity_occurrence(w,u)
    | ~ min_precedes(x,w,v)
    | subactivity_occurrence(x,u) ),
    file('PRO009+4.p',unknown),
    [] ).

cnf(78,axiom,
    ( ~ leaf_occ(u,skc1)
    | ~ root_occ(v,skc1)
    | ~ occurrence_of(v,tptp3)
    | ~ occurrence_of(u,tptp1)
    | ~ min_precedes(v,u,tptp0) ),
    file('PRO009+4.p',unknown),
    [] ).

cnf(79,axiom,
    ( ~ leaf_occ(u,skc1)
    | ~ root_occ(v,skc1)
    | ~ occurrence_of(v,tptp3)
    | ~ occurrence_of(u,tptp2)
    | ~ min_precedes(v,u,tptp0) ),
    file('PRO009+4.p',unknown),
    [] ).

cnf(85,plain,
    ( ~ subactivity_occurrence(u,skc1)
    | ~ root(u,tptp0)
    | root_occ(u,skc1) ),
    inference(res,[status(thm),theory(equality)],[6,70]),
    [iquote('0:Res:6.0,70.0')] ).

cnf(86,plain,
    ( ~ root_occ(u,skc1)
    | ~ root_occ(v,skc1)
    | equal(v,u) ),
    inference(res,[status(thm),theory(equality)],[6,72]),
    [iquote('0:Res:6.0,72.0')] ).

cnf(96,plain,
    next_subocc(skf28(skc1),skf27(skc1),tptp0),
    inference(res,[status(thm),theory(equality)],[6,52]),
    [iquote('0:Res:6.0,52.0')] ).

cnf(97,plain,
    root_occ(skf29(skc1),skc1),
    inference(res,[status(thm),theory(equality)],[6,34]),
    [iquote('0:Res:6.0,34.0')] ).

cnf(98,plain,
    leaf_occ(skf27(skc1),skc1),
    inference(res,[status(thm),theory(equality)],[6,35]),
    [iquote('0:Res:6.0,35.0')] ).

cnf(102,plain,
    ( ~ subactivity_occurrence(u,skc1)
    | ~ min_precedes(v,u,tptp0)
    | subactivity_occurrence(v,skc1) ),
    inference(res,[status(thm),theory(equality)],[6,75]),
    [iquote('0:Res:6.0,75.2')] ).

cnf(139,plain,
    subactivity_occurrence(skf27(skc1),skc1),
    inference(res,[status(thm),theory(equality)],[98,26]),
    [iquote('0:Res:98.0,26.0')] ).

cnf(232,plain,
    min_precedes(skf28(skc1),skf27(skc1),tptp0),
    inference(res,[status(thm),theory(equality)],[96,48]),
    [iquote('0:Res:96.0,48.0')] ).

cnf(252,plain,
    root(skf25(tptp0,u),tptp0),
    inference(res,[status(thm),theory(equality)],[232,50]),
    [iquote('0:Res:232.0,50.0')] ).

cnf(323,plain,
    min_precedes(skf25(tptp0,skf27(skc1)),skf27(skc1),tptp0),
    inference(res,[status(thm),theory(equality)],[232,61]),
    [iquote('0:Res:232.0,61.0')] ).

cnf(746,plain,
    ( ~ root_occ(u,skc1)
    | equal(u,skf29(skc1)) ),
    inference(res,[status(thm),theory(equality)],[97,86]),
    [iquote('0:Res:97.0,86.0')] ).

cnf(751,plain,
    ( ~ subactivity_occurrence(u,skc1)
    | ~ root(u,tptp0)
    | equal(u,skf29(skc1)) ),
    inference(res,[status(thm),theory(equality)],[85,746]),
    [iquote('0:Res:85.2,746.0')] ).

cnf(817,plain,
    ( ~ leaf_occ(skf27(skc1),skc1)
    | ~ root_occ(skf25(tptp0,skf27(skc1)),skc1)
    | ~ occurrence_of(skf25(tptp0,skf27(skc1)),tptp3)
    | ~ occurrence_of(skf27(skc1),tptp2) ),
    inference(res,[status(thm),theory(equality)],[323,79]),
    [iquote('0:Res:323.0,79.4')] ).

cnf(837,plain,
    ( ~ leaf_occ(skf27(skc1),skc1)
    | ~ root_occ(skf25(tptp0,skf27(skc1)),skc1)
    | ~ occurrence_of(skf25(tptp0,skf27(skc1)),tptp3)
    | ~ occurrence_of(skf27(skc1),tptp1) ),
    inference(res,[status(thm),theory(equality)],[323,78]),
    [iquote('0:Res:323.0,78.4')] ).

cnf(942,plain,
    ( ~ subactivity_occurrence(skf27(skc1),skc1)
    | subactivity_occurrence(skf25(tptp0,skf27(skc1)),skc1) ),
    inference(res,[status(thm),theory(equality)],[323,102]),
    [iquote('0:Res:323.0,102.1')] ).

cnf(951,plain,
    subactivity_occurrence(skf25(tptp0,skf27(skc1)),skc1),
    inference(mrr,[status(thm)],[942,139]),
    [iquote('0:MRR:942.0,139.0')] ).

cnf(1113,plain,
    ( ~ root(skf25(tptp0,skf27(skc1)),tptp0)
    | equal(skf25(tptp0,skf27(skc1)),skf29(skc1)) ),
    inference(res,[status(thm),theory(equality)],[951,751]),
    [iquote('0:Res:951.0,751.0')] ).

cnf(1118,plain,
    equal(skf25(tptp0,skf27(skc1)),skf29(skc1)),
    inference(mrr,[status(thm)],[1113,252]),
    [iquote('0:MRR:1113.0,252.0')] ).

cnf(1167,plain,
    ( ~ leaf_occ(skf27(skc1),skc1)
    | ~ root_occ(skf29(skc1),skc1)
    | ~ occurrence_of(skf29(skc1),tptp3)
    | ~ occurrence_of(skf27(skc1),tptp1) ),
    inference(rew,[status(thm),theory(equality)],[1118,837]),
    [iquote('0:Rew:1118.0,837.2,1118.0,837.1')] ).

cnf(1168,plain,
    ~ occurrence_of(skf27(skc1),tptp1),
    inference(mrr,[status(thm)],[1167,98,97,10]),
    [iquote('0:MRR:1167.0,1167.1,1167.2,98.0,97.0,10.0')] ).

cnf(1169,plain,
    ( ~ leaf_occ(skf27(skc1),skc1)
    | ~ root_occ(skf29(skc1),skc1)
    | ~ occurrence_of(skf29(skc1),tptp3)
    | ~ occurrence_of(skf27(skc1),tptp2) ),
    inference(rew,[status(thm),theory(equality)],[1118,817]),
    [iquote('0:Rew:1118.0,817.2,1118.0,817.1')] ).

cnf(1170,plain,
    ~ occurrence_of(skf27(skc1),tptp2),
    inference(mrr,[status(thm)],[1169,98,97,10]),
    [iquote('0:MRR:1169.0,1169.1,1169.2,98.0,97.0,10.0')] ).

cnf(1190,plain,
    occurrence_of(skf27(skc1),tptp2),
    inference(res,[status(thm),theory(equality)],[33,1168]),
    [iquote('0:Res:33.0,1168.0')] ).

cnf(1191,plain,
    $false,
    inference(mrr,[status(thm)],[1190,1170]),
    [iquote('0:MRR:1190.0,1170.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : PRO009+4 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.12  % Command  : run_spass %d %s
% 0.12/0.33  % Computer : n016.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 600
% 0.12/0.33  % DateTime : Mon Jun 13 03:41:43 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.39/0.61  
% 0.39/0.61  SPASS V 3.9 
% 0.39/0.61  SPASS beiseite: Proof found.
% 0.39/0.61  % SZS status Theorem
% 0.39/0.61  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 0.39/0.61  SPASS derived 985 clauses, backtracked 20 clauses, performed 2 splits and kept 627 clauses.
% 0.39/0.61  SPASS allocated 99060 KBytes.
% 0.39/0.61  SPASS spent	0:00:00.26 on the problem.
% 0.39/0.61  		0:00:00.04 for the input.
% 0.39/0.61  		0:00:00.09 for the FLOTTER CNF translation.
% 0.39/0.61  		0:00:00.01 for inferences.
% 0.39/0.61  		0:00:00.00 for the backtracking.
% 0.39/0.61  		0:00:00.09 for the reduction.
% 0.39/0.61  
% 0.39/0.61  
% 0.39/0.61  Here is a proof with depth 5, length 39 :
% 0.39/0.61  % SZS output start Refutation
% See solution above
% 0.39/0.61  Formulae used in the proof : goals sos_32 sos_18 sos_26 sos_23 sos_19 sos_29 sos_27
% 0.39/0.61  
%------------------------------------------------------------------------------