%------------------------------------------------------------------------------
% File : CSI_E---1.1
% Problem : LCL656+1.001 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar mcs_scs.jar %d %s
% Computer : n031.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 : Mon Sep 7 11:21:21 AM UTC 2026
% Result : Theorem 136.51s 136.50s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL656+1.001 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.02 % Command : java -jar mcs_scs.jar %d %s
% 0.07/0.35 % Computer : n031.cluster.edu
% 0.07/0.35 % Model : x86_64 x86_64
% 0.07/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.35 % Memory : 8046.5625MB
% 0.07/0.35 % OS : Linux 6.8.0-71-generic
% 0.07/0.35 % CPULimit : 300
% 0.07/0.35 % WCLimit : 300
% 0.07/0.35 % DateTime : Sat Sep 5 02:18:54 UTC 2026
% 0.07/0.35 % CPUTime :
% 0.23/0.47 start to proof:theBenchmark.p
% 136.51/136.50 % Version : CSI_E---1.1
% 136.51/136.50 % Problem : theBenchmark.p
% 136.51/136.50 % Proof found!
% 136.51/136.50 % SZS status Theorem for theBenchmark.p
% 136.51/136.50 % SZS output start Proof
% 136.51/136.50 fof(main, conjecture, ~(?[X1]:(~((~(![X2]:((~(r1(X1,X2))|p2(X2))))|~(((![X2]:((~(r1(X1,X2))|((((((~(![X1]:((~(r1(X2,X1))|~(((~(p2(X1))&~(p102(X1)))&p101(X1))))))&~(![X1]:((~(r1(X2,X1))|~(((p2(X1)&~(p102(X1)))&p101(X1)))))))|~((~(p101(X2))&p100(X2))))&(((![X1]:((~(r1(X2,X1))|~(p2(X1))|~(p101(X1))))|p2(X2))&(![X1]:((~(r1(X2,X1))|p2(X1)|~(p101(X1))))|~(p2(X2))))|~(p101(X2))))&(((![X1]:((~(r1(X2,X1))|~(p1(X1))|~(p100(X1))))|p1(X2))&(![X1]:((~(r1(X2,X1))|p1(X1)|~(p100(X1))))|~(p1(X2))))|~(p100(X2))))&(p101(X2)|~(p102(X2))))&(p100(X2)|~(p101(X2))))))&~(p101(X1)))&p100(X1))))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', main)).
% 136.51/136.50 fof(reflexivity, axiom, ![X1]:(r1(X1,X1)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', reflexivity)).
% 136.51/136.50 fof(c_0_2, negated_conjecture, ~(~(?[X1]:(~((~(![X2]:((~r1(X1,X2)|p2(X2))))|~(((![X2]:((~r1(X1,X2)|((((((~(![X1]:((~r1(X2,X1)|~(((~p2(X1)&~p102(X1))&p101(X1))))))&~(![X1]:((~r1(X2,X1)|~(((p2(X1)&~p102(X1))&p101(X1)))))))|~((~p101(X2)&p100(X2))))&(((![X1]:((~r1(X2,X1)|~p2(X1)|~p101(X1)))|p2(X2))&(![X1]:((~r1(X2,X1)|p2(X1)|~p101(X1)))|~p2(X2)))|~p101(X2)))&(((![X1]:((~r1(X2,X1)|~p1(X1)|~p100(X1)))|p1(X2))&(![X1]:((~r1(X2,X1)|p1(X1)|~p100(X1)))|~p1(X2)))|~p100(X2)))&(p101(X2)|~p102(X2)))&(p100(X2)|~p101(X2)))))&~p101(X1))&p100(X1)))))))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[main])])).
% 136.51/136.50 fof(c_0_3, negated_conjecture, ![X4, X5, X8, X9, X10, X11]:(((~r1(esk1_0,X4)|p2(X4))&(((((((((r1(X5,esk2_1(X5))|(p101(X5)|~p100(X5))|~r1(esk1_0,X5))&(((~p2(esk2_1(X5))|(p101(X5)|~p100(X5))|~r1(esk1_0,X5))&(~p102(esk2_1(X5))|(p101(X5)|~p100(X5))|~r1(esk1_0,X5)))&(p101(esk2_1(X5))|(p101(X5)|~p100(X5))|~r1(esk1_0,X5))))&((r1(X5,esk3_1(X5))|(p101(X5)|~p100(X5))|~r1(esk1_0,X5))&(((p2(esk3_1(X5))|(p101(X5)|~p100(X5))|~r1(esk1_0,X5))&(~p102(esk3_1(X5))|(p101(X5)|~p100(X5))|~r1(esk1_0,X5)))&(p101(esk3_1(X5))|(p101(X5)|~p100(X5))|~r1(esk1_0,X5)))))&((~r1(X5,X8)|~p2(X8)|~p101(X8)|p2(X5)|~p101(X5)|~r1(esk1_0,X5))&(~r1(X5,X9)|p2(X9)|~p101(X9)|~p2(X5)|~p101(X5)|~r1(esk1_0,X5))))&((~r1(X5,X10)|~p1(X10)|~p100(X10)|p1(X5)|~p100(X5)|~r1(esk1_0,X5))&(~r1(X5,X11)|p1(X11)|~p100(X11)|~p1(X5)|~p100(X5)|~r1(esk1_0,X5))))&(p101(X5)|~p102(X5)|~r1(esk1_0,X5)))&(p100(X5)|~p101(X5)|~r1(esk1_0,X5)))&~p101(esk1_0))&p100(esk1_0)))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])])])])])).
% 136.51/136.50 cnf(c_0_4, negated_conjecture, (p101(X1)|~p2(esk2_1(X1))|~p100(X1)|~r1(esk1_0,X1)), inference(split_conjunct,[status(thm)],[c_0_3])).
% 136.51/136.50 cnf(c_0_5, negated_conjecture, (p2(X1)|~r1(esk1_0,X1)), inference(split_conjunct,[status(thm)],[c_0_3])).
% 136.51/136.50 fof(c_0_6, plain, ![X12]:(r1(X12,X12)), inference(variable_rename,[status(thm)],[reflexivity])).
% 136.51/136.50 cnf(c_0_7, negated_conjecture, (p101(X1)|~p100(X1)|~r1(esk1_0,esk2_1(X1))|~r1(esk1_0,X1)), inference(spm,[status(thm)],[c_0_4, c_0_5])).
% 136.51/136.50 cnf(c_0_8, negated_conjecture, (r1(X1,esk2_1(X1))|p101(X1)|~p100(X1)|~r1(esk1_0,X1)), inference(split_conjunct,[status(thm)],[c_0_3])).
% 136.51/136.50 cnf(c_0_9, negated_conjecture, (p100(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_3])).
% 136.51/136.50 cnf(c_0_10, plain, (r1(X1,X1)), inference(split_conjunct,[status(thm)],[c_0_6])).
% 136.51/136.50 cnf(c_0_11, negated_conjecture, (~p101(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_3])).
% 136.51/136.50 cnf(c_0_12, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7, c_0_8]), c_0_9]), c_0_10])]), c_0_11]), ['proof']).
% 136.51/136.50 % SZS output end Proof
% 136.51/136.50 % User time : 0.007 s
% 136.51/136.50 % System time : 0.001 s
% 136.51/136.50 % Total time : 0.008 s
% 136.51/136.50 % User time : 0.009 s
% 136.51/136.50 % System time : 0.003 s
% 136.51/136.50 % Total time : 0.012 s
% 136.51/136.50
%------------------------------------------------------------------------------