%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : REL018-1 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n009.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 : Thu Sep 24 02:03:56 PM UTC 2026
% Result : Unsatisfiable 0.10s 0.45s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 14
% Syntax : Number of clauses : 62 ( 62 unt; 0 nHn; 16 RR)
% Number of literals : 62 ( 61 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 4 con; 0-2 aty)
% Number of variables : 70 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(converse_multiplicativity_10,axiom,
converse(composition(X1,X2)) = composition(converse(X2),converse(X1)),
file('/export/starexec/sandbox/benchmark/Axioms/REL001-0.ax',converse_multiplicativity_10) ).
cnf(composition_identity_6,axiom,
composition(X1,one) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/REL001-0.ax',composition_identity_6) ).
cnf(converse_idempotence_8,axiom,
converse(converse(X1)) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/REL001-0.ax',converse_idempotence_8) ).
cnf(converse_cancellativity_11,axiom,
join(composition(converse(X1),complement(composition(X1,X2))),complement(X2)) = complement(X2),
file('/export/starexec/sandbox/benchmark/Axioms/REL001-0.ax',converse_cancellativity_11) ).
cnf(maddux1_join_commutativity_1,axiom,
join(X1,X2) = join(X2,X1),
file('/export/starexec/sandbox/benchmark/Axioms/REL001-0.ax',maddux1_join_commutativity_1) ).
cnf(def_zero_13,axiom,
zero = meet(X1,complement(X1)),
file('/export/starexec/sandbox/benchmark/Axioms/REL001-0.ax',def_zero_13) ).
cnf(maddux4_definiton_of_meet_4,axiom,
meet(X1,X2) = complement(join(complement(X1),complement(X2))),
file('/export/starexec/sandbox/benchmark/Axioms/REL001-0.ax',maddux4_definiton_of_meet_4) ).
cnf(def_top_12,axiom,
top = join(X1,complement(X1)),
file('/export/starexec/sandbox/benchmark/Axioms/REL001-0.ax',def_top_12) ).
cnf(maddux3_a_kind_of_de_Morgan_3,axiom,
X1 = join(complement(join(complement(X1),complement(X2))),complement(join(complement(X1),X2))),
file('/export/starexec/sandbox/benchmark/Axioms/REL001-0.ax',maddux3_a_kind_of_de_Morgan_3) ).
cnf(maddux2_join_associativity_2,axiom,
join(X1,join(X2,X3)) = join(join(X1,X2),X3),
file('/export/starexec/sandbox/benchmark/Axioms/REL001-0.ax',maddux2_join_associativity_2) ).
cnf(converse_additivity_9,axiom,
converse(join(X1,X2)) = join(converse(X1),converse(X2)),
file('/export/starexec/sandbox/benchmark/Axioms/REL001-0.ax',converse_additivity_9) ).
cnf(goals_14,negated_conjecture,
composition(sk1,top) = sk1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals_14) ).
cnf(composition_distributivity_7,axiom,
composition(join(X1,X2),X3) = join(composition(X1,X3),composition(X2,X3)),
file('/export/starexec/sandbox/benchmark/Axioms/REL001-0.ax',composition_distributivity_7) ).
cnf(goals_15,negated_conjecture,
composition(complement(sk1),top) != complement(sk1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals_15) ).
cnf(c_0_14,axiom,
converse(composition(X1,X2)) = composition(converse(X2),converse(X1)),
converse_multiplicativity_10 ).
cnf(c_0_15,axiom,
composition(X1,one) = X1,
composition_identity_6 ).
cnf(c_0_16,plain,
composition(converse(one),converse(X1)) = converse(X1),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_17,axiom,
converse(converse(X1)) = X1,
converse_idempotence_8 ).
cnf(c_0_18,plain,
composition(converse(one),X1) = X1,
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_19,axiom,
join(composition(converse(X1),complement(composition(X1,X2))),complement(X2)) = complement(X2),
converse_cancellativity_11 ).
cnf(c_0_20,axiom,
join(X1,X2) = join(X2,X1),
maddux1_join_commutativity_1 ).
cnf(c_0_21,plain,
converse(one) = one,
inference(spm,[status(thm)],[c_0_15,c_0_18]) ).
cnf(c_0_22,axiom,
zero = meet(X1,complement(X1)),
def_zero_13 ).
cnf(c_0_23,axiom,
meet(X1,X2) = complement(join(complement(X1),complement(X2))),
maddux4_definiton_of_meet_4 ).
cnf(c_0_24,plain,
join(complement(X1),composition(converse(X2),complement(composition(X2,X1)))) = complement(X1),
inference(rw,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_25,plain,
composition(one,X1) = X1,
inference(rw,[status(thm)],[c_0_18,c_0_21]) ).
cnf(c_0_26,plain,
zero = complement(join(complement(X1),complement(complement(X1)))),
inference(rw,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_27,axiom,
top = join(X1,complement(X1)),
def_top_12 ).
cnf(c_0_28,plain,
join(complement(X1),complement(X1)) = complement(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_21]),c_0_25]) ).
cnf(c_0_29,plain,
complement(top) = zero,
inference(rw,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_30,axiom,
X1 = join(complement(join(complement(X1),complement(X2))),complement(join(complement(X1),X2))),
maddux3_a_kind_of_de_Morgan_3 ).
cnf(c_0_31,axiom,
join(X1,join(X2,X3)) = join(join(X1,X2),X3),
maddux2_join_associativity_2 ).
cnf(c_0_32,plain,
join(zero,zero) = zero,
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_33,plain,
join(complement(join(complement(X1),X2)),complement(join(complement(X1),complement(X2)))) = X1,
inference(rw,[status(thm)],[c_0_30,c_0_20]) ).
cnf(c_0_34,plain,
join(zero,join(zero,X1)) = join(zero,X1),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_35,plain,
join(zero,complement(complement(X1))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_28]),c_0_27]),c_0_29]),c_0_20]) ).
cnf(c_0_36,axiom,
converse(join(X1,X2)) = join(converse(X1),converse(X2)),
converse_additivity_9 ).
cnf(c_0_37,plain,
join(zero,X1) = X1,
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_38,plain,
join(X1,join(complement(X1),X2)) = join(top,X2),
inference(spm,[status(thm)],[c_0_31,c_0_27]) ).
cnf(c_0_39,plain,
join(converse(zero),converse(X1)) = converse(X1),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_40,plain,
join(top,complement(X1)) = top,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_28]),c_0_27]) ).
cnf(c_0_41,plain,
complement(complement(X1)) = X1,
inference(rw,[status(thm)],[c_0_35,c_0_37]) ).
cnf(c_0_42,negated_conjecture,
composition(sk1,top) = sk1,
goals_14 ).
cnf(c_0_43,plain,
join(X1,zero) = X1,
inference(spm,[status(thm)],[c_0_20,c_0_37]) ).
cnf(c_0_44,plain,
join(converse(zero),X1) = X1,
inference(spm,[status(thm)],[c_0_39,c_0_17]) ).
cnf(c_0_45,plain,
join(top,X1) = top,
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_46,negated_conjecture,
composition(converse(sk1),complement(sk1)) = zero,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_42]),c_0_29]),c_0_29]),c_0_37]) ).
cnf(c_0_47,plain,
converse(zero) = zero,
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_48,plain,
join(converse(top),converse(X1)) = converse(top),
inference(spm,[status(thm)],[c_0_36,c_0_45]) ).
cnf(c_0_49,axiom,
composition(join(X1,X2),X3) = join(composition(X1,X3),composition(X2,X3)),
composition_distributivity_7 ).
cnf(c_0_50,negated_conjecture,
composition(converse(complement(sk1)),sk1) = zero,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_46]),c_0_47]),c_0_17]) ).
cnf(c_0_51,plain,
complement(zero) = top,
inference(spm,[status(thm)],[c_0_27,c_0_37]) ).
cnf(c_0_52,plain,
join(X1,top) = top,
inference(spm,[status(thm)],[c_0_20,c_0_45]) ).
cnf(c_0_53,plain,
join(converse(top),X1) = converse(top),
inference(spm,[status(thm)],[c_0_48,c_0_17]) ).
cnf(c_0_54,plain,
join(composition(top,X1),composition(X2,X1)) = composition(top,X1),
inference(spm,[status(thm)],[c_0_49,c_0_45]) ).
cnf(c_0_55,negated_conjecture,
join(complement(sk1),composition(complement(sk1),top)) = complement(sk1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_50]),c_0_17]),c_0_51]) ).
cnf(c_0_56,plain,
converse(top) = top,
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_57,plain,
join(X1,composition(top,X1)) = composition(top,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_25]),c_0_20]) ).
cnf(c_0_58,negated_conjecture,
composition(complement(sk1),top) != complement(sk1),
inference(fof_simplification,[status(thm)],[goals_15]) ).
cnf(c_0_59,negated_conjecture,
composition(top,converse(complement(sk1))) = converse(complement(sk1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_55]),c_0_14]),c_0_56]),c_0_57]) ).
cnf(c_0_60,negated_conjecture,
composition(complement(sk1),top) != complement(sk1),
c_0_58 ).
cnf(c_0_61,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_59]),c_0_17]),c_0_17]),c_0_56]),c_0_60]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : REL018-1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.37 % Computer : n009.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Mon Sep 21 04:00:28 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.41 Running first-order theorem proving
% 0.10/0.41 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.45 % Version: 3.5.1
% 0.10/0.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.10/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.10/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.10/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.10/0.45 % Starting sh5l with 300s (1) cores
% 0.10/0.45 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 800046 completed with status 0
% 0.10/0.45 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.10/0.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.10/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.10/0.45 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.10/0.45 % No SInE strategy applied
% 0.10/0.45 % Search class: FUUPM-FFSF21-MFFFFFNN
% 0.10/0.45 % Scheduled 8 strats onto 5 cores with 1500 seconds (1500 total)
% 0.10/0.45 % Starting SubtermCWHack with 136s (1) cores
% 0.10/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.10/0.45 % Starting H----_047_B31_F1_PI_AE_R4_CS_SP_S2S with 136s (1) cores
% 0.10/0.45 % Starting G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y with 136s (1) cores
% 0.10/0.45 % Starting U----_043_B31_F1_PI_AE_CS_SP_S2S with 136s (1) cores
% 0.10/0.45 % H----_047_B31_F1_PI_AE_R4_CS_SP_S2S with pid 800053 completed with status 0
% 0.10/0.45 % Result found by H----_047_B31_F1_PI_AE_R4_CS_SP_S2S
% 0.10/0.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.10/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.10/0.45 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.10/0.45 % No SInE strategy applied
% 0.10/0.45 % Search class: FUUPM-FFSF21-MFFFFFNN
% 0.10/0.45 % Scheduled 8 strats onto 5 cores with 1500 seconds (1500 total)
% 0.10/0.45 % Starting SubtermCWHack with 136s (1) cores
% 0.10/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.10/0.45 % Starting H----_047_B31_F1_PI_AE_R4_CS_SP_S2S with 136s (1) cores
% 0.10/0.45 % Preprocessing time : 0.001 s
% 0.10/0.45
% 0.10/0.45 % Proof found!
% 0.10/0.45 % SZS status Unsatisfiable
% 0.10/0.45 % SZS output start CNFRefutation
% See solution above
% 0.10/0.45 % Parsed axioms : 15
% 0.10/0.45 % Removed by relevancy pruning/SinE : 0
% 0.10/0.45 % Initial clauses : 15
% 0.10/0.45 % Removed in clause preprocessing : 1
% 0.10/0.45 % Initial clauses in saturation : 14
% 0.10/0.45 % Processed clauses : 190
% 0.10/0.45 % ...of these trivial : 63
% 0.10/0.45 % ...subsumed : 18
% 0.10/0.45 % ...remaining for further processing : 109
% 0.10/0.45 % Other redundant clauses eliminated : 0
% 0.10/0.45 % Clauses deleted for lack of memory : 0
% 0.10/0.45 % Backward-subsumed : 0
% 0.10/0.45 % Backward-rewritten : 42
% 0.10/0.45 % Generated clauses : 2085
% 0.10/0.45 % ...of the previous two non-redundant : 835
% 0.10/0.45 % ...aggressively subsumed : 0
% 0.10/0.45 % Contextual simplify-reflections : 0
% 0.10/0.45 % Paramodulations : 2085
% 0.10/0.45 % Factorizations : 0
% 0.10/0.45 % NegExts : 0
% 0.10/0.45 % Equation resolutions : 0
% 0.10/0.45 % Disequality decompositions : 0
% 0.10/0.45 % Total rewrite steps : 3102
% 0.10/0.45 % ...of those cached : 2405
% 0.10/0.45 % Propositional unsat checks : 0
% 0.10/0.45 % Propositional check models : 0
% 0.10/0.45 % Propositional check unsatisfiable : 0
% 0.10/0.45 % Propositional clauses : 0
% 0.10/0.45 % Propositional clauses after purity: 0
% 0.10/0.45 % Propositional unsat core size : 0
% 0.10/0.45 % Propositional preprocessing time : 0.000
% 0.10/0.45 % Propositional encoding time : 0.000
% 0.10/0.45 % Propositional solver time : 0.000
% 0.10/0.45 % Success case prop preproc time : 0.000
% 0.10/0.45 % Success case prop encoding time : 0.000
% 0.10/0.45 % Success case prop solver time : 0.000
% 0.10/0.45 % Current number of processed clauses : 67
% 0.10/0.45 % Positive orientable unit clauses : 63
% 0.10/0.45 % Positive unorientable unit clauses: 3
% 0.10/0.45 % Negative unit clauses : 1
% 0.10/0.45 % Non-unit-clauses : 0
% 0.10/0.45 % Current number of unprocessed clauses: 600
% 0.10/0.45 % ...number of literals in the above : 600
% 0.10/0.45 % Current number of archived formulas : 0
% 0.10/0.45 % Current number of archived clauses : 43
% 0.10/0.45 % Clause-clause subsumption calls (NU) : 0
% 0.10/0.45 % Rec. Clause-clause subsumption calls : 0
% 0.10/0.45 % Non-unit clause-clause subsumptions : 0
% 0.10/0.45 % Unit Clause-clause subsumption calls : 7
% 0.10/0.45 % Rewrite failures with RHS unbound : 0
% 0.10/0.45 % BW rewrite match attempts : 155
% 0.10/0.45 % BW rewrite match successes : 111
% 0.10/0.45 % Condensation attempts : 0
% 0.10/0.45 % Condensation successes : 0
% 0.10/0.45 % Termbank termtop insertions : 15632
% 0.10/0.45 % Search garbage collected termcells : 2
% 0.10/0.45
% 0.10/0.45 % -------------------------------------------------
% 0.10/0.45 % User time : 0.021 s
% 0.10/0.45 % System time : 0.002 s
% 0.10/0.45 % Total time : 0.023 s
% 0.10/0.45 % Maximum resident set size: 3644 pages
% 0.10/0.45
% 0.10/0.45 % -------------------------------------------------
% 0.10/0.45 % User time : 0.083 s
% 0.10/0.45 % System time : 0.020 s
% 0.10/0.45 % Total time : 0.102 s
% 0.10/0.45 % Maximum resident set size: 4864 pages
% 0.10/0.45 % E exiting
%------------------------------------------------------------------------------