%------------------------------------------------------------------------------ % File : SPASS---3.9 % Problem : SWC208+1 : TPTP v8.1.0. Released v2.4.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 22:02:29 EDT 2022 % Result : Theorem 0.90s 1.13s % Output : Refutation 0.90s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.08/0.13 % Problem : SWC208+1 : TPTP v8.1.0. Released v2.4.0. % 0.08/0.14 % Command : run_spass %d %s % 0.14/0.35 % Computer : n005.cluster.edu % 0.14/0.35 % Model : x86_64 x86_64 % 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.35 % Memory : 8042.1875MB % 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.35 % CPULimit : 300 % 0.14/0.35 % WCLimit : 600 % 0.14/0.35 % DateTime : Sun Jun 12 04:59:39 EDT 2022 % 0.14/0.36 % CPUTime : % 0.90/1.13 % 0.90/1.13 SPASS V 3.9 % 0.90/1.13 SPASS beiseite: Proof found. % 0.90/1.13 % SZS status Theorem % 0.90/1.13 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p % 0.90/1.13 SPASS derived 867 clauses, backtracked 566 clauses, performed 27 splits and kept 1299 clauses. % 0.90/1.13 SPASS allocated 99101 KBytes. % 0.90/1.13 SPASS spent 0:00:00.75 on the problem. % 0.90/1.13 0:00:00.04 for the input. % 0.90/1.13 0:00:00.06 for the FLOTTER CNF translation. % 0.90/1.13 0:00:00.00 for inferences. % 0.90/1.13 0:00:00.01 for the backtracking. % 0.90/1.13 0:00:00.45 for the reduction. % 0.90/1.13 % 0.90/1.13 % 0.90/1.13 Here is a proof with depth 2, length 25 : % 0.90/1.13 % SZS output start Refutation % 0.90/1.13 1[0:Inp] || -> ssList(skc5)*. % 0.90/1.13 2[0:Inp] || -> ssList(skc4)*. % 0.90/1.13 13[0:Inp] || -> neq(skc5,nil)*. % 0.90/1.13 52[0:Inp] || neq(skc4,nil)* -> . % 0.90/1.13 60[0:Inp] || -> SkP0(u,v)* equal(nil,v). % 0.90/1.13 61[0:Inp] || -> SkP0(u,v)* equal(nil,u). % 0.90/1.13 70[0:Inp] || SkP0(skc4,skc5) -> neq(skc4,nil)*. % 0.90/1.13 186[0:Inp] ssList(u) ssList(v) || equal(tl(u),tl(v))* equal(hd(u),hd(v)) -> equal(u,v) equal(nil,v) equal(nil,u). % 0.90/1.13 195[0:MRR:70.1,52.0] || SkP0(skc4,skc5)* -> . % 0.90/1.13 284[0:Res:2.0,186.1] ssList(u) || equal(tl(skc4),tl(u))* equal(hd(skc4),hd(u)) -> equal(nil,u) equal(skc4,u) equal(skc4,nil). % 0.90/1.13 455[0:Res:1.0,186.1] ssList(u) || equal(tl(skc5),tl(u))* equal(hd(skc5),hd(u)) -> equal(nil,u) equal(skc5,u) equal(skc5,nil). % 0.90/1.13 551[1:Spt:284.5] || -> equal(skc4,nil)**. % 0.90/1.13 661[1:Rew:551.0,52.0] || neq(nil,nil)* -> . % 0.90/1.13 662[1:Rew:551.0,195.0] || SkP0(nil,skc5)* -> . % 0.90/1.13 808[2:Spt:455.5] || -> equal(skc5,nil)**. % 0.90/1.13 918[2:Rew:808.0,13.0] || -> neq(nil,nil)*. % 0.90/1.13 961[2:MRR:918.0,661.0] || -> . % 0.90/1.13 1053[2:Spt:961.0,455.5,808.0] || equal(skc5,nil)** -> . % 0.90/1.13 1054[2:Spt:961.0,455.0,455.1,455.2,455.3,455.4] ssList(u) || equal(tl(skc5),tl(u))* equal(hd(skc5),hd(u)) -> equal(nil,u) equal(skc5,u). % 0.90/1.13 1084[1:Res:60.0,662.0] || -> equal(skc5,nil)**. % 0.90/1.13 1085[2:MRR:1084.0,1053.0] || -> . % 0.90/1.13 1086[1:Spt:1085.0,284.5,551.0] || equal(skc4,nil)** -> . % 0.90/1.13 1087[1:Spt:1085.0,284.0,284.1,284.2,284.3,284.4] ssList(u) || equal(tl(skc4),tl(u))* equal(hd(skc4),hd(u)) -> equal(nil,u) equal(skc4,u). % 0.90/1.13 1406[0:Res:61.0,195.0] || -> equal(skc4,nil)**. % 0.90/1.13 1408[1:MRR:1406.0,1086.0] || -> . % 0.90/1.13 % SZS output end Refutation % 0.90/1.13 Formulae used in the proof : co1 ax77 % 0.90/1.13 %------------------------------------------------------------------------------