↑ Up

SPASS---3.9.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : SWC406-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm  : none
% Format   : tptp
% Command  : run_spass %d %s

% Computer : n025.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:52 EDT 2022

% Result   : Unsatisfiable 0.20s 0.49s
% Output   : Refutation 0.20s
% 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('SWC406-1.p',unknown),
    [] ).

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

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

cnf(13,axiom,
    ssItem(sk6),
    file('SWC406-1.p',unknown),
    [] ).

cnf(14,axiom,
    memberP(sk1,sk6),
    file('SWC406-1.p',unknown),
    [] ).

cnf(15,axiom,
    ~ memberP(sk2,sk6),
    file('SWC406-1.p',unknown),
    [] ).

cnf(203,plain,
    ( ~ ssItem(u)
    | ~ memberP(sk1,u)
    | memberP(sk2,u) ),
    inference(rew,[status(thm),theory(equality)],[5,11,6]),
    [iquote('0:Rew:5.0,11.2,6.0,11.1')] ).

cnf(246,plain,
    ( ~ memberP(sk1,sk6)
    | memberP(sk2,sk6) ),
    inference(res,[status(thm),theory(equality)],[13,203]),
    [iquote('0:Res:13.0,203.0')] ).

cnf(493,plain,
    $false,
    inference(mrr,[status(thm)],[246,14,15]),
    [iquote('0:MRR:246.0,246.1,14.0,15.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem  : SWC406-1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.13  % Command  : run_spass %d %s
% 0.13/0.35  % Computer : n025.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 600
% 0.13/0.35  % DateTime : Sun Jun 12 10:33:08 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.20/0.49  
% 0.20/0.49  SPASS V 3.9 
% 0.20/0.49  SPASS beiseite: Proof found.
% 0.20/0.49  % SZS status Theorem
% 0.20/0.49  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.20/0.49  SPASS derived 282 clauses, backtracked 0 clauses, performed 0 splits and kept 220 clauses.
% 0.20/0.49  SPASS allocated 76246 KBytes.
% 0.20/0.49  SPASS spent	0:00:00.13 on the problem.
% 0.20/0.49  		0:00:00.04 for the input.
% 0.20/0.49  		0:00:00.00 for the FLOTTER CNF translation.
% 0.20/0.49  		0:00:00.00 for inferences.
% 0.20/0.49  		0:00:00.00 for the backtracking.
% 0.20/0.49  		0:00:00.03 for the reduction.
% 0.20/0.49  
% 0.20/0.49  
% 0.20/0.49  Here is a proof with depth 1, length 9 :
% 0.20/0.49  % SZS output start Refutation
% See solution above
% 0.20/0.49  Formulae used in the proof : co1_5 co1_6 co1_11 co1_13 co1_14 co1_15
% 0.20/0.49  
%------------------------------------------------------------------------------