%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : NUN070+1 : TPTP v8.1.0. Released v7.3.0.
% Transfm  : none
% Format   : tptp
% Command  : run_spass %d %s

% Computer : n025.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 16:38:45 EDT 2022

% Result   : Theorem 0.54s 0.72s
% Output   : Refutation 0.54s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.11  % Problem  : NUN070+1 : TPTP v8.1.0. Released v7.3.0.
% 0.12/0.12  % Command  : run_spass %d %s
% 0.12/0.33  % Computer : n025.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  2 09:15:29 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.54/0.72  
% 0.54/0.72  SPASS V 3.9 
% 0.54/0.72  SPASS beiseite: Proof found.
% 0.54/0.72  % SZS status Theorem
% 0.54/0.72  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 0.54/0.72  SPASS derived 2142 clauses, backtracked 0 clauses, performed 0 splits and kept 978 clauses.
% 0.54/0.72  SPASS allocated 99225 KBytes.
% 0.54/0.72  SPASS spent	0:00:00.37 on the problem.
% 0.54/0.72  		0:00:00.03 for the input.
% 0.54/0.72  		0:00:00.03 for the FLOTTER CNF translation.
% 0.54/0.72  		0:00:00.03 for inferences.
% 0.54/0.72  		0:00:00.00 for the backtracking.
% 0.54/0.72  		0:00:00.24 for the reduction.
% 0.54/0.72  
% 0.54/0.72  
% 0.54/0.72  Here is a proof with depth 3, length 20 :
% 0.54/0.72  % SZS output start Refutation
% 0.54/0.72  2[0:Inp] ||  -> r1(skf31(u))*.
% 0.54/0.72  4[0:Inp] ||  -> r1(skf34(u))*.
% 0.54/0.72  5[0:Inp] ||  -> id__dfg(skf30(u),u)*l.
% 0.54/0.72  8[0:Inp] ||  -> r2(u,skf28(v,u))*.
% 0.54/0.72  9[0:Inp] ||  -> id__dfg(skf32(u),skf34(u))*l.
% 0.54/0.72  15[0:Inp] ||  -> r3(u,skf31(u),skf30(u))*.
% 0.54/0.72  21[0:Inp] || id__dfg(u,v)* -> id__dfg(v,u).
% 0.54/0.72  22[0:Inp] r1(u) || SkP4(v,u)* -> .
% 0.54/0.72  36[0:Inp] || id__dfg(u,v) -> r1(v) SkP4(v,u)*.
% 0.54/0.72  59[0:Inp] r1(u) r1(v) r1(w) || r2(u,x)* id__dfg(y,x)*+ r2(v,z)* r3(z,w,y)* -> .
% 0.54/0.72  75[0:Res:5.0,59.4] r1(u) r1(v) r1(w) || r2(u,x)* r2(v,y)* r3(y,w,skf30(x))*+ -> .
% 0.54/0.72  126[0:Res:36.2,22.1] r1(u) || id__dfg(u,v)*+ -> r1(v)*.
% 0.54/0.72  287[0:Res:9.0,21.0] ||  -> id__dfg(skf34(u),skf32(u))*r.
% 0.54/0.72  484[0:Res:287.0,126.1] r1(skf34(u)) ||  -> r1(skf32(u))*.
% 0.54/0.72  496[0:SSi:484.0,4.0] ||  -> r1(skf32(u))*.
% 0.54/0.72  2268[0:Res:15.0,75.5] r1(u) r1(v) r1(skf31(w)) || r2(u,w)* r2(v,w)* -> .
% 0.54/0.72  2270[0:Con:2268.1] r1(u) r1(skf31(v)) || r2(u,v)* -> .
% 0.54/0.72  2271[0:SSi:2270.1,2.0] r1(u) || r2(u,v)* -> .
% 0.54/0.72  2286[0:Res:8.0,2271.1] r1(u) ||  -> .
% 0.54/0.72  2290[0:UnC:2286.0,496.0] ||  -> .
% 0.54/0.72  % SZS output end Refutation
% 0.54/0.72  Formulae used in the proof : axiom_4a axiom_5a axiom_2a axiom_6 axiom_8 onepluszeroidone
% 0.54/0.72  
%------------------------------------------------------------------------------