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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : SWC279+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm  : none
% Format   : tptp
% Command  : run_spass %d %s

% Computer : n023.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 22:03:01 EDT 2022

% Result   : Theorem 5.23s 5.38s
% Output   : Refutation 5.23s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   11
% Syntax   : Number of clauses     :   29 (  15 unt;   1 nHn;  29 RR)
%            Number of literals    :   73 (   0 equ;  47 neg)
%            Maximal clause size   :    7 (   2 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    7 (   6 usr;   1 prp; 0-3 aty)
%            Number of functors    :   12 (  12 usr;  10 con; 0-2 aty)
%            Number of variables   :    0 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    ssItem(skc13),
    file('SWC279+1.p',unknown),
    [] ).

cnf(2,axiom,
    ssList(skc12),
    file('SWC279+1.p',unknown),
    [] ).

cnf(3,axiom,
    ssList(skc11),
    file('SWC279+1.p',unknown),
    [] ).

cnf(4,axiom,
    ssItem(skc10),
    file('SWC279+1.p',unknown),
    [] ).

cnf(70,axiom,
    ( memberP(u,v)
    | skP0(w,v,u) ),
    file('SWC279+1.p',unknown),
    [] ).

cnf(80,axiom,
    ( ~ skP0(skc10,skc13,skc11)
    | memberP(skc12,skc13) ),
    file('SWC279+1.p',unknown),
    [] ).

cnf(81,axiom,
    ( ~ leq(u,v)
    | skP0(v,u,w) ),
    file('SWC279+1.p',unknown),
    [] ).

cnf(84,axiom,
    equal(app(app(skc11,cons(skc10,nil)),skc12),skc8),
    file('SWC279+1.p',unknown),
    [] ).

cnf(85,axiom,
    ( ~ leq(skc10,skc13)
    | ~ skP0(skc10,skc13,skc11) ),
    file('SWC279+1.p',unknown),
    [] ).

cnf(191,axiom,
    ( ~ ssItem(u)
    | ~ ssList(v)
    | ~ ssList(w)
    | ~ ssItem(x)
    | ~ memberP(w,u)
    | ~ equal(app(app(w,cons(x,nil)),v),skc8)
    | leq(u,x) ),
    file('SWC279+1.p',unknown),
    [] ).

cnf(192,axiom,
    ( ~ ssItem(u)
    | ~ ssList(v)
    | ~ ssList(w)
    | ~ ssItem(x)
    | ~ memberP(v,u)
    | ~ equal(app(app(w,cons(x,nil)),v),skc8)
    | leq(x,u) ),
    file('SWC279+1.p',unknown),
    [] ).

cnf(6829,plain,
    ~ skP0(skc10,skc13,skc11),
    inference(spt,[spt(split,[position(s1)])],[80]),
    [iquote('1:Spt:80.0')] ).

cnf(6830,plain,
    memberP(skc11,skc13),
    inference(res,[status(thm),theory(equality)],[70,6829]),
    [iquote('1:Res:70.1,6829.0')] ).

cnf(6831,plain,
    ~ leq(skc13,skc10),
    inference(res,[status(thm),theory(equality)],[81,6829]),
    [iquote('1:Res:81.1,6829.0')] ).

cnf(11109,plain,
    ( ~ ssItem(u)
    | ~ ssList(skc12)
    | ~ ssList(skc11)
    | ~ ssItem(skc10)
    | ~ memberP(skc11,u)
    | ~ equal(skc8,skc8)
    | leq(u,skc10) ),
    inference(spl,[status(thm),theory(equality)],[84,191]),
    [iquote('0:SpL:84.0,191.5')] ).

cnf(11111,plain,
    ( ~ ssItem(u)
    | ~ ssList(skc12)
    | ~ ssList(skc11)
    | ~ ssItem(skc10)
    | ~ memberP(skc11,u)
    | leq(u,skc10) ),
    inference(obv,[status(thm),theory(equality)],[11109]),
    [iquote('0:Obv:11109.5')] ).

cnf(11112,plain,
    ( ~ ssItem(u)
    | ~ memberP(skc11,u)
    | leq(u,skc10) ),
    inference(ssi,[status(thm)],[11111,4,3,2]),
    [iquote('0:SSi:11111.3,11111.2,11111.1,4.0,3.0,2.0')] ).

cnf(11149,plain,
    ( ~ ssItem(u)
    | ~ ssList(skc12)
    | ~ ssList(skc11)
    | ~ ssItem(skc10)
    | ~ memberP(skc12,u)
    | ~ equal(skc8,skc8)
    | leq(skc10,u) ),
    inference(spl,[status(thm),theory(equality)],[84,192]),
    [iquote('0:SpL:84.0,192.5')] ).

cnf(11151,plain,
    ( ~ ssItem(u)
    | ~ ssList(skc12)
    | ~ ssList(skc11)
    | ~ ssItem(skc10)
    | ~ memberP(skc12,u)
    | leq(skc10,u) ),
    inference(obv,[status(thm),theory(equality)],[11149]),
    [iquote('0:Obv:11149.5')] ).

cnf(11152,plain,
    ( ~ ssItem(u)
    | ~ memberP(skc12,u)
    | leq(skc10,u) ),
    inference(ssi,[status(thm)],[11151,4,3,2]),
    [iquote('0:SSi:11151.3,11151.2,11151.1,4.0,3.0,2.0')] ).

cnf(11987,plain,
    ( ~ ssItem(skc13)
    | leq(skc13,skc10) ),
    inference(res,[status(thm),theory(equality)],[6830,11112]),
    [iquote('1:Res:6830.0,11112.1')] ).

cnf(11988,plain,
    leq(skc13,skc10),
    inference(ssi,[status(thm)],[11987,1]),
    [iquote('1:SSi:11987.0,1.0')] ).

cnf(11989,plain,
    $false,
    inference(mrr,[status(thm)],[11988,6831]),
    [iquote('1:MRR:11988.0,6831.0')] ).

cnf(11990,plain,
    skP0(skc10,skc13,skc11),
    inference(spt,[spt(split,[position(sa)])],[11989,6829]),
    [iquote('1:Spt:11989.0,80.0,6829.0')] ).

cnf(11991,plain,
    memberP(skc12,skc13),
    inference(spt,[spt(split,[position(s2)])],[80]),
    [iquote('1:Spt:11989.0,80.1')] ).

cnf(11992,plain,
    ~ leq(skc10,skc13),
    inference(mrr,[status(thm)],[85,11990]),
    [iquote('1:MRR:85.1,11990.0')] ).

cnf(12541,plain,
    ( ~ ssItem(skc13)
    | leq(skc10,skc13) ),
    inference(res,[status(thm),theory(equality)],[11991,11152]),
    [iquote('1:Res:11991.0,11152.1')] ).

cnf(12542,plain,
    leq(skc10,skc13),
    inference(ssi,[status(thm)],[12541,1]),
    [iquote('1:SSi:12541.0,1.0')] ).

cnf(12543,plain,
    $false,
    inference(mrr,[status(thm)],[12542,11992]),
    [iquote('1:MRR:12542.0,11992.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem  : SWC279+1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.12  % Command  : run_spass %d %s
% 0.12/0.33  % Computer : n023.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 : Sat Jun 11 22:06:36 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 5.23/5.38  
% 5.23/5.38  SPASS V 3.9 
% 5.23/5.38  SPASS beiseite: Proof found.
% 5.23/5.38  % SZS status Theorem
% 5.23/5.38  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 5.23/5.38  SPASS derived 8662 clauses, backtracked 2121 clauses, performed 70 splits and kept 6304 clauses.
% 5.23/5.38  SPASS allocated 107655 KBytes.
% 5.23/5.38  SPASS spent	0:00:04.71 on the problem.
% 5.23/5.38  		0:00:00.04 for the input.
% 5.23/5.38  		0:00:00.06 for the FLOTTER CNF translation.
% 5.23/5.38  		0:00:00.08 for inferences.
% 5.23/5.38  		0:00:00.08 for the backtracking.
% 5.23/5.38  		0:00:04.25 for the reduction.
% 5.23/5.38  
% 5.23/5.38  
% 5.23/5.38  Here is a proof with depth 3, length 29 :
% 5.23/5.38  % SZS output start Refutation
% See solution above
% 5.23/5.38  Formulae used in the proof : co1
% 5.23/5.38  
%------------------------------------------------------------------------------