TSTP Solution File: SWC256+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SWC256+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n017.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:52 EDT 2022
% Result : Theorem 1.21s 1.40s
% Output : Refutation 1.21s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SWC256+1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.12 % Command : run_spass %d %s
% 0.12/0.33 % Computer : n017.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Sun Jun 12 15:29:22 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.21/1.40
% 1.21/1.40 SPASS V 3.9
% 1.21/1.40 SPASS beiseite: Proof found.
% 1.21/1.40 % SZS status Theorem
% 1.21/1.40 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.21/1.40 SPASS derived 2686 clauses, backtracked 1421 clauses, performed 33 splits and kept 2929 clauses.
% 1.21/1.40 SPASS allocated 100170 KBytes.
% 1.21/1.40 SPASS spent 0:00:01.06 on the problem.
% 1.21/1.40 0:00:00.04 for the input.
% 1.21/1.40 0:00:00.07 for the FLOTTER CNF translation.
% 1.21/1.40 0:00:00.01 for inferences.
% 1.21/1.40 0:00:00.02 for the backtracking.
% 1.21/1.40 0:00:00.75 for the reduction.
% 1.21/1.40
% 1.21/1.40
% 1.21/1.40 Here is a proof with depth 6, length 156 :
% 1.21/1.40 % SZS output start Refutation
% 1.21/1.40 1[0:Inp] || -> ssList(skc5)*.
% 1.21/1.40 2[0:Inp] || -> ssList(skc4)*.
% 1.21/1.40 3[0:Inp] || -> ssItem(skc7)*.
% 1.21/1.40 4[0:Inp] || -> ssItem(skc6)*.
% 1.21/1.40 5[0:Inp] || -> ssList(nil)*.
% 1.21/1.40 6[0:Inp] || -> cyclefreeP(nil)*.
% 1.21/1.40 7[0:Inp] || -> totalorderP(nil)*.
% 1.21/1.40 8[0:Inp] || -> strictorderP(nil)*.
% 1.21/1.40 9[0:Inp] || -> totalorderedP(nil)*.
% 1.21/1.40 10[0:Inp] || -> strictorderedP(nil)*.
% 1.21/1.40 11[0:Inp] || -> duplicatefreeP(nil)*.
% 1.21/1.40 12[0:Inp] || -> equalelemsP(nil)*.
% 1.21/1.40 13[0:Inp] || -> neq(skc5,nil)*.
% 1.21/1.40 14[0:Inp] || singletonP(skc4)* -> .
% 1.21/1.40 53[0:Inp] || -> ssItem(skf44(u,v))*.
% 1.21/1.40 54[0:Inp] || equal(skc7,skc6)** -> .
% 1.21/1.40 69[0:Inp] || SkP0(skc5,skc4)* -> equal(nil,skc5).
% 1.21/1.40 70[0:Inp] || SkP0(skc5,skc4)* -> equal(nil,skc4).
% 1.21/1.40 71[0:Inp] ssItem(u) || memberP(nil,u)* -> .
% 1.21/1.40 72[0:Inp] ssItem(u) || -> cyclefreeP(cons(u,nil))*.
% 1.21/1.40 73[0:Inp] ssItem(u) || -> totalorderP(cons(u,nil))*.
% 1.21/1.40 74[0:Inp] ssItem(u) || -> strictorderP(cons(u,nil))*.
% 1.21/1.40 75[0:Inp] ssItem(u) || -> totalorderedP(cons(u,nil))*.
% 1.21/1.40 76[0:Inp] ssItem(u) || -> strictorderedP(cons(u,nil))*.
% 1.21/1.40 77[0:Inp] ssItem(u) || -> duplicatefreeP(cons(u,nil))*.
% 1.21/1.40 78[0:Inp] ssItem(u) || -> equalelemsP(cons(u,nil))*.
% 1.21/1.40 80[0:Inp] || -> SkP0(u,v) memberP(u,skf44(u,v))*.
% 1.21/1.40 81[0:Inp] ssList(u) || -> equal(app(nil,u),u)**.
% 1.21/1.40 87[0:Inp] || -> SkP0(u,v) equal(cons(skf44(u,v),nil),v)**.
% 1.21/1.40 91[0:Inp] ssItem(u) ssList(v) || -> ssList(cons(u,v))*.
% 1.21/1.40 111[0:Inp] ssItem(u) ssList(v) || -> equal(hd(cons(u,v)),u)**.
% 1.21/1.40 121[0:Inp] ssList(u) ssItem(v) || equal(cons(v,nil),u)* -> singletonP(u)*.
% 1.21/1.40 122[0:Inp] ssList(u) ssList(v) || equal(v,u) neq(v,u)* -> .
% 1.21/1.40 133[0:Inp] ssList(u) ssList(v) || -> equal(nil,v) equal(hd(app(v,u)),hd(v))**.
% 1.21/1.40 187[0:Inp] ssList(u) ssList(v) || equal(tl(u),tl(v))* equal(hd(u),hd(v)) -> equal(u,v) equal(nil,v) equal(nil,u).
% 1.21/1.40 196[0:Rew:70.1,69.1] || SkP0(skc5,skc4)* -> equal(skc5,skc4).
% 1.21/1.40 244[0:Res:2.0,133.0] ssList(u) || -> equal(nil,skc4) equal(hd(app(skc4,u)),hd(skc4))**.
% 1.21/1.40 248[0:Res:2.0,122.0] ssList(u) || equal(skc4,u) neq(skc4,u)* -> .
% 1.21/1.40 255[0:Res:2.0,111.0] ssItem(u) || -> equal(hd(cons(u,skc4)),u)**.
% 1.21/1.40 267[0:Res:2.0,91.0] ssItem(u) || -> ssList(cons(u,skc4))*.
% 1.21/1.40 285[0:Res:2.0,187.1] ssList(u) || equal(tl(skc4),tl(u))* equal(hd(skc4),hd(u)) -> equal(nil,u) equal(skc4,u) equal(nil,skc4).
% 1.21/1.40 320[0:Res:2.0,121.1] ssItem(u) || equal(cons(u,nil),skc4)** -> singletonP(skc4).
% 1.21/1.40 415[0:Res:1.0,133.0] ssList(u) || -> equal(nil,skc5) equal(hd(app(skc5,u)),hd(skc5))**.
% 1.21/1.40 456[0:Res:1.0,187.1] ssList(u) || equal(tl(skc5),tl(u))* equal(hd(skc5),hd(u)) -> equal(nil,u) equal(skc5,u) equal(nil,skc5).
% 1.21/1.40 544[0:MRR:320.2,14.0] ssItem(u) || equal(cons(u,nil),skc4)** -> .
% 1.21/1.40 549[1:Spt:415.0,415.2] ssList(u) || -> equal(hd(app(skc5,u)),hd(skc5))**.
% 1.21/1.40 551[2:Spt:244.0,244.2] ssList(u) || -> equal(hd(app(skc4,u)),hd(skc4))**.
% 1.21/1.40 557[3:Spt:456.5] || -> equal(nil,skc5)**.
% 1.21/1.40 558[3:Rew:557.0,78.1] ssItem(u) || -> equalelemsP(cons(u,skc5))*.
% 1.21/1.40 559[3:Rew:557.0,77.1] ssItem(u) || -> duplicatefreeP(cons(u,skc5))*.
% 1.21/1.40 560[3:Rew:557.0,76.1] ssItem(u) || -> strictorderedP(cons(u,skc5))*.
% 1.21/1.40 561[3:Rew:557.0,75.1] ssItem(u) || -> totalorderedP(cons(u,skc5))*.
% 1.21/1.40 562[3:Rew:557.0,74.1] ssItem(u) || -> strictorderP(cons(u,skc5))*.
% 1.21/1.40 563[3:Rew:557.0,73.1] ssItem(u) || -> totalorderP(cons(u,skc5))*.
% 1.21/1.40 564[3:Rew:557.0,72.1] ssItem(u) || -> cyclefreeP(cons(u,skc5))*.
% 1.21/1.40 630[3:Rew:557.0,12.0] || -> equalelemsP(skc5)*.
% 1.21/1.40 631[3:Rew:557.0,11.0] || -> duplicatefreeP(skc5)*.
% 1.21/1.40 632[3:Rew:557.0,10.0] || -> strictorderedP(skc5)*.
% 1.21/1.40 633[3:Rew:557.0,9.0] || -> totalorderedP(skc5)*.
% 1.21/1.40 634[3:Rew:557.0,8.0] || -> strictorderP(skc5)*.
% 1.21/1.40 635[3:Rew:557.0,7.0] || -> totalorderP(skc5)*.
% 1.21/1.40 636[3:Rew:557.0,6.0] || -> cyclefreeP(skc5)*.
% 1.21/1.40 653[3:Rew:557.0,71.1] ssItem(u) || memberP(skc5,u)* -> .
% 1.21/1.40 655[3:Rew:557.0,81.1] ssList(u) || -> equal(app(skc5,u),u)**.
% 1.21/1.40 713[3:Rew:655.1,549.1] ssList(u) || -> equal(hd(u),hd(skc5))*.
% 1.21/1.40 759[4:Spt:196.1] || -> equal(skc5,skc4)**.
% 1.21/1.40 768[4:Rew:759.0,558.1] ssItem(u) || -> equalelemsP(cons(u,skc4))*.
% 1.21/1.40 769[4:Rew:759.0,559.1] ssItem(u) || -> duplicatefreeP(cons(u,skc4))*.
% 1.21/1.40 770[4:Rew:759.0,560.1] ssItem(u) || -> strictorderedP(cons(u,skc4))*.
% 1.21/1.40 771[4:Rew:759.0,561.1] ssItem(u) || -> totalorderedP(cons(u,skc4))*.
% 1.21/1.40 772[4:Rew:759.0,562.1] ssItem(u) || -> strictorderP(cons(u,skc4))*.
% 1.21/1.40 773[4:Rew:759.0,563.1] ssItem(u) || -> totalorderP(cons(u,skc4))*.
% 1.21/1.40 774[4:Rew:759.0,564.1] ssItem(u) || -> cyclefreeP(cons(u,skc4))*.
% 1.21/1.40 881[4:Rew:759.0,713.1] ssList(u) || -> equal(hd(u),hd(skc4))*.
% 1.21/1.40 1133[4:SpR:255.1,881.1] ssItem(u) ssList(cons(u,skc4)) || -> equal(u,hd(skc4))*.
% 1.21/1.40 1136[4:SSi:1133.1,267.1,768.1,769.1,770.1,771.1,772.1,773.1,774.1] ssItem(u) || -> equal(u,hd(skc4))*.
% 1.21/1.40 1205[4:SpR:1136.1,1136.1] ssItem(u) ssItem(v) || -> equal(v,u)*.
% 1.21/1.40 1252[4:EmS:1205.0,3.0] ssItem(u) || -> equal(u,skc7)*.
% 1.21/1.40 1274[4:EmS:1252.0,4.0] || -> equal(skc7,skc6)**.
% 1.21/1.40 1275[4:MRR:1274.0,54.0] || -> .
% 1.21/1.40 1413[4:Spt:1275.0,196.1,759.0] || equal(skc5,skc4)** -> .
% 1.21/1.40 1414[4:Spt:1275.0,196.0] || SkP0(skc5,skc4)* -> .
% 1.21/1.40 1562[3:Res:80.1,653.1] ssItem(skf44(skc5,u)) || -> SkP0(skc5,u)*.
% 1.21/1.40 1563[3:SSi:1562.0,53.0,636.0,635.0,634.0,633.0,632.0,631.0,630.0,1.0] || -> SkP0(skc5,u)*.
% 1.21/1.40 1564[4:UnC:1563.0,1414.0] || -> .
% 1.21/1.40 1566[3:Spt:1564.0,456.5,557.0] || equal(nil,skc5)** -> .
% 1.21/1.40 1567[3:Spt:1564.0,456.0,456.1,456.2,456.3,456.4] ssList(u) || equal(tl(skc5),tl(u))* equal(hd(skc5),hd(u)) -> equal(nil,u) equal(skc5,u).
% 1.21/1.40 1586[4:Spt:285.5] || -> equal(nil,skc4)**.
% 1.21/1.40 1623[4:Rew:1586.0,72.1] ssItem(u) || -> cyclefreeP(cons(u,skc4))*.
% 1.21/1.40 1624[4:Rew:1586.0,73.1] ssItem(u) || -> totalorderP(cons(u,skc4))*.
% 1.21/1.40 1625[4:Rew:1586.0,74.1] ssItem(u) || -> strictorderP(cons(u,skc4))*.
% 1.21/1.40 1626[4:Rew:1586.0,75.1] ssItem(u) || -> totalorderedP(cons(u,skc4))*.
% 1.21/1.40 1627[4:Rew:1586.0,76.1] ssItem(u) || -> strictorderedP(cons(u,skc4))*.
% 1.21/1.40 1628[4:Rew:1586.0,77.1] ssItem(u) || -> duplicatefreeP(cons(u,skc4))*.
% 1.21/1.40 1629[4:Rew:1586.0,78.1] ssItem(u) || -> equalelemsP(cons(u,skc4))*.
% 1.21/1.40 1635[4:Rew:1586.0,81.1] ssList(u) || -> equal(app(skc4,u),u)**.
% 1.21/1.40 1714[4:Rew:1635.1,551.1] ssList(u) || -> equal(hd(u),hd(skc4))*.
% 1.21/1.40 1787[4:SpR:1714.1,255.1] ssList(cons(u,skc4)) ssItem(u) || -> equal(hd(skc4),u)*.
% 1.21/1.40 1796[4:SSi:1787.0,267.1,1623.1,1624.1,1625.1,1626.1,1627.1,1628.1,1629.1] ssItem(u) || -> equal(hd(skc4),u)*.
% 1.21/1.40 1814[4:SpR:1796.1,1796.1] ssItem(u) ssItem(v) || -> equal(u,v)*.
% 1.21/1.40 2002[4:EmS:1814.0,3.0] ssItem(u) || -> equal(skc7,u)*.
% 1.21/1.40 2025[4:EmS:2002.0,4.0] || -> equal(skc7,skc6)**.
% 1.21/1.40 2026[4:MRR:2025.0,54.0] || -> .
% 1.21/1.40 2211[4:Spt:2026.0,285.5,1586.0] || equal(nil,skc4)** -> .
% 1.21/1.40 2212[4:Spt:2026.0,285.0,285.1,285.2,285.3,285.4] ssList(u) || equal(tl(skc4),tl(u))* equal(hd(skc4),hd(u)) -> equal(nil,u) equal(skc4,u).
% 1.21/1.40 2218[4:MRR:70.1,2211.0] || SkP0(skc5,skc4)* -> .
% 1.21/1.40 2296[0:Res:80.1,71.1] ssItem(skf44(nil,u)) || -> SkP0(nil,u)*.
% 1.21/1.40 2297[0:SSi:2296.0,53.0,12.0,11.0,10.0,9.0,8.0,7.0,6.0,5.0] || -> SkP0(nil,u)*.
% 1.21/1.40 2344[0:SpL:87.1,544.1] ssItem(skf44(u,v)) || equal(v,skc4) -> SkP0(u,v)*.
% 1.21/1.40 2352[0:SSi:2344.0,53.0] || equal(u,skc4) -> SkP0(v,u)*.
% 1.21/1.40 2363[4:Res:2352.1,2218.0] || equal(skc4,skc4)* -> .
% 1.21/1.40 2364[4:Obv:2363.0] || -> .
% 1.21/1.40 2365[2:Spt:2364.0,244.1] || -> equal(nil,skc4)**.
% 1.21/1.40 2397[2:Rew:2365.0,78.1] ssItem(u) || -> equalelemsP(cons(u,skc4))*.
% 1.21/1.40 2398[2:Rew:2365.0,77.1] ssItem(u) || -> duplicatefreeP(cons(u,skc4))*.
% 1.21/1.40 2399[2:Rew:2365.0,76.1] ssItem(u) || -> strictorderedP(cons(u,skc4))*.
% 1.21/1.40 2400[2:Rew:2365.0,75.1] ssItem(u) || -> totalorderedP(cons(u,skc4))*.
% 1.21/1.40 2401[2:Rew:2365.0,74.1] ssItem(u) || -> strictorderP(cons(u,skc4))*.
% 1.21/1.40 2402[2:Rew:2365.0,73.1] ssItem(u) || -> totalorderP(cons(u,skc4))*.
% 1.21/1.40 2403[2:Rew:2365.0,72.1] ssItem(u) || -> cyclefreeP(cons(u,skc4))*.
% 1.21/1.40 2407[2:Rew:2365.0,81.1] ssList(u) || -> equal(app(skc4,u),u)**.
% 1.21/1.40 2541[3:Spt:196.1] || -> equal(skc5,skc4)**.
% 1.21/1.40 2554[3:Rew:2541.0,549.1] ssList(u) || -> equal(hd(app(skc4,u)),hd(skc4))**.
% 1.21/1.40 2710[3:Rew:2407.1,2554.1] ssList(u) || -> equal(hd(u),hd(skc4))*.
% 1.21/1.42 2779[3:SpR:2710.1,255.1] ssList(cons(u,skc4)) ssItem(u) || -> equal(hd(skc4),u)*.
% 1.21/1.42 2784[3:SSi:2779.0,267.1,2397.1,2398.1,2399.1,2400.1,2401.1,2402.1,2403.1] ssItem(u) || -> equal(hd(skc4),u)*.
% 1.21/1.42 2789[3:SpR:2784.1,2784.1] ssItem(u) ssItem(v) || -> equal(u,v)*.
% 1.21/1.42 2932[3:EmS:2789.0,3.0] ssItem(u) || -> equal(skc7,u)*.
% 1.21/1.42 2954[3:EmS:2932.0,4.0] || -> equal(skc7,skc6)**.
% 1.21/1.42 2955[3:MRR:2954.0,54.0] || -> .
% 1.21/1.42 3108[3:Spt:2955.0,196.1,2541.0] || equal(skc5,skc4)** -> .
% 1.21/1.42 3109[3:Spt:2955.0,196.0] || SkP0(skc5,skc4)* -> .
% 1.21/1.42 3133[3:Res:2352.1,3109.0] || equal(skc4,skc4)* -> .
% 1.21/1.42 3134[3:Obv:3133.0] || -> .
% 1.21/1.42 3135[1:Spt:3134.0,415.1] || -> equal(nil,skc5)**.
% 1.21/1.42 3137[1:Rew:3135.0,6.0] || -> cyclefreeP(skc5)*.
% 1.21/1.42 3138[1:Rew:3135.0,7.0] || -> totalorderP(skc5)*.
% 1.21/1.42 3139[1:Rew:3135.0,8.0] || -> strictorderP(skc5)*.
% 1.21/1.42 3140[1:Rew:3135.0,9.0] || -> totalorderedP(skc5)*.
% 1.21/1.42 3141[1:Rew:3135.0,10.0] || -> strictorderedP(skc5)*.
% 1.21/1.42 3142[1:Rew:3135.0,11.0] || -> duplicatefreeP(skc5)*.
% 1.21/1.42 3143[1:Rew:3135.0,12.0] || -> equalelemsP(skc5)*.
% 1.21/1.42 3144[1:Rew:3135.0,2297.0] || -> SkP0(skc5,u)*.
% 1.21/1.42 3145[1:Rew:3135.0,13.0] || -> neq(skc5,skc5)*.
% 1.21/1.42 3184[1:MRR:196.0,3144.0] || -> equal(skc5,skc4)**.
% 1.21/1.42 3268[1:Rew:3184.0,3137.0] || -> cyclefreeP(skc4)*.
% 1.21/1.42 3269[1:Rew:3184.0,3138.0] || -> totalorderP(skc4)*.
% 1.21/1.42 3270[1:Rew:3184.0,3139.0] || -> strictorderP(skc4)*.
% 1.21/1.42 3271[1:Rew:3184.0,3140.0] || -> totalorderedP(skc4)*.
% 1.21/1.42 3272[1:Rew:3184.0,3141.0] || -> strictorderedP(skc4)*.
% 1.21/1.42 3273[1:Rew:3184.0,3142.0] || -> duplicatefreeP(skc4)*.
% 1.21/1.42 3274[1:Rew:3184.0,3143.0] || -> equalelemsP(skc4)*.
% 1.21/1.42 3276[1:Rew:3184.0,3145.0] || -> neq(skc4,skc4)*.
% 1.21/1.42 3584[1:Res:3276.0,248.2] ssList(skc4) || equal(skc4,skc4)* -> .
% 1.21/1.42 3585[1:Obv:3584.1] ssList(skc4) || -> .
% 1.21/1.42 3586[1:SSi:3585.0,2.0,3268.0,3269.0,3270.0,3271.0,3272.0,3273.0,3274.0] || -> .
% 1.21/1.42 % SZS output end Refutation
% 1.21/1.42 Formulae used in the proof : co1 ax2 ax17 ax60 ax62 ax64 ax66 ax69 ax72 ax74 ax38 ax59 ax61 ax63 ax65 ax68 ax71 ax73 ax28 ax16 ax23 ax4 ax15 ax85 ax77
% 1.21/1.42
%------------------------------------------------------------------------------