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

View Problem - Process Solution

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

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

% Result   : Theorem 111.42s 111.62s
% Output   : Refutation 111.42s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :   17
% Syntax   : Number of clauses     :   30 (  16 unt;   0 nHn;  30 RR)
%            Number of literals    :   68 (   0 equ;  49 neg)
%            Maximal clause size   :    5 (   2 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :   11 (  10 usr;   1 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   6 con; 0-2 aty)
%            Number of variables   :    0 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    ssList(skc5),
    file('SWC008+1.p',unknown),
    [] ).

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

cnf(3,axiom,
    equalelemsP(skc4),
    file('SWC008+1.p',unknown),
    [] ).

cnf(6,axiom,
    ssList(nil),
    file('SWC008+1.p',unknown),
    [] ).

cnf(7,axiom,
    cyclefreeP(nil),
    file('SWC008+1.p',unknown),
    [] ).

cnf(8,axiom,
    totalorderP(nil),
    file('SWC008+1.p',unknown),
    [] ).

cnf(9,axiom,
    strictorderP(nil),
    file('SWC008+1.p',unknown),
    [] ).

cnf(10,axiom,
    totalorderedP(nil),
    file('SWC008+1.p',unknown),
    [] ).

cnf(11,axiom,
    strictorderedP(nil),
    file('SWC008+1.p',unknown),
    [] ).

cnf(12,axiom,
    duplicatefreeP(nil),
    file('SWC008+1.p',unknown),
    [] ).

cnf(13,axiom,
    equalelemsP(nil),
    file('SWC008+1.p',unknown),
    [] ).

cnf(14,axiom,
    frontsegP(skc5,skc4),
    file('SWC008+1.p',unknown),
    [] ).

cnf(56,axiom,
    ssList(skf46(u,v)),
    file('SWC008+1.p',unknown),
    [] ).

cnf(78,axiom,
    ( ~ ssList(u)
    | equal(app(u,nil),u) ),
    file('SWC008+1.p',unknown),
    [] ).

cnf(131,axiom,
    ( ~ ssList(u)
    | ~ ssList(v)
    | ~ frontsegP(v,u)
    | equal(app(u,skf46(v,u)),v) ),
    file('SWC008+1.p',unknown),
    [] ).

cnf(155,axiom,
    ( ~ ssList(u)
    | ~ ssList(v)
    | ~ ssList(w)
    | equal(app(app(w,v),u),app(w,app(v,u))) ),
    file('SWC008+1.p',unknown),
    [] ).

cnf(183,axiom,
    ( ~ ssList(u)
    | ~ ssList(v)
    | ~ ssList(w)
    | ~ equal(app(app(u,v),w),skc5)
    | ~ equal(app(u,w),skc4) ),
    file('SWC008+1.p',unknown),
    [] ).

cnf(198,plain,
    ( ~ ssList(u)
    | ~ ssList(v)
    | ~ ssList(w)
    | ~ equal(app(w,u),skc4)
    | ~ equal(app(w,app(v,u)),skc5) ),
    inference(rew,[status(thm),theory(equality)],[155,183]),
    [iquote('0:Rew:155.3,183.3')] ).

cnf(209,plain,
    ( ~ ssList(u)
    | ~ ssList(v)
    | ~ equal(app(skc4,u),skc4)
    | ~ equal(app(skc4,app(v,u)),skc5) ),
    inference(res,[status(thm),theory(equality)],[2,198]),
    [iquote('0:Res:2.0,198.0')] ).

cnf(279,plain,
    equal(app(skc4,nil),skc4),
    inference(res,[status(thm),theory(equality)],[2,78]),
    [iquote('0:Res:2.0,78.0')] ).

cnf(415,plain,
    ( ~ ssList(u)
    | ~ frontsegP(skc5,u)
    | equal(app(u,skf46(skc5,u)),skc5) ),
    inference(res,[status(thm),theory(equality)],[1,131]),
    [iquote('0:Res:1.0,131.0')] ).

cnf(47077,plain,
    ( ~ ssList(u)
    | ~ ssList(nil)
    | ~ ssList(u)
    | ~ equal(app(skc4,nil),skc4)
    | ~ equal(app(skc4,u),skc5) ),
    inference(spl,[status(thm),theory(equality)],[78,209]),
    [iquote('0:SpL:78.1,209.3')] ).

cnf(47140,plain,
    ( ~ ssList(nil)
    | ~ ssList(u)
    | ~ equal(app(skc4,nil),skc4)
    | ~ equal(app(skc4,u),skc5) ),
    inference(obv,[status(thm),theory(equality)],[47077]),
    [iquote('0:Obv:47077.0')] ).

cnf(47141,plain,
    ( ~ ssList(nil)
    | ~ ssList(u)
    | ~ equal(skc4,skc4)
    | ~ equal(app(skc4,u),skc5) ),
    inference(rew,[status(thm),theory(equality)],[279,47140]),
    [iquote('0:Rew:279.0,47140.2')] ).

cnf(47142,plain,
    ( ~ ssList(nil)
    | ~ ssList(u)
    | ~ equal(app(skc4,u),skc5) ),
    inference(obv,[status(thm),theory(equality)],[47141]),
    [iquote('0:Obv:47141.2')] ).

cnf(47143,plain,
    ( ~ ssList(u)
    | ~ equal(app(skc4,u),skc5) ),
    inference(ssi,[status(thm)],[47142,13,12,9,8,7,11,10,6]),
    [iquote('0:SSi:47142.0,13.0,12.0,9.0,8.0,7.0,11.0,10.0,6.0')] ).

cnf(47207,plain,
    ( ~ ssList(skc4)
    | ~ ssList(skf46(skc5,skc4))
    | ~ frontsegP(skc5,skc4)
    | ~ equal(skc5,skc5) ),
    inference(spl,[status(thm),theory(equality)],[415,47143]),
    [iquote('0:SpL:415.2,47143.1')] ).

cnf(55720,plain,
    ( ~ ssList(skc4)
    | ~ ssList(skf46(skc5,skc4))
    | ~ frontsegP(skc5,skc4) ),
    inference(obv,[status(thm),theory(equality)],[47207]),
    [iquote('0:Obv:47207.3')] ).

cnf(55721,plain,
    ~ frontsegP(skc5,skc4),
    inference(ssi,[status(thm)],[55720,56,1,2,3]),
    [iquote('0:SSi:55720.1,55720.0,56.0,1.0,2.0,3.0,2.0,3.0')] ).

cnf(55722,plain,
    $false,
    inference(mrr,[status(thm)],[55721,14]),
    [iquote('0:MRR:55721.0,14.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.10  % Problem  : SWC008+1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.10  % Command  : run_spass %d %s
% 0.10/0.30  % Computer : n032.cluster.edu
% 0.10/0.30  % Model    : x86_64 x86_64
% 0.10/0.30  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30  % Memory   : 8042.1875MB
% 0.10/0.30  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30  % CPULimit : 300
% 0.10/0.30  % WCLimit  : 600
% 0.10/0.30  % DateTime : Sun Jun 12 07:30:55 EDT 2022
% 0.10/0.30  % CPUTime  : 
% 111.42/111.62  
% 111.42/111.62  SPASS V 3.9 
% 111.42/111.62  SPASS beiseite: Proof found.
% 111.42/111.62  % SZS status Theorem
% 111.42/111.62  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 111.42/111.62  SPASS derived 29170 clauses, backtracked 21577 clauses, performed 45 splits and kept 22857 clauses.
% 111.42/111.62  SPASS allocated 147889 KBytes.
% 111.42/111.62  SPASS spent	0:1:36.85 on the problem.
% 111.42/111.62  		0:00:00.03 for the input.
% 111.42/111.62  		0:00:00.05 for the FLOTTER CNF translation.
% 111.42/111.62  		0:00:00.51 for inferences.
% 111.42/111.62  		0:00:03.64 for the backtracking.
% 111.42/111.62  		0:1:32.18 for the reduction.
% 111.42/111.62  
% 111.42/111.62  
% 111.42/111.62  Here is a proof with depth 3, length 30 :
% 111.42/111.62  % SZS output start Refutation
% See solution above
% 111.42/111.62  Formulae used in the proof : co1 ax17 ax60 ax62 ax64 ax66 ax69 ax72 ax74 ax5 ax84 ax82
% 111.42/111.62  
%------------------------------------------------------------------------------