↑ Up

SPASS---3.9.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : NUN080+1 : TPTP v8.1.0. Released v7.3.0.
% Transfm  : none
% Format   : tptp
% Command  : run_spass %d %s

% Computer : n024.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:47 EDT 2022

% Result   : Theorem 0.21s 0.52s
% Output   : Refutation 0.21s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13  % Problem  : NUN080+1 : TPTP v8.1.0. Released v7.3.0.
% 0.04/0.13  % Command  : run_spass %d %s
% 0.14/0.34  % Computer : n024.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit : 300
% 0.14/0.34  % WCLimit  : 600
% 0.14/0.34  % DateTime : Thu Jun  2 05:57:21 EDT 2022
% 0.14/0.35  % CPUTime  : 
% 0.21/0.52  
% 0.21/0.52  SPASS V 3.9 
% 0.21/0.52  SPASS beiseite: Proof found.
% 0.21/0.52  % SZS status Theorem
% 0.21/0.52  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 0.21/0.52  SPASS derived 850 clauses, backtracked 0 clauses, performed 0 splits and kept 463 clauses.
% 0.21/0.52  SPASS allocated 98250 KBytes.
% 0.21/0.52  SPASS spent	0:00:00.16 on the problem.
% 0.21/0.52  		0:00:00.03 for the input.
% 0.21/0.52  		0:00:00.04 for the FLOTTER CNF translation.
% 0.21/0.52  		0:00:00.01 for inferences.
% 0.21/0.52  		0:00:00.00 for the backtracking.
% 0.21/0.52  		0:00:00.05 for the reduction.
% 0.21/0.52  
% 0.21/0.52  
% 0.21/0.52  Here is a proof with depth 4, length 18 :
% 0.21/0.52  % SZS output start Refutation
% 0.21/0.52  1[0:Inp] ||  -> id__dfg(u,u)*.
% 0.21/0.52  4[0:Inp] ||  -> r1(skf34(u))*.
% 0.21/0.52  8[0:Inp] ||  -> r2(u,skf28(v,u))*.
% 0.21/0.52  9[0:Inp] ||  -> id__dfg(skf32(u),skf34(u))*l.
% 0.21/0.52  13[0:Inp] ||  -> r3(u,v,skf25(v,u))*.
% 0.21/0.52  21[0:Inp] || id__dfg(u,v)* -> id__dfg(v,u).
% 0.21/0.52  22[0:Inp] r1(u) || SkP4(v,u)* -> .
% 0.21/0.52  36[0:Inp] || id__dfg(u,v) -> r1(v) SkP4(v,u)*.
% 0.21/0.52  55[0:Inp] r1(u) || r3(v,w,x)* r2(y,w)* id__dfg(x,z)* r2(u,y)* -> .
% 0.21/0.52  71[0:Res:1.0,55.3] r1(u) || r2(u,v)* r2(v,w)* r3(x,w,y)*+ -> .
% 0.21/0.52  119[0:Res:36.2,22.1] r1(u) || id__dfg(u,v)*+ -> r1(v)*.
% 0.21/0.52  280[0:Res:9.0,21.0] ||  -> id__dfg(skf34(u),skf32(u))*r.
% 0.21/0.52  448[0:Res:280.0,119.1] r1(skf34(u)) ||  -> r1(skf32(u))*.
% 0.21/0.52  458[0:SSi:448.0,4.0] ||  -> r1(skf32(u))*.
% 0.21/0.52  917[0:Res:13.0,71.3] r1(u) || r2(u,v)*+ r2(v,w)* -> .
% 0.21/0.52  922[0:Res:8.0,917.1] r1(u) || r2(skf28(v,u),w)* -> .
% 0.21/0.52  934[0:Res:8.0,922.1] r1(u) ||  -> .
% 0.21/0.52  937[0:UnC:934.0,458.0] ||  -> .
% 0.21/0.52  % SZS output end Refutation
% 0.21/0.52  Formulae used in the proof : axiom_5 axiom_5a axiom_2a axiom_1a axiom_6 axiom_8 xplustwoidy
% 0.21/0.52  
%------------------------------------------------------------------------------