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

View Problem - Process Solution

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

% Computer : n008.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:54 EDT 2022

% Result   : Unsatisfiable 0.21s 0.50s
% Output   : Refutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    6
% Syntax   : Number of clauses     :    9 (   6 unt;   0 nHn;   9 RR)
%            Number of literals    :   14 (   0 equ;   6 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   6 con; 0-0 aty)
%            Number of variables   :    0 (   0 sgn)

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

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

cnf(7,axiom,
    ( ~ ssItem(u)
    | ~ memberP(sk4,u)
    | memberP(sk3,u) ),
    file('SWC411-1.p',unknown),
    [] ).

cnf(8,axiom,
    ssItem(sk5),
    file('SWC411-1.p',unknown),
    [] ).

cnf(9,axiom,
    memberP(sk2,sk5),
    file('SWC411-1.p',unknown),
    [] ).

cnf(10,axiom,
    ~ memberP(sk1,sk5),
    file('SWC411-1.p',unknown),
    [] ).

cnf(198,plain,
    ( ~ ssItem(u)
    | ~ memberP(sk2,u)
    | memberP(sk1,u) ),
    inference(rew,[status(thm),theory(equality)],[6,7,5]),
    [iquote('0:Rew:6.0,7.2,5.0,7.1')] ).

cnf(231,plain,
    ( ~ memberP(sk2,sk5)
    | memberP(sk1,sk5) ),
    inference(res,[status(thm),theory(equality)],[8,198]),
    [iquote('0:Res:8.0,198.0')] ).

cnf(477,plain,
    $false,
    inference(mrr,[status(thm)],[231,9,10]),
    [iquote('0:MRR:231.0,231.1,9.0,10.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.14  % Problem  : SWC411-1 : TPTP v8.1.0. Released v2.4.0.
% 0.04/0.15  % Command  : run_spass %d %s
% 0.15/0.36  % Computer : n008.cluster.edu
% 0.15/0.36  % Model    : x86_64 x86_64
% 0.15/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36  % Memory   : 8042.1875MB
% 0.15/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36  % CPULimit : 300
% 0.15/0.36  % WCLimit  : 600
% 0.15/0.36  % DateTime : Sat Jun 11 21:02:37 EDT 2022
% 0.15/0.36  % CPUTime  : 
% 0.21/0.50  
% 0.21/0.50  SPASS V 3.9 
% 0.21/0.50  SPASS beiseite: Proof found.
% 0.21/0.50  % SZS status Theorem
% 0.21/0.50  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.21/0.50  SPASS derived 276 clauses, backtracked 0 clauses, performed 0 splits and kept 215 clauses.
% 0.21/0.50  SPASS allocated 76228 KBytes.
% 0.21/0.50  SPASS spent	0:00:00.12 on the problem.
% 0.21/0.50  		0:00:00.04 for the input.
% 0.21/0.50  		0:00:00.00 for the FLOTTER CNF translation.
% 0.21/0.50  		0:00:00.00 for inferences.
% 0.21/0.50  		0:00:00.00 for the backtracking.
% 0.21/0.50  		0:00:00.03 for the reduction.
% 0.21/0.50  
% 0.21/0.50  
% 0.21/0.50  Here is a proof with depth 1, length 9 :
% 0.21/0.50  % SZS output start Refutation
% See solution above
% 0.21/0.50  Formulae used in the proof : co1_5 co1_6 co1_7 co1_8 co1_9 co1_10
% 0.21/0.50  
%------------------------------------------------------------------------------