%------------------------------------------------------------------------------ % File : SPASS---3.9 % Problem : SYN549+1 : TPTP v8.1.0. Released v2.2.0. % Transfm : none % Format : tptp % Command : run_spass %d %s % Computer : n013.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 : Thu Jul 21 12:22:48 EDT 2022 % Result : Theorem 0.19s 0.45s % Output : Refutation 0.19s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.06/0.12 % Problem : SYN549+1 : TPTP v8.1.0. Released v2.2.0. % 0.06/0.13 % Command : run_spass %d %s % 0.12/0.34 % Computer : n013.cluster.edu % 0.12/0.34 % Model : x86_64 x86_64 % 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.34 % Memory : 8042.1875MB % 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.34 % CPULimit : 300 % 0.12/0.34 % WCLimit : 600 % 0.12/0.34 % DateTime : Mon Jul 11 19:23:30 EDT 2022 % 0.12/0.34 % CPUTime : % 0.19/0.45 % 0.19/0.45 SPASS V 3.9 % 0.19/0.45 SPASS beiseite: Proof found. % 0.19/0.45 % SZS status Theorem % 0.19/0.45 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.19/0.45 SPASS derived 101 clauses, backtracked 0 clauses, performed 0 splits and kept 71 clauses. % 0.19/0.45 SPASS allocated 97659 KBytes. % 0.19/0.45 SPASS spent 0:00:00.10 on the problem. % 0.19/0.45 0:00:00.04 for the input. % 0.19/0.45 0:00:00.03 for the FLOTTER CNF translation. % 0.19/0.45 0:00:00.00 for inferences. % 0.19/0.45 0:00:00.00 for the backtracking. % 0.19/0.45 0:00:00.01 for the reduction. % 0.19/0.45 % 0.19/0.45 % 0.19/0.45 Here is a proof with depth 3, length 25 : % 0.19/0.45 % SZS output start Refutation % 0.19/0.45 1[0:Inp] || -> reachable(u,u)*. % 0.19/0.45 2[0:Inp] || -> reachable(u,skf8(u))*r. % 0.19/0.45 4[0:Inp] || -> reachable(skf8(u),skf9(u))*l. % 0.19/0.45 5[0:Inp] || -> reachable(skf5(u),skf7(u))*l. % 0.19/0.45 6[0:Inp] || -> reachable(skf5(u),skf6(u))*l. % 0.19/0.45 7[0:Inp] SkP0(u) || -> q(skf9(u))* p(skf8(u)). % 0.19/0.45 8[0:Inp] p(u) || reachable(v,u)*+ -> SkP0(v)*. % 0.19/0.45 9[0:Inp] || reachable(u,v)* reachable(v,w)* -> reachable(u,w)*. % 0.19/0.45 10[0:Inp] || reachable(initial_world,u) -> q(skf7(u)) p(skf6(u)) SkP0(skf5(u))*. % 0.19/0.45 11[0:Inp] q(u) || reachable(v,w)*+ reachable(w,u)* -> SkP0(v)*. % 0.19/0.45 12[0:Inp] p(u) || reachable(skf5(v),u)* SkP0(skf5(v))* reachable(initial_world,v) -> . % 0.19/0.45 13[0:Inp] q(u) || SkP0(skf5(v))* reachable(initial_world,v) reachable(skf5(v),u)* -> . % 0.19/0.45 14[0:MRR:12.2,8.2] p(u) || reachable(initial_world,v) reachable(skf5(v),u)* -> . % 0.19/0.45 24[0:OCh:9.1,9.0,4.0,2.0] || -> reachable(u,skf9(u))*r. % 0.19/0.45 30[0:Res:6.0,8.1] p(skf6(u)) || -> SkP0(skf5(u))*. % 0.19/0.45 40[0:MRR:10.2,30.0] || reachable(initial_world,u) -> q(skf7(u)) SkP0(skf5(u))*. % 0.19/0.45 56[0:Res:2.0,14.2] p(skf8(skf5(u))) || reachable(initial_world,u)* -> . % 0.19/0.45 69[0:Res:1.0,11.1] q(u) || reachable(v,u)*+ -> SkP0(v)*. % 0.19/0.45 86[0:MRR:13.1,69.2] q(u) || reachable(initial_world,v) reachable(skf5(v),u)* -> . % 0.19/0.45 94[0:Res:5.0,69.1] q(skf7(u)) || -> SkP0(skf5(u))*. % 0.19/0.45 104[0:MRR:40.1,94.0] || reachable(initial_world,u) -> SkP0(skf5(u))*. % 0.19/0.45 113[0:Res:24.0,86.2] q(skf9(skf5(u))) || reachable(initial_world,u)* -> . % 0.19/0.45 123[0:SoR:113.0,7.1] SkP0(skf5(u)) || reachable(initial_world,u) -> p(skf8(skf5(u)))*. % 0.19/0.45 124[0:MRR:123.0,123.2,104.1,56.0] || reachable(initial_world,u)* -> . % 0.19/0.45 125[0:UnC:124.0,24.0] || -> . % 0.19/0.45 % SZS output end Refutation % 0.19/0.45 Formulae used in the proof : reflexivity_of_reachable prove_this transitivity_of_reachable % 0.19/0.45 %------------------------------------------------------------------------------