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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : SWC010-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:01:03 EDT 2022

% Result   : Unsatisfiable 19.84s 20.02s
% Output   : Refutation 19.84s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :   12
% Syntax   : Number of clauses     :   30 (   9 unt;   4 nHn;  30 RR)
%            Number of literals    :   70 (   0 equ;  43 neg)
%            Maximal clause size   :    6 (   2 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    5 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :   13 (  13 usr;  11 con; 0-2 aty)
%            Number of variables   :    0 (   0 sgn)

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

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

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

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

cnf(11,axiom,
    ( ssList(sk6)
    | neq(sk2,nil) ),
    file('SWC010-1.p',unknown),
    [] ).

cnf(12,axiom,
    ( ssList(sk7)
    | neq(sk2,nil) ),
    file('SWC010-1.p',unknown),
    [] ).

cnf(16,axiom,
    ( ~ ssItem(u)
    | ~ ssList(v)
    | ~ ssList(w)
    | ~ equal(app(app(v,cons(u,nil)),w),sk2)
    | ~ equal(app(v,w),sk1)
    | ~ neq(sk4,nil) ),
    file('SWC010-1.p',unknown),
    [] ).

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

cnf(18,axiom,
    ( ~ neq(sk4,nil)
    | ssList(sk6) ),
    file('SWC010-1.p',unknown),
    [] ).

cnf(19,axiom,
    ( ~ neq(sk4,nil)
    | ssList(sk7) ),
    file('SWC010-1.p',unknown),
    [] ).

cnf(20,axiom,
    ( ~ neq(sk4,nil)
    | equal(app(app(sk6,cons(sk5,nil)),sk7),sk4) ),
    file('SWC010-1.p',unknown),
    [] ).

cnf(21,axiom,
    ( ~ neq(sk4,nil)
    | equal(app(sk6,sk7),sk3) ),
    file('SWC010-1.p',unknown),
    [] ).

cnf(210,plain,
    ( ~ neq(sk2,nil)
    | ssList(sk7) ),
    inference(rew,[status(thm),theory(equality)],[5,19]),
    [iquote('0:Rew:5.0,19.0')] ).

cnf(211,plain,
    ssList(sk7),
    inference(mrr,[status(thm)],[210,12]),
    [iquote('0:MRR:210.0,12.1')] ).

cnf(212,plain,
    ( ~ neq(sk2,nil)
    | ssList(sk6) ),
    inference(rew,[status(thm),theory(equality)],[5,18]),
    [iquote('0:Rew:5.0,18.0')] ).

cnf(213,plain,
    ssList(sk6),
    inference(mrr,[status(thm)],[212,11]),
    [iquote('0:MRR:212.0,11.1')] ).

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

cnf(215,plain,
    ssItem(sk5),
    inference(mrr,[status(thm)],[214,10]),
    [iquote('0:MRR:214.0,10.1')] ).

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

cnf(217,plain,
    ( ~ neq(sk2,nil)
    | equal(app(sk6,sk7),sk1) ),
    inference(rew,[status(thm),theory(equality)],[6,21,5]),
    [iquote('0:Rew:6.0,21.1,5.0,21.0')] ).

cnf(218,plain,
    equal(app(sk6,sk7),sk1),
    inference(mrr,[status(thm)],[217,216]),
    [iquote('0:MRR:217.0,216.0')] ).

cnf(219,plain,
    ( ~ neq(sk2,nil)
    | equal(app(app(sk6,cons(sk5,nil)),sk7),sk2) ),
    inference(rew,[status(thm),theory(equality)],[5,20]),
    [iquote('0:Rew:5.0,20.1,5.0,20.0')] ).

cnf(220,plain,
    equal(app(app(sk6,cons(sk5,nil)),sk7),sk2),
    inference(mrr,[status(thm)],[219,216]),
    [iquote('0:MRR:219.0,216.0')] ).

cnf(227,plain,
    ( ~ ssItem(u)
    | ~ ssList(v)
    | ~ ssList(w)
    | ~ equal(app(app(v,cons(u,nil)),w),sk2)
    | ~ equal(app(v,w),sk1)
    | ~ neq(sk2,nil) ),
    inference(rew,[status(thm),theory(equality)],[5,16]),
    [iquote('0:Rew:5.0,16.5')] ).

cnf(228,plain,
    ( ~ ssList(u)
    | ~ ssList(v)
    | ~ ssItem(w)
    | ~ equal(app(v,u),sk1)
    | ~ equal(app(app(v,cons(w,nil)),u),sk2) ),
    inference(mrr,[status(thm)],[227,216]),
    [iquote('0:MRR:227.5,216.0')] ).

cnf(35458,plain,
    ( ~ ssList(sk7)
    | ~ ssList(sk6)
    | ~ ssItem(sk5)
    | ~ equal(app(sk6,sk7),sk1)
    | ~ equal(sk2,sk2) ),
    inference(spl,[status(thm),theory(equality)],[220,228]),
    [iquote('0:SpL:220.0,228.4')] ).

cnf(35459,plain,
    ( ~ ssList(sk7)
    | ~ ssList(sk6)
    | ~ ssItem(sk5)
    | ~ equal(app(sk6,sk7),sk1) ),
    inference(obv,[status(thm),theory(equality)],[35458]),
    [iquote('0:Obv:35458.4')] ).

cnf(35460,plain,
    ( ~ ssList(sk7)
    | ~ ssList(sk6)
    | ~ ssItem(sk5)
    | ~ equal(sk1,sk1) ),
    inference(rew,[status(thm),theory(equality)],[218,35459]),
    [iquote('0:Rew:218.0,35459.3')] ).

cnf(35461,plain,
    ( ~ ssList(sk7)
    | ~ ssList(sk6)
    | ~ ssItem(sk5) ),
    inference(obv,[status(thm),theory(equality)],[35460]),
    [iquote('0:Obv:35460.3')] ).

cnf(35462,plain,
    $false,
    inference(ssi,[status(thm)],[35461,215,213,211]),
    [iquote('0:SSi:35461.2,35461.1,35461.0,215.0,213.0,211.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : SWC010-1 : TPTP v8.1.0. Released v2.4.0.
% 0.11/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 : Sun Jun 12 07:50:21 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 19.84/20.02  
% 19.84/20.02  SPASS V 3.9 
% 19.84/20.02  SPASS beiseite: Proof found.
% 19.84/20.02  % SZS status Theorem
% 19.84/20.02  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 19.84/20.02  SPASS derived 23912 clauses, backtracked 12116 clauses, performed 128 splits and kept 21841 clauses.
% 19.84/20.02  SPASS allocated 99660 KBytes.
% 19.84/20.02  SPASS spent	0:0:14.63 on the problem.
% 19.84/20.02  		0:00:00.04 for the input.
% 19.84/20.02  		0:00:00.00 for the FLOTTER CNF translation.
% 19.84/20.02  		0:00:00.18 for inferences.
% 19.84/20.02  		0:00:00.43 for the backtracking.
% 19.84/20.02  		0:0:13.70 for the reduction.
% 19.84/20.02  
% 19.84/20.02  
% 19.84/20.02  Here is a proof with depth 1, length 30 :
% 19.84/20.02  % SZS output start Refutation
% See solution above
% 19.84/20.02  Formulae used in the proof : co1_5 co1_6 co1_7 co1_10 co1_11 co1_12 co1_16 co1_17 co1_18 co1_19 co1_20 co1_21
% 19.84/20.02  
%------------------------------------------------------------------------------