%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : REL001-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 : n010.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:47 PM UTC 2026
% Result : Unsatisfiable 0.15s 0.51s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 11
% Syntax : Number of clauses : 37 ( 37 unt; 0 nHn; 7 RR)
% Number of literals : 37 ( 36 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 : 47 ( 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(zero,sk1) != sk1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals_14) ).
cnf(c_0_11,axiom,
converse(composition(X1,X2)) = composition(converse(X2),converse(X1)),
converse_multiplicativity_10 ).
cnf(c_0_12,axiom,
converse(converse(X1)) = X1,
converse_idempotence_8 ).
cnf(c_0_13,plain,
converse(composition(converse(X1),X2)) = composition(converse(X2),X1),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_14,axiom,
composition(X1,one) = X1,
composition_identity_6 ).
cnf(c_0_15,plain,
composition(converse(one),X1) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_12]) ).
cnf(c_0_16,axiom,
join(composition(converse(X1),complement(composition(X1,X2))),complement(X2)) = complement(X2),
converse_cancellativity_11 ).
cnf(c_0_17,axiom,
join(X1,X2) = join(X2,X1),
maddux1_join_commutativity_1 ).
cnf(c_0_18,plain,
converse(one) = one,
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,axiom,
zero = meet(X1,complement(X1)),
def_zero_13 ).
cnf(c_0_20,axiom,
meet(X1,X2) = complement(join(complement(X1),complement(X2))),
maddux4_definiton_of_meet_4 ).
cnf(c_0_21,plain,
join(complement(X1),composition(converse(X2),complement(composition(X2,X1)))) = complement(X1),
inference(rw,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_22,plain,
composition(one,X1) = X1,
inference(rw,[status(thm)],[c_0_15,c_0_18]) ).
cnf(c_0_23,plain,
zero = complement(join(complement(X1),complement(complement(X1)))),
inference(rw,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_24,axiom,
top = join(X1,complement(X1)),
def_top_12 ).
cnf(c_0_25,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_18]),c_0_22]) ).
cnf(c_0_26,plain,
complement(top) = zero,
inference(rw,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_27,axiom,
X1 = join(complement(join(complement(X1),complement(X2))),complement(join(complement(X1),X2))),
maddux3_a_kind_of_de_Morgan_3 ).
cnf(c_0_28,axiom,
join(X1,join(X2,X3)) = join(join(X1,X2),X3),
maddux2_join_associativity_2 ).
cnf(c_0_29,plain,
join(zero,zero) = zero,
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_30,plain,
join(complement(join(complement(X1),X2)),complement(join(complement(X1),complement(X2)))) = X1,
inference(rw,[status(thm)],[c_0_27,c_0_17]) ).
cnf(c_0_31,negated_conjecture,
join(zero,sk1) != sk1,
inference(fof_simplification,[status(thm)],[goals_14]) ).
cnf(c_0_32,plain,
join(zero,join(zero,X1)) = join(zero,X1),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_33,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_30,c_0_24]),c_0_25]),c_0_26]),c_0_17]) ).
cnf(c_0_34,negated_conjecture,
join(zero,sk1) != sk1,
c_0_31 ).
cnf(c_0_35,plain,
join(zero,X1) = X1,
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_36,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_34,c_0_35])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : REL001-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.12/0.44 % Computer : n010.cluster.edu
% 0.12/0.44 % Model : x86_64 x86_64
% 0.12/0.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.44 % Memory : 8046.5625MB
% 0.12/0.44 % OS : Linux 6.8.0-71-generic
% 0.12/0.44 % CPULimit : 300
% 0.12/0.44 % WCLimit : 300
% 0.12/0.44 % DateTime : Mon Sep 21 03:57:40 UTC 2026
% 0.12/0.44 % CPUTime :
% 0.12/0.44 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/0.49 Running first-order theorem proving
% 0.15/0.49 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.15/0.51 % Version: 3.5.1
% 0.15/0.51 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/0.51 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.51 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/0.51 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.51 % Starting new_bool_1 with 300s (1) cores
% 0.15/0.51 % Starting sh5l with 300s (1) cores
% 0.15/0.51 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 4174921 completed with status 0
% 0.15/0.51 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.15/0.51 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/0.51 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.51 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/0.51 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/0.51 % No SInE strategy applied
% 0.15/0.51 % Search class: FUUPM-FFSF21-MFFFFFNN
% 0.15/0.51 % Scheduled 8 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.51 % Starting SubtermCWHack with 136s (1) cores
% 0.15/0.51 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.15/0.51 % Starting H----_047_B31_F1_PI_AE_R4_CS_SP_S2S with 136s (1) cores
% 0.15/0.51 % Starting G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y with 136s (1) cores
% 0.15/0.51 % Starting U----_043_B31_F1_PI_AE_CS_SP_S2S with 136s (1) cores
% 0.15/0.51 % SubtermCWHack with pid 4174925 completed with status 0
% 0.15/0.51 % Result found by SubtermCWHack
% 0.15/0.51 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/0.51 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.51 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/0.51 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/0.51 % No SInE strategy applied
% 0.15/0.51 % Search class: FUUPM-FFSF21-MFFFFFNN
% 0.15/0.51 % Scheduled 8 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.51 % Starting SubtermCWHack with 136s (1) cores
% 0.15/0.51 % Preprocessing time : 0.001 s
% 0.15/0.51
% 0.15/0.51 % Proof found!
% 0.15/0.51 % SZS status Unsatisfiable
% 0.15/0.51 % SZS output start CNFRefutation
% See solution above
% 0.15/0.51 % Parsed axioms : 14
% 0.15/0.51 % Removed by relevancy pruning/SinE : 0
% 0.15/0.51 % Initial clauses : 14
% 0.15/0.51 % Removed in clause preprocessing : 1
% 0.15/0.51 % Initial clauses in saturation : 13
% 0.15/0.51 % Processed clauses : 90
% 0.15/0.51 % ...of these trivial : 25
% 0.15/0.51 % ...subsumed : 8
% 0.15/0.51 % ...remaining for further processing : 57
% 0.15/0.51 % Other redundant clauses eliminated : 0
% 0.15/0.51 % Clauses deleted for lack of memory : 0
% 0.15/0.51 % Backward-subsumed : 0
% 0.15/0.51 % Backward-rewritten : 21
% 0.15/0.51 % Generated clauses : 560
% 0.15/0.51 % ...of the previous two non-redundant : 340
% 0.15/0.51 % ...aggressively subsumed : 0
% 0.15/0.51 % Contextual simplify-reflections : 0
% 0.15/0.51 % Paramodulations : 560
% 0.15/0.51 % Factorizations : 0
% 0.15/0.51 % NegExts : 0
% 0.15/0.51 % Equation resolutions : 0
% 0.15/0.51 % Disequality decompositions : 0
% 0.15/0.51 % Total rewrite steps : 660
% 0.15/0.51 % ...of those cached : 420
% 0.15/0.51 % Propositional unsat checks : 0
% 0.15/0.51 % Propositional check models : 0
% 0.15/0.51 % Propositional check unsatisfiable : 0
% 0.15/0.51 % Propositional clauses : 0
% 0.15/0.51 % Propositional clauses after purity: 0
% 0.15/0.51 % Propositional unsat core size : 0
% 0.15/0.51 % Propositional preprocessing time : 0.000
% 0.15/0.51 % Propositional encoding time : 0.000
% 0.15/0.51 % Propositional solver time : 0.000
% 0.15/0.51 % Success case prop preproc time : 0.000
% 0.15/0.51 % Success case prop encoding time : 0.000
% 0.15/0.51 % Success case prop solver time : 0.000
% 0.15/0.51 % Current number of processed clauses : 36
% 0.15/0.51 % Positive orientable unit clauses : 35
% 0.15/0.51 % Positive unorientable unit clauses: 1
% 0.15/0.51 % Negative unit clauses : 0
% 0.15/0.51 % Non-unit-clauses : 0
% 0.15/0.51 % Current number of unprocessed clauses: 259
% 0.15/0.51 % ...number of literals in the above : 259
% 0.15/0.51 % Current number of archived formulas : 0
% 0.15/0.51 % Current number of archived clauses : 22
% 0.15/0.51 % Clause-clause subsumption calls (NU) : 0
% 0.15/0.51 % Rec. Clause-clause subsumption calls : 0
% 0.15/0.51 % Non-unit clause-clause subsumptions : 0
% 0.15/0.51 % Unit Clause-clause subsumption calls : 0
% 0.15/0.51 % Rewrite failures with RHS unbound : 0
% 0.15/0.51 % BW rewrite match attempts : 28
% 0.15/0.51 % BW rewrite match successes : 24
% 0.15/0.51 % Condensation attempts : 0
% 0.15/0.51 % Condensation successes : 0
% 0.15/0.51 % Termbank termtop insertions : 5167
% 0.15/0.51 % Search garbage collected termcells : 2
% 0.15/0.51
% 0.15/0.51 % -------------------------------------------------
% 0.15/0.51 % User time : 0.005 s
% 0.15/0.51 % System time : 0.002 s
% 0.15/0.51 % Total time : 0.008 s
% 0.15/0.51 % Maximum resident set size: 3644 pages
% 0.15/0.51
% 0.15/0.51 % -------------------------------------------------
% 0.15/0.51 % User time : 0.022 s
% 0.15/0.51 % System time : 0.013 s
% 0.15/0.51 % Total time : 0.034 s
% 0.15/0.51 % Maximum resident set size: 4608 pages
% 0.15/0.51 % E exiting
%------------------------------------------------------------------------------