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

% Computer : n013.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:32:12 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    q(f(u)),
    file('SYN940+1.p',unknown),
    [] ).

cnf(2,axiom,
    ( ~ q(u)
    | p(f(v)) ),
    file('SYN940+1.p',unknown),
    [] ).

cnf(3,axiom,
    ( ~ p(u)
    | ~ q(u)
    | r(v) ),
    file('SYN940+1.p',unknown),
    [] ).

cnf(4,axiom,
    ( ~ p(u)
    | ~ q(u)
    | ~ r(skc2)
    | ~ r(skc3) ),
    file('SYN940+1.p',unknown),
    [] ).

cnf(5,plain,
    ( ~ q(u)
    | ~ p(u) ),
    inference(mrr,[status(thm)],[4,3]),
    [iquote('0:MRR:4.2,4.3,3.2,3.2')] ).

cnf(8,plain,
    p(f(u)),
    inference(ems,[status(thm)],[2,1]),
    [iquote('0:EmS:2.0,1.0')] ).

cnf(9,plain,
    $false,
    inference(ems,[status(thm)],[5,1,8]),
    [iquote('0:EmS:5.0,5.1,1.0,8.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12  % Problem  : SYN940+1 : TPTP v8.1.0. Released v3.1.0.
% 0.10/0.13  % Command  : run_spass %d %s
% 0.13/0.33  % Computer : n013.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % 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 : Tue Jul 12 06:24:29 EDT 2022
% 0.13/0.33  % CPUTime  : 
% 0.19/0.43  
% 0.19/0.43  SPASS V 3.9 
% 0.19/0.43  SPASS beiseite: Proof found.
% 0.19/0.43  % SZS status Theorem
% 0.19/0.43  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.19/0.43  SPASS derived 2 clauses, backtracked 0 clauses, performed 0 splits and kept 5 clauses.
% 0.19/0.43  SPASS allocated 97576 KBytes.
% 0.19/0.43  SPASS spent	0:00:00.09 on the problem.
% 0.19/0.43  		0:00:00.04 for the input.
% 0.19/0.43  		0:00:00.03 for the FLOTTER CNF translation.
% 0.19/0.43  		0:00:00.00 for inferences.
% 0.19/0.43  		0:00:00.00 for the backtracking.
% 0.19/0.43  		0:00:00.00 for the reduction.
% 0.19/0.43  
% 0.19/0.43  
% 0.19/0.43  Here is a proof with depth 2, length 7 :
% 0.19/0.43  % SZS output start Refutation
% See solution above
% 0.19/0.43  Formulae used in the proof : prove_this
% 0.19/0.43  
%------------------------------------------------------------------------------