%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : REL007-1 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n016.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:50 PM UTC 2026
% Result : Unsatisfiable 0.20s 0.76s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 13
% Syntax : Number of clauses : 69 ( 69 unt; 0 nHn; 18 RR)
% Number of literals : 69 ( 68 equ; 4 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 : 10 ( 10 usr; 5 con; 0-2 aty)
% Number of variables : 85 ( 9 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(converse_multiplicativity_10,axiom,
converse(composition(X1,X2)) = composition(converse(X2),converse(X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/REL001-0.ax',converse_multiplicativity_10) ).
cnf(converse_idempotence_8,axiom,
converse(converse(X1)) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/REL001-0.ax',converse_idempotence_8) ).
cnf(composition_identity_6,axiom,
composition(X1,one) = X1,
file('/export/starexec/sandbox2/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/sandbox2/benchmark/Axioms/REL001-0.ax',converse_cancellativity_11) ).
cnf(maddux1_join_commutativity_1,axiom,
join(X1,X2) = join(X2,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/REL001-0.ax',maddux1_join_commutativity_1) ).
cnf(maddux4_definiton_of_meet_4,axiom,
meet(X1,X2) = complement(join(complement(X1),complement(X2))),
file('/export/starexec/sandbox2/benchmark/Axioms/REL001-0.ax',maddux4_definiton_of_meet_4) ).
cnf(def_top_12,axiom,
top = join(X1,complement(X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/REL001-0.ax',def_top_12) ).
cnf(def_zero_13,axiom,
zero = meet(X1,complement(X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/REL001-0.ax',def_zero_13) ).
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/sandbox2/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/sandbox2/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/sandbox2/benchmark/Axioms/REL001-0.ax',converse_additivity_9) ).
cnf(goals_14,negated_conjecture,
meet(sk1,converse(sk2)) = zero,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals_14) ).
cnf(goals_15,negated_conjecture,
meet(converse(sk1),sk2) != zero,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals_15) ).
cnf(c_0_13,axiom,
converse(composition(X1,X2)) = composition(converse(X2),converse(X1)),
converse_multiplicativity_10 ).
cnf(c_0_14,axiom,
converse(converse(X1)) = X1,
converse_idempotence_8 ).
cnf(c_0_15,plain,
converse(composition(converse(X1),X2)) = composition(converse(X2),X1),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_16,axiom,
composition(X1,one) = X1,
composition_identity_6 ).
cnf(c_0_17,plain,
composition(converse(one),X1) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_14]) ).
cnf(c_0_18,axiom,
join(composition(converse(X1),complement(composition(X1,X2))),complement(X2)) = complement(X2),
converse_cancellativity_11 ).
cnf(c_0_19,axiom,
join(X1,X2) = join(X2,X1),
maddux1_join_commutativity_1 ).
cnf(c_0_20,plain,
converse(one) = one,
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_21,plain,
join(complement(X1),composition(converse(X2),complement(composition(X2,X1)))) = complement(X1),
inference(rw,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,plain,
composition(one,X1) = X1,
inference(rw,[status(thm)],[c_0_17,c_0_20]) ).
cnf(c_0_23,axiom,
meet(X1,X2) = complement(join(complement(X1),complement(X2))),
maddux4_definiton_of_meet_4 ).
cnf(c_0_24,axiom,
top = join(X1,complement(X1)),
def_top_12 ).
cnf(c_0_25,axiom,
zero = meet(X1,complement(X1)),
def_zero_13 ).
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_21,c_0_22]),c_0_20]),c_0_22]) ).
cnf(c_0_27,plain,
complement(top) = zero,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,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)),meet(X1,X2)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_23]),c_0_19]) ).
cnf(c_0_32,plain,
join(zero,join(zero,X1)) = join(zero,X1),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_33,plain,
join(zero,complement(complement(X1))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_25]),c_0_26]),c_0_19]) ).
cnf(c_0_34,plain,
join(X1,join(X2,complement(join(X1,X2)))) = top,
inference(spm,[status(thm)],[c_0_24,c_0_29]) ).
cnf(c_0_35,plain,
join(zero,X1) = X1,
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_36,axiom,
converse(join(X1,X2)) = join(converse(X1),converse(X2)),
converse_additivity_9 ).
cnf(c_0_37,plain,
join(top,complement(X1)) = top,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_26]),c_0_24]),c_0_19]) ).
cnf(c_0_38,negated_conjecture,
meet(sk1,converse(sk2)) = zero,
goals_14 ).
cnf(c_0_39,plain,
join(X1,zero) = X1,
inference(spm,[status(thm)],[c_0_19,c_0_35]) ).
cnf(c_0_40,plain,
complement(complement(X1)) = X1,
inference(rw,[status(thm)],[c_0_33,c_0_35]) ).
cnf(c_0_41,plain,
join(converse(X1),join(converse(X2),X3)) = join(converse(join(X1,X2)),X3),
inference(spm,[status(thm)],[c_0_29,c_0_36]) ).
cnf(c_0_42,plain,
join(X1,top) = top,
inference(spm,[status(thm)],[c_0_34,c_0_37]) ).
cnf(c_0_43,negated_conjecture,
complement(join(complement(sk1),converse(sk2))) = sk1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_38]),c_0_39]) ).
cnf(c_0_44,plain,
converse(join(converse(X1),X2)) = join(X1,converse(X2)),
inference(spm,[status(thm)],[c_0_36,c_0_14]) ).
cnf(c_0_45,plain,
join(X1,join(X2,X3)) = join(X3,join(X1,X2)),
inference(spm,[status(thm)],[c_0_19,c_0_29]) ).
cnf(c_0_46,plain,
join(X1,X1) = X1,
inference(spm,[status(thm)],[c_0_26,c_0_40]) ).
cnf(c_0_47,plain,
join(complement(converse(X1)),converse(join(X2,X1))) = top,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_24]),c_0_42]),c_0_19]) ).
cnf(c_0_48,negated_conjecture,
join(complement(sk1),converse(sk2)) = complement(sk1),
inference(spm,[status(thm)],[c_0_40,c_0_43]) ).
cnf(c_0_49,plain,
join(X1,converse(complement(converse(X1)))) = converse(top),
inference(spm,[status(thm)],[c_0_44,c_0_24]) ).
cnf(c_0_50,plain,
join(top,X1) = top,
inference(spm,[status(thm)],[c_0_19,c_0_42]) ).
cnf(c_0_51,plain,
join(X1,join(X2,X1)) = join(X2,X1),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_52,plain,
converse(join(X1,converse(X2))) = join(converse(X1),X2),
inference(spm,[status(thm)],[c_0_36,c_0_14]) ).
cnf(c_0_53,negated_conjecture,
join(complement(sk2),converse(complement(sk1))) = top,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_14]) ).
cnf(c_0_54,plain,
converse(top) = top,
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_55,plain,
join(X1,join(complement(X1),X2)) = top,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_24]),c_0_42]) ).
cnf(c_0_56,plain,
join(X1,meet(X1,X2)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_31]),c_0_19]) ).
cnf(c_0_57,plain,
meet(X1,X2) = meet(X2,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_19]),c_0_23]) ).
cnf(c_0_58,negated_conjecture,
join(complement(sk1),converse(complement(sk2))) = top,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_54]),c_0_19]) ).
cnf(c_0_59,plain,
join(X1,join(X2,complement(X1))) = top,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_40]),c_0_45]) ).
cnf(c_0_60,plain,
join(X1,meet(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_61,negated_conjecture,
meet(sk1,converse(complement(sk2))) = sk1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_58]),c_0_27]),c_0_35]) ).
cnf(c_0_62,negated_conjecture,
meet(converse(sk1),sk2) != zero,
inference(fof_simplification,[status(thm)],[goals_15]) ).
cnf(c_0_63,plain,
join(complement(converse(X1)),converse(join(X1,X2))) = top,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_41]),c_0_19]) ).
cnf(c_0_64,negated_conjecture,
join(sk1,converse(complement(sk2))) = converse(complement(sk2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_61]),c_0_19]) ).
cnf(c_0_65,negated_conjecture,
meet(converse(sk1),sk2) != zero,
c_0_62 ).
cnf(c_0_66,negated_conjecture,
join(complement(sk2),complement(converse(sk1))) = top,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_64]),c_0_14]),c_0_19]) ).
cnf(c_0_67,negated_conjecture,
meet(sk2,converse(sk1)) != zero,
inference(rw,[status(thm)],[c_0_65,c_0_57]) ).
cnf(c_0_68,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_66]),c_0_27]),c_0_67]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : REL007-1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.61 % Computer : n016.cluster.edu
% 0.15/0.61 % Model : x86_64 x86_64
% 0.15/0.61 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.61 % Memory : 8046.5625MB
% 0.15/0.61 % OS : Linux 6.8.0-71-generic
% 0.15/0.61 % CPULimit : 300
% 0.15/0.61 % WCLimit : 300
% 0.15/0.61 % DateTime : Mon Sep 21 04:02:38 UTC 2026
% 0.15/0.62 % CPUTime :
% 0.15/0.62 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.20/0.68 Running first-order theorem proving
% 0.20/0.68 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 0.20/0.76 % Version: 3.5.1
% 0.20/0.76 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.76 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.76 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.76 % Starting new_bool_3 with 300s (1) cores
% 0.20/0.76 % Starting new_bool_1 with 300s (1) cores
% 0.20/0.76 % Starting sh5l with 300s (1) cores
% 0.20/0.76 % sh5l with pid 1508503 completed with status 0
% 0.20/0.76 % Result found by sh5l
% 0.20/0.76 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.76 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.76 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.76 % Starting new_bool_3 with 300s (1) cores
% 0.20/0.76 % Starting new_bool_1 with 300s (1) cores
% 0.20/0.76 % Starting sh5l with 300s (1) cores
% 0.20/0.76 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.20/0.76 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.20/0.76 % Search class: FUUPM-FFSF21-MFFFFFNN
% 0.20/0.76 % Scheduled 8 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.76 % Starting SubtermCWHack with 28s (1) cores
% 0.20/0.76 % SubtermCWHack with pid 1508511 completed with status 0
% 0.20/0.76 % Result found by SubtermCWHack
% 0.20/0.76 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.76 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.76 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.76 % Starting new_bool_3 with 300s (1) cores
% 0.20/0.76 % Starting new_bool_1 with 300s (1) cores
% 0.20/0.76 % Starting sh5l with 300s (1) cores
% 0.20/0.76 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.20/0.76 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.20/0.76 % Search class: FUUPM-FFSF21-MFFFFFNN
% 0.20/0.76 % Scheduled 8 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.76 % Starting SubtermCWHack with 28s (1) cores
% 0.20/0.76 % Preprocessing time : 0.002 s
% 0.20/0.76
% 0.20/0.76 % Proof found!
% 0.20/0.76 % SZS status Unsatisfiable
% 0.20/0.76 % SZS output start CNFRefutation
% See solution above
% 0.20/0.76 % Parsed axioms : 15
% 0.20/0.76 % Removed by relevancy pruning/SinE : 0
% 0.20/0.76 % Initial clauses : 15
% 0.20/0.76 % Removed in clause preprocessing : 0
% 0.20/0.76 % Initial clauses in saturation : 15
% 0.20/0.76 % Processed clauses : 336
% 0.20/0.76 % ...of these trivial : 166
% 0.20/0.76 % ...subsumed : 26
% 0.20/0.76 % ...remaining for further processing : 144
% 0.20/0.76 % Other redundant clauses eliminated : 0
% 0.20/0.76 % Clauses deleted for lack of memory : 0
% 0.20/0.76 % Backward-subsumed : 0
% 0.20/0.76 % Backward-rewritten : 28
% 0.20/0.76 % Generated clauses : 3733
% 0.20/0.76 % ...of the previous two non-redundant : 1793
% 0.20/0.76 % ...aggressively subsumed : 0
% 0.20/0.76 % Contextual simplify-reflections : 0
% 0.20/0.76 % Paramodulations : 3733
% 0.20/0.76 % Factorizations : 0
% 0.20/0.76 % NegExts : 0
% 0.20/0.76 % Equation resolutions : 0
% 0.20/0.76 % Disequality decompositions : 0
% 0.20/0.76 % Total rewrite steps : 5423
% 0.20/0.76 % ...of those cached : 4114
% 0.20/0.76 % Propositional unsat checks : 0
% 0.20/0.76 % Propositional check models : 0
% 0.20/0.76 % Propositional check unsatisfiable : 0
% 0.20/0.76 % Propositional clauses : 0
% 0.20/0.76 % Propositional clauses after purity: 0
% 0.20/0.76 % Propositional unsat core size : 0
% 0.20/0.76 % Propositional preprocessing time : 0.000
% 0.20/0.76 % Propositional encoding time : 0.000
% 0.20/0.76 % Propositional solver time : 0.000
% 0.20/0.76 % Success case prop preproc time : 0.000
% 0.20/0.76 % Success case prop encoding time : 0.000
% 0.20/0.76 % Success case prop solver time : 0.000
% 0.20/0.76 % Current number of processed clauses : 116
% 0.20/0.76 % Positive orientable unit clauses : 111
% 0.20/0.76 % Positive unorientable unit clauses: 4
% 0.20/0.76 % Negative unit clauses : 1
% 0.20/0.76 % Non-unit-clauses : 0
% 0.20/0.76 % Current number of unprocessed clauses: 1443
% 0.20/0.76 % ...number of literals in the above : 1443
% 0.20/0.76 % Current number of archived formulas : 0
% 0.20/0.76 % Current number of archived clauses : 28
% 0.20/0.76 % Clause-clause subsumption calls (NU) : 0
% 0.20/0.76 % Rec. Clause-clause subsumption calls : 0
% 0.20/0.76 % Non-unit clause-clause subsumptions : 0
% 0.20/0.76 % Unit Clause-clause subsumption calls : 4
% 0.20/0.76 % Rewrite failures with RHS unbound : 0
% 0.20/0.77 % BW rewrite match attempts : 163
% 0.20/0.77 % BW rewrite match successes : 63
% 0.20/0.77 % Condensation attempts : 0
% 0.20/0.77 % Condensation successes : 0
% 0.20/0.77 % Termbank termtop insertions : 32047
% 0.20/0.77 % Search garbage collected termcells : 2
% 0.20/0.77
% 0.20/0.77 % -------------------------------------------------
% 0.20/0.77 % User time : 0.054 s
% 0.20/0.77 % System time : 0.005 s
% 0.20/0.77 % Total time : 0.059 s
% 0.20/0.77 % Maximum resident set size: 3592 pages
% 0.20/0.77
% 0.20/0.77 % -------------------------------------------------
% 0.20/0.77 % User time : 0.056 s
% 0.20/0.77 % System time : 0.009 s
% 0.20/0.77 % Total time : 0.065 s
% 0.20/0.77 % Maximum resident set size: 4864 pages
% 0.20/0.77 % E exiting
%------------------------------------------------------------------------------