TSTP Solution File: SWC050-1 by SPASS---3.9

View Problem - Process Solution

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

% Computer : n029.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:23 EDT 2022

% Result   : Unsatisfiable 0.84s 1.01s
% Output   : Refutation 0.84s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    9
% Syntax   : Number of clauses     :   23 (   8 unt;   2 nHn;  23 RR)
%            Number of literals    :   47 (   0 equ;  27 neg)
%            Maximal clause size   :    5 (   2 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    5 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   7 con; 0-0 aty)
%            Number of variables   :    0 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(5,axiom,
    equal(sk4,sk2),
    file('SWC050-1.p',unknown),
    [] ).

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

cnf(7,axiom,
    ( neq(sk2,nil)
    | neq(sk2,nil) ),
    file('SWC050-1.p',unknown),
    [] ).

cnf(10,axiom,
    ( ssList(sk5)
    | neq(sk2,nil) ),
    file('SWC050-1.p',unknown),
    [] ).

cnf(14,axiom,
    ( ~ ssList(u)
    | ~ neq(u,nil)
    | ~ rearsegP(sk2,u)
    | ~ rearsegP(sk1,u)
    | ~ neq(sk4,nil) ),
    file('SWC050-1.p',unknown),
    [] ).

cnf(15,axiom,
    ( ~ neq(sk4,nil)
    | ssList(sk5) ),
    file('SWC050-1.p',unknown),
    [] ).

cnf(16,axiom,
    ( ~ neq(sk4,nil)
    | neq(sk5,nil) ),
    file('SWC050-1.p',unknown),
    [] ).

cnf(17,axiom,
    ( ~ neq(sk4,nil)
    | rearsegP(sk4,sk5) ),
    file('SWC050-1.p',unknown),
    [] ).

cnf(18,axiom,
    ( ~ neq(sk4,nil)
    | rearsegP(sk3,sk5) ),
    file('SWC050-1.p',unknown),
    [] ).

cnf(206,plain,
    ( ~ neq(sk2,nil)
    | ssList(sk5) ),
    inference(rew,[status(thm),theory(equality)],[5,15]),
    [iquote('0:Rew:5.0,15.0')] ).

cnf(207,plain,
    ssList(sk5),
    inference(mrr,[status(thm)],[206,10]),
    [iquote('0:MRR:206.0,10.1')] ).

cnf(210,plain,
    neq(sk2,nil),
    inference(obv,[status(thm),theory(equality)],[7]),
    [iquote('0:Obv:7.0')] ).

cnf(211,plain,
    ( ~ neq(sk2,nil)
    | rearsegP(sk1,sk5) ),
    inference(rew,[status(thm),theory(equality)],[6,18,5]),
    [iquote('0:Rew:6.0,18.1,5.0,18.0')] ).

cnf(212,plain,
    rearsegP(sk1,sk5),
    inference(mrr,[status(thm)],[211,210]),
    [iquote('0:MRR:211.0,210.0')] ).

cnf(213,plain,
    ( ~ neq(sk2,nil)
    | rearsegP(sk2,sk5) ),
    inference(rew,[status(thm),theory(equality)],[5,17]),
    [iquote('0:Rew:5.0,17.1,5.0,17.0')] ).

cnf(214,plain,
    rearsegP(sk2,sk5),
    inference(mrr,[status(thm)],[213,210]),
    [iquote('0:MRR:213.0,210.0')] ).

cnf(215,plain,
    ( ~ neq(sk2,nil)
    | neq(sk5,nil) ),
    inference(rew,[status(thm),theory(equality)],[5,16]),
    [iquote('0:Rew:5.0,16.0')] ).

cnf(216,plain,
    neq(sk5,nil),
    inference(mrr,[status(thm)],[215,210]),
    [iquote('0:MRR:215.0,210.0')] ).

cnf(217,plain,
    ( ~ ssList(u)
    | ~ neq(u,nil)
    | ~ rearsegP(sk2,u)
    | ~ rearsegP(sk1,u)
    | ~ neq(sk2,nil) ),
    inference(rew,[status(thm),theory(equality)],[5,14]),
    [iquote('0:Rew:5.0,14.4')] ).

cnf(218,plain,
    ( ~ ssList(u)
    | ~ neq(u,nil)
    | ~ rearsegP(sk1,u)
    | ~ rearsegP(sk2,u) ),
    inference(mrr,[status(thm)],[217,210]),
    [iquote('0:MRR:217.4,210.0')] ).

cnf(2256,plain,
    ( ~ ssList(sk5)
    | ~ neq(sk5,nil)
    | ~ rearsegP(sk1,sk5) ),
    inference(res,[status(thm),theory(equality)],[214,218]),
    [iquote('0:Res:214.0,218.3')] ).

cnf(2261,plain,
    ( ~ neq(sk5,nil)
    | ~ rearsegP(sk1,sk5) ),
    inference(ssi,[status(thm)],[2256,207]),
    [iquote('0:SSi:2256.0,207.0')] ).

cnf(2262,plain,
    $false,
    inference(mrr,[status(thm)],[2261,216,212]),
    [iquote('0:MRR:2261.0,2261.1,216.0,212.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SWC050-1 : TPTP v8.1.0. Released v2.4.0.
% 0.00/0.12  % Command  : run_spass %d %s
% 0.12/0.33  % Computer : n029.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 11:53:24 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.84/1.01  
% 0.84/1.01  SPASS V 3.9 
% 0.84/1.01  SPASS beiseite: Proof found.
% 0.84/1.01  % SZS status Theorem
% 0.84/1.01  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.84/1.01  SPASS derived 1589 clauses, backtracked 597 clauses, performed 23 splits and kept 1873 clauses.
% 0.84/1.01  SPASS allocated 77624 KBytes.
% 0.84/1.01  SPASS spent	0:00:00.65 on the problem.
% 0.84/1.01  		0:00:00.04 for the input.
% 0.84/1.01  		0:00:00.00 for the FLOTTER CNF translation.
% 0.84/1.01  		0:00:00.01 for inferences.
% 0.84/1.01  		0:00:00.01 for the backtracking.
% 0.84/1.01  		0:00:00.42 for the reduction.
% 0.84/1.01  
% 0.84/1.01  
% 0.84/1.01  Here is a proof with depth 1, length 23 :
% 0.84/1.01  % SZS output start Refutation
% See solution above
% 0.84/1.01  Formulae used in the proof : co1_5 co1_6 co1_7 co1_10 co1_14 co1_15 co1_16 co1_17 co1_18
% 0.84/1.01  
%------------------------------------------------------------------------------