%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : REL048-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 : 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 : Thu Sep 24 02:04:10 PM UTC 2026
% Result : Unsatisfiable 0.22s 5.56s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 12
% Syntax : Number of clauses : 49 ( 45 unt; 0 nHn; 13 RR)
% Number of literals : 53 ( 52 equ; 9 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 6 con; 0-2 aty)
% Number of variables : 54 ( 0 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(converse_idempotence_8,axiom,
converse(converse(X1)) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/REL001-0.ax',converse_idempotence_8) ).
cnf(composition_identity_6,axiom,
composition(X1,one) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/REL001-0.ax',composition_identity_6) ).
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(goals_14,negated_conjecture,
join(join(sk1,sk2),sk3) = sk3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals_14) ).
cnf(goals_15,negated_conjecture,
( join(sk2,sk3) != sk3
| join(sk1,sk3) != sk3 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals_15) ).
cnf(c_0_12,axiom,
converse(composition(X1,X2)) = composition(converse(X2),converse(X1)),
converse_multiplicativity_10 ).
cnf(c_0_13,axiom,
converse(converse(X1)) = X1,
converse_idempotence_8 ).
cnf(c_0_14,plain,
converse(composition(converse(X1),X2)) = composition(converse(X2),X1),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_15,axiom,
composition(X1,one) = X1,
composition_identity_6 ).
cnf(c_0_16,plain,
composition(converse(one),X1) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_13]) ).
cnf(c_0_17,axiom,
join(composition(converse(X1),complement(composition(X1,X2))),complement(X2)) = complement(X2),
converse_cancellativity_11 ).
cnf(c_0_18,axiom,
join(X1,X2) = join(X2,X1),
maddux1_join_commutativity_1 ).
cnf(c_0_19,plain,
converse(one) = one,
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,axiom,
zero = meet(X1,complement(X1)),
def_zero_13 ).
cnf(c_0_21,axiom,
meet(X1,X2) = complement(join(complement(X1),complement(X2))),
maddux4_definiton_of_meet_4 ).
cnf(c_0_22,plain,
join(complement(X1),composition(converse(X2),complement(composition(X2,X1)))) = complement(X1),
inference(rw,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_23,plain,
composition(one,X1) = X1,
inference(rw,[status(thm)],[c_0_16,c_0_19]) ).
cnf(c_0_24,plain,
zero = complement(join(complement(X1),complement(complement(X1)))),
inference(rw,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_25,axiom,
top = join(X1,complement(X1)),
def_top_12 ).
cnf(c_0_26,plain,
join(complement(X1),complement(X1)) = complement(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_19]),c_0_23]) ).
cnf(c_0_27,plain,
complement(top) = zero,
inference(rw,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_28,axiom,
X1 = join(complement(join(complement(X1),complement(X2))),complement(join(complement(X1),X2))),
maddux3_a_kind_of_de_Morgan_3 ).
cnf(c_0_29,axiom,
join(X1,join(X2,X3)) = join(join(X1,X2),X3),
maddux2_join_associativity_2 ).
cnf(c_0_30,plain,
join(zero,zero) = zero,
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_31,plain,
join(complement(join(complement(X1),X2)),complement(join(complement(X1),complement(X2)))) = X1,
inference(rw,[status(thm)],[c_0_28,c_0_18]) ).
cnf(c_0_32,negated_conjecture,
join(join(sk1,sk2),sk3) = sk3,
goals_14 ).
cnf(c_0_33,plain,
join(zero,join(zero,X1)) = join(zero,X1),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_34,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_31,c_0_26]),c_0_25]),c_0_27]),c_0_18]) ).
cnf(c_0_35,negated_conjecture,
join(sk3,join(sk1,sk2)) = sk3,
inference(rw,[status(thm)],[c_0_32,c_0_18]) ).
cnf(c_0_36,plain,
join(zero,X1) = X1,
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_37,negated_conjecture,
join(sk3,join(sk1,join(sk2,X1))) = join(sk3,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_35]),c_0_29]) ).
cnf(c_0_38,negated_conjecture,
( join(sk2,sk3) != sk3
| join(sk1,sk3) != sk3 ),
inference(fof_simplification,[status(thm)],[goals_15]) ).
cnf(c_0_39,plain,
complement(complement(X1)) = X1,
inference(rw,[status(thm)],[c_0_34,c_0_36]) ).
cnf(c_0_40,negated_conjecture,
join(sk3,join(sk1,join(X1,sk2))) = join(sk3,X1),
inference(spm,[status(thm)],[c_0_37,c_0_18]) ).
cnf(c_0_41,negated_conjecture,
( join(sk2,sk3) != sk3
| join(sk1,sk3) != sk3 ),
c_0_38 ).
cnf(c_0_42,plain,
join(X1,X1) = X1,
inference(spm,[status(thm)],[c_0_26,c_0_39]) ).
cnf(c_0_43,negated_conjecture,
join(sk3,join(sk1,join(X1,join(sk2,X2)))) = join(sk3,join(X1,X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_40]),c_0_29]),c_0_29]),c_0_29]) ).
cnf(c_0_44,negated_conjecture,
( join(sk3,sk2) != sk3
| join(sk3,sk1) != sk3 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_41,c_0_18]),c_0_18]) ).
cnf(c_0_45,negated_conjecture,
join(sk3,sk2) = sk3,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_42]),c_0_35]) ).
cnf(c_0_46,negated_conjecture,
join(sk3,join(X1,sk2)) = join(sk3,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_42]),c_0_40]) ).
cnf(c_0_47,negated_conjecture,
join(sk3,sk1) != sk3,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_44,c_0_45])]) ).
cnf(c_0_48,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_35,c_0_46]),c_0_47]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : REL048-1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.18/5.44 % Computer : n018.cluster.edu
% 0.18/5.44 % Model : x86_64 x86_64
% 0.18/5.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/5.44 % Memory : 8046.5625MB
% 0.18/5.44 % OS : Linux 6.8.0-71-generic
% 0.18/5.44 % CPULimit : 300
% 0.18/5.44 % WCLimit : 300
% 0.18/5.44 % DateTime : Mon Sep 21 04:10:50 UTC 2026
% 0.18/5.44 % CPUTime :
% 0.18/5.44 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.22/5.51 Running first-order theorem proving
% 0.22/5.51 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.22/5.56 % Version: 3.5.1
% 0.22/5.56 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/5.56 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/5.56 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/5.56 % Starting new_bool_3 with 300s (1) cores
% 0.22/5.56 % Starting new_bool_1 with 300s (1) cores
% 0.22/5.56 % Starting sh5l with 300s (1) cores
% 0.22/5.56 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 937731 completed with status 0
% 0.22/5.56 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.22/5.56 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/5.56 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/5.56 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/5.56 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.22/5.56 % No SInE strategy applied
% 0.22/5.56 % Search class: FUHPM-FFSF21-MFFFFFNN
% 0.22/5.56 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/5.56 % Starting SubtermCWHack with 136s (1) cores
% 0.22/5.56 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.22/5.56 % Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S with 136s (1) cores
% 0.22/5.56 % Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 136s (1) cores
% 0.22/5.56 % Starting new_bool_3 with 136s (1) cores
% 0.22/5.56 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 937736 completed with status 0
% 0.22/5.56 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.22/5.56 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/5.56 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/5.56 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/5.56 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.22/5.56 % No SInE strategy applied
% 0.22/5.56 % Search class: FUHPM-FFSF21-MFFFFFNN
% 0.22/5.56 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/5.56 % Starting SubtermCWHack with 136s (1) cores
% 0.22/5.56 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.22/5.56 % Preprocessing time : 0.001 s
% 0.22/5.56 % Presaturation interreduction done
% 0.22/5.56
% 0.22/5.56 % Proof found!
% 0.22/5.56 % SZS status Unsatisfiable
% 0.22/5.56 % SZS output start CNFRefutation
% See solution above
% 0.22/5.57 % Parsed axioms : 15
% 0.22/5.57 % Removed by relevancy pruning/SinE : 0
% 0.22/5.57 % Initial clauses : 15
% 0.22/5.57 % Removed in clause preprocessing : 1
% 0.22/5.57 % Initial clauses in saturation : 14
% 0.22/5.57 % Processed clauses : 93
% 0.22/5.57 % ...of these trivial : 23
% 0.22/5.57 % ...subsumed : 4
% 0.22/5.57 % ...remaining for further processing : 66
% 0.22/5.57 % Other redundant clauses eliminated : 0
% 0.22/5.57 % Clauses deleted for lack of memory : 0
% 0.22/5.57 % Backward-subsumed : 0
% 0.22/5.57 % Backward-rewritten : 15
% 0.22/5.57 % Generated clauses : 293
% 0.22/5.57 % ...of the previous two non-redundant : 207
% 0.22/5.57 % ...aggressively subsumed : 0
% 0.22/5.57 % Contextual simplify-reflections : 0
% 0.22/5.57 % Paramodulations : 293
% 0.22/5.57 % Factorizations : 0
% 0.22/5.57 % NegExts : 0
% 0.22/5.57 % Equation resolutions : 0
% 0.22/5.57 % Disequality decompositions : 0
% 0.22/5.57 % Total rewrite steps : 309
% 0.22/5.57 % ...of those cached : 149
% 0.22/5.57 % Propositional unsat checks : 0
% 0.22/5.57 % Propositional check models : 0
% 0.22/5.57 % Propositional check unsatisfiable : 0
% 0.22/5.57 % Propositional clauses : 0
% 0.22/5.57 % Propositional clauses after purity: 0
% 0.22/5.57 % Propositional unsat core size : 0
% 0.22/5.57 % Propositional preprocessing time : 0.000
% 0.22/5.57 % Propositional encoding time : 0.000
% 0.22/5.57 % Propositional solver time : 0.000
% 0.22/5.57 % Success case prop preproc time : 0.000
% 0.22/5.57 % Success case prop encoding time : 0.000
% 0.22/5.57 % Success case prop solver time : 0.000
% 0.22/5.57 % Current number of processed clauses : 37
% 0.22/5.57 % Positive orientable unit clauses : 35
% 0.22/5.57 % Positive unorientable unit clauses: 1
% 0.22/5.57 % Negative unit clauses : 1
% 0.22/5.57 % Non-unit-clauses : 0
% 0.22/5.57 % Current number of unprocessed clauses: 141
% 0.22/5.57 % ...number of literals in the above : 141
% 0.22/5.57 % Current number of archived formulas : 0
% 0.22/5.57 % Current number of archived clauses : 30
% 0.22/5.57 % Clause-clause subsumption calls (NU) : 0
% 0.22/5.57 % Rec. Clause-clause subsumption calls : 0
% 0.22/5.57 % Non-unit clause-clause subsumptions : 0
% 0.22/5.57 % Unit Clause-clause subsumption calls : 0
% 0.22/5.57 % Rewrite failures with RHS unbound : 0
% 0.22/5.57 % BW rewrite match attempts : 93
% 0.22/5.57 % BW rewrite match successes : 25
% 0.22/5.57 % Condensation attempts : 0
% 0.22/5.57 % Condensation successes : 0
% 0.22/5.57 % Termbank termtop insertions : 3323
% 0.22/5.57 % Search garbage collected termcells : 5
% 0.22/5.57
% 0.22/5.57 % -------------------------------------------------
% 0.22/5.57 % User time : 0.006 s
% 0.22/5.57 % System time : 0.004 s
% 0.22/5.57 % Total time : 0.010 s
% 0.22/5.57 % Maximum resident set size: 3644 pages
% 0.22/5.57
% 0.22/5.57 % -------------------------------------------------
% 0.22/5.57 % User time : 0.048 s
% 0.22/5.57 % System time : 0.019 s
% 0.22/5.57 % Total time : 0.067 s
% 0.22/5.57 % Maximum resident set size: 4864 pages
% 0.22/5.57 % E exiting
%------------------------------------------------------------------------------