%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : SWC032-1 : TPTP v8.1.0. Released v2.4.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 : Tue Jul 19 22:01:14 EDT 2022

% Result   : Unsatisfiable 0.60s 0.79s
% Output   : Refutation 0.60s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    9
% Syntax   : Number of clauses     :   22 (  11 unt;   2 nHn;  22 RR)
%            Number of literals    :   38 (   0 equ;  21 neg)
%            Maximal clause size   :    4 (   1 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    9 (   9 usr;   8 con; 0-2 aty)
%            Number of variables   :    0 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(3,axiom,
    ssList(sk3),
    file('SWC032-1.p',unknown),
    [] ).

cnf(5,axiom,
    equal(sk4,sk2),
    file('SWC032-1.p',unknown),
    [] ).

cnf(6,axiom,
    equal(sk1,sk3),
    file('SWC032-1.p',unknown),
    [] ).

cnf(7,axiom,
    ssList(sk5),
    file('SWC032-1.p',unknown),
    [] ).

cnf(8,axiom,
    equal(app(sk3,sk5),sk4),
    file('SWC032-1.p',unknown),
    [] ).

cnf(11,axiom,
    ( ~ equal(nil,sk3)
    | equal(nil,sk4) ),
    file('SWC032-1.p',unknown),
    [] ).

cnf(12,axiom,
    ( equal(nil,sk2)
    | equal(nil,sk1) ),
    file('SWC032-1.p',unknown),
    [] ).

cnf(15,axiom,
    ( ~ equal(nil,sk1)
    | ~ equal(nil,sk2) ),
    file('SWC032-1.p',unknown),
    [] ).

cnf(133,axiom,
    ( ~ ssList(u)
    | ~ ssList(v)
    | ~ equal(app(v,u),nil)
    | equal(nil,v) ),
    file('SWC032-1.p',unknown),
    [] ).

cnf(203,plain,
    equal(app(sk3,sk5),sk2),
    inference(rew,[status(thm),theory(equality)],[5,8]),
    [iquote('0:Rew:5.0,8.0')] ).

cnf(204,plain,
    ( equal(nil,sk2)
    | equal(nil,sk3) ),
    inference(rew,[status(thm),theory(equality)],[6,12]),
    [iquote('0:Rew:6.0,12.1')] ).

cnf(205,plain,
    ( ~ equal(nil,sk3)
    | equal(nil,sk2) ),
    inference(rew,[status(thm),theory(equality)],[5,11]),
    [iquote('0:Rew:5.0,11.1')] ).

cnf(206,plain,
    ( ~ equal(nil,sk3)
    | ~ equal(sk2,sk2) ),
    inference(rew,[status(thm),theory(equality)],[205,15,6]),
    [iquote('0:Rew:205.1,15.1,6.0,15.0')] ).

cnf(207,plain,
    ~ equal(nil,sk3),
    inference(obv,[status(thm),theory(equality)],[206]),
    [iquote('0:Obv:206.1')] ).

cnf(208,plain,
    equal(nil,sk2),
    inference(mrr,[status(thm)],[204,207]),
    [iquote('0:MRR:204.1,207.0')] ).

cnf(231,plain,
    ~ equal(sk3,sk2),
    inference(rew,[status(thm),theory(equality)],[208,207]),
    [iquote('0:Rew:208.0,207.0')] ).

cnf(251,plain,
    ( ~ ssList(u)
    | ~ ssList(v)
    | ~ equal(app(u,v),sk2)
    | equal(sk2,u) ),
    inference(rew,[status(thm),theory(equality)],[208,133]),
    [iquote('0:Rew:208.0,133.3,208.0,133.2')] ).

cnf(569,plain,
    ( ~ ssList(u)
    | ~ equal(app(sk3,u),sk2)
    | equal(sk3,sk2) ),
    inference(res,[status(thm),theory(equality)],[3,251]),
    [iquote('0:Res:3.0,251.1')] ).

cnf(623,plain,
    ( ~ ssList(u)
    | ~ equal(app(sk3,u),sk2) ),
    inference(mrr,[status(thm)],[569,231]),
    [iquote('0:MRR:569.2,231.0')] ).

cnf(1166,plain,
    ( ~ ssList(sk5)
    | ~ equal(sk2,sk2) ),
    inference(spl,[status(thm),theory(equality)],[203,623]),
    [iquote('0:SpL:203.0,623.1')] ).

cnf(1214,plain,
    ~ ssList(sk5),
    inference(obv,[status(thm),theory(equality)],[1166]),
    [iquote('0:Obv:1166.1')] ).

cnf(1215,plain,
    $false,
    inference(ssi,[status(thm)],[1214,7]),
    [iquote('0:SSi:1214.0,7.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11  % Problem  : SWC032-1 : TPTP v8.1.0. Released v2.4.0.
% 0.06/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 : Sun Jun 12 23:39:58 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.60/0.79  
% 0.60/0.79  SPASS V 3.9 
% 0.60/0.79  SPASS beiseite: Proof found.
% 0.60/0.79  % SZS status Theorem
% 0.60/0.79  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.60/0.79  SPASS derived 793 clauses, backtracked 233 clauses, performed 12 splits and kept 1065 clauses.
% 0.60/0.79  SPASS allocated 77001 KBytes.
% 0.60/0.79  SPASS spent	0:00:00.44 on the problem.
% 0.60/0.79  		0:00:00.04 for the input.
% 0.60/0.79  		0:00:00.00 for the FLOTTER CNF translation.
% 0.60/0.79  		0:00:00.00 for inferences.
% 0.60/0.79  		0:00:00.01 for the backtracking.
% 0.60/0.79  		0:00:00.22 for the reduction.
% 0.60/0.79  
% 0.60/0.79  
% 0.60/0.79  Here is a proof with depth 2, length 22 :
% 0.60/0.79  % SZS output start Refutation
% See solution above
% 0.60/0.79  Formulae used in the proof : co1_3 co1_5 co1_6 co1_7 co1_8 co1_11 co1_12 co1_15 clause118
% 0.60/0.79  
%------------------------------------------------------------------------------