%------------------------------------------------------------------------------ % File : SPASS---3.9 % Problem : SEU130+2 : TPTP v8.1.0. Released v3.3.0. % Transfm : none % Format : tptp % Command : run_spass %d %s % Computer : n005.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 14:34:10 EDT 2022 % Result : Theorem 0.19s 0.47s % Output : Refutation 0.19s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : SEU130+2 : TPTP v8.1.0. Released v3.3.0. % 0.03/0.13 % Command : run_spass %d %s % 0.13/0.33 % Computer : n005.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.33 % CPULimit : 300 % 0.13/0.33 % WCLimit : 600 % 0.13/0.33 % DateTime : Sun Jun 19 03:27:23 EDT 2022 % 0.13/0.34 % CPUTime : % 0.19/0.47 % 0.19/0.47 SPASS V 3.9 % 0.19/0.47 SPASS beiseite: Proof found. % 0.19/0.47 % SZS status Theorem % 0.19/0.47 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p % 0.19/0.47 SPASS derived 32 clauses, backtracked 0 clauses, performed 0 splits and kept 67 clauses. % 0.19/0.47 SPASS allocated 98272 KBytes. % 0.19/0.47 SPASS spent 0:00:00.12 on the problem. % 0.19/0.47 0:00:00.04 for the input. % 0.19/0.47 0:00:00.06 for the FLOTTER CNF translation. % 0.19/0.47 0:00:00.00 for inferences. % 0.19/0.47 0:00:00.00 for the backtracking. % 0.19/0.47 0:00:00.00 for the reduction. % 0.19/0.47 % 0.19/0.47 % 0.19/0.47 Here is a proof with depth 2, length 13 : % 0.19/0.47 % SZS output start Refutation % 0.19/0.47 3[0:Inp] || -> subset(skc4,skc5)*r. % 0.19/0.47 13[0:Inp] || equal(set_intersection2(skc4,skc5),skc4)** -> . % 0.19/0.47 38[0:Inp] || in(u,v)* subset(v,w)* -> in(u,w)*. % 0.19/0.47 50[0:Inp] || -> equal(u,set_intersection2(v,w)) in(skf9(w,v,u),u)* in(skf9(w,v,u),v)*. % 0.19/0.47 55[0:Inp] || in(skf9(u,v,w),u)* in(skf9(u,v,w),v)* in(skf9(u,v,w),w)* -> equal(w,set_intersection2(v,u)). % 0.19/0.47 61[0:Res:55.3,13.0] || in(skf9(skc5,skc4,skc4),skc4) in(skf9(skc5,skc4,skc4),skc4) in(skf9(skc5,skc4,skc4),skc5)* -> . % 0.19/0.47 62[0:Res:50.2,13.0] || -> in(skf9(skc5,skc4,skc4),skc4)* in(skf9(skc5,skc4,skc4),skc4)*. % 0.19/0.47 69[0:Res:3.0,38.0] || in(u,skc4) -> in(u,skc5)*. % 0.19/0.47 73[0:Obv:62.0] || -> in(skf9(skc5,skc4,skc4),skc4)*. % 0.19/0.47 74[0:Obv:61.0] || in(skf9(skc5,skc4,skc4),skc4) in(skf9(skc5,skc4,skc4),skc5)* -> . % 0.19/0.47 75[0:MRR:74.0,73.0] || in(skf9(skc5,skc4,skc4),skc5)* -> . % 0.19/0.47 96[0:Res:69.1,75.0] || in(skf9(skc5,skc4,skc4),skc4)* -> . % 0.19/0.47 97[0:MRR:96.0,73.0] || -> . % 0.19/0.47 % SZS output end Refutation % 0.19/0.47 Formulae used in the proof : t28_xboole_1 d3_tarski d3_xboole_0 % 0.19/0.47 %------------------------------------------------------------------------------