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

% Computer : n026.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 : Mon Jul 18 18:27:29 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    ~ adj(cell12,cell13),
    file('PUZ075+1.p',unknown),
    [] ).

cnf(12,axiom,
    ( ~ skP10(u,v)
    | edge(v,u) ),
    file('PUZ075+1.p',unknown),
    [] ).

cnf(536,axiom,
    ( ~ edge(u,v)
    | adj(u,v) ),
    file('PUZ075+1.p',unknown),
    [] ).

cnf(551,axiom,
    ( ~ equal(u,cell12)
    | ~ equal(v,cell13)
    | skP10(v,u) ),
    file('PUZ075+1.p',unknown),
    [] ).

cnf(728,plain,
    ~ edge(cell12,cell13),
    inference(res,[status(thm),theory(equality)],[536,1]),
    [iquote('0:Res:536.1,1.0')] ).

cnf(1964,plain,
    ( ~ equal(u,cell13)
    | skP10(u,cell12) ),
    inference(eqr,[status(thm),theory(equality)],[551]),
    [iquote('0:EqR:551.0')] ).

cnf(2913,plain,
    skP10(cell13,cell12),
    inference(eqr,[status(thm),theory(equality)],[1964]),
    [iquote('0:EqR:1964.0')] ).

cnf(2914,plain,
    edge(cell12,cell13),
    inference(res,[status(thm),theory(equality)],[2913,12]),
    [iquote('0:Res:2913.0,12.0')] ).

cnf(2917,plain,
    $false,
    inference(mrr,[status(thm)],[2914,728]),
    [iquote('0:MRR:2914.0,728.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : PUZ075+1 : TPTP v8.1.0. Released v3.5.0.
% 0.06/0.13  % Command  : run_spass %d %s
% 0.13/0.34  % Computer : n026.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 : Sat May 28 20:37:54 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 3.12/3.35  
% 3.12/3.35  SPASS V 3.9 
% 3.12/3.35  SPASS beiseite: Proof found.
% 3.12/3.35  % SZS status Theorem
% 3.12/3.35  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 3.12/3.35  SPASS derived 2190 clauses, backtracked 0 clauses, performed 0 splits and kept 1574 clauses.
% 3.12/3.35  SPASS allocated 104894 KBytes.
% 3.12/3.35  SPASS spent	0:00:02.67 on the problem.
% 3.12/3.35  		0:00:00.04 for the input.
% 3.12/3.35  		0:00:00.38 for the FLOTTER CNF translation.
% 3.12/3.35  		0:00:00.21 for inferences.
% 3.12/3.35  		0:00:00.00 for the backtracking.
% 3.12/3.35  		0:00:01.89 for the reduction.
% 3.12/3.35  
% 3.12/3.35  
% 3.12/3.35  Here is a proof with depth 3, length 9 :
% 3.12/3.35  % SZS output start Refutation
% See solution above
% 3.12/3.35  Formulae used in the proof : tlhfof24989 tlhfof24987 tlhfof24988
% 3.12/3.35  
%------------------------------------------------------------------------------