%------------------------------------------------------------------------------
% File : CSI_E---1.1
% Problem : LCL203-10 : TPTP v9.3.1. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar mcs_scs.jar %d %s
% Computer : n005.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:20:31 AM UTC 2026
% Result : Unsatisfiable 0.36s 0.67s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL203-10 : TPTP v9.3.1. Released v7.3.0.
% 0.00/0.03 % Command : java -jar mcs_scs.jar %d %s
% 0.09/0.35 % Computer : n005.cluster.edu
% 0.09/0.35 % Model : x86_64 x86_64
% 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35 % Memory : 8046.5625MB
% 0.09/0.35 % OS : Linux 6.8.0-71-generic
% 0.09/0.35 % CPULimit : 300
% 0.09/0.35 % WCLimit : 300
% 0.09/0.35 % DateTime : Sun Sep 6 00:36:20 UTC 2026
% 0.09/0.35 % CPUTime :
% 0.24/0.46 start to proof:theBenchmark.p
% 0.36/0.67 % Version : CSI_E---1.1
% 0.36/0.67 % Problem : theBenchmark.p
% 0.36/0.67 % Proof found!
% 0.36/0.67 # SZS status Unsatisfiable
% 0.36/0.67 % SZS output start Proof
% 0.36/0.67 cnf(axiom_1_3, axiom, (axiom(implies(X1,or(X2,X1)))=true), file('/export/starexec/sandbox/benchmark/theBenchmark.p', axiom_1_3)).
% 0.36/0.67 cnf(implies_definition, axiom, (implies(X1,X2)=or(not(X1),X2)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', implies_definition)).
% 0.36/0.67 cnf(rule_2, axiom, (ifeq(theorem(implies(X1,X2)),true,ifeq(theorem(X1),true,theorem(X2),true),true)=true), file('/export/starexec/sandbox/benchmark/theBenchmark.p', rule_2)).
% 0.36/0.67 cnf(rule_1, axiom, (ifeq(axiom(X1),true,theorem(X1),true)=true), file('/export/starexec/sandbox/benchmark/theBenchmark.p', rule_1)).
% 0.36/0.67 cnf(ifeq_axiom, axiom, (ifeq(X1,X1,X2,X3)=X2), file('/export/starexec/sandbox/benchmark/theBenchmark.p', ifeq_axiom)).
% 0.36/0.67 cnf(axiom_1_5, axiom, (axiom(implies(or(X1,or(X2,X3)),or(X2,or(X1,X3))))=true), file('/export/starexec/sandbox/benchmark/theBenchmark.p', axiom_1_5)).
% 0.36/0.67 cnf(axiom_1_4, axiom, (axiom(implies(or(X1,X2),or(X2,X1)))=true), file('/export/starexec/sandbox/benchmark/theBenchmark.p', axiom_1_4)).
% 0.36/0.67 cnf(axiom_1_6, axiom, (axiom(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2))))=true), file('/export/starexec/sandbox/benchmark/theBenchmark.p', axiom_1_6)).
% 0.36/0.67 cnf(prove_this, negated_conjecture, (theorem(implies(not(or(p,q)),or(not(p),not(q))))!=true), file('/export/starexec/sandbox/benchmark/theBenchmark.p', prove_this)).
% 0.36/0.67 cnf(c_0_9, axiom, (axiom(implies(X1,or(X2,X1)))=true), axiom_1_3).
% 0.36/0.67 cnf(c_0_10, axiom, (implies(X1,X2)=or(not(X1),X2)), implies_definition).
% 0.36/0.67 cnf(c_0_11, axiom, (ifeq(theorem(implies(X1,X2)),true,ifeq(theorem(X1),true,theorem(X2),true),true)=true), rule_2).
% 0.36/0.67 cnf(c_0_12, axiom, (ifeq(axiom(X1),true,theorem(X1),true)=true), rule_1).
% 0.36/0.67 cnf(c_0_13, plain, (axiom(or(not(X1),or(X2,X1)))=true), inference(rw,[status(thm)],[c_0_9, c_0_10])).
% 0.36/0.67 cnf(c_0_14, axiom, (ifeq(X1,X1,X2,X3)=X2), ifeq_axiom).
% 0.36/0.67 cnf(c_0_15, axiom, (axiom(implies(or(X1,or(X2,X3)),or(X2,or(X1,X3))))=true), axiom_1_5).
% 0.36/0.67 cnf(c_0_16, axiom, (axiom(implies(or(X1,X2),or(X2,X1)))=true), axiom_1_4).
% 0.36/0.67 cnf(c_0_17, plain, (ifeq(theorem(or(not(X1),X2)),true,ifeq(theorem(X1),true,theorem(X2),true),true)=true), inference(rw,[status(thm)],[c_0_11, c_0_10])).
% 0.36/0.67 cnf(c_0_18, plain, (theorem(or(not(X1),or(X2,X1)))=true), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12, c_0_13]), c_0_14])).
% 0.36/0.67 cnf(c_0_19, plain, (axiom(or(not(or(X1,or(X2,X3))),or(X2,or(X1,X3))))=true), inference(rw,[status(thm)],[c_0_15, c_0_10])).
% 0.36/0.67 cnf(c_0_20, axiom, (axiom(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2))))=true), axiom_1_6).
% 0.36/0.67 cnf(c_0_21, plain, (axiom(or(not(or(X1,X2)),or(X2,X1)))=true), inference(rw,[status(thm)],[c_0_16, c_0_10])).
% 0.36/0.67 cnf(c_0_22, plain, (ifeq(theorem(or(not(or(not(X1),or(X2,X1))),X3)),true,theorem(X3),true)=true), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17, c_0_18]), c_0_14])).
% 0.36/0.67 cnf(c_0_23, plain, (theorem(or(not(or(X1,or(X2,X3))),or(X2,or(X1,X3))))=true), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12, c_0_19]), c_0_14])).
% 0.36/0.67 cnf(c_0_24, plain, (axiom(or(not(or(not(X1),X2)),or(not(or(X3,X1)),or(X3,X2))))=true), inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_20, c_0_10]), c_0_10]), c_0_10])).
% 0.36/0.67 cnf(c_0_25, plain, (theorem(or(not(or(X1,X2)),or(X2,X1)))=true), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12, c_0_21]), c_0_14])).
% 0.36/0.67 cnf(c_0_26, plain, (theorem(or(X1,or(not(X2),X2)))=true), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22, c_0_23]), c_0_14])).
% 0.36/0.67 cnf(c_0_27, plain, (theorem(or(not(or(not(X1),X2)),or(not(or(X3,X1)),or(X3,X2))))=true), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12, c_0_24]), c_0_14])).
% 0.36/0.67 cnf(c_0_28, plain, (ifeq(theorem(or(X1,X2)),true,theorem(or(X2,X1)),true)=true), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17, c_0_25]), c_0_14])).
% 0.36/0.67 cnf(c_0_29, plain, (theorem(or(not(X1),X1))=true), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22, c_0_26]), c_0_14])).
% 0.36/0.67 cnf(c_0_30, plain, (ifeq(theorem(or(not(X1),X2)),true,theorem(or(not(or(X3,X1)),or(X3,X2))),true)=true), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17, c_0_27]), c_0_14])).
% 0.36/0.67 cnf(c_0_31, plain, (theorem(or(X1,not(X1)))=true), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28, c_0_29]), c_0_14])).
% 0.36/0.67 cnf(c_0_32, plain, (theorem(or(not(or(X1,X2)),or(X1,not(not(X2)))))=true), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30, c_0_31]), c_0_14])).
% 0.36/0.67 cnf(c_0_33, plain, (theorem(or(not(X1),not(not(or(X2,X1)))))=true), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22, c_0_32]), c_0_14])).
% 0.36/0.67 cnf(c_0_34, negated_conjecture, (theorem(implies(not(or(p,q)),or(not(p),not(q))))!=true), inference(fof_simplification,[status(thm)],[prove_this])).
% 0.36/0.67 cnf(c_0_35, plain, (ifeq(theorem(X1),true,theorem(or(X2,X1)),true)=true), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17, c_0_18]), c_0_14])).
% 0.36/0.67 cnf(c_0_36, plain, (theorem(or(not(not(or(X1,X2))),not(X2)))=true), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28, c_0_33]), c_0_14])).
% 0.36/0.67 cnf(c_0_37, negated_conjecture, (theorem(implies(not(or(p,q)),or(not(p),not(q))))!=true), c_0_34).
% 0.36/0.67 cnf(c_0_38, plain, (ifeq(theorem(or(X1,or(X2,X3))),true,theorem(or(X2,or(X1,X3))),true)=true), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17, c_0_23]), c_0_14])).
% 0.36/0.67 cnf(c_0_39, plain, (theorem(or(X1,or(not(not(or(X2,X3))),not(X3))))=true), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35, c_0_36]), c_0_14])).
% 0.36/0.67 cnf(c_0_40, negated_conjecture, (theorem(or(not(not(or(p,q))),or(not(p),not(q))))!=true), inference(rw,[status(thm)],[c_0_37, c_0_10])).
% 0.36/0.67 cnf(c_0_41, plain, (theorem(or(not(not(or(X1,X2))),or(X3,not(X2))))=true), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38, c_0_39]), c_0_14])).
% 0.36/0.67 cnf(c_0_42, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_40, c_0_41])]), ['proof']).
% 0.36/0.67 % SZS output end Proof
% 0.36/0.67 % User time : 0.144 s
% 0.36/0.67 % System time : 0.012 s
% 0.36/0.67 % Total time : 0.156 s
% 0.36/0.67 % User time : 0.751 s
% 0.36/0.67 % System time : 0.033 s
% 0.36/0.67 % Total time : 0.784 s
% 0.36/0.67
%------------------------------------------------------------------------------