%------------------------------------------------------------------------------ % File : SPASS---3.9 % Problem : SWC135-1 : TPTP v8.1.0. Released v2.4.0. % Transfm : none % Format : tptp % Command : run_spass %d %s % Computer : n010.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:01:58 EDT 2022 % Result : Unsatisfiable 1.81s 1.99s % Output : Refutation 1.81s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : SWC135-1 : TPTP v8.1.0. Released v2.4.0. % 0.03/0.13 % Command : run_spass %d %s % 0.13/0.34 % Computer : n010.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:05:25 EDT 2022 % 0.13/0.34 % CPUTime : % 1.81/1.99 % 1.81/1.99 SPASS V 3.9 % 1.81/1.99 SPASS beiseite: Proof found. % 1.81/1.99 % SZS status Theorem % 1.81/1.99 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p % 1.81/1.99 SPASS derived 2495 clauses, backtracked 2525 clauses, performed 71 splits and kept 4578 clauses. % 1.81/1.99 SPASS allocated 77911 KBytes. % 1.81/1.99 SPASS spent 0:00:01.62 on the problem. % 1.81/1.99 0:00:00.04 for the input. % 1.81/1.99 0:00:00.00 for the FLOTTER CNF translation. % 1.81/1.99 0:00:00.01 for inferences. % 1.81/1.99 0:00:00.03 for the backtracking. % 1.81/1.99 0:00:01.36 for the reduction. % 1.81/1.99 % 1.81/1.99 % 1.81/1.99 Here is a proof with depth 2, length 60 : % 1.81/1.99 % SZS output start Refutation % 1.81/1.99 1[0:Inp] || -> ssList(sk1)*. % 1.81/1.99 2[0:Inp] || -> ssList(sk2)*. % 1.81/1.99 5[0:Inp] || -> equal(sk4,sk2)**. % 1.81/1.99 7[0:Inp] || neq(sk4,nil)* -> . % 1.81/1.99 8[0:Inp] || cyclefreeP(sk2)* -> . % 1.81/1.99 9[0:Inp] || -> equalelemsP(nil)*. % 1.81/1.99 10[0:Inp] || -> duplicatefreeP(nil)*. % 1.81/1.99 11[0:Inp] || -> strictorderedP(nil)*. % 1.81/1.99 12[0:Inp] || -> totalorderedP(nil)*. % 1.81/1.99 13[0:Inp] || -> strictorderP(nil)*. % 1.81/1.99 14[0:Inp] || -> totalorderP(nil)*. % 1.81/1.99 15[0:Inp] || -> cyclefreeP(nil)*. % 1.81/1.99 16[0:Inp] || -> ssList(nil)*. % 1.81/1.99 80[0:Inp] ssList(u) || -> ssItem(v)* duplicatefreeP(u)*. % 1.81/1.99 108[0:Inp] ssList(u) ssList(v) || -> equal(u,v) neq(u,v)*. % 1.81/1.99 110[0:Inp] ssItem(u) ssItem(v) || -> equal(u,v) neq(u,v)*. % 1.81/1.99 185[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.81/1.99 196[0:Rew:5.0,7.0] || neq(sk2,nil)* -> . % 1.81/1.99 282[0:Res:2.0,80.0] || -> ssItem(u)* duplicatefreeP(sk2)*. % 1.81/1.99 297[0:Res:2.0,185.1] ssList(u) || equal(hd(u),hd(sk2))* equal(tl(u),tl(sk2)) -> equal(u,sk2) equal(nil,u) equal(nil,sk2). % 1.81/1.99 336[0:Res:2.0,108.1] ssList(u) || -> equal(sk2,u) neq(sk2,u)*. % 1.81/1.99 453[0:Res:1.0,80.0] || -> ssItem(u)* duplicatefreeP(sk1)*. % 1.81/1.99 550[1:Spt:80.1] || -> ssItem(u)*. % 1.81/1.99 580[1:MRR:110.1,110.0,550.0] || -> equal(u,v) neq(u,v)*. % 1.81/1.99 754[2:Spt:297.5] || -> equal(nil,sk2)**. % 1.81/1.99 812[2:Rew:754.0,15.0] || -> cyclefreeP(sk2)*. % 1.81/1.99 856[2:MRR:812.0,8.0] || -> . % 1.81/1.99 952[2:Spt:856.0,297.5,754.0] || equal(nil,sk2)** -> . % 1.81/1.99 953[2:Spt:856.0,297.0,297.1,297.2,297.3,297.4] ssList(u) || equal(hd(u),hd(sk2))* equal(tl(u),tl(sk2)) -> equal(u,sk2) equal(nil,u). % 1.81/1.99 1209[1:Res:580.1,196.0] || -> equal(nil,sk2)**. % 1.81/1.99 1210[2:MRR:1209.0,952.0] || -> . % 1.81/1.99 1211[1:Spt:1210.0,80.0,80.2] ssList(u) || -> duplicatefreeP(u)*. % 1.81/1.99 1227[2:Spt:453.0] || -> ssItem(u)*. % 1.81/1.99 1255[2:MRR:110.1,110.0,1227.0] || -> equal(u,v) neq(u,v)*. % 1.81/1.99 1425[3:Spt:297.5] || -> equal(nil,sk2)**. % 1.81/1.99 1427[3:Rew:1425.0,15.0] || -> cyclefreeP(sk2)*. % 1.81/1.99 1527[3:MRR:1427.0,8.0] || -> . % 1.81/1.99 1622[3:Spt:1527.0,297.5,1425.0] || equal(nil,sk2)** -> . % 1.81/1.99 1623[3:Spt:1527.0,297.0,297.1,297.2,297.3,297.4] ssList(u) || equal(hd(u),hd(sk2))* equal(tl(u),tl(sk2)) -> equal(u,sk2) equal(nil,u). % 1.81/1.99 1876[2:Res:1255.1,196.0] || -> equal(nil,sk2)**. % 1.81/1.99 1877[3:MRR:1876.0,1622.0] || -> . % 1.81/1.99 1878[2:Spt:1877.0,453.1] || -> duplicatefreeP(sk1)*. % 1.81/1.99 1881[3:Spt:282.0] || -> ssItem(u)*. % 1.81/1.99 1911[3:MRR:110.1,110.0,1881.0] || -> equal(u,v) neq(u,v)*. % 1.81/1.99 2077[4:Spt:297.5] || -> equal(nil,sk2)**. % 1.81/1.99 2079[4:Rew:2077.0,15.0] || -> cyclefreeP(sk2)*. % 1.81/1.99 2179[4:MRR:2079.0,8.0] || -> . % 1.81/1.99 2274[4:Spt:2179.0,297.5,2077.0] || equal(nil,sk2)** -> . % 1.81/1.99 2275[4:Spt:2179.0,297.0,297.1,297.2,297.3,297.4] ssList(u) || equal(hd(u),hd(sk2))* equal(tl(u),tl(sk2)) -> equal(u,sk2) equal(nil,u). % 1.81/1.99 2523[3:Res:1911.1,196.0] || -> equal(nil,sk2)**. % 1.81/1.99 2524[4:MRR:2523.0,2274.0] || -> . % 1.81/1.99 2525[3:Spt:2524.0,282.1] || -> duplicatefreeP(sk2)*. % 1.81/1.99 2526[4:Spt:297.5] || -> equal(nil,sk2)**. % 1.81/1.99 2528[4:Rew:2526.0,15.0] || -> cyclefreeP(sk2)*. % 1.81/1.99 2630[4:MRR:2528.0,8.0] || -> . % 1.81/1.99 2724[4:Spt:2630.0,297.5,2526.0] || equal(nil,sk2)** -> . % 1.81/1.99 2725[4:Spt:2630.0,297.0,297.1,297.2,297.3,297.4] ssList(u) || equal(hd(u),hd(sk2))* equal(tl(u),tl(sk2)) -> equal(u,sk2) equal(nil,u). % 1.81/1.99 3217[0:Res:336.2,196.0] ssList(nil) || -> equal(nil,sk2)**. % 1.81/1.99 3218[0:SSi:3217.0,16.0,15.0,14.0,13.0,12.0,11.0,10.0,9.0] || -> equal(nil,sk2)**. % 1.81/1.99 3219[4:MRR:3218.0,2724.0] || -> . % 1.81/1.99 % SZS output end Refutation % 1.81/1.99 Formulae used in the proof : co1_1 co1_2 co1_5 co1_7 co1_8 clause1 clause2 clause3 clause4 clause5 clause6 clause7 clause8 clause72 clause100 clause102 clause177 % 1.81/1.99 %------------------------------------------------------------------------------