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

% Computer : n008.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:14 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    holdsAt(forwards,n2),
    file('CSR019+1.p',unknown),
    [] ).

cnf(15,axiom,
    equal(plus(n1,n1),n2),
    file('CSR019+1.p',unknown),
    [] ).

cnf(44,axiom,
    ( ~ skP8(u,v)
    | happens(v,u) ),
    file('CSR019+1.p',unknown),
    [] ).

cnf(73,axiom,
    ( ~ skP3(u,v,w)
    | terminates(w,v,u) ),
    file('CSR019+1.p',unknown),
    [] ).

cnf(74,axiom,
    ( ~ skP4(u,v,w)
    | terminates(w,v,u) ),
    file('CSR019+1.p',unknown),
    [] ).

cnf(88,axiom,
    ( ~ equal(u,pull)
    | ~ equal(v,n1)
    | skP8(v,u) ),
    file('CSR019+1.p',unknown),
    [] ).

cnf(99,axiom,
    ( ~ happens(u,v)
    | ~ holdsAt(w,plus(v,n1))
    | ~ terminates(u,w,v) ),
    file('CSR019+1.p',unknown),
    [] ).

cnf(106,axiom,
    ( ~ equal(u,pull)
    | ~ equal(v,forwards)
    | happens(push,w)
    | skP3(w,v,u) ),
    file('CSR019+1.p',unknown),
    [] ).

cnf(112,axiom,
    ( ~ equal(u,pull)
    | ~ equal(v,forwards)
    | ~ happens(push,w)
    | skP4(w,v,u) ),
    file('CSR019+1.p',unknown),
    [] ).

cnf(528,plain,
    ( ~ equal(u,pull)
    | ~ equal(v,n1)
    | happens(u,v) ),
    inference(res,[status(thm),theory(equality)],[88,44]),
    [iquote('0:Res:88.2,44.0')] ).

cnf(743,plain,
    ( ~ equal(u,pull)
    | ~ equal(v,forwards)
    | happens(push,w)
    | terminates(u,v,w) ),
    inference(res,[status(thm),theory(equality)],[106,73]),
    [iquote('0:Res:106.3,73.0')] ).

cnf(837,plain,
    ( ~ happens(u,n1)
    | ~ holdsAt(v,n2)
    | ~ terminates(u,v,n1) ),
    inference(spl,[status(thm),theory(equality)],[15,99]),
    [iquote('0:SpL:15.0,99.1')] ).

cnf(1271,plain,
    ( ~ equal(u,pull)
    | ~ equal(v,forwards)
    | ~ happens(push,w)
    | terminates(u,v,w) ),
    inference(res,[status(thm),theory(equality)],[112,74]),
    [iquote('0:Res:112.3,74.0')] ).

cnf(1275,plain,
    ( ~ equal(u,pull)
    | ~ equal(v,forwards)
    | terminates(u,v,w) ),
    inference(mrr,[status(thm)],[1271,743]),
    [iquote('0:MRR:1271.2,743.2')] ).

cnf(6554,plain,
    ( ~ equal(u,pull)
    | ~ equal(v,forwards)
    | ~ happens(u,n1)
    | ~ holdsAt(v,n2) ),
    inference(res,[status(thm),theory(equality)],[1275,837]),
    [iquote('0:Res:1275.2,837.2')] ).

cnf(8988,plain,
    ( ~ equal(u,forwards)
    | ~ happens(pull,n1)
    | ~ holdsAt(u,n2) ),
    inference(eqr,[status(thm),theory(equality)],[6554]),
    [iquote('0:EqR:6554.0')] ).

cnf(8989,plain,
    ( ~ happens(pull,n1)
    | ~ holdsAt(forwards,n2) ),
    inference(eqr,[status(thm),theory(equality)],[8988]),
    [iquote('0:EqR:8988.0')] ).

cnf(8990,plain,
    ~ happens(pull,n1),
    inference(mrr,[status(thm)],[8989,1]),
    [iquote('0:MRR:8989.1,1.0')] ).

cnf(8996,plain,
    ( ~ equal(pull,pull)
    | ~ equal(n1,n1) ),
    inference(res,[status(thm),theory(equality)],[528,8990]),
    [iquote('0:Res:528.2,8990.0')] ).

cnf(8998,plain,
    $false,
    inference(obv,[status(thm),theory(equality)],[8996]),
    [iquote('0:Obv:8996.1')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12  % Problem  : CSR019+1 : TPTP v8.1.0. Bugfixed v3.1.0.
% 0.08/0.13  % Command  : run_spass %d %s
% 0.12/0.34  % Computer : n008.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 600
% 0.12/0.34  % DateTime : Sat Jun 11 01:16:22 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.60/0.83  
% 0.60/0.83  SPASS V 3.9 
% 0.60/0.83  SPASS beiseite: Proof found.
% 0.60/0.83  % SZS status Theorem
% 0.60/0.83  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 0.60/0.83  SPASS derived 8212 clauses, backtracked 1 clauses, performed 8 splits and kept 780 clauses.
% 0.60/0.83  SPASS allocated 89308 KBytes.
% 0.60/0.83  SPASS spent	0:00:00.44 on the problem.
% 0.60/0.83  		0:00:00.04 for the input.
% 0.60/0.83  		0:00:00.09 for the FLOTTER CNF translation.
% 0.60/0.83  		0:00:00.06 for inferences.
% 0.60/0.83  		0:00:00.00 for the backtracking.
% 0.60/0.83  		0:00:00.22 for the reduction.
% 0.60/0.83  
% 0.60/0.83  
% 0.60/0.83  Here is a proof with depth 5, length 20 :
% 0.60/0.83  % SZS output start Refutation
% See solution above
% 0.60/0.83  Formulae used in the proof : not_forwards_2 plus1_1 happens_all_defn terminates_all_defn happens_terminates_not_holds
% 0.60/0.83  
%------------------------------------------------------------------------------