↑ Up

SPASS---3.9.UNS-Ref.s

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

% Computer : n007.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 : Thu Jul 21 12:17:21 EDT 2022

% Result   : Unsatisfiable 0.18s 0.40s
% Output   : Refutation 0.18s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    7
% Syntax   : Number of clauses     :   13 (   6 unt;   1 nHn;  13 RR)
%            Number of literals    :   23 (   0 equ;  10 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    0 (   0 avg)
%            Number of predicates  :    6 (   5 usr;   6 prp; 0-0 aty)
%            Number of functors    :    0 (   0 usr;   0 con; --- aty)
%            Number of variables   :    0 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    ( ~ t
    | ~ s
    | p ),
    file('SYN030-1.p',unknown),
    [] ).

cnf(2,axiom,
    ( ~ r
    | s ),
    file('SYN030-1.p',unknown),
    [] ).

cnf(4,axiom,
    ( ~ r
    | ~ q
    | t ),
    file('SYN030-1.p',unknown),
    [] ).

cnf(5,axiom,
    ( ~ q
    | r ),
    file('SYN030-1.p',unknown),
    [] ).

cnf(6,axiom,
    ( q
    | r ),
    file('SYN030-1.p',unknown),
    [] ).

cnf(7,axiom,
    ( ~ r
    | q ),
    file('SYN030-1.p',unknown),
    [] ).

cnf(9,axiom,
    ( ~ p
    | ~ q
    | ~ r ),
    file('SYN030-1.p',unknown),
    [] ).

cnf(10,plain,
    q,
    inference(mrr,[status(thm)],[7,6]),
    [iquote('0:MRR:7.0,6.1')] ).

cnf(11,plain,
    r,
    inference(mrr,[status(thm)],[5,10]),
    [iquote('0:MRR:5.0,10.0')] ).

cnf(12,plain,
    s,
    inference(mrr,[status(thm)],[2,11]),
    [iquote('0:MRR:2.0,11.0')] ).

cnf(13,plain,
    t,
    inference(mrr,[status(thm)],[4,11,10]),
    [iquote('0:MRR:4.0,4.1,11.0,10.0')] ).

cnf(14,plain,
    p,
    inference(mrr,[status(thm)],[1,13,12]),
    [iquote('0:MRR:1.0,1.1,13.0,12.0')] ).

cnf(15,plain,
    $false,
    inference(mrr,[status(thm)],[9,14,10,11]),
    [iquote('0:MRR:9.0,9.1,9.2,14.0,10.0,11.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11  % Problem  : SYN030-1 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.12  % Command  : run_spass %d %s
% 0.13/0.32  % Computer : n007.cluster.edu
% 0.13/0.32  % Model    : x86_64 x86_64
% 0.13/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.32  % Memory   : 8042.1875MB
% 0.13/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit : 300
% 0.13/0.33  % WCLimit  : 600
% 0.13/0.33  % DateTime : Mon Jul 11 11:37:47 EDT 2022
% 0.13/0.33  % CPUTime  : 
% 0.18/0.40  
% 0.18/0.40  SPASS V 3.9 
% 0.18/0.40  SPASS beiseite: Proof found.
% 0.18/0.40  % SZS status Theorem
% 0.18/0.40  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 0.18/0.40  SPASS derived 0 clauses, backtracked 0 clauses, performed 0 splits and kept 7 clauses.
% 0.18/0.40  SPASS allocated 63077 KBytes.
% 0.18/0.40  SPASS spent	0:00:00.06 on the problem.
% 0.18/0.40  		0:00:00.04 for the input.
% 0.18/0.40  		0:00:00.00 for the FLOTTER CNF translation.
% 0.18/0.40  		0:00:00.00 for inferences.
% 0.18/0.40  		0:00:00.00 for the backtracking.
% 0.18/0.40  		0:00:00.00 for the reduction.
% 0.18/0.40  
% 0.18/0.40  
% 0.18/0.40  Here is a proof with depth 0, length 13 :
% 0.18/0.40  % SZS output start Refutation
% See solution above
% 0.18/0.40  Formulae used in the proof : clause1 clause2 clause4 clause5 clause6 clause7 theorem
% 0.18/0.40  
%------------------------------------------------------------------------------