TSTP Solution File: SWC207-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SWC207-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:02:28 EDT 2022
% Result : Unsatisfiable 1.98s 2.23s
% Output : Refutation 2.07s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWC207-1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/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 00:54:44 EDT 2022
% 0.12/0.34 % CPUTime :
% 1.98/2.23
% 1.98/2.23 SPASS V 3.9
% 1.98/2.23 SPASS beiseite: Proof found.
% 1.98/2.23 % SZS status Theorem
% 1.98/2.23 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.98/2.23 SPASS derived 3590 clauses, backtracked 3573 clauses, performed 77 splits and kept 5762 clauses.
% 1.98/2.23 SPASS allocated 78903 KBytes.
% 1.98/2.23 SPASS spent 0:00:01.88 on the problem.
% 1.98/2.23 0:00:00.04 for the input.
% 1.98/2.23 0:00:00.00 for the FLOTTER CNF translation.
% 1.98/2.23 0:00:00.01 for inferences.
% 1.98/2.23 0:00:00.02 for the backtracking.
% 1.98/2.23 0:00:01.57 for the reduction.
% 1.98/2.23
% 1.98/2.23
% 1.98/2.23 Here is a proof with depth 3, length 144 :
% 1.98/2.23 % SZS output start Refutation
% 1.98/2.23 1[0:Inp] || -> ssList(sk1)*.
% 1.98/2.23 2[0:Inp] || -> ssList(sk2)*.
% 1.98/2.23 5[0:Inp] || -> equal(sk4,sk2)**.
% 1.98/2.23 6[0:Inp] || -> equal(sk3,sk1)**.
% 1.98/2.23 7[0:Inp] || -> neq(sk2,nil)*.
% 1.98/2.23 8[0:Inp] || neq(sk1,nil)* -> .
% 1.98/2.23 9[0:Inp] || -> ssItem(sk5)* equal(nil,sk4).
% 1.98/2.23 10[0:Inp] || -> ssItem(sk5)* equal(nil,sk3).
% 1.98/2.23 11[0:Inp] || -> equal(cons(sk5,nil),sk3)** equal(nil,sk4).
% 1.98/2.23 14[0:Inp] || -> equal(cons(sk5,nil),sk3)** equal(nil,sk3).
% 1.98/2.23 17[0:Inp] || -> equalelemsP(nil)*.
% 1.98/2.23 18[0:Inp] || -> duplicatefreeP(nil)*.
% 1.98/2.23 19[0:Inp] || -> strictorderedP(nil)*.
% 1.98/2.23 20[0:Inp] || -> totalorderedP(nil)*.
% 1.98/2.23 21[0:Inp] || -> strictorderP(nil)*.
% 1.98/2.23 22[0:Inp] || -> totalorderP(nil)*.
% 1.98/2.23 23[0:Inp] || -> cyclefreeP(nil)*.
% 1.98/2.23 24[0:Inp] || -> ssList(nil)*.
% 1.98/2.23 28[0:Inp] || -> ssItem(skaf83(u))*.
% 1.98/2.23 80[0:Inp] ssItem(u) || -> equalelemsP(cons(u,nil))*.
% 1.98/2.23 81[0:Inp] ssItem(u) || -> duplicatefreeP(cons(u,nil))*.
% 1.98/2.23 82[0:Inp] ssItem(u) || -> strictorderedP(cons(u,nil))*.
% 1.98/2.23 83[0:Inp] ssItem(u) || -> totalorderedP(cons(u,nil))*.
% 1.98/2.23 84[0:Inp] ssItem(u) || -> strictorderP(cons(u,nil))*.
% 1.98/2.23 85[0:Inp] ssItem(u) || -> totalorderP(cons(u,nil))*.
% 1.98/2.23 86[0:Inp] ssItem(u) || -> cyclefreeP(cons(u,nil))*.
% 1.98/2.23 88[0:Inp] ssList(u) || -> ssItem(v)* duplicatefreeP(u)*.
% 1.98/2.23 90[0:Inp] ssList(u) || -> equal(app(nil,u),u)**.
% 1.98/2.23 102[0:Inp] ssList(u) ssItem(v) || -> ssList(cons(v,u))*.
% 1.98/2.23 112[0:Inp] ssList(u) ssItem(v) || -> equal(tl(cons(v,u)),u)**.
% 1.98/2.23 115[0:Inp] ssList(u) ssItem(v) || equal(cons(v,u),u)** -> .
% 1.98/2.23 116[0:Inp] ssList(u) ssList(v) || -> equal(u,v) neq(u,v)*.
% 1.98/2.23 118[0:Inp] ssItem(u) ssItem(v) || -> equal(u,v) neq(u,v)*.
% 1.98/2.23 149[0:Inp] ssList(u) ssList(v) || -> equal(nil,u) equal(app(tl(u),v),tl(app(u,v)))**.
% 1.98/2.23 193[0:Inp] ssList(u) ssList(v) || equal(hd(v),hd(u))* equal(tl(v),tl(u)) -> equal(v,u) equal(nil,v) equal(nil,u).
% 1.98/2.23 204[0:Rew:6.0,10.1] || -> ssItem(sk5)* equal(nil,sk1).
% 1.98/2.23 205[0:Rew:204.1,9.1,5.0,9.1] || -> ssItem(sk5)* equal(sk2,sk1).
% 1.98/2.23 208[0:Rew:6.0,14.1,6.0,14.0] || -> equal(nil,sk1) equal(cons(sk5,nil),sk1)**.
% 1.98/2.23 209[0:Rew:208.1,11.1,5.0,11.1,6.0,11.0] || -> equal(sk2,sk1) equal(cons(sk5,nil),sk1)**.
% 1.98/2.23 297[0:Res:2.0,88.0] || -> ssItem(u)* duplicatefreeP(sk2)*.
% 1.98/2.23 468[0:Res:1.0,88.0] || -> ssItem(u)* duplicatefreeP(sk1)*.
% 1.98/2.23 483[0:Res:1.0,193.1] ssList(u) || equal(hd(u),hd(sk1))* equal(tl(u),tl(sk1)) -> equal(u,sk1) equal(nil,u) equal(nil,sk1).
% 1.98/2.23 500[0:Res:1.0,149.1] ssList(u) || -> equal(nil,sk1) equal(app(tl(sk1),u),tl(app(sk1,u)))**.
% 1.98/2.23 518[0:Res:1.0,112.1] ssItem(u) || -> equal(tl(cons(u,sk1)),sk1)**.
% 1.98/2.23 521[0:Res:1.0,115.1] ssItem(u) || equal(cons(u,sk1),sk1)** -> .
% 1.98/2.23 522[0:Res:1.0,116.1] ssList(u) || -> equal(sk1,u) neq(sk1,u)*.
% 1.98/2.23 524[0:Res:1.0,102.1] ssItem(u) || -> ssList(cons(u,sk1))*.
% 1.98/2.23 562[1:Spt:88.1] || -> ssItem(u)*.
% 1.98/2.23 576[1:MRR:521.0,562.0] || equal(cons(u,sk1),sk1)** -> .
% 1.98/2.23 592[1:MRR:118.1,118.0,562.0] || -> equal(u,v) neq(u,v)*.
% 1.98/2.23 768[2:Spt:483.5] || -> equal(nil,sk1)**.
% 1.98/2.23 776[2:Rew:768.0,209.1] || -> equal(sk2,sk1) equal(cons(sk5,sk1),sk1)**.
% 1.98/2.23 841[2:Rew:768.0,7.0] || -> neq(sk2,sk1)*.
% 1.98/2.23 842[2:Rew:768.0,8.0] || neq(sk1,sk1)* -> .
% 1.98/2.23 912[2:MRR:776.1,576.0] || -> equal(sk2,sk1)**.
% 1.98/2.23 1046[2:Rew:912.0,841.0] || -> neq(sk1,sk1)*.
% 1.98/2.23 1049[2:MRR:1046.0,842.0] || -> .
% 1.98/2.23 1186[2:Spt:1049.0,483.5,768.0] || equal(nil,sk1)** -> .
% 1.98/2.23 1187[2:Spt:1049.0,483.0,483.1,483.2,483.3,483.4] ssList(u) || equal(hd(u),hd(sk1))* equal(tl(u),tl(sk1)) -> equal(u,sk1) equal(nil,u).
% 1.98/2.23 1442[1:Res:592.1,8.0] || -> equal(nil,sk1)**.
% 1.98/2.23 1443[2:MRR:1442.0,1186.0] || -> .
% 1.98/2.23 1444[1:Spt:1443.0,88.0,88.2] ssList(u) || -> duplicatefreeP(u)*.
% 1.98/2.23 1460[2:Spt:500.0,500.2] ssList(u) || -> equal(app(tl(sk1),u),tl(app(sk1,u)))**.
% 1.98/2.23 1462[3:Spt:468.0] || -> ssItem(u)*.
% 1.98/2.23 1483[3:MRR:521.0,1462.0] || equal(cons(u,sk1),sk1)** -> .
% 1.98/2.23 1490[3:MRR:118.1,118.0,1462.0] || -> equal(u,v) neq(u,v)*.
% 1.98/2.23 1662[4:Spt:483.5] || -> equal(nil,sk1)**.
% 1.98/2.23 1678[4:Rew:1662.0,7.0] || -> neq(sk2,sk1)*.
% 1.98/2.23 1679[4:Rew:1662.0,8.0] || neq(sk1,sk1)* -> .
% 1.98/2.23 1744[4:Rew:1662.0,209.1] || -> equal(sk2,sk1) equal(cons(sk5,sk1),sk1)**.
% 1.98/2.23 1829[4:MRR:1744.1,1483.0] || -> equal(sk2,sk1)**.
% 1.98/2.23 1965[4:Rew:1829.0,1678.0] || -> neq(sk1,sk1)*.
% 1.98/2.23 1968[4:MRR:1965.0,1679.0] || -> .
% 1.98/2.23 2081[4:Spt:1968.0,483.5,1662.0] || equal(nil,sk1)** -> .
% 1.98/2.23 2082[4:Spt:1968.0,483.0,483.1,483.2,483.3,483.4] ssList(u) || equal(hd(u),hd(sk1))* equal(tl(u),tl(sk1)) -> equal(u,sk1) equal(nil,u).
% 1.98/2.23 2329[3:Res:1490.1,8.0] || -> equal(nil,sk1)**.
% 1.98/2.23 2330[4:MRR:2329.0,2081.0] || -> .
% 1.98/2.23 2331[3:Spt:2330.0,468.1] || -> duplicatefreeP(sk1)*.
% 1.98/2.23 2334[4:Spt:297.0] || -> ssItem(u)*.
% 1.98/2.23 2348[4:MRR:521.0,2334.0] || equal(cons(u,sk1),sk1)** -> .
% 1.98/2.23 2364[4:MRR:118.1,118.0,2334.0] || -> equal(u,v) neq(u,v)*.
% 1.98/2.23 2532[5:Spt:483.5] || -> equal(nil,sk1)**.
% 1.98/2.23 2548[5:Rew:2532.0,7.0] || -> neq(sk2,sk1)*.
% 1.98/2.23 2549[5:Rew:2532.0,8.0] || neq(sk1,sk1)* -> .
% 1.98/2.23 2614[5:Rew:2532.0,209.1] || -> equal(sk2,sk1) equal(cons(sk5,sk1),sk1)**.
% 1.98/2.23 2699[5:MRR:2614.1,2348.0] || -> equal(sk2,sk1)**.
% 1.98/2.23 2835[5:Rew:2699.0,2548.0] || -> neq(sk1,sk1)*.
% 1.98/2.23 2838[5:MRR:2835.0,2549.0] || -> .
% 1.98/2.23 2950[5:Spt:2838.0,483.5,2532.0] || equal(nil,sk1)** -> .
% 1.98/2.23 2951[5:Spt:2838.0,483.0,483.1,483.2,483.3,483.4] ssList(u) || equal(hd(u),hd(sk1))* equal(tl(u),tl(sk1)) -> equal(u,sk1) equal(nil,u).
% 1.98/2.23 3203[4:Res:2364.1,8.0] || -> equal(nil,sk1)**.
% 1.98/2.23 3204[5:MRR:3203.0,2950.0] || -> .
% 1.98/2.23 3205[4:Spt:3204.0,297.1] || -> duplicatefreeP(sk2)*.
% 1.98/2.23 3206[5:Spt:483.5] || -> equal(nil,sk1)**.
% 1.98/2.23 3219[5:Rew:3206.0,7.0] || -> neq(sk2,sk1)*.
% 1.98/2.23 3223[5:Rew:3206.0,8.0] || neq(sk1,sk1)* -> .
% 1.98/2.23 3231[5:Rew:3206.0,90.1] ssList(u) || -> equal(app(sk1,u),u)**.
% 1.98/2.23 3290[5:Rew:3206.0,80.1] ssItem(u) || -> equalelemsP(cons(u,sk1))*.
% 1.98/2.23 3291[5:Rew:3206.0,81.1] ssItem(u) || -> duplicatefreeP(cons(u,sk1))*.
% 1.98/2.23 3292[5:Rew:3206.0,82.1] ssItem(u) || -> strictorderedP(cons(u,sk1))*.
% 1.98/2.23 3293[5:Rew:3206.0,83.1] ssItem(u) || -> totalorderedP(cons(u,sk1))*.
% 1.98/2.23 3294[5:Rew:3206.0,84.1] ssItem(u) || -> strictorderP(cons(u,sk1))*.
% 1.98/2.23 3295[5:Rew:3206.0,85.1] ssItem(u) || -> totalorderP(cons(u,sk1))*.
% 1.98/2.23 3296[5:Rew:3206.0,86.1] ssItem(u) || -> cyclefreeP(cons(u,sk1))*.
% 1.98/2.23 3302[5:Rew:3206.0,209.1] || -> equal(sk2,sk1) equal(cons(sk5,sk1),sk1)**.
% 1.98/2.23 3358[5:Rew:3231.1,1460.1] ssList(u) || -> equal(app(tl(sk1),u),tl(u))**.
% 1.98/2.23 3409[6:Spt:205.1] || -> equal(sk2,sk1)**.
% 1.98/2.23 3551[6:Rew:3409.0,3219.0] || -> neq(sk1,sk1)*.
% 1.98/2.23 3561[6:MRR:3551.0,3223.0] || -> .
% 1.98/2.23 3648[6:Spt:3561.0,205.1,3409.0] || equal(sk2,sk1)** -> .
% 1.98/2.23 3649[6:Spt:3561.0,205.0] || -> ssItem(sk5)*.
% 1.98/2.23 3656[6:MRR:3302.0,3648.0] || -> equal(cons(sk5,sk1),sk1)**.
% 1.98/2.23 3722[6:SpR:3656.0,518.1] ssItem(sk5) || -> equal(tl(sk1),sk1)**.
% 1.98/2.23 3723[6:SSi:3722.0,3649.0] || -> equal(tl(sk1),sk1)**.
% 1.98/2.23 3724[6:Rew:3723.0,3358.1] ssList(u) || -> equal(app(sk1,u),tl(u))**.
% 1.98/2.23 3725[6:Rew:3231.1,3724.1] ssList(u) || -> equal(tl(u),u)**.
% 1.98/2.23 3738[6:SpR:3725.1,518.1] ssList(cons(u,sk1)) ssItem(u) || -> equal(cons(u,sk1),sk1)**.
% 1.98/2.23 3743[6:SSi:3738.0,524.1,3290.1,3291.1,3292.1,3293.1,3294.1,3295.1,3296.1] ssItem(u) || -> equal(cons(u,sk1),sk1)**.
% 1.98/2.23 3744[6:MRR:3743.1,521.1] ssItem(u) || -> .
% 1.98/2.23 3745[6:UnC:3744.0,28.0] || -> .
% 1.98/2.23 3746[5:Spt:3745.0,483.5,3206.0] || equal(nil,sk1)** -> .
% 1.98/2.23 3747[5:Spt:3745.0,483.0,483.1,483.2,483.3,483.4] ssList(u) || equal(hd(u),hd(sk1))* equal(tl(u),tl(sk1)) -> equal(u,sk1) equal(nil,u).
% 1.98/2.23 4050[0:Res:522.2,8.0] ssList(nil) || -> equal(nil,sk1)**.
% 1.98/2.23 4051[0:SSi:4050.0,24.0,23.0,22.0,21.0,20.0,19.0,18.0,17.0] || -> equal(nil,sk1)**.
% 1.98/2.23 4052[5:MRR:4051.0,3746.0] || -> .
% 1.98/2.23 4053[2:Spt:4052.0,500.1] || -> equal(nil,sk1)**.
% 1.98/2.23 4069[0:Rew:4051.0,7.0] || -> neq(sk2,sk1)*.
% 1.98/2.23 4073[0:Rew:4051.0,8.0] || neq(sk1,sk1)* -> .
% 1.98/2.23 4157[0:Rew:4051.0,209.1] || -> equal(sk2,sk1) equal(cons(sk5,sk1),sk1)**.
% 1.98/2.23 4225[3:Spt:297.0] || -> ssItem(u)*.
% 1.98/2.23 4232[3:MRR:521.0,4225.0] || equal(cons(u,sk1),sk1)** -> .
% 1.98/2.23 4400[3:MRR:4157.1,4232.0] || -> equal(sk2,sk1)**.
% 1.98/2.23 4467[3:Rew:4400.0,4069.0] || -> neq(sk1,sk1)*.
% 1.98/2.23 4493[3:MRR:4467.0,4073.0] || -> .
% 1.98/2.23 4622[3:Spt:4493.0,297.1] || -> duplicatefreeP(sk2)*.
% 2.07/2.27 4623[4:Spt:205.1] || -> equal(sk2,sk1)**.
% 2.07/2.27 4633[4:Rew:4623.0,4069.0] || -> neq(sk1,sk1)*.
% 2.07/2.27 4775[4:MRR:4633.0,4073.0] || -> .
% 2.07/2.27 4865[4:Spt:4775.0,205.1,4623.0] || equal(sk2,sk1)** -> .
% 2.07/2.27 4866[4:Spt:4775.0,205.0] || -> ssItem(sk5)*.
% 2.07/2.27 4873[4:MRR:4157.0,4865.0] || -> equal(cons(sk5,sk1),sk1)**.
% 2.07/2.27 4938[4:SpL:4873.0,521.1] ssItem(sk5) || equal(sk1,sk1)* -> .
% 2.07/2.27 4939[4:Obv:4938.1] ssItem(sk5) || -> .
% 2.07/2.27 4940[4:SSi:4939.0,4866.0] || -> .
% 2.07/2.27 % SZS output end Refutation
% 2.07/2.27 Formulae used in the proof : co1_1 co1_2 co1_5 co1_6 co1_7 co1_8 co1_9 co1_10 co1_11 co1_14 clause1 clause2 clause3 clause4 clause5 clause6 clause7 clause8 clause12 clause64 clause65 clause66 clause67 clause68 clause69 clause70 clause72 clause74 clause86 clause96 clause99 clause100 clause102 clause133 clause177
% 2.07/2.27
%------------------------------------------------------------------------------