%------------------------------------------------------------------------------ % File : LisaST---0.9 % Problem : SYN415+1 : TPTP v9.3.1. Released v2.0.0. % Transfm : none % Format : tptp:raw % Command : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p % Computer : n003.cluster.edu % Model : x86_64 x86_64 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz % Memory : 8046.5625MB % OS : Linux 6.8.0-71-generic % CPULimit : 300s % WCLimit : 300s % DateTime : Sun Sep 27 09:22:05 AM UTC 2026 % Result : Theorem 10.26s 1.67s % Output : CNFRefutation 10.26s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.02 % Problem : SYN415+1 : TPTP v9.3.1. Released v2.0.0. % 0.00/0.04 % Command : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.09/0.34 % Computer : n003.cluster.edu % 0.09/0.34 % Model : x86_64 x86_64 % 0.09/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.09/0.34 % Memory : 8046.5625MB % 0.09/0.34 % OS : Linux 6.8.0-71-generic % 0.09/0.34 % CPULimit : 300 % 0.09/0.34 % WCLimit : 300 % 0.09/0.34 % DateTime : Sat Sep 26 17:43:09 UTC 2026 % 0.09/0.34 % CPUTime : % 0.09/0.35 Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p % 10.26/1.67 % SZS status Theorem for theBenchmark.p % 10.26/1.67 % SZS output start CNFRefutation for theBenchmark.p % 10.26/1.67 fof(kalish317, conjecture, ((? [X0] : f(X0) & ! [X1] : ! [X2] : (((f(X1) & f(X2)) => X1 = X2))) <=> ? [X3] : ((f(X3) & ! [X4] : ((f(X4) => X3 = X4)))))). % 10.26/1.67 fof(negated_conjecture, negated_conjecture, ~(((? [X0] : f(X0) & ! [X1] : ! [X2] : (((f(X1) & f(X2)) => X1 = X2))) <=> ? [X3] : ((f(X3) & ! [X4] : ((f(X4) => X3 = X4)))))), inference(negate_conjecture, [status(cth)], [kalish317])). % 10.26/1.67 cnf(c1, plain, X0 | f(sK3), inference(clausification, [status(esa)], [negated_conjecture])). % 10.26/1.67 cnf(c2, plain, X0 | ~f(X1) | sK3 = X1, inference(clausification, [status(esa)], [negated_conjecture])). % 10.26/1.67 cnf(c3, plain, ~f(X0) | f(sK2(X0)) | ~X1, inference(clausification, [status(esa)], [negated_conjecture])). % 10.26/1.67 cnf(c6, plain, ~f(X0) | X0 != sK2(X0) | ~X1, inference(clausification, [status(esa)], [negated_conjecture])). % 10.26/1.67 cnf(c9, plain, ~X0 | f(sK5), inference(clausification, [status(esa)], [negated_conjecture])). % 10.26/1.67 cnf(c10, plain, ~X0 | ~f(X1) | ~f(X2) | X1 = X2, inference(clausification, [status(esa)], [negated_conjecture])). % 10.26/1.67 cnf(c11, plain, X0 | ~f(X1) | f(sK9), inference(clausification, [status(esa)], [negated_conjecture])). % 10.26/1.67 cnf(c12, plain, X0 | ~f(X1) | f(sK10), inference(clausification, [status(esa)], [negated_conjecture])). % 10.26/1.67 cnf(c13, plain, X0 | ~f(X1) | sK9 != sK10, inference(clausification, [status(esa)], [negated_conjecture])). % 10.26/1.67 cnf(d0, plain, 'Ts0' | f(sK9) | 'Ts0', inference(resolution, [status(thm)], [c11,c1])). % 10.26/1.67 cnf(d1, plain, 'Ts0' | sK3 = sK9 | 'Ts0', inference(resolution, [status(thm)], [d0,c2])). % 10.26/1.67 cnf(d2, plain, X0 = sK5 | ~'Ts0' | ~f(X0) | ~'Ts0', inference(resolution, [status(thm)], [c10,c9])). % 10.26/1.67 cnf(d3, plain, sK2(X0) = sK5 | ~'Ts0' | ~'Ts0' | ~f(X0), inference(resolution, [status(thm)], [d2,c3])). % 10.26/1.67 cnf(d4, plain, sK2(sK5) = sK5 | ~'Ts0' | ~'Ts0', inference(resolution, [status(thm)], [d3,c9])). % 10.26/1.67 cnf(d5, plain, sK2(sK5) = sK5 | sK3 = sK9, inference(resolution, [status(thm)], [d4,d1])). % 10.26/1.67 cnf(d6, plain, sK5 != sK5 | ~'Ts0' | ~f(sK5) | sK3 = sK9, inference(superposition, [status(thm)], [d5,c6])). % 10.26/1.67 cnf(d7, plain, sK3 = sK9 | ~'Ts0' | ~f(sK5), inference(equality_resolution, [status(thm)], [d6])). % 10.26/1.67 cnf(d8, plain, sK3 = sK9 | ~'Ts0' | ~'Ts0', inference(resolution, [status(thm)], [d7,c9])). % 10.26/1.67 cnf(d9, plain, sK3 = sK9 | sK3 = sK9, inference(resolution, [status(thm)], [d8,d1])). % 10.26/1.67 cnf(d10, plain, 'Ts0' | f(sK10) | 'Ts0', inference(resolution, [status(thm)], [c12,d0])). % 10.26/1.67 cnf(d11, plain, 'Ts0' | sK3 = sK10 | 'Ts0', inference(resolution, [status(thm)], [d10,c2])). % 10.26/1.67 cnf(d12, plain, sK2(sK5) = sK5 | sK3 = sK10, inference(resolution, [status(thm)], [d4,d11])). % 10.26/1.67 cnf(d13, plain, sK5 != sK5 | ~'Ts0' | ~f(sK5) | sK3 = sK10, inference(superposition, [status(thm)], [d12,c6])). % 10.26/1.67 cnf(d14, plain, sK3 = sK10 | ~'Ts0' | ~f(sK5), inference(equality_resolution, [status(thm)], [d13])). % 10.26/1.67 cnf(d15, plain, sK3 = sK10 | ~'Ts0' | ~'Ts0', inference(resolution, [status(thm)], [d14,c9])). % 10.26/1.67 cnf(d16, plain, sK3 = sK10 | sK3 = sK10, inference(resolution, [status(thm)], [d15,d11])). % 10.26/1.67 cnf(d17, plain, sK9 != sK3 | 'Ts0' | ~f(X0), inference(demodulation, [status(thm)], [c13,d16])). % 10.26/1.67 cnf(d18, plain, sK3 != sK3 | 'Ts0' | ~f(X0), inference(demodulation, [status(thm)], [d17,d9])). % 10.26/1.67 cnf(d19, plain, 'Ts0' | ~f(X0), inference(equality_resolution, [status(thm)], [d18])). % 10.26/1.67 cnf(d20, plain, 'Ts0' | 'Ts0', inference(resolution, [status(thm)], [d19,c1])). % 10.26/1.67 cnf(d21, plain, X0 != sK2(X0) | ~f(X0), inference(resolution, [status(thm)], [d20,c6])). % 10.26/1.67 cnf(d22, plain, sK2(sK5) = sK5, inference(resolution, [status(thm)], [d20,d4])). % 10.26/1.67 cnf(d23, plain, sK5 != sK5 | ~f(sK5), inference(superposition, [status(thm)], [d22,d21])). % 10.26/1.67 cnf(d24, plain, f(sK5), inference(resolution, [status(thm)], [d20,c9])). % 10.26/1.67 cnf(d25, plain, sK5 != sK5, inference(resolution, [status(thm)], [d24,d23])). % 10.26/1.67 cnf(d26, plain, $false, inference(equality_resolution, [status(thm)], [d25])). % 10.26/1.67 % SZS output end CNFRefutation for theBenchmark.p %------------------------------------------------------------------------------