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

View Problem - Process Solution

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

% Computer : n006.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:37 EDT 2022

% Result   : Theorem 1.47s 1.64s
% Output   : Refutation 1.47s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13  % Problem  : SWV203+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% 0.11/0.13  % Command  : run_spass %d %s
% 0.15/0.34  % Computer : n006.cluster.edu
% 0.15/0.34  % Model    : x86_64 x86_64
% 0.15/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.34  % Memory   : 8042.1875MB
% 0.15/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35  % CPULimit : 300
% 0.15/0.35  % WCLimit  : 600
% 0.15/0.35  % DateTime : Tue Jun 14 23:59:56 EDT 2022
% 0.15/0.35  % CPUTime  : 
% 1.47/1.64  
% 1.47/1.64  SPASS V 3.9 
% 1.47/1.64  SPASS beiseite: Proof found.
% 1.47/1.64  % SZS status Theorem
% 1.47/1.64  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 1.47/1.64  SPASS derived 4422 clauses, backtracked 487 clauses, performed 4 splits and kept 2721 clauses.
% 1.47/1.64  SPASS allocated 89385 KBytes.
% 1.47/1.64  SPASS spent	0:00:01.26 on the problem.
% 1.47/1.64  		0:00:00.04 for the input.
% 1.47/1.64  		0:00:00.08 for the FLOTTER CNF translation.
% 1.47/1.64  		0:00:00.03 for inferences.
% 1.47/1.64  		0:00:00.02 for the backtracking.
% 1.47/1.64  		0:00:00.98 for the reduction.
% 1.47/1.64  
% 1.47/1.64  
% 1.47/1.64  Here is a proof with depth 5, length 82 :
% 1.47/1.64  % SZS output start Refutation
% 1.47/1.64  2[0:Inp] ||  -> leq(n0,skc3)*r.
% 1.47/1.64  3[0:Inp] ||  -> leq(skc3,n2)*l.
% 1.47/1.64  6[0:Inp] ||  -> gt(pv5,n0)*l.
% 1.47/1.64  7[0:Inp] ||  -> leq(skc2,pv5)*l.
% 1.47/1.64  8[0:Inp] ||  -> leq(n0,skc2)*r.
% 1.47/1.64  37[0:Inp] ||  -> leq(u,u)*.
% 1.47/1.64  38[0:Inp] ||  -> equal(succ(n0),n1)**.
% 1.47/1.64  67[0:Inp] ||  -> equal(succ(succ(n0)),n2)**.
% 1.47/1.64  84[0:Inp] ||  -> equal(pred(succ(u)),u)**.
% 1.47/1.64  96[0:Inp] || equal(a_select3(z_defuse,skc3,skc2),use)** -> .
% 1.47/1.64  107[0:Inp] || equal(skc2,pv5) equal(skc3,n0)** -> .
% 1.47/1.64  108[0:Inp] || equal(skc2,pv5) equal(skc3,n1)** -> .
% 1.47/1.64  109[0:Inp] || equal(skc2,pv5) equal(skc3,n2)** -> .
% 1.47/1.64  112[0:Inp] || gt(u,v)*+ -> leq(v,pred(u))*.
% 1.47/1.64  134[0:Inp] || leq(u,v)* -> gt(v,u) equal(u,v).
% 1.47/1.64  138[0:Inp] || leq(u,n0)*+ leq(n0,u)* -> equal(u,n0).
% 1.47/1.64  140[0:Inp] || leq(u,v)* leq(v,w)* -> leq(u,w)*.
% 1.47/1.64  144[0:Inp] || leq(u,n1)* leq(n0,u) -> equal(u,n1) equal(u,n0).
% 1.47/1.64  154[0:Inp] || leq(u,n2) leq(v,pred(pv5)) leq(n0,v) leq(n0,u) -> equal(a_select3(z_defuse,u,v),use)**.
% 1.47/1.64  181[0:Rew:38.0,67.0] ||  -> equal(succ(n1),n2)**.
% 1.47/1.64  194[0:Res:154.4,96.0] || leq(n0,skc3) leq(skc3,n2) leq(skc2,pred(pv5))*r leq(n0,skc2) -> .
% 1.47/1.64  223[0:Res:8.0,144.0] || leq(skc2,n1)*l -> equal(skc2,n1) equal(skc2,n0).
% 1.47/1.64  256[0:Res:8.0,134.0] ||  -> gt(skc2,n0)*l equal(skc2,n0).
% 1.47/1.64  336[0:Res:7.0,134.0] ||  -> gt(pv5,skc2)*r equal(skc2,pv5).
% 1.47/1.64  383[0:MRR:194.0,194.1,194.3,2.0,3.0,8.0] || leq(skc2,pred(pv5))*r -> .
% 1.47/1.64  438[1:Spt:223.1] ||  -> equal(skc2,n1)**.
% 1.47/1.64  445[1:Rew:438.0,336.1] ||  -> gt(pv5,skc2)*r equal(pv5,n1).
% 1.47/1.64  446[1:Rew:438.0,107.0] || equal(pv5,n1) equal(skc3,n0)** -> .
% 1.47/1.64  447[1:Rew:438.0,108.0] || equal(pv5,n1) equal(skc3,n1)** -> .
% 1.47/1.64  448[1:Rew:438.0,109.0] || equal(pv5,n1) equal(skc3,n2)** -> .
% 1.47/1.64  541[1:Rew:438.0,383.0] || leq(n1,pred(pv5))*r -> .
% 1.47/1.64  569[1:Rew:438.0,445.0] ||  -> gt(pv5,n1)*l equal(pv5,n1).
% 1.47/1.64  676[0:SpR:38.0,84.0] ||  -> equal(pred(n1),n0)**.
% 1.47/1.64  677[0:SpR:181.0,84.0] ||  -> equal(pred(n2),n1)**.
% 1.47/1.64  798[2:Spt:446.0] || equal(pv5,n1)** -> .
% 1.47/1.64  799[2:MRR:569.1,798.0] ||  -> gt(pv5,n1)*l.
% 1.47/1.64  3578[2:Res:799.0,112.0] ||  -> leq(n1,pred(pv5))*r.
% 1.47/1.64  3586[0:Res:6.0,112.0] ||  -> leq(n0,pred(pv5))*r.
% 1.47/1.64  3735[2:MRR:3578.0,541.0] ||  -> .
% 1.47/1.64  3837[2:Spt:3735.0,446.0,798.0] ||  -> equal(pv5,n1)**.
% 1.47/1.64  3838[2:Spt:3735.0,446.1] || equal(skc3,n0)** -> .
% 1.47/1.64  3908[2:Rew:3837.0,447.0] || equal(n1,n1) equal(skc3,n1)** -> .
% 1.47/1.64  3909[2:Obv:3908.0] || equal(skc3,n1)** -> .
% 1.47/1.64  3910[2:Rew:3837.0,448.0] || equal(n1,n1) equal(skc3,n2)** -> .
% 1.47/1.64  3911[2:Obv:3910.0] || equal(skc3,n2)** -> .
% 1.47/1.64  5238[0:Res:3.0,134.0] ||  -> gt(n2,skc3)*r equal(skc3,n2).
% 1.47/1.64  5435[2:MRR:5238.1,3911.0] ||  -> gt(n2,skc3)*r.
% 1.47/1.64  5447[2:Res:5435.0,112.0] ||  -> leq(skc3,pred(n2))*r.
% 1.47/1.64  5458[2:Rew:677.0,5447.0] ||  -> leq(skc3,n1)*l.
% 1.47/1.64  5459[2:Res:5458.0,134.0] ||  -> gt(n1,skc3)*r equal(skc3,n1).
% 1.47/1.64  5471[2:MRR:5459.1,3909.0] ||  -> gt(n1,skc3)*r.
% 1.47/1.64  5472[2:Res:5471.0,112.0] ||  -> leq(skc3,pred(n1))*r.
% 1.47/1.64  5483[2:Rew:676.0,5472.0] ||  -> leq(skc3,n0)*l.
% 1.47/1.64  5593[2:NCh:140.2,140.0,5483.0,138.0] || leq(n0,n0) leq(n0,skc3)*r -> equal(skc3,n0).
% 1.47/1.64  5601[2:MRR:5593.0,5593.1,5593.2,37.0,2.0,3838.0] ||  -> .
% 1.47/1.64  5602[1:Spt:5601.0,223.1,438.0] || equal(skc2,n1)** -> .
% 1.47/1.64  5603[1:Spt:5601.0,223.0,223.2] || leq(skc2,n1)*l -> equal(skc2,n0).
% 1.47/1.64  5615[2:Spt:256.1] ||  -> equal(skc2,n0)**.
% 1.47/1.64  5639[2:Rew:5615.0,383.0] || leq(n0,pred(pv5))*r -> .
% 1.47/1.64  5746[2:MRR:5639.0,3586.0] ||  -> .
% 1.47/1.64  5815[2:Spt:5746.0,256.1,5615.0] || equal(skc2,n0)** -> .
% 1.47/1.64  5816[2:Spt:5746.0,256.0] ||  -> gt(skc2,n0)*l.
% 1.47/1.64  5833[3:Spt:336.1] ||  -> equal(skc2,pv5)**.
% 1.47/1.64  5845[3:Rew:5833.0,107.0] || equal(pv5,pv5) equal(skc3,n0)** -> .
% 1.47/1.64  5846[3:Rew:5833.0,108.0] || equal(pv5,pv5) equal(skc3,n1)** -> .
% 1.47/1.64  5847[3:Rew:5833.0,109.0] || equal(pv5,pv5) equal(skc3,n2)** -> .
% 1.47/1.64  5972[3:Obv:5845.0] || equal(skc3,n0)** -> .
% 1.47/1.64  5981[3:Obv:5846.0] || equal(skc3,n1)** -> .
% 1.47/1.64  5982[3:Obv:5847.0] || equal(skc3,n2)** -> .
% 1.47/1.64  5983[3:MRR:5238.1,5982.0] ||  -> gt(n2,skc3)*r.
% 1.47/1.64  6142[3:Res:5983.0,112.0] ||  -> leq(skc3,pred(n2))*r.
% 1.47/1.64  6153[3:Rew:677.0,6142.0] ||  -> leq(skc3,n1)*l.
% 1.47/1.64  6154[3:Res:6153.0,134.0] ||  -> gt(n1,skc3)*r equal(skc3,n1).
% 1.47/1.64  6168[3:MRR:6154.1,5981.0] ||  -> gt(n1,skc3)*r.
% 1.47/1.64  6170[3:Res:6168.0,112.0] ||  -> leq(skc3,pred(n1))*r.
% 1.47/1.64  6181[3:Rew:676.0,6170.0] ||  -> leq(skc3,n0)*l.
% 1.47/1.64  6193[3:NCh:140.2,140.0,6181.0,138.0] || leq(n0,n0) leq(n0,skc3)*r -> equal(skc3,n0).
% 1.47/1.64  6201[3:MRR:6193.0,6193.1,6193.2,37.0,2.0,5972.0] ||  -> .
% 1.47/1.64  6202[3:Spt:6201.0,336.1,5833.0] || equal(skc2,pv5)** -> .
% 1.47/1.64  6203[3:Spt:6201.0,336.0] ||  -> gt(pv5,skc2)*r.
% 1.47/1.64  6204[3:Res:6203.0,112.0] ||  -> leq(skc2,pred(pv5))*r.
% 1.47/1.64  6214[3:MRR:6204.0,383.0] ||  -> .
% 1.47/1.64  % SZS output end Refutation
% 1.47/1.64  Formulae used in the proof : quaternion_ds1_inuse_0014 reflexivity_leq successor_1 successor_2 pred_succ leq_gt_pred leq_gt2 finite_domain_0 transitivity_leq finite_domain_1
% 1.47/1.64  
%------------------------------------------------------------------------------