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

View Problem - Process Solution

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

% Computer : n026.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:03:22 EDT 2022

% Result   : Theorem 0.80s 1.02s
% Output   : Refutation 0.80s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SWC332+1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.12  % Command  : run_spass %d %s
% 0.12/0.34  % Computer : n026.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 13:36:35 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.80/1.02  
% 0.80/1.02  SPASS V 3.9 
% 0.80/1.02  SPASS beiseite: Proof found.
% 0.80/1.02  % SZS status Theorem
% 0.80/1.02  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 0.80/1.02  SPASS derived 883 clauses, backtracked 645 clauses, performed 52 splits and kept 1430 clauses.
% 0.80/1.02  SPASS allocated 99025 KBytes.
% 0.80/1.02  SPASS spent	0:00:00.68 on the problem.
% 0.80/1.02  		0:00:00.04 for the input.
% 0.80/1.02  		0:00:00.07 for the FLOTTER CNF translation.
% 0.80/1.02  		0:00:00.00 for inferences.
% 0.80/1.02  		0:00:00.01 for the backtracking.
% 0.80/1.02  		0:00:00.39 for the reduction.
% 0.80/1.02  
% 0.80/1.02  
% 0.80/1.02  Here is a proof with depth 2, length 152 :
% 0.80/1.02  % SZS output start Refutation
% 0.80/1.02  1[0:Inp] ||  -> ssList(skc5)*.
% 0.80/1.02  2[0:Inp] ||  -> ssList(skc4)*.
% 0.80/1.02  5[0:Inp] ||  -> ssList(nil)*.
% 0.80/1.02  6[0:Inp] ||  -> cyclefreeP(nil)*.
% 0.80/1.02  7[0:Inp] ||  -> totalorderP(nil)*.
% 0.80/1.02  8[0:Inp] ||  -> strictorderP(nil)*.
% 0.80/1.02  9[0:Inp] ||  -> totalorderedP(nil)*.
% 0.80/1.02  10[0:Inp] ||  -> strictorderedP(nil)*.
% 0.80/1.02  11[0:Inp] ||  -> duplicatefreeP(nil)*.
% 0.80/1.02  12[0:Inp] ||  -> equalelemsP(nil)*.
% 0.80/1.02  13[0:Inp] ||  -> segmentP(skc5,skc4)*.
% 0.80/1.02  14[0:Inp] ||  -> ssItem(skf45(u))*.
% 0.80/1.02  59[0:Inp] || neq(skc5,nil)* -> singletonP(skc4).
% 0.80/1.02  68[0:Inp] || segmentP(skc5,skc4)* equalelemsP(skc4) -> .
% 0.80/1.02  70[0:Inp] ssItem(u) ||  -> cyclefreeP(cons(u,nil))*.
% 0.80/1.02  71[0:Inp] ssItem(u) ||  -> totalorderP(cons(u,nil))*.
% 0.80/1.02  72[0:Inp] ssItem(u) ||  -> strictorderP(cons(u,nil))*.
% 0.80/1.02  73[0:Inp] ssItem(u) ||  -> totalorderedP(cons(u,nil))*.
% 0.80/1.02  74[0:Inp] ssItem(u) ||  -> strictorderedP(cons(u,nil))*.
% 0.80/1.02  76[0:Inp] ssItem(u) ||  -> equalelemsP(cons(u,nil))*.
% 0.80/1.02  84[0:Inp] ssList(u) ||  -> cyclefreeP(u) leq(skf51(u),skf50(u))*.
% 0.80/1.02  93[0:Inp] ssList(u) || segmentP(nil,u)* -> equal(nil,u).
% 0.80/1.02  103[0:Inp] ssList(u) singletonP(u) ||  -> equal(cons(skf45(u),nil),u)**.
% 0.80/1.02  104[0:Inp] ssList(u) ssList(v) ||  -> neq(v,u)* equal(v,u).
% 0.80/1.02  149[0:Inp] ssList(u) ssItem(v) || strictorderedP(cons(v,u))* -> lt(v,hd(u)) equal(nil,u).
% 0.80/1.02  169[0:Inp] ssList(u) ||  -> strictorderedP(u) equal(app(app(skf72(u),cons(skf70(u),skf73(u))),cons(skf71(u),skf74(u))),u)**.
% 0.80/1.02  170[0:Inp] ssList(u) ||  -> totalorderedP(u) equal(app(app(skf67(u),cons(skf65(u),skf68(u))),cons(skf66(u),skf69(u))),u)**.
% 0.80/1.02  171[0:Inp] ssList(u) ||  -> strictorderP(u) equal(app(app(skf62(u),cons(skf60(u),skf63(u))),cons(skf61(u),skf64(u))),u)**.
% 0.80/1.02  172[0:Inp] ssList(u) ||  -> totalorderP(u) equal(app(app(skf57(u),cons(skf55(u),skf58(u))),cons(skf56(u),skf59(u))),u)**.
% 0.80/1.02  192[0:MRR:68.0,13.0] || equalelemsP(skc4)* -> .
% 0.80/1.02  214[0:Res:2.0,172.0] ||  -> totalorderP(skc4) equal(app(app(skf57(skc4),cons(skf55(skc4),skf58(skc4))),cons(skf56(skc4),skf59(skc4))),skc4)**.
% 0.80/1.02  215[0:Res:2.0,171.0] ||  -> strictorderP(skc4) equal(app(app(skf62(skc4),cons(skf60(skc4),skf63(skc4))),cons(skf61(skc4),skf64(skc4))),skc4)**.
% 0.80/1.02  216[0:Res:2.0,170.0] ||  -> totalorderedP(skc4) equal(app(app(skf67(skc4),cons(skf65(skc4),skf68(skc4))),cons(skf66(skc4),skf69(skc4))),skc4)**.
% 0.80/1.02  217[0:Res:2.0,169.0] ||  -> strictorderedP(skc4) equal(app(app(skf72(skc4),cons(skf70(skc4),skf73(skc4))),cons(skf71(skc4),skf74(skc4))),skc4)**.
% 0.80/1.02  247[0:Res:2.0,103.1] singletonP(skc4) ||  -> equal(cons(skf45(skc4),nil),skc4)**.
% 0.80/1.02  260[0:Res:2.0,84.0] ||  -> cyclefreeP(skc4) leq(skf51(skc4),skf50(skc4))*.
% 0.80/1.02  269[0:Res:2.0,93.0] || segmentP(nil,skc4)* -> equal(skc4,nil).
% 0.80/1.02  304[0:Res:2.0,149.1] ssItem(u) || strictorderedP(cons(u,skc4))* -> lt(u,hd(skc4)) equal(skc4,nil).
% 0.80/1.02  419[0:Res:1.0,104.0] ssList(u) ||  -> neq(skc5,u)* equal(skc5,u).
% 0.80/1.02  475[0:Res:1.0,149.1] ssItem(u) || strictorderedP(cons(u,skc5))* -> lt(u,hd(skc5)) equal(skc5,nil).
% 0.80/1.02  550[1:Spt:304.3] ||  -> equal(skc4,nil)**.
% 0.80/1.02  555[1:Rew:550.0,192.0] || equalelemsP(nil)* -> .
% 0.80/1.02  704[1:MRR:555.0,12.0] ||  -> .
% 0.80/1.02  808[1:Spt:704.0,304.3,550.0] || equal(skc4,nil)** -> .
% 0.80/1.02  809[1:Spt:704.0,304.0,304.1,304.2] ssItem(u) || strictorderedP(cons(u,skc4))* -> lt(u,hd(skc4)).
% 0.80/1.02  812[1:MRR:269.1,808.0] || segmentP(nil,skc4)* -> .
% 0.80/1.02  823[2:Spt:475.3] ||  -> equal(skc5,nil)**.
% 0.80/1.02  974[2:Rew:823.0,13.0] ||  -> segmentP(nil,skc4)*.
% 0.80/1.02  976[2:MRR:974.0,812.0] ||  -> .
% 0.80/1.02  1080[2:Spt:976.0,475.3,823.0] || equal(skc5,nil)** -> .
% 0.80/1.02  1081[2:Spt:976.0,475.0,475.1,475.2] ssItem(u) || strictorderedP(cons(u,skc5))* -> lt(u,hd(skc5)).
% 0.80/1.02  1095[3:Spt:217.0] ||  -> strictorderedP(skc4)*.
% 0.80/1.02  1098[4:Spt:216.0] ||  -> totalorderedP(skc4)*.
% 0.80/1.02  1109[5:Spt:260.0] ||  -> cyclefreeP(skc4)*.
% 0.80/1.02  1113[6:Spt:215.0] ||  -> strictorderP(skc4)*.
% 0.80/1.02  1114[7:Spt:214.0] ||  -> totalorderP(skc4)*.
% 0.80/1.02  1118[8:Spt:59.0] || neq(skc5,nil)* -> .
% 0.80/1.02  1163[8:Res:419.1,1118.0] ssList(nil) ||  -> equal(skc5,nil)**.
% 0.80/1.02  1164[8:SSi:1163.0,12.0,11.0,8.0,7.0,6.0,10.0,9.0,5.0] ||  -> equal(skc5,nil)**.
% 0.80/1.02  1165[8:MRR:1164.0,1080.0] ||  -> .
% 0.80/1.02  1166[8:Spt:1165.0,59.0,1118.0] ||  -> neq(skc5,nil)*.
% 0.80/1.02  1167[8:Spt:1165.0,59.1] ||  -> singletonP(skc4)*.
% 0.80/1.02  1168[8:MRR:247.0,1167.0] ||  -> equal(cons(skf45(skc4),nil),skc4)**.
% 0.80/1.02  1169[8:SpR:1168.0,76.1] ssItem(skf45(skc4)) ||  -> equalelemsP(skc4)*.
% 0.80/1.02  1177[8:SSi:1169.0,14.0,1095.0,1098.0,1109.0,1113.0,1114.0,2.0,1167.0] ||  -> equalelemsP(skc4)*.
% 0.80/1.02  1178[8:MRR:1177.0,192.0] ||  -> .
% 0.80/1.02  1181[7:Spt:1178.0,214.0,1114.0] || totalorderP(skc4)* -> .
% 0.80/1.02  1182[7:Spt:1178.0,214.1] ||  -> equal(app(app(skf57(skc4),cons(skf55(skc4),skf58(skc4))),cons(skf56(skc4),skf59(skc4))),skc4)**.
% 0.80/1.02  1188[8:Spt:59.0] || neq(skc5,nil)* -> .
% 0.80/1.02  1189[8:Res:419.1,1188.0] ssList(nil) ||  -> equal(skc5,nil)**.
% 0.80/1.02  1190[8:SSi:1189.0,12.0,11.0,8.0,7.0,6.0,10.0,9.0,5.0] ||  -> equal(skc5,nil)**.
% 0.80/1.02  1191[8:MRR:1190.0,1080.0] ||  -> .
% 0.80/1.02  1192[8:Spt:1191.0,59.0,1188.0] ||  -> neq(skc5,nil)*.
% 0.80/1.02  1193[8:Spt:1191.0,59.1] ||  -> singletonP(skc4)*.
% 0.80/1.02  1194[8:MRR:247.0,1193.0] ||  -> equal(cons(skf45(skc4),nil),skc4)**.
% 0.80/1.02  1201[8:SpR:1194.0,71.1] ssItem(skf45(skc4)) ||  -> totalorderP(skc4)*.
% 0.80/1.02  1210[8:SSi:1201.0,14.0,1095.0,1098.0,1109.0,1113.0,2.0,1193.0] ||  -> totalorderP(skc4)*.
% 0.80/1.02  1211[8:MRR:1210.0,1181.0] ||  -> .
% 0.80/1.02  1212[6:Spt:1211.0,215.0,1113.0] || strictorderP(skc4)* -> .
% 0.80/1.02  1213[6:Spt:1211.0,215.1] ||  -> equal(app(app(skf62(skc4),cons(skf60(skc4),skf63(skc4))),cons(skf61(skc4),skf64(skc4))),skc4)**.
% 0.80/1.02  1219[7:Spt:59.0] || neq(skc5,nil)* -> .
% 0.80/1.02  1220[7:Res:419.1,1219.0] ssList(nil) ||  -> equal(skc5,nil)**.
% 0.80/1.02  1221[7:SSi:1220.0,12.0,11.0,8.0,7.0,6.0,10.0,9.0,5.0] ||  -> equal(skc5,nil)**.
% 0.80/1.02  1222[7:MRR:1221.0,1080.0] ||  -> .
% 0.80/1.02  1223[7:Spt:1222.0,59.0,1219.0] ||  -> neq(skc5,nil)*.
% 0.80/1.02  1224[7:Spt:1222.0,59.1] ||  -> singletonP(skc4)*.
% 0.80/1.02  1225[7:MRR:247.0,1224.0] ||  -> equal(cons(skf45(skc4),nil),skc4)**.
% 0.80/1.02  1232[7:SpR:1225.0,72.1] ssItem(skf45(skc4)) ||  -> strictorderP(skc4)*.
% 0.80/1.02  1249[7:SSi:1232.0,14.0,1095.0,1098.0,1109.0,2.0,1224.0] ||  -> strictorderP(skc4)*.
% 0.80/1.02  1250[7:MRR:1249.0,1212.0] ||  -> .
% 0.80/1.02  1256[5:Spt:1250.0,260.0,1109.0] || cyclefreeP(skc4)* -> .
% 0.80/1.02  1257[5:Spt:1250.0,260.1] ||  -> leq(skf51(skc4),skf50(skc4))*.
% 0.80/1.02  1262[6:Spt:214.0] ||  -> totalorderP(skc4)*.
% 0.80/1.02  1263[7:Spt:59.0] || neq(skc5,nil)* -> .
% 0.80/1.02  1264[7:Res:419.1,1263.0] ssList(nil) ||  -> equal(skc5,nil)**.
% 0.80/1.02  1265[7:SSi:1264.0,12.0,11.0,8.0,7.0,6.0,10.0,9.0,5.0] ||  -> equal(skc5,nil)**.
% 0.80/1.02  1266[7:MRR:1265.0,1080.0] ||  -> .
% 0.80/1.02  1267[7:Spt:1266.0,59.0,1263.0] ||  -> neq(skc5,nil)*.
% 0.80/1.02  1268[7:Spt:1266.0,59.1] ||  -> singletonP(skc4)*.
% 0.80/1.02  1269[7:MRR:247.0,1268.0] ||  -> equal(cons(skf45(skc4),nil),skc4)**.
% 0.80/1.02  1277[7:SpR:1269.0,70.1] ssItem(skf45(skc4)) ||  -> cyclefreeP(skc4)*.
% 0.80/1.02  1294[7:SSi:1277.0,14.0,1095.0,1098.0,2.0,1262.0,1268.0] ||  -> cyclefreeP(skc4)*.
% 0.80/1.02  1295[7:MRR:1294.0,1256.0] ||  -> .
% 0.80/1.02  1299[6:Spt:1295.0,214.0,1262.0] || totalorderP(skc4)* -> .
% 0.80/1.02  1300[6:Spt:1295.0,214.1] ||  -> equal(app(app(skf57(skc4),cons(skf55(skc4),skf58(skc4))),cons(skf56(skc4),skf59(skc4))),skc4)**.
% 0.80/1.02  1304[7:Spt:215.0] ||  -> strictorderP(skc4)*.
% 0.80/1.02  1306[8:Spt:59.0] || neq(skc5,nil)* -> .
% 0.80/1.02  1307[8:Res:419.1,1306.0] ssList(nil) ||  -> equal(skc5,nil)**.
% 0.80/1.02  1308[8:SSi:1307.0,12.0,11.0,8.0,7.0,6.0,10.0,9.0,5.0] ||  -> equal(skc5,nil)**.
% 0.80/1.02  1309[8:MRR:1308.0,1080.0] ||  -> .
% 0.80/1.02  1310[8:Spt:1309.0,59.0,1306.0] ||  -> neq(skc5,nil)*.
% 0.80/1.02  1311[8:Spt:1309.0,59.1] ||  -> singletonP(skc4)*.
% 0.80/1.02  1312[8:MRR:247.0,1311.0] ||  -> equal(cons(skf45(skc4),nil),skc4)**.
% 0.80/1.02  1318[8:SpR:1312.0,70.1] ssItem(skf45(skc4)) ||  -> cyclefreeP(skc4)*.
% 0.80/1.02  1328[8:SSi:1318.0,14.0,1095.0,1098.0,2.0,1304.0,1311.0] ||  -> cyclefreeP(skc4)*.
% 0.80/1.02  1329[8:MRR:1328.0,1256.0] ||  -> .
% 0.80/1.02  1330[7:Spt:1329.0,215.0,1304.0] || strictorderP(skc4)* -> .
% 0.80/1.02  1331[7:Spt:1329.0,215.1] ||  -> equal(app(app(skf62(skc4),cons(skf60(skc4),skf63(skc4))),cons(skf61(skc4),skf64(skc4))),skc4)**.
% 0.80/1.02  1337[8:Spt:59.0] || neq(skc5,nil)* -> .
% 0.80/1.02  1338[8:Res:419.1,1337.0] ssList(nil) ||  -> equal(skc5,nil)**.
% 0.80/1.02  1339[8:SSi:1338.0,12.0,11.0,8.0,7.0,6.0,10.0,9.0,5.0] ||  -> equal(skc5,nil)**.
% 0.80/1.03  1340[8:MRR:1339.0,1080.0] ||  -> .
% 0.80/1.03  1341[8:Spt:1340.0,59.0,1337.0] ||  -> neq(skc5,nil)*.
% 0.80/1.03  1342[8:Spt:1340.0,59.1] ||  -> singletonP(skc4)*.
% 0.80/1.03  1343[8:MRR:247.0,1342.0] ||  -> equal(cons(skf45(skc4),nil),skc4)**.
% 0.80/1.03  1350[8:SpR:1343.0,70.1] ssItem(skf45(skc4)) ||  -> cyclefreeP(skc4)*.
% 0.80/1.03  1362[8:SSi:1350.0,14.0,1095.0,1098.0,2.0,1342.0] ||  -> cyclefreeP(skc4)*.
% 0.80/1.03  1363[8:MRR:1362.0,1256.0] ||  -> .
% 0.80/1.03  1364[4:Spt:1363.0,216.0,1098.0] || totalorderedP(skc4)* -> .
% 0.80/1.03  1365[4:Spt:1363.0,216.1] ||  -> equal(app(app(skf67(skc4),cons(skf65(skc4),skf68(skc4))),cons(skf66(skc4),skf69(skc4))),skc4)**.
% 0.80/1.03  1377[5:Spt:59.0] || neq(skc5,nil)* -> .
% 0.80/1.03  1378[5:Res:419.1,1377.0] ssList(nil) ||  -> equal(skc5,nil)**.
% 0.80/1.03  1379[5:SSi:1378.0,12.0,11.0,8.0,7.0,6.0,10.0,9.0,5.0] ||  -> equal(skc5,nil)**.
% 0.80/1.03  1380[5:MRR:1379.0,1080.0] ||  -> .
% 0.80/1.03  1381[5:Spt:1380.0,59.0,1377.0] ||  -> neq(skc5,nil)*.
% 0.80/1.03  1382[5:Spt:1380.0,59.1] ||  -> singletonP(skc4)*.
% 0.80/1.03  1383[5:MRR:247.0,1382.0] ||  -> equal(cons(skf45(skc4),nil),skc4)**.
% 0.80/1.03  1399[5:SpR:1383.0,73.1] ssItem(skf45(skc4)) ||  -> totalorderedP(skc4)*.
% 0.80/1.03  1419[5:SSi:1399.0,14.0,1095.0,2.0,1382.0] ||  -> totalorderedP(skc4)*.
% 0.80/1.03  1420[5:MRR:1419.0,1364.0] ||  -> .
% 0.80/1.03  1425[3:Spt:1420.0,217.0,1095.0] || strictorderedP(skc4)* -> .
% 0.80/1.03  1426[3:Spt:1420.0,217.1] ||  -> equal(app(app(skf72(skc4),cons(skf70(skc4),skf73(skc4))),cons(skf71(skc4),skf74(skc4))),skc4)**.
% 0.80/1.03  1438[4:Spt:59.0] || neq(skc5,nil)* -> .
% 0.80/1.03  1439[4:Res:419.1,1438.0] ssList(nil) ||  -> equal(skc5,nil)**.
% 0.80/1.03  1440[4:SSi:1439.0,12.0,11.0,8.0,7.0,6.0,10.0,9.0,5.0] ||  -> equal(skc5,nil)**.
% 0.80/1.03  1441[4:MRR:1440.0,1080.0] ||  -> .
% 0.80/1.03  1442[4:Spt:1441.0,59.0,1438.0] ||  -> neq(skc5,nil)*.
% 0.80/1.03  1443[4:Spt:1441.0,59.1] ||  -> singletonP(skc4)*.
% 0.80/1.03  1444[4:MRR:247.0,1443.0] ||  -> equal(cons(skf45(skc4),nil),skc4)**.
% 0.80/1.03  1458[4:SpR:1444.0,74.1] ssItem(skf45(skc4)) ||  -> strictorderedP(skc4)*.
% 0.80/1.03  1495[4:SSi:1458.0,14.0,2.0,1443.0] ||  -> strictorderedP(skc4)*.
% 0.80/1.03  1496[4:MRR:1495.0,1425.0] ||  -> .
% 0.80/1.03  % SZS output end Refutation
% 0.80/1.03  Formulae used in the proof : co1 ax17 ax60 ax62 ax64 ax66 ax69 ax72 ax74 ax4 ax2 ax59 ax61 ax63 ax65 ax68 ax73 ax8 ax58 ax15 ax70 ax12 ax11 ax10 ax9
% 0.80/1.03  
%------------------------------------------------------------------------------