%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : SYO674-1 : TPTP v9.3.1. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox2/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n018.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 : Thu Sep 24 09:12:16 AM UTC 2026
% Result : Unsatisfiable 59.55s 59.88s
% Output : Proof 59.65s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYO674-1 : TPTP v9.3.1. Released v7.3.0.
% 0.00/0.03 This is a CNF_UNS_RFO_NEQ_NHN problem
% 0.00/0.04 % Command : /export/starexec/sandbox2/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.35 % Computer : n018.cluster.edu
% 0.10/0.35 % Model : x86_64 x86_64
% 0.10/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.35 % Memory : 8046.5625MB
% 0.10/0.35 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Sun Sep 20 07:49:12 UTC 2026
% 0.10/0.36 % CPUTime :
% 59.55/59.88 % SZS status Unsatisfiable for theBenchmark
% 59.55/59.88 % SZS output start Proof for theBenchmark
% 59.55/59.89 cnf(clause_193, axiom,
% 59.55/59.89 ( ~E(s(0), f(suc(B_233))) | ~E(s(0), f(suc(B_232))) | ~iLEQ(suc(B_230), suc(B_231)) | ~E(s(0), f(B_229)) | ~E(s(0), f(suc(A_2))) | ~E(s(0), f(suc(B_229))) | ~E(s(0), f(B_232)) | ~E(s(0), f(B_233)) | ~E(s(0), f(B_231)) | ~iLEQ(suc(A_2), suc(B_229)) | ~iLEQ(suc(B_229), suc(B_230)) | ~E(s(0), f(suc(B_231))) | ~E(s(0), f(B_230)) | ~E(s(0), f(suc(B_230))) | ~iLEQ(suc(B_232), suc(B_233)) | ~E(s(0), f(A_2)) | ~iLEQ(suc(B_231), suc(B_232)) ),
% 59.55/59.89 file('theBenchmark.p', clause_193) ).
% 59.55/59.89
% 59.55/59.89 cnf(clause_298, axiom,
% 59.55/59.89 ( ~LE(f(B_228), s(s(0))) | E(s(0), f(B_228)) | LE(f(B_228), s(0)) ),
% 59.55/59.89 file('theBenchmark.p', clause_298) ).
% 59.55/59.89
% 59.55/59.89 cnf(clause_281, axiom,
% 59.55/59.89 ( ~E(0, f(A_3)) | ~E(0, f(suc(A_3))) | iLEQ(suc(A_3), suc(A_3)) ),
% 59.55/59.89 file('theBenchmark.p', clause_281) ).
% 59.55/59.89
% 59.55/59.89 cnf(clause_176, axiom,
% 59.55/59.89 ( ~LE(f(B_253), s(0)) | E(0, f(B_253)) | LE(f(B_253), 0) ),
% 59.55/59.89 file('theBenchmark.p', clause_176) ).
% 59.55/59.89
% 59.55/59.89 cnf(clause_139, axiom,
% 59.55/59.89 ( ~LE(f(B_158), s(s(s(0)))) | E(s(s(0)), f(B_158)) | LE(f(B_158), s(s(0))) ),
% 59.55/59.89 file('theBenchmark.p', clause_139) ).
% 59.55/59.89
% 59.55/59.89 cnf(clause_126, axiom,
% 59.55/59.89 ( ~E(s(s(0)), f(A_1)) | ~E(s(s(0)), f(suc(A_1))) | iLEQ(suc(A_1), suc(A_1)) ),
% 59.55/59.89 file('theBenchmark.p', clause_126) ).
% 59.55/59.89
% 59.55/59.89 cnf(clause_498, axiom,
% 59.55/59.89 ( LE(f(A), s(s(s(0)))) ),
% 59.55/59.89 file('theBenchmark.p', clause_498) ).
% 59.55/59.89
% 59.55/59.89 cnf(clause_204, axiom,
% 59.55/59.89 ( ~LE(f(z), 0) ),
% 59.55/59.89 file('theBenchmark.p', clause_204) ).
% 59.55/59.89
% 59.55/59.89 cnf(clause_129, axiom,
% 59.55/59.89 ( ~LE(f(suc(B_158)), s(s(s(0)))) | E(s(s(0)), f(suc(B_158))) | LE(f(B_158), s(s(0))) ),
% 59.55/59.89 file('theBenchmark.p', clause_129) ).
% 59.55/59.89
% 59.55/59.89 cnf(clause_431, axiom,
% 59.55/59.89 ( ~E(s(s(0)), f(A_1)) | ~E(s(s(0)), f(suc(B_163))) | ~E(s(s(0)), f(B_159)) | ~iLEQ(suc(B_160), suc(B_161)) | ~E(s(s(0)), f(suc(A_1))) | ~E(s(s(0)), f(B_162)) | ~E(s(s(0)), f(B_163)) | ~iLEQ(suc(B_159), suc(B_160)) | ~E(s(s(0)), f(suc(B_161))) | ~E(s(s(0)), f(suc(B_160))) | ~E(s(s(0)), f(suc(B_162))) | ~E(s(s(0)), f(B_160)) | ~iLEQ(suc(B_161), suc(B_162)) | ~E(s(s(0)), f(B_161)) | ~E(s(s(0)), f(suc(B_159))) | ~iLEQ(suc(B_162), suc(B_163)) | ~iLEQ(suc(A_1), suc(B_159)) ),
% 59.55/59.89 file('theBenchmark.p', clause_431) ).
% 59.55/59.89
% 59.55/59.89 cnf(clause_50, axiom,
% 59.55/59.89 ( ~LE(f(suc(B_253)), s(0)) | E(0, f(suc(B_253))) | LE(f(B_253), 0) ),
% 59.55/59.89 file('theBenchmark.p', clause_50) ).
% 59.55/59.89
% 59.55/59.89 cnf(clause_84, axiom,
% 59.55/59.89 ( ~LE(f(suc(B_228)), s(s(0))) | E(s(0), f(suc(B_228))) | LE(f(B_228), s(0)) ),
% 59.55/59.89 file('theBenchmark.p', clause_84) ).
% 59.55/59.89
% 59.55/59.89 cnf(clause_493, axiom,
% 59.55/59.89 ( ~E(s(0), f(A_2)) | ~E(s(0), f(suc(A_2))) | iLEQ(suc(A_2), suc(A_2)) ),
% 59.55/59.89 file('theBenchmark.p', clause_493) ).
% 59.55/59.89
% 59.55/59.89 cnf(clause_453, axiom,
% 59.55/59.89 ( ~iLEQ(suc(A_3), suc(B_254)) | ~E(0, f(B_254)) | ~E(0, f(suc(B_257))) | ~iLEQ(suc(B_255), suc(B_256)) | ~E(0, f(B_258)) | ~iLEQ(suc(B_256), suc(B_257)) | ~E(0, f(A_3)) | ~E(0, f(B_255)) | ~E(0, f(suc(B_254))) | ~iLEQ(suc(B_254), suc(B_255)) | ~E(0, f(suc(A_3))) | ~E(0, f(suc(B_256))) | ~iLEQ(suc(B_257), suc(B_258)) | ~E(0, f(suc(B_255))) | ~E(0, f(suc(B_258))) | ~E(0, f(B_256)) | ~E(0, f(B_257)) ),
% 59.55/59.89 file('theBenchmark.p', clause_453) ).
% 59.55/59.89
% 59.55/59.89 cnf(sat_proved, plain, $false,
% 59.55/59.89 inference(cadical, [status(thm)], [
% 59.65/59.90 ]) ).
% 59.65/59.90 % SZS output end Proof for theBenchmark
%------------------------------------------------------------------------------