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

View Problem - Process Solution

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

% Computer : n004.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:19:04 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    ~ n3(a),
    file('SYN153-1.p',unknown),
    [] ).

cnf(21,axiom,
    l0(a),
    file('SYN153-1.p',unknown),
    [] ).

cnf(38,axiom,
    n0(b,a),
    file('SYN153-1.p',unknown),
    [] ).

cnf(40,axiom,
    ( ~ n0(u,v)
    | k1(v) ),
    file('SYN153-1.p',unknown),
    [] ).

cnf(198,axiom,
    ( ~ k1(u)
    | p2(u,u,u) ),
    file('SYN153-1.p',unknown),
    [] ).

cnf(279,axiom,
    ( ~ p2(u,v,w)
    | n3(w) ),
    file('SYN153-1.p',unknown),
    [] ).

cnf(419,plain,
    ~ p2(u,v,a),
    inference(res,[status(thm),theory(equality)],[279,1]),
    [iquote('0:Res:279.1,1.0')] ).

cnf(458,plain,
    k1(a),
    inference(res,[status(thm),theory(equality)],[38,40]),
    [iquote('0:Res:38.0,40.0')] ).

cnf(473,plain,
    ~ k1(a),
    inference(res,[status(thm),theory(equality)],[198,419]),
    [iquote('0:Res:198.1,419.0')] ).

cnf(474,plain,
    $false,
    inference(ssi,[status(thm)],[473,21,458]),
    [iquote('0:SSi:473.0,21.0,458.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : SYN153-1 : TPTP v8.1.0. Released v1.1.0.
% 0.11/0.13  % Command  : run_spass %d %s
% 0.13/0.34  % Computer : n004.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 : Mon Jul 11 16:36:37 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.20/0.46  
% 0.20/0.46  SPASS V 3.9 
% 0.20/0.46  SPASS beiseite: Proof found.
% 0.20/0.46  % SZS status Theorem
% 0.20/0.46  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 0.20/0.46  SPASS derived 22 clauses, backtracked 0 clauses, performed 0 splits and kept 351 clauses.
% 0.20/0.46  SPASS allocated 76112 KBytes.
% 0.20/0.46  SPASS spent	0:00:00.11 on the problem.
% 0.20/0.46  		0:00:00.04 for the input.
% 0.20/0.46  		0:00:00.00 for the FLOTTER CNF translation.
% 0.20/0.46  		0:00:00.00 for inferences.
% 0.20/0.46  		0:00:00.00 for the backtracking.
% 0.20/0.46  		0:00:00.03 for the reduction.
% 0.20/0.46  
% 0.20/0.46  
% 0.20/0.46  Here is a proof with depth 2, length 10 :
% 0.20/0.46  % SZS output start Refutation
% See solution above
% 0.20/0.46  Formulae used in the proof : prove_this axiom_20 axiom_37 rule_001 rule_159 rule_240
% 0.20/0.46  
%------------------------------------------------------------------------------