%------------------------------------------------------------------------------
% File : CSI_E---1.1
% Problem : LCL218-10 : TPTP v9.3.1. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar mcs_scs.jar %d %s
% 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 : Mon Sep 7 11:20:34 AM UTC 2026
% Result : Unsatisfiable 26.77s 4.47s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL218-10 : TPTP v9.3.1. Released v7.3.0.
% 0.00/0.02 % Command : java -jar mcs_scs.jar %d %s
% 0.07/0.33 % Computer : n018.cluster.edu
% 0.07/0.33 % Model : x86_64 x86_64
% 0.07/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.33 % Memory : 8046.5625MB
% 0.07/0.33 % OS : Linux 6.8.0-71-generic
% 0.07/0.33 % CPULimit : 300
% 0.07/0.33 % WCLimit : 300
% 0.07/0.33 % DateTime : Fri Sep 4 12:44:48 UTC 2026
% 0.07/0.34 % CPUTime :
% 0.11/0.41 start to proof:theBenchmark.p
% 26.77/4.47 % Version : CSI_E---1.1
% 26.77/4.47 % Problem : theBenchmark.p
% 26.77/4.47 % Proof found!
% 26.77/4.47 # SZS status Unsatisfiable
% 26.77/4.47 % SZS output start Proof
% 26.77/4.47 cnf(rule_2, axiom, (ifeq(theorem(X1),true,ifeq(axiom(or(not(X1),X2)),true,theorem(X2),true),true)=true), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', rule_2)).
% 26.77/4.47 cnf(axiom_1_5, axiom, (axiom(or(not(or(X1,or(X2,X3))),or(X2,or(X1,X3))))=true), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', axiom_1_5)).
% 26.77/4.47 cnf(ifeq_axiom, axiom, (ifeq(X1,X1,X2,X3)=X2), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', ifeq_axiom)).
% 26.77/4.47 cnf(rule_1, axiom, (ifeq(axiom(X1),true,theorem(X1),true)=true), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', rule_1)).
% 26.77/4.47 cnf(axiom_1_4, axiom, (axiom(or(not(or(X1,X2)),or(X2,X1)))=true), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', axiom_1_4)).
% 26.77/4.47 cnf(rule_3, axiom, (ifeq(theorem(or(not(X1),X2)),true,ifeq(axiom(or(not(X3),X1)),true,theorem(or(not(X3),X2)),true),true)=true), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', rule_3)).
% 26.77/4.47 cnf(axiom_1_3, axiom, (axiom(or(not(X1),or(X2,X1)))=true), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', axiom_1_3)).
% 26.77/4.47 cnf(prove_this, negated_conjecture, (theorem(or(not(or(not(or(p,q)),q)),or(not(p),q)))!=true), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', prove_this)).
% 26.77/4.47 cnf(c_0_8, axiom, (ifeq(theorem(X1),true,ifeq(axiom(or(not(X1),X2)),true,theorem(X2),true),true)=true), rule_2).
% 26.77/4.47 cnf(c_0_9, axiom, (axiom(or(not(or(X1,or(X2,X3))),or(X2,or(X1,X3))))=true), axiom_1_5).
% 26.77/4.47 cnf(c_0_10, axiom, (ifeq(X1,X1,X2,X3)=X2), ifeq_axiom).
% 26.77/4.47 cnf(c_0_11, axiom, (ifeq(axiom(X1),true,theorem(X1),true)=true), rule_1).
% 26.77/4.47 cnf(c_0_12, axiom, (axiom(or(not(or(X1,X2)),or(X2,X1)))=true), axiom_1_4).
% 26.77/4.47 cnf(c_0_13, axiom, (ifeq(theorem(or(not(X1),X2)),true,ifeq(axiom(or(not(X3),X1)),true,theorem(or(not(X3),X2)),true),true)=true), rule_3).
% 26.77/4.47 cnf(c_0_14, 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_8, c_0_9]), c_0_10])).
% 26.77/4.47 cnf(c_0_15, plain, (theorem(or(not(or(X1,X2)),or(X2,X1)))=true), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11, c_0_12]), c_0_10])).
% 26.77/4.47 cnf(c_0_16, axiom, (axiom(or(not(X1),or(X2,X1)))=true), axiom_1_3).
% 26.77/4.47 cnf(c_0_17, plain, (ifeq(theorem(or(not(or(X1,X2)),X3)),true,theorem(or(not(or(X2,X1)),X3)),true)=true), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13, c_0_12]), c_0_10])).
% 26.77/4.47 cnf(c_0_18, plain, (theorem(or(X1,or(not(or(X2,X1)),X2)))=true), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14, c_0_15]), c_0_10])).
% 26.77/4.47 cnf(c_0_19, plain, (ifeq(theorem(or(not(or(X1,X2)),X3)),true,theorem(or(not(X2),X3)),true)=true), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13, c_0_16]), c_0_10])).
% 26.77/4.47 cnf(c_0_20, plain, (theorem(or(not(or(X1,X2)),or(not(or(X3,not(or(X2,X1)))),X3)))=true), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17, c_0_18]), c_0_10])).
% 26.77/4.47 cnf(c_0_21, plain, (theorem(or(not(X1),or(not(or(X2,not(or(X1,X3)))),X2)))=true), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19, c_0_20]), c_0_10])).
% 26.77/4.47 cnf(c_0_22, negated_conjecture, (theorem(or(not(or(not(or(p,q)),q)),or(not(p),q)))!=true), inference(fof_simplification,[status(thm)],[prove_this])).
% 26.77/4.47 cnf(c_0_23, plain, (theorem(or(not(or(X1,not(or(X2,X3)))),or(not(X2),X1)))=true), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14, c_0_21]), c_0_10])).
% 26.77/4.47 cnf(c_0_24, negated_conjecture, (theorem(or(not(or(not(or(p,q)),q)),or(not(p),q)))!=true), c_0_22).
% 26.77/4.47 cnf(c_0_25, plain, (theorem(or(not(or(not(or(X1,X2)),X3)),or(not(X1),X3)))=true), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17, c_0_23]), c_0_10])).
% 26.77/4.47 cnf(c_0_26, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_24, c_0_25])]), ['proof']).
% 26.77/4.47 % SZS output end Proof
% 26.77/4.47 % User time : 3.870 s
% 26.77/4.47 % System time : 0.101 s
% 26.77/4.47 % Total time : 3.971 s
% 26.77/4.47 % User time : 3.872 s
% 26.77/4.47 % System time : 0.104 s
% 26.77/4.47 % Total time : 3.976 s
% 26.77/4.47
%------------------------------------------------------------------------------