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

View Problem - Process Solution

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

% Computer : n017.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:10 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    ~ p1(d,u,d),
    file('SYN167-1.p',unknown),
    [] ).

cnf(2,axiom,
    s0(d),
    file('SYN167-1.p',unknown),
    [] ).

cnf(111,axiom,
    ( ~ s0(u)
    | ~ s0(v)
    | p1(v,v,v) ),
    file('SYN167-1.p',unknown),
    [] ).

cnf(383,plain,
    ( ~ s0(u)
    | p1(u,u,u) ),
    inference(con,[status(thm)],[111]),
    [iquote('0:Con:111.0')] ).

cnf(424,plain,
    ~ s0(d),
    inference(res,[status(thm),theory(equality)],[383,1]),
    [iquote('0:Res:383.1,1.0')] ).

cnf(438,plain,
    $false,
    inference(mrr,[status(thm)],[424,2]),
    [iquote('0:MRR:424.0,2.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12  % Problem  : SYN167-1 : TPTP v8.1.0. Released v1.1.0.
% 0.10/0.13  % Command  : run_spass %d %s
% 0.14/0.34  % Computer : n017.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit : 300
% 0.14/0.34  % WCLimit  : 600
% 0.14/0.34  % DateTime : Mon Jul 11 22:33:34 EDT 2022
% 0.14/0.34  % CPUTime  : 
% 0.21/0.46  
% 0.21/0.46  SPASS V 3.9 
% 0.21/0.46  SPASS beiseite: Proof found.
% 0.21/0.46  % SZS status Theorem
% 0.21/0.46  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.21/0.46  SPASS derived 20 clauses, backtracked 0 clauses, performed 0 splits and kept 336 clauses.
% 0.21/0.46  SPASS allocated 76104 KBytes.
% 0.21/0.46  SPASS spent	0:00:00.10 on the problem.
% 0.21/0.46  		0:00:00.04 for the input.
% 0.21/0.46  		0:00:00.00 for the FLOTTER CNF translation.
% 0.21/0.46  		0:00:00.00 for inferences.
% 0.21/0.46  		0:00:00.00 for the backtracking.
% 0.21/0.46  		0:00:00.02 for the reduction.
% 0.21/0.46  
% 0.21/0.46  
% 0.21/0.46  Here is a proof with depth 1, length 6 :
% 0.21/0.46  % SZS output start Refutation
% See solution above
% 0.21/0.46  Formulae used in the proof : prove_this axiom_1 rule_072
% 0.21/0.46  
%------------------------------------------------------------------------------