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

% Computer : n029.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:15 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    ~ holdsAt(spinning,n3),
    file('CSR023+1.p',unknown),
    [] ).

cnf(16,axiom,
    equal(plus(n1,n2),n3),
    file('CSR023+1.p',unknown),
    [] ).

cnf(22,axiom,
    equal(plus(u,v),plus(v,u)),
    file('CSR023+1.p',unknown),
    [] ).

cnf(85,axiom,
    ( ~ equal(u,n2)
    | ~ equal(v,pull)
    | happens(v,u) ),
    file('CSR023+1.p',unknown),
    [] ).

cnf(86,axiom,
    ( ~ equal(u,n2)
    | ~ equal(v,push)
    | happens(v,u) ),
    file('CSR023+1.p',unknown),
    [] ).

cnf(94,axiom,
    ( ~ happens(u,v)
    | ~ initiates(u,w,v)
    | holdsAt(w,plus(v,n1)) ),
    file('CSR023+1.p',unknown),
    [] ).

cnf(111,axiom,
    ( ~ equal(u,spinning)
    | ~ equal(v,pull)
    | ~ happens(push,w)
    | initiates(v,u,w) ),
    file('CSR023+1.p',unknown),
    [] ).

cnf(1374,plain,
    ( ~ equal(u,spinning)
    | ~ equal(v,pull)
    | ~ happens(push,w)
    | ~ happens(v,w)
    | holdsAt(u,plus(w,n1)) ),
    inference(res,[status(thm),theory(equality)],[111,94]),
    [iquote('0:Res:111.3,94.1')] ).

cnf(9663,plain,
    ( ~ equal(u,pull)
    | ~ happens(push,v)
    | ~ happens(u,v)
    | holdsAt(spinning,plus(v,n1)) ),
    inference(eqr,[status(thm),theory(equality)],[1374]),
    [iquote('0:EqR:1374.0')] ).

cnf(10487,plain,
    ( ~ happens(push,u)
    | ~ happens(pull,u)
    | holdsAt(spinning,plus(u,n1)) ),
    inference(eqr,[status(thm),theory(equality)],[9663]),
    [iquote('0:EqR:9663.0')] ).

cnf(10490,plain,
    ( ~ happens(push,u)
    | ~ happens(pull,u)
    | holdsAt(spinning,plus(n1,u)) ),
    inference(spr,[status(thm),theory(equality)],[22,10487]),
    [iquote('0:SpR:22.0,10487.2')] ).

cnf(10531,plain,
    ( ~ happens(push,n2)
    | ~ happens(pull,n2)
    | holdsAt(spinning,n3) ),
    inference(spr,[status(thm),theory(equality)],[16,10490]),
    [iquote('0:SpR:16.0,10490.2')] ).

cnf(10543,plain,
    ( ~ happens(push,n2)
    | ~ happens(pull,n2) ),
    inference(mrr,[status(thm)],[10531,1]),
    [iquote('0:MRR:10531.2,1.0')] ).

cnf(10566,plain,
    ( ~ equal(n2,n2)
    | ~ equal(pull,pull)
    | ~ happens(push,n2) ),
    inference(res,[status(thm),theory(equality)],[85,10543]),
    [iquote('0:Res:85.2,10543.1')] ).

cnf(10570,plain,
    ~ happens(push,n2),
    inference(obv,[status(thm),theory(equality)],[10566]),
    [iquote('0:Obv:10566.1')] ).

cnf(10575,plain,
    ( ~ equal(n2,n2)
    | ~ equal(push,push) ),
    inference(res,[status(thm),theory(equality)],[86,10570]),
    [iquote('0:Res:86.2,10570.0')] ).

cnf(10579,plain,
    $false,
    inference(obv,[status(thm),theory(equality)],[10575]),
    [iquote('0:Obv:10575.1')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12  % Problem  : CSR023+1 : TPTP v8.1.0. Bugfixed v3.1.0.
% 0.04/0.12  % Command  : run_spass %d %s
% 0.12/0.33  % Computer : n029.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 600
% 0.12/0.33  % DateTime : Thu Jun  9 19:28:07 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.71/0.92  
% 0.71/0.92  SPASS V 3.9 
% 0.71/0.92  SPASS beiseite: Proof found.
% 0.71/0.92  % SZS status Theorem
% 0.71/0.92  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 0.71/0.92  SPASS derived 9735 clauses, backtracked 9 clauses, performed 9 splits and kept 848 clauses.
% 0.71/0.92  SPASS allocated 90256 KBytes.
% 0.71/0.92  SPASS spent	0:00:00.51 on the problem.
% 0.71/0.92  		0:00:00.04 for the input.
% 0.71/0.92  		0:00:00.08 for the FLOTTER CNF translation.
% 0.71/0.92  		0:00:00.08 for inferences.
% 0.71/0.92  		0:00:00.00 for the backtracking.
% 0.71/0.92  		0:00:00.28 for the reduction.
% 0.71/0.92  
% 0.71/0.92  
% 0.71/0.92  Here is a proof with depth 7, length 17 :
% 0.71/0.92  % SZS output start Refutation
% See solution above
% 0.71/0.92  Formulae used in the proof : spinning_3 plus1_2 symmetry_of_plus happens_all_defn happens_holds initiates_all_defn
% 0.71/0.92  
%------------------------------------------------------------------------------