%------------------------------------------------------------------------------
% File : CSI_E---1.1
% Problem : LCL029-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar mcs_scs.jar %d %s
% Computer : n020.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:13 AM UTC 2026
% Result : Unsatisfiable 0.55s 0.58s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL029-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.03 % Command : java -jar mcs_scs.jar %d %s
% 0.07/0.39 % Computer : n020.cluster.edu
% 0.07/0.39 % Model : x86_64 x86_64
% 0.07/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.39 % Memory : 8046.5625MB
% 0.07/0.39 % OS : Linux 6.8.0-71-generic
% 0.07/0.39 % CPULimit : 300
% 0.07/0.39 % WCLimit : 300
% 0.07/0.39 % DateTime : Fri Sep 4 12:32:12 UTC 2026
% 0.07/0.39 % CPUTime :
% 0.16/0.51 start to proof:theBenchmark.p
% 0.55/0.58 % Version : CSI_E---1.1
% 0.55/0.58 % Problem : theBenchmark.p
% 0.55/0.58 % Proof found!
% 0.55/0.58 # SZS status Unsatisfiable
% 0.55/0.58 % SZS output start Proof
% 0.55/0.58 cnf(condensed_detachment, axiom, (is_a_theorem(X2)|~is_a_theorem(implies(X1,X2))|~is_a_theorem(X1)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', condensed_detachment)).
% 0.55/0.58 cnf(c0_3, axiom, (is_a_theorem(implies(implies(implies(X1,X2),X1),X1))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', c0_3)).
% 0.55/0.58 cnf(c0_1, axiom, (is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', c0_1)).
% 0.55/0.58 cnf(prove_c0_5, negated_conjecture, (~is_a_theorem(implies(implies(implies(a,falsehood),falsehood),a))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', prove_c0_5)).
% 0.55/0.58 cnf(c0_2, axiom, (is_a_theorem(implies(X1,implies(X2,X1)))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', c0_2)).
% 0.55/0.58 cnf(c0_4, axiom, (is_a_theorem(implies(falsehood,X1))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', c0_4)).
% 0.55/0.58 cnf(c_0_6, plain, (is_a_theorem(X2)|~is_a_theorem(implies(X1,X2))|~is_a_theorem(X1)), inference(fof_simplification,[status(thm)],[condensed_detachment])).
% 0.55/0.58 cnf(c_0_7, plain, (is_a_theorem(X2)|~is_a_theorem(implies(X1,X2))|~is_a_theorem(X1)), c_0_6).
% 0.55/0.58 cnf(c_0_8, axiom, (is_a_theorem(implies(implies(implies(X1,X2),X1),X1))), c0_3).
% 0.55/0.58 cnf(c_0_9, axiom, (is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3))))), c0_1).
% 0.55/0.58 cnf(c_0_10, plain, (is_a_theorem(X1)|~is_a_theorem(implies(implies(X1,X2),X1))), inference(pm,[status(thm)],[c_0_7, c_0_8])).
% 0.55/0.58 cnf(c_0_11, plain, (is_a_theorem(implies(implies(X1,X2),implies(X3,X2)))|~is_a_theorem(implies(X3,X1))), inference(pm,[status(thm)],[c_0_7, c_0_9])).
% 0.55/0.58 cnf(c_0_12, negated_conjecture, (~is_a_theorem(implies(implies(implies(a,falsehood),falsehood),a))), inference(fof_simplification,[status(thm)],[prove_c0_5])).
% 0.55/0.58 cnf(c_0_13, plain, (is_a_theorem(implies(X1,X2))|~is_a_theorem(implies(X1,implies(X1,X2)))), inference(pm,[status(thm)],[c_0_10, c_0_11])).
% 0.55/0.58 cnf(c_0_14, axiom, (is_a_theorem(implies(X1,implies(X2,X1)))), c0_2).
% 0.55/0.58 cnf(c_0_15, negated_conjecture, (~is_a_theorem(implies(implies(implies(a,falsehood),falsehood),a))), c_0_12).
% 0.55/0.58 cnf(c_0_16, plain, (is_a_theorem(implies(X1,X2))|~is_a_theorem(implies(X3,X2))|~is_a_theorem(implies(X1,X3))), inference(pm,[status(thm)],[c_0_7, c_0_11])).
% 0.55/0.58 cnf(c_0_17, plain, (is_a_theorem(implies(implies(X1,X2),X2))|~is_a_theorem(implies(implies(X1,X2),X1))), inference(pm,[status(thm)],[c_0_13, c_0_11])).
% 0.55/0.58 cnf(c_0_18, plain, (is_a_theorem(implies(X1,X2))|~is_a_theorem(X2)), inference(pm,[status(thm)],[c_0_7, c_0_14])).
% 0.55/0.58 cnf(c_0_19, negated_conjecture, (~is_a_theorem(implies(implies(implies(a,falsehood),falsehood),X1))|~is_a_theorem(implies(X1,a))), inference(pm,[status(thm)],[c_0_15, c_0_16])).
% 0.55/0.58 cnf(c_0_20, plain, (is_a_theorem(implies(X1,X2))|~is_a_theorem(implies(X1,implies(implies(X2,X3),X2)))), inference(pm,[status(thm)],[c_0_16, c_0_8])).
% 0.55/0.58 cnf(c_0_21, plain, (is_a_theorem(implies(implies(X1,X2),X2))|~is_a_theorem(X1)), inference(pm,[status(thm)],[c_0_17, c_0_18])).
% 0.55/0.58 cnf(c_0_22, negated_conjecture, (~is_a_theorem(implies(implies(implies(falsehood,X1),implies(implies(a,falsehood),X1)),a))), inference(pm,[status(thm)],[c_0_19, c_0_9])).
% 0.55/0.58 cnf(c_0_23, plain, (is_a_theorem(implies(implies(X1,implies(implies(X2,X3),X2)),X2))|~is_a_theorem(X1)), inference(pm,[status(thm)],[c_0_20, c_0_21])).
% 0.55/0.58 cnf(c_0_24, axiom, (is_a_theorem(implies(falsehood,X1))), c0_4).
% 0.55/0.58 cnf(c_0_25, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_22, c_0_23]), c_0_24])]), ['proof']).
% 0.55/0.58 % SZS output end Proof
% 0.55/0.58 % User time : 0.026 s
% 0.55/0.58 % System time : 0.006 s
% 0.55/0.58 % Total time : 0.032 s
% 0.55/0.58 % User time : 0.108 s
% 0.55/0.58 % System time : 0.019 s
% 0.55/0.58 % Total time : 0.127 s
% 0.55/0.58
%------------------------------------------------------------------------------