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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : SWV159+1 : TPTP v8.1.0. Bugfixed v3.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 : Wed Jul 20 21:41:28 EDT 2022

% Result   : Theorem 1.17s 1.34s
% Output   : Refutation 1.17s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13  % Problem  : SWV159+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% 0.12/0.14  % Command  : run_spass %d %s
% 0.14/0.35  % Computer : n025.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit : 300
% 0.14/0.35  % WCLimit  : 600
% 0.14/0.35  % DateTime : Thu Jun 16 04:14:56 EDT 2022
% 0.14/0.35  % CPUTime  : 
% 1.17/1.34  
% 1.17/1.34  SPASS V 3.9 
% 1.17/1.34  SPASS beiseite: Proof found.
% 1.17/1.34  % SZS status Theorem
% 1.17/1.34  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 1.17/1.34  SPASS derived 4379 clauses, backtracked 0 clauses, performed 2 splits and kept 2204 clauses.
% 1.17/1.34  SPASS allocated 89421 KBytes.
% 1.17/1.34  SPASS spent	0:00:00.96 on the problem.
% 1.17/1.34  		0:00:00.04 for the input.
% 1.17/1.34  		0:00:00.08 for the FLOTTER CNF translation.
% 1.17/1.34  		0:00:00.03 for inferences.
% 1.17/1.34  		0:00:00.02 for the backtracking.
% 1.17/1.34  		0:00:00.66 for the reduction.
% 1.17/1.34  
% 1.17/1.34  
% 1.17/1.34  Here is a proof with depth 1, length 7 :
% 1.17/1.34  % SZS output start Refutation
% 1.17/1.34  2[0:Inp] ||  -> leq(n0,skc1)*r.
% 1.17/1.34  44[0:Inp] ||  -> leq(skc1,pred(pv10))*r.
% 1.17/1.34  111[0:Inp] || equal(sum__dfg(n0,n4,a_select3(q,skc1,tptp_sum_index)),n1)** -> .
% 1.17/1.34  126[0:Inp] || leq(u,pred(pv10)) leq(n0,u) -> equal(sum__dfg(n0,n4,a_select3(q,u,tptp_sum_index)),n1)**.
% 1.17/1.34  5899[0:SpL:126.2,111.0] || leq(skc1,pred(pv10))*r leq(n0,skc1) equal(n1,n1) -> .
% 1.17/1.34  5900[0:Obv:5899.2] || leq(skc1,pred(pv10))*r leq(n0,skc1) -> .
% 1.17/1.34  5901[0:MRR:5900.0,5900.1,44.0,2.0] ||  -> .
% 1.17/1.34  % SZS output end Refutation
% 1.17/1.34  Formulae used in the proof : cl5_nebula_norm_0009
% 1.17/1.34  
%------------------------------------------------------------------------------