%------------------------------------------------------------------------------ % File : SPASS---3.9 % Problem : SWV181+1 : TPTP v8.1.0. Bugfixed v3.3.0. % Transfm : none % Format : tptp % Command : run_spass %d %s % Computer : n017.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:41:32 EDT 2022 % Result : Theorem 0.51s 0.73s % Output : Refutation 0.51s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : SWV181+1 : TPTP v8.1.0. Bugfixed v3.3.0. % 0.03/0.13 % Command : run_spass %d %s % 0.12/0.34 % Computer : n017.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 : Wed Jun 15 07:24:39 EDT 2022 % 0.12/0.34 % CPUTime : % 0.51/0.73 % 0.51/0.73 SPASS V 3.9 % 0.51/0.73 SPASS beiseite: Proof found. % 0.51/0.73 % SZS status Theorem % 0.51/0.73 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p % 0.51/0.73 SPASS derived 477 clauses, backtracked 49 clauses, performed 6 splits and kept 480 clauses. % 0.51/0.73 SPASS allocated 86179 KBytes. % 0.51/0.73 SPASS spent 0:00:00.38 on the problem. % 0.51/0.73 0:00:00.04 for the input. % 0.51/0.73 0:00:00.08 for the FLOTTER CNF translation. % 0.51/0.73 0:00:00.00 for inferences. % 0.51/0.73 0:00:00.01 for the backtracking. % 0.51/0.73 0:00:00.13 for the reduction. % 0.51/0.73 % 0.51/0.73 % 0.51/0.73 Here is a proof with depth 3, length 13 : % 0.51/0.73 % SZS output start Refutation % 0.51/0.73 4[0:Inp] || -> leq(n1,loopcounter)*r. % 0.51/0.73 5[0:Inp] || -> gt(n1,loopcounter)*r. % 0.51/0.73 37[0:Inp] || gt(u,u)* -> . % 0.51/0.73 102[0:Inp] || leq(u,v)* -> gt(v,u) equal(u,v). % 0.51/0.73 107[0:Inp] || gt(u,v)* gt(v,w)* -> gt(u,w)*. % 0.51/0.73 256[0:Res:4.0,102.0] || -> gt(loopcounter,n1)*l equal(loopcounter,n1). % 0.51/0.73 462[1:Spt:256.1] || -> equal(loopcounter,n1)**. % 0.51/0.73 499[1:Rew:462.0,5.0] || -> gt(n1,n1)*. % 0.51/0.73 510[1:MRR:499.0,37.0] || -> . % 0.51/0.73 544[1:Spt:510.0,256.1,462.0] || equal(loopcounter,n1)** -> . % 0.51/0.73 545[1:Spt:510.0,256.0] || -> gt(loopcounter,n1)*l. % 0.51/0.73 775[1:OCh:107.1,107.0,5.0,545.0] || -> gt(n1,n1)*. % 0.51/0.73 776[1:MRR:775.0,37.0] || -> . % 0.51/0.73 % SZS output end Refutation % 0.51/0.73 Formulae used in the proof : cl5_nebula_init_0081 irreflexivity_gt leq_gt2 transitivity_gt % 0.51/0.73 %------------------------------------------------------------------------------