%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : CSR066+2 : TPTP v8.1.0. Released v3.4.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 : Fri Jul 15 23:24:56 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(4,axiom,
    shavingrazor_manual(c_theprototypicalshavingrazor_manual),
    file('CSR066+2.p',unknown),
    [] ).

cnf(270,axiom,
    relationexistsall(c_tptp_8_271,c_tptpcol_16_25972,c_shavingrazor_manual),
    file('CSR066+2.p',unknown),
    [] ).

cnf(544,axiom,
    ( ~ isa(u,c_tptpcol_16_25972)
    | tptpcol_16_25972(u) ),
    file('CSR066+2.p',unknown),
    [] ).

cnf(822,axiom,
    ( ~ shavingrazor_manual(u)
    | isa(u,c_shavingrazor_manual) ),
    file('CSR066+2.p',unknown),
    [] ).

cnf(999,axiom,
    ( ~ tptpcol_16_25972(u)
    | ~ tptp_8_271(u,c_theprototypicalshavingrazor_manual) ),
    file('CSR066+2.p',unknown),
    [] ).

cnf(1089,axiom,
    ( ~ shavingrazor_manual(u)
    | tptp_8_271(f_relationexistsallfn(u,c_tptp_8_271,c_tptpcol_16_25972,c_shavingrazor_manual),u) ),
    file('CSR066+2.p',unknown),
    [] ).

cnf(1129,axiom,
    ( ~ isa(u,v)
    | ~ relationexistsall(w,x,v)
    | isa(f_relationexistsallfn(u,w,x,v),x) ),
    file('CSR066+2.p',unknown),
    [] ).

cnf(3976,plain,
    ( ~ shavingrazor_manual(c_theprototypicalshavingrazor_manual)
    | ~ tptpcol_16_25972(f_relationexistsallfn(c_theprototypicalshavingrazor_manual,c_tptp_8_271,c_tptpcol_16_25972,c_shavingrazor_manual)) ),
    inference(res,[status(thm),theory(equality)],[1089,999]),
    [iquote('0:Res:1089.1,999.1')] ).

cnf(3977,plain,
    ~ tptpcol_16_25972(f_relationexistsallfn(c_theprototypicalshavingrazor_manual,c_tptp_8_271,c_tptpcol_16_25972,c_shavingrazor_manual)),
    inference(ssi,[status(thm)],[3976,4]),
    [iquote('0:SSi:3976.0,4.0')] ).

cnf(7789,plain,
    ( ~ isa(u,v)
    | ~ relationexistsall(w,c_tptpcol_16_25972,v)
    | tptpcol_16_25972(f_relationexistsallfn(u,w,c_tptpcol_16_25972,v)) ),
    inference(res,[status(thm),theory(equality)],[1129,544]),
    [iquote('0:Res:1129.2,544.0')] ).

cnf(47821,plain,
    ( ~ relationexistsall(c_tptp_8_271,c_tptpcol_16_25972,c_shavingrazor_manual)
    | ~ isa(c_theprototypicalshavingrazor_manual,c_shavingrazor_manual) ),
    inference(sor,[status(thm)],[3977,7789]),
    [iquote('0:SoR:3977.0,7789.2')] ).

cnf(47822,plain,
    ~ isa(c_theprototypicalshavingrazor_manual,c_shavingrazor_manual),
    inference(mrr,[status(thm)],[47821,270]),
    [iquote('0:MRR:47821.0,270.0')] ).

cnf(76357,plain,
    ~ shavingrazor_manual(c_theprototypicalshavingrazor_manual),
    inference(res,[status(thm),theory(equality)],[822,47822]),
    [iquote('0:Res:822.1,47822.0')] ).

cnf(76358,plain,
    $false,
    inference(ssi,[status(thm)],[76357,4]),
    [iquote('0:SSi:76357.0,4.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : CSR066+2 : TPTP v8.1.0. Released v3.4.0.
% 0.12/0.13  % Command  : run_spass %d %s
% 0.13/0.34  % Computer : n016.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 Jun 11 04:05:11 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 86.14/86.38  
% 86.14/86.38  SPASS V 3.9 
% 86.14/86.38  SPASS beiseite: Proof found.
% 86.14/86.38  % SZS status Theorem
% 86.14/86.38  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 86.14/86.38  SPASS derived 74516 clauses, backtracked 0 clauses, performed 0 splits and kept 61308 clauses.
% 86.14/86.38  SPASS allocated 145760 KBytes.
% 86.14/86.38  SPASS spent	0:1:24.05 on the problem.
% 86.14/86.38  		0:00:00.04 for the input.
% 86.14/86.38  		0:00:00.18 for the FLOTTER CNF translation.
% 86.14/86.38  		0:00:01.26 for inferences.
% 86.14/86.38  		0:00:00.00 for the backtracking.
% 86.14/86.38  		0:1:17.14 for the reduction.
% 86.14/86.38  
% 86.14/86.38  
% 86.14/86.38  Here is a proof with depth 3, length 14 :
% 86.14/86.38  % SZS output start Refutation
% See solution above
% 86.14/86.38  Formulae used in the proof : ax1_97 ax1_392 ax1_563 ax1_913 query116 ax1_391 ax1_64
% 86.14/86.38  
%------------------------------------------------------------------------------