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

View Problem - Process Solution

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

% Computer : n014.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:34 EDT 2022

% Result   : Theorem 0.19s 0.51s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.11  % Problem  : SWV188+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% 0.04/0.12  % Command  : run_spass %d %s
% 0.11/0.33  % Computer : n014.cluster.edu
% 0.11/0.33  % Model    : x86_64 x86_64
% 0.11/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33  % Memory   : 8042.1875MB
% 0.11/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33  % CPULimit : 300
% 0.11/0.33  % WCLimit  : 600
% 0.11/0.33  % DateTime : Tue Jun 14 21:35:21 EDT 2022
% 0.11/0.33  % CPUTime  : 
% 0.19/0.51  
% 0.19/0.51  SPASS V 3.9 
% 0.19/0.51  SPASS beiseite: Proof found.
% 0.19/0.51  % SZS status Theorem
% 0.19/0.51  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 0.19/0.51  SPASS derived 199 clauses, backtracked 0 clauses, performed 0 splits and kept 166 clauses.
% 0.19/0.51  SPASS allocated 85816 KBytes.
% 0.19/0.51  SPASS spent	0:00:00.17 on the problem.
% 0.19/0.51  		0:00:00.04 for the input.
% 0.19/0.51  		0:00:00.07 for the FLOTTER CNF translation.
% 0.19/0.51  		0:00:00.00 for inferences.
% 0.19/0.51  		0:00:00.00 for the backtracking.
% 0.19/0.51  		0:00:00.01 for the reduction.
% 0.19/0.51  
% 0.19/0.51  
% 0.19/0.51  Here is a proof with depth 1, length 15 :
% 0.19/0.51  % SZS output start Refutation
% 0.19/0.51  2[0:Inp] ||  -> leq(n0,skc1)*r.
% 0.19/0.51  3[0:Inp] ||  -> leq(skc1,tptp_minus_1)*l.
% 0.19/0.51  34[0:Inp] || gt(u,u)* -> .
% 0.19/0.51  36[0:Inp] ||  -> equal(succ(tptp_minus_1),n0)**.
% 0.19/0.51  78[0:Inp] || leq(u,v)* -> leq(u,succ(v))*.
% 0.19/0.51  79[0:Inp] || leq(u,v)* -> gt(succ(v),u)*.
% 0.19/0.51  103[0:Inp] || leq(u,n0)* leq(n0,u)* -> equal(u,n0).
% 0.19/0.51  189[0:Res:3.0,78.0] ||  -> leq(skc1,succ(tptp_minus_1))*r.
% 0.19/0.51  190[0:Res:3.0,79.0] ||  -> gt(succ(tptp_minus_1),skc1)*l.
% 0.19/0.51  254[0:Res:2.0,103.0] || leq(skc1,n0)*l -> equal(skc1,n0).
% 0.19/0.51  349[0:Rew:36.0,189.0] ||  -> leq(skc1,n0)*l.
% 0.19/0.51  350[0:Rew:36.0,190.0] ||  -> gt(n0,skc1)*r.
% 0.19/0.51  353[0:MRR:254.0,349.0] ||  -> equal(skc1,n0)**.
% 0.19/0.51  360[0:Rew:353.0,350.0] ||  -> gt(n0,n0)*.
% 0.19/0.51  368[0:MRR:360.0,34.0] ||  -> .
% 0.19/0.51  % SZS output end Refutation
% 0.19/0.51  Formulae used in the proof : cl5_nebula_init_0116 irreflexivity_gt succ_tptp_minus_1 leq_succ leq_succ_gt_equiv finite_domain_0
% 0.19/0.51  
%------------------------------------------------------------------------------