%------------------------------------------------------------------------------ % File : SPASS---3.9 % Problem : SWC352-1 : TPTP v8.1.0. Released v2.4.0. % Transfm : none % Format : tptp % Command : run_spass %d %s % Computer : n020.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:30 EDT 2022 % Result : Unsatisfiable 1.21s 1.44s % Output : Refutation 1.21s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.12/0.12 % Problem : SWC352-1 : TPTP v8.1.0. Released v2.4.0. % 0.12/0.13 % Command : run_spass %d %s % 0.13/0.34 % Computer : n020.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 18:59:05 EDT 2022 % 0.13/0.34 % CPUTime : % 1.21/1.44 % 1.21/1.44 SPASS V 3.9 % 1.21/1.44 SPASS beiseite: Proof found. % 1.21/1.44 % SZS status Theorem % 1.21/1.44 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p % 1.21/1.44 SPASS derived 1761 clauses, backtracked 1640 clauses, performed 55 splits and kept 3269 clauses. % 1.21/1.44 SPASS allocated 77475 KBytes. % 1.21/1.44 SPASS spent 0:00:01.08 on the problem. % 1.21/1.44 0:00:00.04 for the input. % 1.21/1.44 0:00:00.00 for the FLOTTER CNF translation. % 1.21/1.44 0:00:00.01 for inferences. % 1.21/1.44 0:00:00.02 for the backtracking. % 1.21/1.44 0:00:00.85 for the reduction. % 1.21/1.44 % 1.21/1.44 % 1.21/1.44 Here is a proof with depth 2, length 70 : % 1.21/1.44 % SZS output start Refutation % 1.21/1.44 1[0:Inp] || -> ssList(sk1)*. % 1.21/1.44 2[0:Inp] || -> ssList(sk2)*. % 1.21/1.44 5[0:Inp] || -> equal(sk4,sk2)**. % 1.21/1.44 6[0:Inp] || -> equal(sk3,sk1)**. % 1.21/1.44 7[0:Inp] || frontsegP(sk2,sk1)* -> . % 1.21/1.44 8[0:Inp] || equal(nil,sk4)** -> equal(nil,sk3). % 1.21/1.44 10[0:Inp] || neq(sk4,nil) -> frontsegP(sk4,sk3)*. % 1.21/1.44 11[0:Inp] || -> equalelemsP(nil)*. % 1.21/1.44 12[0:Inp] || -> duplicatefreeP(nil)*. % 1.21/1.44 13[0:Inp] || -> strictorderedP(nil)*. % 1.21/1.44 14[0:Inp] || -> totalorderedP(nil)*. % 1.21/1.44 15[0:Inp] || -> strictorderP(nil)*. % 1.21/1.44 16[0:Inp] || -> totalorderP(nil)*. % 1.21/1.44 17[0:Inp] || -> cyclefreeP(nil)*. % 1.21/1.44 18[0:Inp] || -> ssList(nil)*. % 1.21/1.44 70[0:Inp] ssList(u) || -> frontsegP(u,nil)*. % 1.21/1.44 82[0:Inp] ssList(u) || -> ssItem(v)* duplicatefreeP(u)*. % 1.21/1.44 110[0:Inp] ssList(u) ssList(v) || -> equal(u,v) neq(u,v)*. % 1.21/1.44 112[0:Inp] ssItem(u) ssItem(v) || -> equal(u,v) neq(u,v)*. % 1.21/1.44 187[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.21/1.44 198[0:Rew:5.0,10.1,6.0,10.1,5.0,10.0] || neq(sk2,nil) -> frontsegP(sk2,sk1)*. % 1.21/1.44 199[0:MRR:198.1,7.0] || neq(sk2,nil)* -> . % 1.21/1.44 201[0:Rew:6.0,8.1,5.0,8.0] || equal(nil,sk2)** -> equal(nil,sk1). % 1.21/1.44 287[0:Res:2.0,82.0] || -> ssItem(u)* duplicatefreeP(sk2)*. % 1.21/1.44 292[0:Res:2.0,70.0] || -> frontsegP(sk2,nil)*. % 1.21/1.44 341[0:Res:2.0,110.1] ssList(u) || -> equal(sk2,u) neq(sk2,u)*. % 1.21/1.44 458[0:Res:1.0,82.0] || -> ssItem(u)* duplicatefreeP(sk1)*. % 1.21/1.44 473[0:Res:1.0,187.1] ssList(u) || equal(hd(u),hd(sk1))* equal(tl(u),tl(sk1)) -> equal(u,sk1) equal(nil,u) equal(nil,sk1). % 1.21/1.44 557[1:Spt:82.1] || -> ssItem(u)*. % 1.21/1.44 587[1:MRR:112.1,112.0,557.0] || -> equal(u,v) neq(u,v)*. % 1.21/1.44 761[2:Spt:473.5] || -> equal(nil,sk1)**. % 1.21/1.44 829[2:Rew:761.0,292.0] || -> frontsegP(sk2,sk1)*. % 1.21/1.44 872[2:MRR:829.0,7.0] || -> . % 1.21/1.44 957[2:Spt:872.0,473.5,761.0] || equal(nil,sk1)** -> . % 1.21/1.44 958[2:Spt:872.0,473.0,473.1,473.2,473.3,473.4] ssList(u) || equal(hd(u),hd(sk1))* equal(tl(u),tl(sk1)) -> equal(u,sk1) equal(nil,u). % 1.21/1.44 963[2:MRR:201.1,957.0] || equal(nil,sk2)** -> . % 1.21/1.44 1029[1:Res:587.1,199.0] || -> equal(nil,sk2)**. % 1.21/1.44 1030[2:MRR:1029.0,963.0] || -> . % 1.21/1.44 1031[1:Spt:1030.0,82.0,82.2] ssList(u) || -> duplicatefreeP(u)*. % 1.21/1.44 1049[2:Spt:458.0] || -> ssItem(u)*. % 1.21/1.44 1077[2:MRR:112.1,112.0,1049.0] || -> equal(u,v) neq(u,v)*. % 1.21/1.44 1247[3:Spt:473.5] || -> equal(nil,sk1)**. % 1.21/1.44 1259[3:Rew:1247.0,292.0] || -> frontsegP(sk2,sk1)*. % 1.21/1.44 1357[3:MRR:1259.0,7.0] || -> . % 1.21/1.44 1442[3:Spt:1357.0,473.5,1247.0] || equal(nil,sk1)** -> . % 1.21/1.44 1443[3:Spt:1357.0,473.0,473.1,473.2,473.3,473.4] ssList(u) || equal(hd(u),hd(sk1))* equal(tl(u),tl(sk1)) -> equal(u,sk1) equal(nil,u). % 1.21/1.44 1448[3:MRR:201.1,1442.0] || equal(nil,sk2)** -> . % 1.21/1.44 1512[2:Res:1077.1,199.0] || -> equal(nil,sk2)**. % 1.21/1.44 1513[3:MRR:1512.0,1448.0] || -> . % 1.21/1.44 1514[2:Spt:1513.0,458.1] || -> duplicatefreeP(sk1)*. % 1.21/1.44 1517[3:Spt:287.0] || -> ssItem(u)*. % 1.21/1.44 1547[3:MRR:112.1,112.0,1517.0] || -> equal(u,v) neq(u,v)*. % 1.21/1.44 1713[4:Spt:473.5] || -> equal(nil,sk1)**. % 1.21/1.44 1725[4:Rew:1713.0,292.0] || -> frontsegP(sk2,sk1)*. % 1.21/1.44 1823[4:MRR:1725.0,7.0] || -> . % 1.21/1.44 1908[4:Spt:1823.0,473.5,1713.0] || equal(nil,sk1)** -> . % 1.21/1.44 1909[4:Spt:1823.0,473.0,473.1,473.2,473.3,473.4] ssList(u) || equal(hd(u),hd(sk1))* equal(tl(u),tl(sk1)) -> equal(u,sk1) equal(nil,u). % 1.21/1.44 1914[4:MRR:201.1,1908.0] || equal(nil,sk2)** -> . % 1.21/1.44 1978[3:Res:1547.1,199.0] || -> equal(nil,sk2)**. % 1.21/1.44 1979[4:MRR:1978.0,1914.0] || -> . % 1.21/1.44 1980[3:Spt:1979.0,287.1] || -> duplicatefreeP(sk2)*. % 1.21/1.44 1981[4:Spt:473.5] || -> equal(nil,sk1)**. % 1.21/1.44 1993[4:Rew:1981.0,292.0] || -> frontsegP(sk2,sk1)*. % 1.21/1.44 2093[4:MRR:1993.0,7.0] || -> . % 1.21/1.44 2177[4:Spt:2093.0,473.5,1981.0] || equal(nil,sk1)** -> . % 1.21/1.44 2178[4:Spt:2093.0,473.0,473.1,473.2,473.3,473.4] ssList(u) || equal(hd(u),hd(sk1))* equal(tl(u),tl(sk1)) -> equal(u,sk1) equal(nil,u). % 1.21/1.44 2184[4:MRR:201.1,2177.0] || equal(nil,sk2)** -> . % 1.21/1.44 2297[0:Res:341.2,199.0] ssList(nil) || -> equal(nil,sk2)**. % 1.21/1.44 2298[0:SSi:2297.0,18.0,17.0,16.0,15.0,14.0,13.0,12.0,11.0] || -> equal(nil,sk2)**. % 1.21/1.44 2299[4:MRR:2298.0,2184.0] || -> . % 1.21/1.44 % SZS output end Refutation % 1.21/1.44 Formulae used in the proof : co1_1 co1_2 co1_5 co1_6 co1_7 co1_8 co1_10 clause1 clause2 clause3 clause4 clause5 clause6 clause7 clause8 clause60 clause72 clause100 clause102 clause177 % 1.21/1.44 %------------------------------------------------------------------------------