TSTP Solution File: SWC124-1 by SPASS---3.9

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : SWC124-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm  : none
% Format   : tptp
% Command  : run_spass %d %s

% Computer : n013.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 : Tue Jul 19 22:01:52 EDT 2022

% Result   : Unsatisfiable 46.81s 46.99s
% Output   : Refutation 57.44s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12  % Problem  : SWC124-1 : TPTP v8.1.0. Released v2.4.0.
% 0.12/0.13  % Command  : run_spass %d %s
% 0.12/0.34  % Computer : n013.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 600
% 0.12/0.34  % DateTime : Sun Jun 12 07:26:28 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 46.81/46.99  
% 46.81/46.99  SPASS V 3.9 
% 46.81/46.99  SPASS beiseite: Proof found.
% 46.81/46.99  % SZS status Theorem
% 46.81/46.99  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 46.81/46.99  SPASS derived 30285 clauses, backtracked 16886 clauses, performed 126 splits and kept 22576 clauses.
% 46.81/46.99  SPASS allocated 112759 KBytes.
% 46.81/46.99  SPASS spent	0:0:46.57 on the problem.
% 46.81/46.99  		0:00:00.04 for the input.
% 46.81/46.99  		0:00:00.00 for the FLOTTER CNF translation.
% 46.81/46.99  		0:00:00.44 for inferences.
% 46.81/46.99  		0:00:01.99 for the backtracking.
% 46.81/46.99  		0:0:43.61 for the reduction.
% 46.81/46.99  
% 46.81/46.99  
% 46.81/46.99  Here is a proof with depth 3, length 138 :
% 46.81/46.99  % SZS output start Refutation
% 46.81/46.99  1[0:Inp] ||  -> ssList(sk1)*.
% 46.81/46.99  2[0:Inp] ||  -> ssList(sk2)*.
% 46.81/46.99  5[0:Inp] ||  -> equal(sk4,sk2)**.
% 46.81/46.99  6[0:Inp] ||  -> equal(sk3,sk1)**.
% 46.81/46.99  7[0:Inp] ||  -> neq(sk2,nil)*.
% 46.81/46.99  8[0:Inp] ||  -> ssList(sk5)*.
% 46.81/46.99  9[0:Inp] ||  -> equal(app(sk3,sk5),sk4)**.
% 46.81/46.99  10[0:Inp] ||  -> totalorderedP(sk3)*.
% 46.81/46.99  12[0:Inp] || equal(nil,sk3) -> equal(sk4,nil)**.
% 46.81/46.99  13[0:Inp] || segmentP(sk2,sk1)* neq(sk1,nil) -> .
% 46.81/46.99  14[0:Inp] ||  -> equalelemsP(nil)*.
% 46.81/46.99  15[0:Inp] ||  -> duplicatefreeP(nil)*.
% 46.81/46.99  16[0:Inp] ||  -> strictorderedP(nil)*.
% 46.81/46.99  17[0:Inp] ||  -> totalorderedP(nil)*.
% 46.81/46.99  18[0:Inp] ||  -> strictorderP(nil)*.
% 46.81/46.99  19[0:Inp] ||  -> totalorderP(nil)*.
% 46.81/46.99  20[0:Inp] ||  -> cyclefreeP(nil)*.
% 46.81/46.99  21[0:Inp] ||  -> ssList(nil)*.
% 46.81/46.99  63[0:Inp] ||  -> ssList(skaf46(u,v))*.
% 46.81/46.99  71[0:Inp] ssList(u) ||  -> rearsegP(u,nil)*.
% 46.81/46.99  85[0:Inp] ssList(u) ||  -> ssItem(v)* duplicatefreeP(u)*.
% 46.81/46.99  86[0:Inp] ssList(u) ||  -> equal(app(u,nil),u)**.
% 46.81/46.99  87[0:Inp] ssList(u) ||  -> equal(app(nil,u),u)**.
% 46.81/46.99  90[0:Inp] ssList(u) ||  -> ssList(tl(u))* equal(nil,u).
% 46.81/46.99  96[0:Inp] ssList(u) || equal(nil,u) -> frontsegP(nil,u)*.
% 46.81/46.99  98[0:Inp] ssList(u) ssList(v) ||  -> ssList(app(u,v))*.
% 46.81/46.99  113[0:Inp] ssList(u) ssList(v) ||  -> equal(u,v) neq(u,v)*.
% 46.81/46.99  115[0:Inp] ssItem(u) ssItem(v) ||  -> equal(u,v) neq(u,v)*.
% 46.81/46.99  130[0:Inp] ssItem(u) ssItem(v) || neq(u,v)* equal(u,v) -> .
% 46.81/46.99  131[0:Inp] ssList(u) ssList(v) || equal(app(u,v),nil)** -> equal(nil,u).
% 46.81/46.99  142[0:Inp] ssList(u) ssList(v) || frontsegP(u,v)*+ frontsegP(v,u)* -> equal(u,v).
% 46.81/46.99  144[0:Inp] ssList(u) ssList(v) || rearsegP(u,v) -> equal(app(skaf46(u,v),v),u)**.
% 46.81/46.99  147[0:Inp] ssItem(u) ssList(v) || strictorderedP(cons(u,v)) -> lt(u,hd(v))* equal(nil,v).
% 46.81/46.99  156[0:Inp] ssList(u) ssList(v) ssList(w) || equal(app(w,v),u)*+ -> rearsegP(u,v)*.
% 46.81/46.99  157[0:Inp] ssList(u) ssList(v) ssList(w) || equal(app(v,w),u)*+ -> frontsegP(u,v)*.
% 46.81/46.99  162[0:Inp] ssList(u) ssList(v) ssList(w) ||  -> equal(app(app(u,v),w),app(u,app(v,w)))**.
% 46.81/46.99  163[0:Inp] ssList(u) ssList(v) ssList(w) || equal(app(v,w),app(v,u))* -> equal(w,u).
% 46.81/46.99  164[0:Inp] ssList(u) ssList(v) ssList(w) || equal(app(w,v),app(u,v))* -> equal(w,u).
% 46.81/46.99  186[0:Inp] ssList(u) ssList(v) ssList(w) ssList(x) || equal(app(app(v,w),u),x)* -> segmentP(x,w)*.
% 46.81/46.99  199[0:Rew:6.0,10.0] ||  -> totalorderedP(sk1)*.
% 46.81/46.99  202[0:Rew:6.0,9.0,5.0,9.0] ||  -> equal(app(sk1,sk5),sk2)**.
% 46.81/46.99  203[0:Rew:5.0,12.1,6.0,12.0] || equal(nil,sk1)** -> equal(nil,sk2).
% 46.81/46.99  207[0:Rew:162.3,186.4] ssList(u) ssList(v) ssList(w) ssList(x) || equal(app(w,app(v,x)),u)*+ -> segmentP(u,v)*.
% 46.81/46.99  242[0:Res:8.0,147.0] ssItem(u) || strictorderedP(cons(u,sk5)) -> lt(u,hd(sk5))* equal(sk5,nil).
% 46.81/46.99  286[0:Res:8.0,90.0] ||  -> ssList(tl(sk5))* equal(sk5,nil).
% 46.81/46.99  290[0:Res:8.0,85.0] ||  -> ssItem(u)* duplicatefreeP(sk5)*.
% 46.81/46.99  454[0:Res:2.0,96.0] || equal(nil,sk2) -> frontsegP(nil,sk2)*.
% 46.81/46.99  462[0:Res:2.0,87.0] ||  -> equal(app(nil,sk2),sk2)**.
% 46.81/46.99  463[0:Res:2.0,85.0] ||  -> ssItem(u)* duplicatefreeP(sk2)*.
% 46.81/46.99  466[0:Res:2.0,71.0] ||  -> rearsegP(sk2,nil)*.
% 46.81/46.99  506[0:Res:2.0,144.1] ssList(u) || rearsegP(sk2,u) -> equal(app(skaf46(sk2,u),u),sk2)**.
% 46.81/46.99  557[1:Spt:85.1] ||  -> ssItem(u)*.
% 46.81/46.99  587[1:MRR:115.1,115.0,557.0] ||  -> equal(u,v) neq(u,v)*.
% 46.81/46.99  597[1:MRR:130.1,130.0,557.0] || neq(u,v)* equal(u,v) -> .
% 46.81/46.99  2955[1:Res:7.0,597.0] || equal(nil,sk2)** -> .
% 46.81/46.99  3454[0:SpL:202.0,131.2] ssList(sk1) ssList(sk5) || equal(nil,sk2)** -> equal(nil,sk1).
% 46.81/46.99  4709[0:EqR:156.3] ssList(app(u,v)) ssList(v) ssList(u) ||  -> rearsegP(app(u,v),v)*.
% 46.81/46.99  4722[0:SSi:4709.0,98.2] ssList(u) ssList(v) ||  -> rearsegP(app(v,u),u)*.
% 46.81/46.99  4943[0:EqR:157.3] ssList(app(u,v)) ssList(u) ssList(v) ||  -> frontsegP(app(u,v),u)*.
% 46.81/46.99  4956[0:SSi:4943.0,98.2] ssList(u) ssList(v) ||  -> frontsegP(app(u,v),u)*.
% 46.81/46.99  5367[0:SpL:86.1,163.3] ssList(u) ssList(nil) ssList(u) ssList(v) || equal(app(u,v),u)** -> equal(v,nil).
% 46.81/46.99  5387[0:Obv:5367.0] ssList(nil) ssList(u) ssList(v) || equal(app(u,v),u)** -> equal(v,nil).
% 46.81/46.99  5388[0:SSi:5387.0,21.0,20.0,19.0,18.0,17.0,16.0,15.0,14.0] ssList(u) ssList(v) || equal(app(u,v),u)** -> equal(v,nil).
% 46.81/46.99  6537[0:SpL:202.0,164.3] ssList(sk1) ssList(sk5) ssList(u) || equal(app(u,sk5),sk2)** -> equal(u,sk1).
% 46.81/46.99  6898[0:EqR:207.4] ssList(app(u,app(v,w))) ssList(v) ssList(u) ssList(w) ||  -> segmentP(app(u,app(v,w)),v)*.
% 46.81/46.99  6932[0:SSi:6898.0,98.2,98.2] ssList(u) ssList(v) ssList(w) ||  -> segmentP(app(v,app(u,w)),u)*.
% 46.81/46.99  8835[0:SpR:202.0,4722.2] ssList(sk5) ssList(sk1) ||  -> rearsegP(sk2,sk5)*.
% 46.81/46.99  8911[0:SpR:202.0,4956.2] ssList(sk1) ssList(sk5) ||  -> frontsegP(sk2,sk1)*.
% 46.81/46.99  11237[0:SpR:506.2,86.1] ssList(nil) ssList(skaf46(sk2,nil)) || rearsegP(sk2,nil) -> equal(skaf46(sk2,nil),sk2)**.
% 46.81/46.99  17628[0:SpL:202.0,5388.2] ssList(sk1) ssList(sk5) || equal(sk2,sk1) -> equal(sk5,nil)**.
% 46.81/46.99  27959[0:SpR:202.0,6932.3] ssList(sk1) ssList(u) ssList(sk5) ||  -> segmentP(app(u,sk2),sk1)*.
% 46.81/46.99  33735[0:SSi:11237.1,11237.0,63.0,2.0,21.0,20.0,19.0,18.0,17.0,16.0,15.0,14.0,21.0,20.0,19.0,18.0,17.0,16.0,15.0,14.0] || rearsegP(sk2,nil) -> equal(skaf46(sk2,nil),sk2)**.
% 46.81/46.99  33736[0:MRR:33735.0,466.0] ||  -> equal(skaf46(sk2,nil),sk2)**.
% 46.81/46.99  36852[0:SSi:8835.1,8835.0,199.0,1.0,8.0] ||  -> rearsegP(sk2,sk5)*.
% 46.81/46.99  36853[0:SSi:8911.1,8911.0,8.0,199.0,1.0] ||  -> frontsegP(sk2,sk1)*.
% 46.81/46.99  36874[0:SSi:17628.1,17628.0,8.0,199.0,1.0] || equal(sk2,sk1) -> equal(sk5,nil)**.
% 46.81/46.99  36905[0:SSi:27959.2,27959.0,8.0,199.0,1.0] ssList(u) ||  -> segmentP(app(u,sk2),sk1)*.
% 46.81/46.99  36951[0:SSi:6537.1,6537.0,8.0,199.0,1.0] ssList(u) || equal(app(u,sk5),sk2)** -> equal(u,sk1).
% 46.81/46.99  37369[0:Res:36853.0,142.2] ssList(sk2) ssList(sk1) || frontsegP(sk1,sk2)* -> equal(sk2,sk1).
% 46.81/46.99  38536[0:SpL:506.2,36951.1] ssList(sk5) ssList(skaf46(sk2,sk5)) || rearsegP(sk2,sk5) equal(sk2,sk2) -> equal(skaf46(sk2,sk5),sk1)**.
% 46.81/46.99  38551[0:Obv:38536.3] ssList(sk5) ssList(skaf46(sk2,sk5)) || rearsegP(sk2,sk5) -> equal(skaf46(sk2,sk5),sk1)**.
% 46.81/46.99  40075[0:SpR:462.0,36905.1] ssList(nil) ||  -> segmentP(sk2,sk1)*.
% 46.81/46.99  40085[0:SSi:40075.0,21.0,20.0,19.0,18.0,17.0,16.0,15.0,14.0] ||  -> segmentP(sk2,sk1)*.
% 46.81/46.99  40086[0:MRR:13.0,40085.0] || neq(sk1,nil)* -> .
% 46.81/46.99  40108[1:Res:587.1,40086.0] ||  -> equal(nil,sk1)**.
% 46.81/46.99  43555[1:Rew:40108.0,2955.0] || equal(sk2,sk1)** -> .
% 46.81/46.99  43597[1:Rew:40108.0,203.1,40108.0,203.0] || equal(sk1,sk1) -> equal(sk2,sk1)**.
% 46.81/46.99  43598[1:Obv:43597.0] ||  -> equal(sk2,sk1)**.
% 46.81/46.99  43599[1:MRR:43598.0,43555.0] ||  -> .
% 46.81/46.99  45084[1:Spt:43599.0,85.0,85.2] ssList(u) ||  -> duplicatefreeP(u)*.
% 46.81/46.99  45110[0:SSi:37369.1,199.0,1.0] ssList(sk2) || frontsegP(sk1,sk2)* -> equal(sk2,sk1).
% 46.81/46.99  45111[0:MRR:45110.0,2.0] || frontsegP(sk1,sk2)* -> equal(sk2,sk1).
% 46.81/46.99  45112[0:SSi:3454.0,199.0,1.0] ssList(sk5) || equal(nil,sk2)** -> equal(nil,sk1).
% 46.81/46.99  45113[0:MRR:45112.0,8.0] || equal(nil,sk2)** -> equal(nil,sk1).
% 46.81/46.99  45115[0:Rew:45113.1,454.1] || equal(nil,sk2) -> frontsegP(sk1,sk2)*.
% 46.81/46.99  45134[0:SSi:38551.1,63.0] ssList(sk5) || rearsegP(sk2,sk5) -> equal(skaf46(sk2,sk5),sk1)**.
% 46.81/46.99  45135[0:MRR:45134.0,45134.1,8.0,36852.0] ||  -> equal(skaf46(sk2,sk5),sk1)**.
% 46.81/46.99  45435[2:Spt:463.0] ||  -> ssItem(u)*.
% 46.81/46.99  45463[2:MRR:115.1,115.0,45435.0] ||  -> equal(u,v) neq(u,v)*.
% 46.81/46.99  45829[3:Spt:286.1] ||  -> equal(sk5,nil)**.
% 46.81/46.99  45845[3:Rew:45829.0,45135.0] ||  -> equal(skaf46(sk2,nil),sk1)**.
% 46.81/46.99  46234[3:Rew:33736.0,45845.0] ||  -> equal(sk2,sk1)**.
% 46.81/46.99  46241[3:Rew:46234.0,7.0] ||  -> neq(sk1,nil)*.
% 46.81/46.99  46595[3:MRR:46241.0,40086.0] ||  -> .
% 46.81/46.99  47141[3:Spt:46595.0,286.1,45829.0] || equal(sk5,nil)** -> .
% 46.81/46.99  47142[3:Spt:46595.0,286.0] ||  -> ssList(tl(sk5))*.
% 46.81/46.99  47146[3:MRR:36874.1,47141.0] || equal(sk2,sk1)** -> .
% 46.81/46.99  47148[3:MRR:45111.1,47146.0] || frontsegP(sk1,sk2)* -> .
% 46.81/46.99  47149[3:MRR:45115.1,47148.0] || equal(nil,sk2)** -> .
% 46.81/46.99  47154[3:MRR:203.1,47149.0] || equal(nil,sk1)** -> .
% 46.81/46.99  47246[2:Res:45463.1,40086.0] ||  -> equal(nil,sk1)**.
% 46.81/46.99  47247[3:MRR:47246.0,47154.0] ||  -> .
% 46.81/46.99  47248[2:Spt:47247.0,463.1] ||  -> duplicatefreeP(sk2)*.
% 46.81/46.99  47251[3:Spt:290.0] ||  -> ssItem(u)*.
% 46.81/46.99  47281[3:MRR:115.1,115.0,47251.0] ||  -> equal(u,v) neq(u,v)*.
% 46.81/46.99  47454[3:Res:47281.1,40086.0] ||  -> equal(nil,sk1)**.
% 46.81/46.99  47464[3:Rew:47454.0,40086.0] || neq(sk1,sk1)* -> .
% 57.44/57.67  47474[3:Rew:47454.0,7.0] ||  -> neq(sk2,sk1)*.
% 57.44/57.67  47710[3:Rew:47454.0,203.1] || equal(nil,sk1)** -> equal(sk2,sk1).
% 57.44/57.67  48110[3:Rew:47454.0,47710.0] || equal(sk1,sk1) -> equal(sk2,sk1)**.
% 57.44/57.67  48111[3:Obv:48110.0] ||  -> equal(sk2,sk1)**.
% 57.44/57.67  48385[3:Rew:48111.0,47474.0] ||  -> neq(sk1,sk1)*.
% 57.44/57.67  48393[3:MRR:48385.0,47464.0] ||  -> .
% 57.44/57.67  49126[3:Spt:48393.0,290.1] ||  -> duplicatefreeP(sk5)*.
% 57.44/57.67  49127[4:Spt:242.3] ||  -> equal(sk5,nil)**.
% 57.44/57.67  49141[4:Rew:49127.0,45135.0] ||  -> equal(skaf46(sk2,nil),sk1)**.
% 57.44/57.67  49536[4:Rew:33736.0,49141.0] ||  -> equal(sk2,sk1)**.
% 57.44/57.67  49542[4:Rew:49536.0,7.0] ||  -> neq(sk1,nil)*.
% 57.44/57.67  49901[4:MRR:49542.0,40086.0] ||  -> .
% 57.44/57.67  50455[4:Spt:49901.0,242.3,49127.0] || equal(sk5,nil)** -> .
% 57.44/57.67  50456[4:Spt:49901.0,242.0,242.1,242.2] ssItem(u) || strictorderedP(cons(u,sk5)) -> lt(u,hd(sk5))*.
% 57.44/57.67  50462[4:MRR:36874.1,50455.0] || equal(sk2,sk1)** -> .
% 57.44/57.67  50464[4:MRR:45111.1,50462.0] || frontsegP(sk1,sk2)* -> .
% 57.44/57.67  50465[4:MRR:45115.1,50464.0] || equal(nil,sk2)** -> .
% 57.44/57.67  50468[4:MRR:203.1,50465.0] || equal(nil,sk1)** -> .
% 57.44/57.67  51218[0:Res:113.3,40086.0] ssList(sk1) ssList(nil) ||  -> equal(nil,sk1)**.
% 57.44/57.67  51219[0:SSi:51218.1,51218.0,21.0,20.0,19.0,18.0,17.0,16.0,15.0,14.0,199.0,1.0] ||  -> equal(nil,sk1)**.
% 57.44/57.67  51220[4:MRR:51219.0,50468.0] ||  -> .
% 57.44/57.67  % SZS output end Refutation
% 57.44/57.67  Formulae used in the proof : co1_1 co1_2 co1_5 co1_6 co1_7 co1_8 co1_9 co1_10 co1_12 co1_13 clause1 clause2 clause3 clause4 clause5 clause6 clause7 clause8 clause50 clause58 clause72 clause73 clause74 clause77 clause83 clause85 clause100 clause102 clause117 clause118 clause129 clause131 clause134 clause143 clause144 clause149 clause150 clause151 clause173
% 57.44/57.67  
%------------------------------------------------------------------------------