%------------------------------------------------------------------------------ % File : SPASS---3.9 % Problem : SWC293+1 : TPTP v8.1.0. Released v2.4.0. % Transfm : none % Format : tptp % Command : run_spass %d %s % Computer : n016.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:07 EDT 2022 % Result : Theorem 0.91s 1.13s % Output : Refutation 0.91s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.06/0.12 % Problem : SWC293+1 : TPTP v8.1.0. Released v2.4.0. % 0.06/0.13 % Command : run_spass %d %s % 0.13/0.34 % Computer : n016.cluster.edu % 0.13/0.34 % Model : x86_64 x86_64 % 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.34 % Memory : 8042.1875MB % 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.34 % CPULimit : 300 % 0.13/0.34 % WCLimit : 600 % 0.13/0.34 % DateTime : Sun Jun 12 23:13:13 EDT 2022 % 0.13/0.34 % CPUTime : % 0.91/1.13 % 0.91/1.13 SPASS V 3.9 % 0.91/1.13 SPASS beiseite: Proof found. % 0.91/1.13 % SZS status Theorem % 0.91/1.13 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p % 0.91/1.13 SPASS derived 997 clauses, backtracked 641 clauses, performed 23 splits and kept 1489 clauses. % 0.91/1.13 SPASS allocated 98940 KBytes. % 0.91/1.13 SPASS spent 0:00:00.77 on the problem. % 0.91/1.13 0:00:00.04 for the input. % 0.91/1.13 0:00:00.07 for the FLOTTER CNF translation. % 0.91/1.13 0:00:00.00 for inferences. % 0.91/1.13 0:00:00.01 for the backtracking. % 0.91/1.13 0:00:00.43 for the reduction. % 0.91/1.13 % 0.91/1.13 % 0.91/1.13 Here is a proof with depth 2, length 50 : % 0.91/1.13 % SZS output start Refutation % 0.91/1.13 1[0:Inp] || -> ssList(skc5)*. % 0.91/1.13 2[0:Inp] || -> ssList(skc4)*. % 0.91/1.13 6[0:Inp] || -> cyclefreeP(nil)*. % 0.91/1.13 7[0:Inp] || -> totalorderP(nil)*. % 0.91/1.13 8[0:Inp] || -> strictorderP(nil)*. % 0.91/1.13 9[0:Inp] || -> totalorderedP(nil)*. % 0.91/1.13 10[0:Inp] || -> strictorderedP(nil)*. % 0.91/1.13 11[0:Inp] || -> duplicatefreeP(nil)*. % 0.91/1.13 12[0:Inp] || -> equalelemsP(nil)*. % 0.91/1.13 13[0:Inp] || strictorderedP(skc4)* -> . % 0.91/1.13 52[0:Inp] || -> ssItem(skf44(u,v))*. % 0.91/1.13 68[0:Inp] || SkP0(skc5,skc4)* -> equal(nil,skc5). % 0.91/1.13 69[0:Inp] || SkP0(skc5,skc4)* -> equal(nil,skc4). % 0.91/1.13 70[0:Inp] ssItem(u) || memberP(nil,u)* -> . % 0.91/1.13 75[0:Inp] ssItem(u) || -> strictorderedP(cons(u,nil))*. % 0.91/1.13 79[0:Inp] || -> SkP0(u,v) memberP(u,skf44(u,v))*. % 0.91/1.13 86[0:Inp] || -> SkP0(u,v) equal(cons(skf44(u,v),nil),v)**. % 0.91/1.13 186[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). % 0.91/1.13 195[0:Rew:69.1,68.1] || SkP0(skc5,skc4)* -> equal(skc5,skc4). % 0.91/1.13 284[0:Res:2.0,186.1] ssList(u) || equal(tl(skc4),tl(u))* equal(hd(skc4),hd(u)) -> equal(nil,u) equal(skc4,u) equal(nil,skc4). % 0.91/1.13 455[0:Res:1.0,186.1] ssList(u) || equal(tl(skc5),tl(u))* equal(hd(skc5),hd(u)) -> equal(nil,u) equal(skc5,u) equal(nil,skc5). % 0.91/1.13 558[1:Spt:455.5] || -> equal(nil,skc5)**. % 0.91/1.13 630[1:Rew:558.0,12.0] || -> equalelemsP(skc5)*. % 0.91/1.13 631[1:Rew:558.0,11.0] || -> duplicatefreeP(skc5)*. % 0.91/1.13 632[1:Rew:558.0,10.0] || -> strictorderedP(skc5)*. % 0.91/1.13 633[1:Rew:558.0,9.0] || -> totalorderedP(skc5)*. % 0.91/1.13 634[1:Rew:558.0,8.0] || -> strictorderP(skc5)*. % 0.91/1.13 635[1:Rew:558.0,7.0] || -> totalorderP(skc5)*. % 0.91/1.13 636[1:Rew:558.0,6.0] || -> cyclefreeP(skc5)*. % 0.91/1.13 652[1:Rew:558.0,70.1] ssItem(u) || memberP(skc5,u)* -> . % 0.91/1.13 758[2:Spt:195.1] || -> equal(skc5,skc4)**. % 0.91/1.13 861[2:Rew:758.0,632.0] || -> strictorderedP(skc4)*. % 0.91/1.13 910[2:MRR:861.0,13.0] || -> . % 0.91/1.13 1008[2:Spt:910.0,195.1,758.0] || equal(skc5,skc4)** -> . % 0.91/1.13 1009[2:Spt:910.0,195.0] || SkP0(skc5,skc4)* -> . % 0.91/1.13 1056[1:Res:79.1,652.1] ssItem(skf44(skc5,u)) || -> SkP0(skc5,u)*. % 0.91/1.13 1057[1:SSi:1056.0,52.0,636.0,635.0,634.0,633.0,632.0,631.0,630.0,1.0] || -> SkP0(skc5,u)*. % 0.91/1.13 1058[2:UnC:1057.0,1009.0] || -> . % 0.91/1.13 1059[1:Spt:1058.0,455.5,558.0] || equal(nil,skc5)** -> . % 0.91/1.13 1060[1:Spt:1058.0,455.0,455.1,455.2,455.3,455.4] ssList(u) || equal(tl(skc5),tl(u))* equal(hd(skc5),hd(u)) -> equal(nil,u) equal(skc5,u). % 0.91/1.13 1075[2:Spt:284.5] || -> equal(nil,skc4)**. % 0.91/1.13 1082[2:Rew:1075.0,10.0] || -> strictorderedP(skc4)*. % 0.91/1.13 1168[2:MRR:1082.0,13.0] || -> . % 0.91/1.13 1247[2:Spt:1168.0,284.5,1075.0] || equal(nil,skc4)** -> . % 0.91/1.13 1248[2:Spt:1168.0,284.0,284.1,284.2,284.3,284.4] ssList(u) || equal(tl(skc4),tl(u))* equal(hd(skc4),hd(u)) -> equal(nil,u) equal(skc4,u). % 0.91/1.13 1254[2:MRR:69.1,1247.0] || SkP0(skc5,skc4)* -> . % 0.91/1.13 1374[0:SpR:86.1,75.1] ssItem(skf44(u,v)) || -> SkP0(u,v)* strictorderedP(v). % 0.91/1.13 1383[0:SSi:1374.0,52.0] || -> SkP0(u,v)* strictorderedP(v). % 0.91/1.13 1392[2:Res:1383.0,1254.0] || -> strictorderedP(skc4)*. % 0.91/1.13 1393[2:MRR:1392.0,13.0] || -> . % 0.91/1.13 % SZS output end Refutation % 0.91/1.13 Formulae used in the proof : co1 ax2 ax60 ax62 ax64 ax66 ax69 ax72 ax74 ax38 ax68 ax77 % 0.91/1.13 %------------------------------------------------------------------------------