TSTP Solution File: SWV155+1 by SPASS---3.9

View Problem - Process Solution

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

% Computer : n021.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 : Wed Jul 20 21:41:27 EDT 2022

% Result   : Theorem 1.09s 1.31s
% Output   : Refutation 1.09s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SWV155+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% 0.07/0.13  % Command  : run_spass %d %s
% 0.13/0.34  % Computer : n021.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 : Thu Jun 16 00:01:59 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 1.09/1.31  
% 1.09/1.31  SPASS V 3.9 
% 1.09/1.31  SPASS beiseite: Proof found.
% 1.09/1.31  % SZS status Theorem
% 1.09/1.31  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 1.09/1.31  SPASS derived 4485 clauses, backtracked 0 clauses, performed 2 splits and kept 2199 clauses.
% 1.09/1.31  SPASS allocated 89424 KBytes.
% 1.09/1.31  SPASS spent	0:00:00.94 on the problem.
% 1.09/1.31  		0:00:00.03 for the input.
% 1.09/1.31  		0:00:00.05 for the FLOTTER CNF translation.
% 1.09/1.31  		0:00:00.03 for inferences.
% 1.09/1.31  		0:00:00.02 for the backtracking.
% 1.09/1.31  		0:00:00.68 for the reduction.
% 1.09/1.31  
% 1.09/1.31  
% 1.09/1.31  Here is a proof with depth 1, length 7 :
% 1.09/1.31  % SZS output start Refutation
% 1.09/1.31  2[0:Inp] ||  -> leq(n0,skc1)*r.
% 1.09/1.31  36[0:Inp] ||  -> leq(skc1,pred(pv10))*r.
% 1.09/1.31  103[0:Inp] || equal(sum__dfg(n0,n4,a_select3(q,skc1,tptp_sum_index)),n1)** -> .
% 1.09/1.31  118[0:Inp] || leq(u,pred(pv10)) leq(n0,u) -> equal(sum__dfg(n0,n4,a_select3(q,u,tptp_sum_index)),n1)**.
% 1.09/1.31  6097[0:SpL:118.2,103.0] || leq(skc1,pred(pv10))*r leq(n0,skc1) equal(n1,n1) -> .
% 1.09/1.31  6098[0:Obv:6097.2] || leq(skc1,pred(pv10))*r leq(n0,skc1) -> .
% 1.09/1.31  6099[0:MRR:6098.0,6098.1,36.0,2.0] ||  -> .
% 1.09/1.31  % SZS output end Refutation
% 1.09/1.31  Formulae used in the proof : cl5_nebula_norm_0005
% 1.09/1.31  
%------------------------------------------------------------------------------