↑ Up

SPASS---3.9.THM-Ref.s

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

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

% Result   : Theorem 1.36s 1.57s
% Output   : Refutation 1.36s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    8
% Syntax   : Number of clauses     :   15 (   8 unt;   0 nHn;  15 RR)
%            Number of literals    :   31 (   0 equ;  19 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    :    4 (   4 usr;   4 con; 0-0 aty)
%            Number of variables   :    0 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    ssList(skc7),
    file('SWC333+1.p',unknown),
    [] ).

cnf(4,axiom,
    totalorderedP(skc5),
    file('SWC333+1.p',unknown),
    [] ).

cnf(15,axiom,
    segmentP(skc6,skc5),
    file('SWC333+1.p',unknown),
    [] ).

cnf(80,axiom,
    ( ~ segmentP(skc6,skc5)
    | ~ totalorderedP(skc5)
    | totalorderedP(skc7) ),
    file('SWC333+1.p',unknown),
    [] ).

cnf(85,axiom,
    ( ~ segmentP(skc6,skc5)
    | ~ totalorderedP(skc5)
    | neq(skc5,skc7) ),
    file('SWC333+1.p',unknown),
    [] ).

cnf(86,axiom,
    ( ~ segmentP(skc6,skc5)
    | ~ totalorderedP(skc5)
    | segmentP(skc6,skc7) ),
    file('SWC333+1.p',unknown),
    [] ).

cnf(87,axiom,
    ( ~ segmentP(skc6,skc5)
    | ~ totalorderedP(skc5)
    | segmentP(skc7,skc5) ),
    file('SWC333+1.p',unknown),
    [] ).

cnf(143,axiom,
    ( ~ totalorderedP(u)
    | ~ ssList(u)
    | ~ segmentP(u,skc5)
    | ~ neq(skc5,u)
    | ~ segmentP(skc6,u) ),
    file('SWC333+1.p',unknown),
    [] ).

cnf(197,plain,
    totalorderedP(skc7),
    inference(mrr,[status(thm)],[80,15,4]),
    [iquote('0:MRR:80.0,80.1,15.0,4.0')] ).

cnf(198,plain,
    segmentP(skc7,skc5),
    inference(mrr,[status(thm)],[87,15,4]),
    [iquote('0:MRR:87.0,87.1,15.0,4.0')] ).

cnf(199,plain,
    segmentP(skc6,skc7),
    inference(mrr,[status(thm)],[86,15,4]),
    [iquote('0:MRR:86.0,86.1,15.0,4.0')] ).

cnf(200,plain,
    neq(skc5,skc7),
    inference(mrr,[status(thm)],[85,15,4]),
    [iquote('0:MRR:85.0,85.1,15.0,4.0')] ).

cnf(4371,plain,
    ( ~ totalorderedP(skc7)
    | ~ ssList(skc7)
    | ~ segmentP(skc7,skc5)
    | ~ segmentP(skc6,skc7) ),
    inference(res,[status(thm),theory(equality)],[200,143]),
    [iquote('0:Res:200.0,143.3')] ).

cnf(4374,plain,
    ( ~ segmentP(skc7,skc5)
    | ~ segmentP(skc6,skc7) ),
    inference(ssi,[status(thm)],[4371,197,1]),
    [iquote('0:SSi:4371.1,4371.0,197.0,1.0,197.0,1.0')] ).

cnf(4375,plain,
    $false,
    inference(mrr,[status(thm)],[4374,198,199]),
    [iquote('0:MRR:4374.0,4374.1,198.0,199.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11  % Problem  : SWC333+1 : TPTP v8.1.0. Released v2.4.0.
% 0.11/0.12  % Command  : run_spass %d %s
% 0.12/0.33  % Computer : n009.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.18/0.33  % CPULimit : 300
% 0.18/0.33  % WCLimit  : 600
% 0.18/0.33  % DateTime : Sat Jun 11 22:57:53 EDT 2022
% 0.18/0.33  % CPUTime  : 
% 1.36/1.57  
% 1.36/1.57  SPASS V 3.9 
% 1.36/1.57  SPASS beiseite: Proof found.
% 1.36/1.57  % SZS status Theorem
% 1.36/1.57  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 1.36/1.57  SPASS derived 2621 clauses, backtracked 1658 clauses, performed 43 splits and kept 2637 clauses.
% 1.36/1.57  SPASS allocated 101069 KBytes.
% 1.36/1.57  SPASS spent	0:00:01.20 on the problem.
% 1.36/1.57  		0:00:00.04 for the input.
% 1.36/1.57  		0:00:00.07 for the FLOTTER CNF translation.
% 1.36/1.57  		0:00:00.02 for inferences.
% 1.36/1.57  		0:00:00.02 for the backtracking.
% 1.36/1.57  		0:00:00.89 for the reduction.
% 1.36/1.57  
% 1.36/1.57  
% 1.36/1.57  Here is a proof with depth 1, length 15 :
% 1.36/1.57  % SZS output start Refutation
% See solution above
% 1.36/1.57  Formulae used in the proof : co1 ax17
% 1.36/1.57  
%------------------------------------------------------------------------------