%------------------------------------------------------------------------------
% File : CSI_E---1.1
% Problem : LCL684+1.001 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar mcs_scs.jar %d %s
% Computer : n011.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:30 AM UTC 2026
% Result : Theorem 0.23s 0.51s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL684+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.34 % Computer : n011.cluster.edu
% 0.07/0.34 % Model : x86_64 x86_64
% 0.07/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.34 % Memory : 8046.5625MB
% 0.07/0.34 % OS : Linux 6.8.0-71-generic
% 0.07/0.34 % CPULimit : 300
% 0.07/0.34 % WCLimit : 300
% 0.07/0.34 % DateTime : Sat Sep 5 16:33:43 UTC 2026
% 0.07/0.34 % CPUTime :
% 0.12/0.45 start to proof:theBenchmark.p
% 0.23/0.51 % Version : CSI_E---1.1
% 0.23/0.51 % Problem : theBenchmark.p
% 0.23/0.51 % Proof found!
% 0.23/0.51 % SZS status Theorem for theBenchmark.p
% 0.23/0.51 % SZS output start Proof
% 0.23/0.51 fof(main, conjecture, ~(?[X1]:(~((~(![X2]:((~(r1(X1,X2))|![X1]:((~(r1(X2,X1))|~((p201(X1)&p101(X1))))))))|~((p201(X1)&p101(X1))))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', main)).
% 0.23/0.51 fof(reflexivity, axiom, ![X1]:(r1(X1,X1)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', reflexivity)).
% 0.23/0.51 fof(c_0_2, negated_conjecture, ~(~(?[X1]:(~((~(![X2]:((~r1(X1,X2)|![X1]:((~r1(X2,X1)|~((p201(X1)&p101(X1))))))))|~((p201(X1)&p101(X1)))))))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[main])])).
% 0.23/0.51 fof(c_0_3, negated_conjecture, ![X5, X6]:(((~r1(esk1_0,X5)|(~r1(X5,X6)|(~p201(X6)|~p101(X6))))&(p201(esk1_0)&p101(esk1_0)))), 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])])])])])).
% 0.23/0.51 fof(c_0_4, plain, ![X7]:(r1(X7,X7)), inference(variable_rename,[status(thm)],[reflexivity])).
% 0.23/0.51 cnf(c_0_5, negated_conjecture, (~r1(esk1_0,X1)|~r1(X1,X2)|~p201(X2)|~p101(X2)), inference(split_conjunct,[status(thm)],[c_0_3])).
% 0.23/0.51 cnf(c_0_6, plain, (r1(X1,X1)), inference(split_conjunct,[status(thm)],[c_0_4])).
% 0.23/0.51 cnf(c_0_7, negated_conjecture, (~p101(X1)|~p201(X1)|~r1(esk1_0,X1)), inference(spm,[status(thm)],[c_0_5, c_0_6])).
% 0.23/0.51 cnf(c_0_8, negated_conjecture, (p101(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_3])).
% 0.23/0.51 cnf(c_0_9, negated_conjecture, (p201(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_3])).
% 0.23/0.51 cnf(c_0_10, negated_conjecture, ($false), 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_6])]), ['proof']).
% 0.23/0.51 % SZS output end Proof
% 0.23/0.51 % User time : 0.002 s
% 0.23/0.51 % System time : 0.002 s
% 0.23/0.51 % Total time : 0.004 s
% 0.23/0.51 % User time : 0.003 s
% 0.23/0.51 % System time : 0.005 s
% 0.23/0.51 % Total time : 0.009 s
% 0.23/0.51
%------------------------------------------------------------------------------