%------------------------------------------------------------------------------ % File : SPASS---3.9 % Problem : SWC407-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:03:52 EDT 2022 % Result : Unsatisfiable 2.24s 2.47s % Output : Refutation 2.24s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : SWC407-1 : TPTP v8.1.0. Released v2.4.0. % 0.12/0.12 % Command : run_spass %d %s % 0.13/0.33 % Computer : n010.cluster.edu % 0.13/0.33 % Model : x86_64 x86_64 % 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.33 % Memory : 8042.1875MB % 0.13/0.33 % 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 21:27:40 EDT 2022 % 0.13/0.34 % CPUTime : % 2.24/2.47 % 2.24/2.47 SPASS V 3.9 % 2.24/2.47 SPASS beiseite: Proof found. % 2.24/2.47 % SZS status Theorem % 2.24/2.47 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p % 2.24/2.47 SPASS derived 5380 clauses, backtracked 1840 clauses, performed 31 splits and kept 4968 clauses. % 2.24/2.47 SPASS allocated 82000 KBytes. % 2.24/2.47 SPASS spent 0:00:01.99 on the problem. % 2.24/2.47 0:00:00.04 for the input. % 2.24/2.47 0:00:00.00 for the FLOTTER CNF translation. % 2.24/2.47 0:00:00.05 for inferences. % 2.24/2.47 0:00:00.04 for the backtracking. % 2.24/2.47 0:00:01.71 for the reduction. % 2.24/2.47 % 2.24/2.47 % 2.24/2.47 Here is a proof with depth 2, length 76 : % 2.24/2.47 % SZS output start Refutation % 2.24/2.47 2[0:Inp] || -> ssList(sk2)*. % 2.24/2.47 5[0:Inp] || -> equal(sk4,sk2)**. % 2.24/2.47 6[0:Inp] || -> equal(sk3,sk1)**. % 2.24/2.47 7[0:Inp] || -> ssItem(sk5)*. % 2.24/2.47 8[0:Inp] || -> memberP(sk1,sk5)*. % 2.24/2.47 9[0:Inp] || memberP(sk2,sk5)* -> . % 2.24/2.47 10[0:Inp] || -> ssItem(sk6)* equal(nil,sk4). % 2.24/2.47 11[0:Inp] || -> ssItem(sk6)* equal(nil,sk3). % 2.24/2.47 12[0:Inp] || -> equal(cons(sk6,nil),sk3)** equal(nil,sk4). % 2.24/2.47 13[0:Inp] || -> memberP(sk4,sk6)* equal(nil,sk4). % 2.24/2.47 14[0:Inp] || -> equal(cons(sk6,nil),sk3)** equal(nil,sk3). % 2.24/2.47 15[0:Inp] || -> memberP(sk4,sk6)* equal(nil,sk3). % 2.24/2.47 16[0:Inp] || -> equalelemsP(nil)*. % 2.24/2.47 17[0:Inp] || -> duplicatefreeP(nil)*. % 2.24/2.47 18[0:Inp] || -> strictorderedP(nil)*. % 2.24/2.47 19[0:Inp] || -> totalorderedP(nil)*. % 2.24/2.47 20[0:Inp] || -> strictorderP(nil)*. % 2.24/2.47 21[0:Inp] || -> totalorderP(nil)*. % 2.24/2.47 22[0:Inp] || -> cyclefreeP(nil)*. % 2.24/2.47 23[0:Inp] || -> ssList(nil)*. % 2.24/2.47 86[0:Inp] ssItem(u) || memberP(nil,u)* -> . % 2.24/2.47 87[0:Inp] ssList(u) || -> ssItem(v)* duplicatefreeP(u)*. % 2.24/2.47 176[0:Inp] ssItem(u) ssItem(v) ssList(w) || memberP(cons(v,w),u)* -> equal(u,v) memberP(w,u). % 2.24/2.47 203[0:Rew:6.0,11.1] || -> ssItem(sk6)* equal(nil,sk1). % 2.24/2.47 204[0:Rew:203.1,10.1,5.0,10.1] || -> ssItem(sk6)* equal(sk2,sk1). % 2.24/2.47 205[0:Rew:6.0,15.1,5.0,15.0] || -> equal(nil,sk1) memberP(sk2,sk6)*. % 2.24/2.47 206[0:Rew:205.1,13.1,5.0,13.1,5.0,13.0] || -> equal(sk2,sk1) memberP(sk2,sk6)*. % 2.24/2.47 207[0:Rew:6.0,14.1,6.0,14.0] || -> equal(nil,sk1) equal(cons(sk6,nil),sk1)**. % 2.24/2.47 208[0:Rew:207.1,12.1,5.0,12.1,6.0,12.0] || -> equal(sk2,sk1) equal(cons(sk6,nil),sk1)**. % 2.24/2.47 396[0:Res:2.0,87.0] || -> ssItem(u)* duplicatefreeP(sk2)*. % 2.24/2.47 488[1:Spt:87.1] || -> ssItem(u)*. % 2.24/2.47 492[1:MRR:86.0,488.0] || memberP(nil,u)* -> . % 2.24/2.47 607[1:MRR:176.1,176.0,488.0] ssList(u) || memberP(cons(v,u),w)* -> equal(w,v) memberP(u,w). % 2.24/2.47 686[2:Spt:206.0] || -> equal(sk2,sk1)**. % 2.24/2.47 794[2:Rew:686.0,9.0] || memberP(sk1,sk5)* -> . % 2.24/2.47 848[2:MRR:794.0,8.0] || -> . % 2.24/2.47 935[2:Spt:848.0,206.0,686.0] || equal(sk2,sk1)** -> . % 2.24/2.47 936[2:Spt:848.0,206.1] || -> memberP(sk2,sk6)*. % 2.24/2.47 937[2:MRR:208.0,935.0] || -> equal(cons(sk6,nil),sk1)**. % 2.24/2.47 1874[2:SpL:937.0,607.1] ssList(nil) || memberP(sk1,u) -> equal(u,sk6) memberP(nil,u)*. % 2.24/2.47 1884[2:SSi:1874.0,16.0,17.0,18.0,19.0,20.0,21.0,22.0,23.0] || memberP(sk1,u) -> equal(u,sk6) memberP(nil,u)*. % 2.24/2.47 1885[2:MRR:1884.2,492.0] || memberP(sk1,u)* -> equal(u,sk6). % 2.24/2.47 1893[2:Res:8.0,1885.0] || -> equal(sk6,sk5)**. % 2.24/2.47 1895[2:Rew:1893.0,936.0] || -> memberP(sk2,sk5)*. % 2.24/2.47 1905[2:MRR:1895.0,9.0] || -> . % 2.24/2.47 1906[1:Spt:1905.0,87.0,87.2] ssList(u) || -> duplicatefreeP(u)*. % 2.24/2.47 1929[2:Spt:396.0] || -> ssItem(u)*. % 2.24/2.47 1940[2:MRR:86.0,1929.0] || memberP(nil,u)* -> . % 2.24/2.47 2048[2:MRR:176.1,176.0,1929.0] ssList(u) || memberP(cons(v,u),w)* -> equal(w,v) memberP(u,w). % 2.24/2.47 2124[3:Spt:206.0] || -> equal(sk2,sk1)**. % 2.24/2.47 2133[3:Rew:2124.0,9.0] || memberP(sk1,sk5)* -> . % 2.24/2.47 2290[3:MRR:2133.0,8.0] || -> . % 2.24/2.47 2378[3:Spt:2290.0,206.0,2124.0] || equal(sk2,sk1)** -> . % 2.24/2.47 2379[3:Spt:2290.0,206.1] || -> memberP(sk2,sk6)*. % 2.24/2.47 2380[3:MRR:208.0,2378.0] || -> equal(cons(sk6,nil),sk1)**. % 2.24/2.47 3360[3:SpL:2380.0,2048.1] ssList(nil) || memberP(sk1,u) -> equal(u,sk6) memberP(nil,u)*. % 2.24/2.47 3370[3:SSi:3360.0,23.0,22.0,21.0,20.0,19.0,18.0,17.0,16.0] || memberP(sk1,u) -> equal(u,sk6) memberP(nil,u)*. % 2.24/2.47 3371[3:MRR:3370.2,1940.0] || memberP(sk1,u)* -> equal(u,sk6). % 2.24/2.47 3379[3:Res:8.0,3371.0] || -> equal(sk6,sk5)**. % 2.24/2.47 3381[3:Rew:3379.0,2379.0] || -> memberP(sk2,sk5)*. % 2.24/2.47 3391[3:MRR:3381.0,9.0] || -> . % 2.24/2.47 3392[2:Spt:3391.0,396.1] || -> duplicatefreeP(sk2)*. % 2.24/2.47 3394[3:Spt:204.1] || -> equal(sk2,sk1)**. % 2.24/2.47 3403[3:Rew:3394.0,9.0] || memberP(sk1,sk5)* -> . % 2.24/2.47 3565[3:MRR:3403.0,8.0] || -> . % 2.24/2.47 3657[3:Spt:3565.0,204.1,3394.0] || equal(sk2,sk1)** -> . % 2.24/2.47 3658[3:Spt:3565.0,204.0] || -> ssItem(sk6)*. % 2.24/2.47 3659[3:MRR:206.0,3657.0] || -> memberP(sk2,sk6)*. % 2.24/2.47 3660[3:MRR:208.0,3657.0] || -> equal(cons(sk6,nil),sk1)**. % 2.24/2.47 7734[3:SpL:3660.0,176.3] ssItem(u) ssItem(sk6) ssList(nil) || memberP(sk1,u) -> equal(u,sk6) memberP(nil,u)*. % 2.24/2.47 7741[3:SSi:7734.2,7734.1,16.0,17.0,18.0,19.0,20.0,21.0,22.0,23.0,3658.0] ssItem(u) || memberP(sk1,u) -> equal(u,sk6) memberP(nil,u)*. % 2.24/2.47 7742[3:MRR:7741.3,86.1] ssItem(u) || memberP(sk1,u)* -> equal(u,sk6). % 2.24/2.47 7753[3:Res:8.0,7742.1] ssItem(sk5) || -> equal(sk6,sk5)**. % 2.24/2.47 7755[3:SSi:7753.0,7.0] || -> equal(sk6,sk5)**. % 2.24/2.47 7757[3:Rew:7755.0,3659.0] || -> memberP(sk2,sk5)*. % 2.24/2.47 7867[3:MRR:7757.0,9.0] || -> . % 2.24/2.47 % SZS output end Refutation % 2.24/2.47 Formulae used in the proof : co1_2 co1_5 co1_6 co1_7 co1_8 co1_9 co1_10 co1_11 co1_12 co1_13 co1_14 co1_15 clause1 clause2 clause3 clause4 clause5 clause6 clause7 clause8 clause71 clause72 clause161 % 2.24/2.47 %------------------------------------------------------------------------------