%------------------------------------------------------------------------------ % File : SPASS---3.9 % Problem : SEU263+1 : TPTP v8.1.0. Released v3.3.0. % Transfm : none % Format : tptp % Command : run_spass %d %s % Computer : n014.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:35:39 EDT 2022 % Result : Theorem 0.20s 0.50s % Output : Refutation 0.20s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.13 % Problem : SEU263+1 : TPTP v8.1.0. Released v3.3.0. % 0.03/0.14 % Command : run_spass %d %s % 0.13/0.35 % Computer : n014.cluster.edu % 0.13/0.35 % Model : x86_64 x86_64 % 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.35 % Memory : 8042.1875MB % 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.35 % CPULimit : 300 % 0.13/0.35 % WCLimit : 600 % 0.13/0.35 % DateTime : Sun Jun 19 20:38:33 EDT 2022 % 0.13/0.35 % CPUTime : % 0.20/0.50 % 0.20/0.50 SPASS V 3.9 % 0.20/0.50 SPASS beiseite: Proof found. % 0.20/0.50 % SZS status Theorem % 0.20/0.50 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.50 SPASS derived 285 clauses, backtracked 0 clauses, performed 0 splits and kept 206 clauses. % 0.20/0.50 SPASS allocated 97988 KBytes. % 0.20/0.50 SPASS spent 0:00:00.13 on the problem. % 0.20/0.50 0:00:00.03 for the input. % 0.20/0.50 0:00:00.03 for the FLOTTER CNF translation. % 0.20/0.50 0:00:00.01 for inferences. % 0.20/0.50 0:00:00.00 for the backtracking. % 0.20/0.50 0:00:00.03 for the reduction. % 0.20/0.50 % 0.20/0.50 % 0.20/0.50 Here is a proof with depth 3, length 21 : % 0.20/0.50 % SZS output start Refutation % 0.20/0.50 2[0:Inp] || -> subset(relation_rng(skc5),skc6)*l. % 0.20/0.50 3[0:Inp] || -> relation_of2_as_subset(skc5,skc4,skc7)*. % 0.20/0.50 5[0:Inp] || relation_of2_as_subset(skc5,skc4,skc6)* -> . % 0.20/0.50 10[0:Inp] || element(u,powerset(cartesian_product2(v,w)))* -> relation(u). % 0.20/0.50 12[0:Inp] || relation_of2(u,v,w) -> relation_of2_as_subset(u,v,w)*. % 0.20/0.50 13[0:Inp] || relation_of2_as_subset(u,v,w)* -> subset(relation_dom(u),v). % 0.20/0.50 16[0:Inp] || subset(u,cartesian_product2(v,w)) -> relation_of2(u,v,w)*. % 0.20/0.50 17[0:Inp] relation(u) || -> subset(u,cartesian_product2(relation_dom(u),relation_rng(u)))*r. % 0.20/0.50 18[0:Inp] || relation_of2_as_subset(u,v,w) -> element(u,powerset(cartesian_product2(v,w)))*. % 0.20/0.50 19[0:Inp] || subset(u,v)* subset(v,w)* -> subset(u,w)*. % 0.20/0.50 20[0:Inp] || subset(u,v) subset(w,x) -> subset(cartesian_product2(w,u),cartesian_product2(x,v))*. % 0.20/0.50 21[0:Res:3.0,13.0] || -> subset(relation_dom(skc5),skc4)*l. % 0.20/0.50 23[0:Res:3.0,18.0] || -> element(skc5,powerset(cartesian_product2(skc4,skc7)))*. % 0.20/0.50 25[0:Res:12.1,5.0] || relation_of2(skc5,skc4,skc6)* -> . % 0.20/0.50 31[0:Res:23.0,10.0] || -> relation(skc5)*. % 0.20/0.50 96[0:Res:16.1,25.0] || subset(skc5,cartesian_product2(skc4,skc6))*r -> . % 0.20/0.50 108[0:OCh:19.1,19.0,20.2,17.1] relation(u) || subset(relation_rng(u),v)*+ subset(relation_dom(u),w)* -> subset(u,cartesian_product2(w,v))*. % 0.20/0.50 157[0:Res:2.0,108.1] relation(skc5) || subset(relation_dom(skc5),u) -> subset(skc5,cartesian_product2(u,skc6))*r. % 0.20/0.50 171[0:SSi:157.0,31.0] || subset(relation_dom(skc5),u) -> subset(skc5,cartesian_product2(u,skc6))*r. % 0.20/0.50 306[0:Res:171.1,96.0] || subset(relation_dom(skc5),skc4)*l -> . % 0.20/0.50 317[0:MRR:306.0,21.0] || -> . % 0.20/0.50 % SZS output end Refutation % 0.20/0.50 Formulae used in the proof : t14_relset_1 cc1_relset_1 redefinition_m2_relset_1 t12_relset_1 d1_relset_1 t21_relat_1 dt_m2_relset_1 t1_xboole_1 t119_zfmisc_1 % 0.20/0.50 %------------------------------------------------------------------------------