%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : LCL169-3 : TPTP v8.1.0. Released v2.3.0.
% Transfm  : none
% Format   : tptp
% Command  : run_spass %d %s

% Computer : n016.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 : Sun Jul 17 14:35:02 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    ~ theorem(implies__dfg(implies__dfg(p,not__dfg(p)),not__dfg(p))),
    file('LCL169-3.p',unknown),
    [] ).

cnf(2,axiom,
    axiom(implies__dfg(or__dfg(u,u),u)),
    file('LCL169-3.p',unknown),
    [] ).

cnf(7,axiom,
    equal(or__dfg(not__dfg(u),v),implies__dfg(u,v)),
    file('LCL169-3.p',unknown),
    [] ).

cnf(8,axiom,
    ( ~ axiom(u)
    | theorem(u) ),
    file('LCL169-3.p',unknown),
    [] ).

cnf(10,plain,
    ~ axiom(implies__dfg(implies__dfg(p,not__dfg(p)),not__dfg(p))),
    inference(res,[status(thm),theory(equality)],[8,1]),
    [iquote('0:Res:8.1,1.0')] ).

cnf(12,plain,
    axiom(implies__dfg(implies__dfg(u,not__dfg(u)),not__dfg(u))),
    inference(spr,[status(thm),theory(equality)],[7,2]),
    [iquote('0:SpR:7.0,2.0')] ).

cnf(15,plain,
    $false,
    inference(unc,[status(thm)],[12,10]),
    [iquote('0:UnC:12.0,10.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem  : LCL169-3 : TPTP v8.1.0. Released v2.3.0.
% 0.03/0.11  % Command  : run_spass %d %s
% 0.11/0.32  % Computer : n016.cluster.edu
% 0.11/0.32  % Model    : x86_64 x86_64
% 0.11/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32  % Memory   : 8042.1875MB
% 0.11/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32  % CPULimit : 300
% 0.11/0.32  % WCLimit  : 600
% 0.11/0.32  % DateTime : Mon Jul  4 07:19:31 EDT 2022
% 0.11/0.32  % CPUTime  : 
% 0.17/0.40  
% 0.17/0.40  SPASS V 3.9 
% 0.17/0.40  SPASS beiseite: Proof found.
% 0.17/0.40  % SZS status Theorem
% 0.17/0.40  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.17/0.40  SPASS derived 4 clauses, backtracked 0 clauses, performed 0 splits and kept 12 clauses.
% 0.17/0.40  SPASS allocated 75600 KBytes.
% 0.17/0.40  SPASS spent	0:00:00.06 on the problem.
% 0.17/0.40  		0:00:00.04 for the input.
% 0.17/0.40  		0:00:00.00 for the FLOTTER CNF translation.
% 0.17/0.40  		0:00:00.00 for inferences.
% 0.17/0.40  		0:00:00.00 for the backtracking.
% 0.17/0.40  		0:00:00.00 for the reduction.
% 0.17/0.40  
% 0.17/0.40  
% 0.17/0.40  Here is a proof with depth 1, length 7 :
% 0.17/0.40  % SZS output start Refutation
% See solution above
% 0.17/0.40  Formulae used in the proof : prove_this axiom_1_2 implies_definition rule_1
% 0.17/0.40  
%------------------------------------------------------------------------------