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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : SYN053-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm  : none
% Format   : tptp
% Command  : run_spass %d %s

% Computer : n021.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:40 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    ( p
    | big(u)
    | big(v) ),
    file('SYN053-1.p',unknown),
    [] ).

cnf(3,axiom,
    ~ p,
    file('SYN053-1.p',unknown),
    [] ).

cnf(5,axiom,
    ( ~ big(a)
    | ~ big(b) ),
    file('SYN053-1.p',unknown),
    [] ).

cnf(8,plain,
    ( p
    | big(u) ),
    inference(con,[status(thm)],[1]),
    [iquote('0:Con:1.2')] ).

cnf(9,plain,
    big(u),
    inference(mrr,[status(thm)],[8,3]),
    [iquote('0:MRR:8.0,3.0')] ).

cnf(10,plain,
    $false,
    inference(mrr,[status(thm)],[5,9]),
    [iquote('0:MRR:5.0,5.1,9.0,9.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem  : SYN053-1 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.13  % Command  : run_spass %d %s
% 0.13/0.34  % Computer : n021.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Tue Jul 12 02:24:54 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.20/0.42  
% 0.20/0.42  SPASS V 3.9 
% 0.20/0.42  SPASS beiseite: Proof found.
% 0.20/0.42  % SZS status Theorem
% 0.20/0.42  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.20/0.42  SPASS derived 0 clauses, backtracked 0 clauses, performed 0 splits and kept 4 clauses.
% 0.20/0.42  SPASS allocated 63075 KBytes.
% 0.20/0.42  SPASS spent	0:00:00.06 on the problem.
% 0.20/0.42  		0:00:00.04 for the input.
% 0.20/0.42  		0:00:00.00 for the FLOTTER CNF translation.
% 0.20/0.42  		0:00:00.00 for inferences.
% 0.20/0.42  		0:00:00.00 for the backtracking.
% 0.20/0.42  		0:00:00.00 for the reduction.
% 0.20/0.42  
% 0.20/0.42  
% 0.20/0.42  Here is a proof with depth 0, length 6 :
% 0.20/0.42  % SZS output start Refutation
% See solution above
% 0.20/0.42  Formulae used in the proof : clause_1 clause_3 clause_5
% 0.20/0.42  
%------------------------------------------------------------------------------