%------------------------------------------------------------------------------ % File : SPASS---3.9 % Problem : SWV390+1 : TPTP v8.1.0. Released v3.3.0. % Transfm : none % Format : tptp % Command : run_spass %d %s % Computer : n022.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 : Wed Jul 20 21:42:37 EDT 2022 % Result : Theorem 1.94s 2.11s % Output : Refutation 1.94s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : SWV390+1 : TPTP v8.1.0. Released v3.3.0. % 0.03/0.13 % Command : run_spass %d %s % 0.13/0.34 % Computer : n022.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 : Tue Jun 14 21:51:33 EDT 2022 % 0.13/0.34 % CPUTime : % 1.94/2.11 % 1.94/2.11 SPASS V 3.9 % 1.94/2.11 SPASS beiseite: Proof found. % 1.94/2.11 % SZS status Theorem % 1.94/2.11 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p % 1.94/2.11 SPASS derived 2845 clauses, backtracked 0 clauses, performed 0 splits and kept 1544 clauses. % 1.94/2.11 SPASS allocated 90347 KBytes. % 1.94/2.11 SPASS spent 0:00:01.73 on the problem. % 1.94/2.11 0:00:00.04 for the input. % 1.94/2.11 0:00:00.04 for the FLOTTER CNF translation. % 1.94/2.11 0:00:00.07 for inferences. % 1.94/2.11 0:00:00.00 for the backtracking. % 1.94/2.11 0:00:01.56 for the reduction. % 1.94/2.11 % 1.94/2.11 % 1.94/2.11 Here is a proof with depth 4, length 15 : % 1.94/2.11 % SZS output start Refutation % 1.94/2.11 2[0:Inp] || -> less_than(bottom,u)*. % 1.94/2.11 10[0:Inp] || check_cpq(triple(skc4,skc5,skc6))* -> . % 1.94/2.11 11[0:Inp] || less_than(skf3(u),skf2(u))*l -> . % 1.94/2.11 15[0:Inp] || -> check_cpq(insert_cpq(triple(skc4,skc5,skc6),skc7))*. % 1.94/2.11 31[0:Inp] || -> check_cpq(triple(u,v,w))* pair_in_list(v,skf2(v),skf3(v))*. % 1.94/2.11 37[0:Inp] || check_cpq(triple(u,v,w))*+ pair_in_list(v,x,y)* -> less_than(y,x). % 1.94/2.11 44[0:Inp] || -> equal(triple(insert_pqp(u,v),insert_slb(w,pair(v,bottom)),x),insert_cpq(triple(u,w,x),v))**. % 1.94/2.11 48[0:Inp] || check_cpq(triple(u,insert_slb(v,pair(w,x)),y))* less_than(x,w) -> check_cpq(triple(u,v,y)). % 1.94/2.11 61[0:Res:31.0,10.0] || -> pair_in_list(skc5,skf2(skc5),skf3(skc5))*. % 1.94/2.11 551[0:SpL:44.0,48.0] || check_cpq(insert_cpq(triple(u,v,w),x)) less_than(bottom,x) -> check_cpq(triple(insert_pqp(u,x),v,w))*. % 1.94/2.11 554[0:MRR:551.1,2.0] || check_cpq(insert_cpq(triple(u,v,w),x)) -> check_cpq(triple(insert_pqp(u,x),v,w))*. % 1.94/2.11 558[0:Res:554.1,37.0] || check_cpq(insert_cpq(triple(u,v,w),x))*+ pair_in_list(v,y,z)* -> less_than(z,y). % 1.94/2.11 3220[0:Res:15.0,558.0] || pair_in_list(skc5,u,v)* -> less_than(v,u). % 1.94/2.11 3226[0:Res:61.0,3220.0] || -> less_than(skf3(skc5),skf2(skc5))*l. % 1.94/2.11 3228[0:MRR:3226.0,11.0] || -> . % 1.94/2.11 % SZS output end Refutation % 1.94/2.11 Formulae used in the proof : bottom_smallest l26_co l26_li4142 transitivity ax42 ax37 % 1.94/2.11 %------------------------------------------------------------------------------