%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : REL002-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 : n017.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:12 PM UTC 2026
% Result : Unsatisfiable 0.17s 0.47s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 11
% Syntax : Number of clauses : 42 ( 42 unt; 0 nHn; 7 RR)
% Number of literals : 42 ( 41 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 : 52 ( 3 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(goals_14,negated_conjecture,
join(sk1,top) != top,
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,
composition(X1,one) = X1,
composition_identity_6 ).
cnf(c_0_13,plain,
composition(converse(one),converse(X1)) = converse(X1),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_14,axiom,
converse(converse(X1)) = X1,
converse_idempotence_8 ).
cnf(c_0_15,plain,
composition(converse(one),X1) = X1,
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
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_12,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,plain,
join(zero,join(zero,X1)) = join(zero,X1),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_32,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_25]),c_0_24]),c_0_26]),c_0_17]) ).
cnf(c_0_33,plain,
join(X1,join(complement(X1),X2)) = join(top,X2),
inference(spm,[status(thm)],[c_0_28,c_0_24]) ).
cnf(c_0_34,plain,
join(zero,X1) = X1,
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_35,plain,
join(top,complement(X1)) = top,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_25]),c_0_24]) ).
cnf(c_0_36,plain,
complement(complement(X1)) = X1,
inference(rw,[status(thm)],[c_0_32,c_0_34]) ).
cnf(c_0_37,negated_conjecture,
join(sk1,top) != top,
inference(fof_simplification,[status(thm)],[goals_14]) ).
cnf(c_0_38,plain,
join(top,X1) = top,
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_39,negated_conjecture,
join(sk1,top) != top,
c_0_37 ).
cnf(c_0_40,plain,
join(X1,top) = top,
inference(spm,[status(thm)],[c_0_17,c_0_38]) ).
cnf(c_0_41,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_39,c_0_40])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : REL002-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.40 % Computer : n017.cluster.edu
% 0.10/0.40 % Model : x86_64 x86_64
% 0.10/0.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.40 % Memory : 8046.5625MB
% 0.10/0.40 % OS : Linux 6.8.0-71-generic
% 0.10/0.40 % CPULimit : 300
% 0.10/0.40 % WCLimit : 300
% 0.10/0.40 % DateTime : Mon Sep 21 03:52:42 UTC 2026
% 0.10/0.41 % CPUTime :
% 0.10/0.41 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.45 Running first-order theorem proving
% 0.10/0.45 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.17/0.47 % Version: 3.5.1
% 0.17/0.47 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.17/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.47 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.17/0.47 % Starting new_bool_3 with 300s (1) cores
% 0.17/0.47 % Starting new_bool_1 with 300s (1) cores
% 0.17/0.47 % Starting sh5l with 300s (1) cores
% 0.17/0.47 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 1372717 completed with status 0
% 0.17/0.47 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.17/0.47 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.17/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.47 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.17/0.47 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.17/0.47 % No SInE strategy applied
% 0.17/0.47 % Search class: FUUPM-FFSF21-MFFFFFNN
% 0.17/0.47 % Scheduled 8 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.47 % Starting SubtermCWHack with 136s (1) cores
% 0.17/0.47 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.17/0.47 % Starting H----_047_B31_F1_PI_AE_R4_CS_SP_S2S with 136s (1) cores
% 0.17/0.47 % Starting G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y with 136s (1) cores
% 0.17/0.47 % Starting U----_043_B31_F1_PI_AE_CS_SP_S2S with 136s (1) cores
% 0.17/0.47 % H----_047_B31_F1_PI_AE_R4_CS_SP_S2S with pid 1372724 completed with status 0
% 0.17/0.47 % Result found by H----_047_B31_F1_PI_AE_R4_CS_SP_S2S
% 0.17/0.47 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.17/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.47 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.17/0.47 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.17/0.47 % No SInE strategy applied
% 0.17/0.47 % Search class: FUUPM-FFSF21-MFFFFFNN
% 0.17/0.47 % Scheduled 8 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.47 % Starting SubtermCWHack with 136s (1) cores
% 0.17/0.47 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.17/0.47 % Starting H----_047_B31_F1_PI_AE_R4_CS_SP_S2S with 136s (1) cores
% 0.17/0.47 % Preprocessing time : 0.001 s
% 0.17/0.47
% 0.17/0.47 % Proof found!
% 0.17/0.47 % SZS status Unsatisfiable
% 0.17/0.47 % SZS output start CNFRefutation
% See solution above
% 0.17/0.47 % Parsed axioms : 14
% 0.17/0.47 % Removed by relevancy pruning/SinE : 0
% 0.17/0.47 % Initial clauses : 14
% 0.17/0.47 % Removed in clause preprocessing : 1
% 0.17/0.47 % Initial clauses in saturation : 13
% 0.17/0.47 % Processed clauses : 40
% 0.17/0.47 % ...of these trivial : 3
% 0.17/0.47 % ...subsumed : 0
% 0.17/0.47 % ...remaining for further processing : 37
% 0.17/0.47 % Other redundant clauses eliminated : 0
% 0.17/0.47 % Clauses deleted for lack of memory : 0
% 0.17/0.47 % Backward-subsumed : 0
% 0.17/0.47 % Backward-rewritten : 13
% 0.17/0.47 % Generated clauses : 204
% 0.17/0.47 % ...of the previous two non-redundant : 138
% 0.17/0.47 % ...aggressively subsumed : 0
% 0.17/0.47 % Contextual simplify-reflections : 0
% 0.17/0.47 % Paramodulations : 204
% 0.17/0.47 % Factorizations : 0
% 0.17/0.47 % NegExts : 0
% 0.17/0.47 % Equation resolutions : 0
% 0.17/0.47 % Disequality decompositions : 0
% 0.17/0.47 % Total rewrite steps : 199
% 0.17/0.47 % ...of those cached : 82
% 0.17/0.47 % Propositional unsat checks : 0
% 0.17/0.47 % Propositional check models : 0
% 0.17/0.47 % Propositional check unsatisfiable : 0
% 0.17/0.47 % Propositional clauses : 0
% 0.17/0.47 % Propositional clauses after purity: 0
% 0.17/0.47 % Propositional unsat core size : 0
% 0.17/0.47 % Propositional preprocessing time : 0.000
% 0.17/0.47 % Propositional encoding time : 0.000
% 0.17/0.47 % Propositional solver time : 0.000
% 0.17/0.47 % Success case prop preproc time : 0.000
% 0.17/0.47 % Success case prop encoding time : 0.000
% 0.17/0.47 % Success case prop solver time : 0.000
% 0.17/0.47 % Current number of processed clauses : 24
% 0.17/0.47 % Positive orientable unit clauses : 23
% 0.17/0.47 % Positive unorientable unit clauses: 1
% 0.17/0.47 % Negative unit clauses : 0
% 0.17/0.47 % Non-unit-clauses : 0
% 0.17/0.47 % Current number of unprocessed clauses: 110
% 0.17/0.47 % ...number of literals in the above : 110
% 0.17/0.47 % Current number of archived formulas : 0
% 0.17/0.47 % Current number of archived clauses : 14
% 0.17/0.47 % Clause-clause subsumption calls (NU) : 0
% 0.17/0.47 % Rec. Clause-clause subsumption calls : 0
% 0.17/0.47 % Non-unit clause-clause subsumptions : 0
% 0.17/0.47 % Unit Clause-clause subsumption calls : 0
% 0.17/0.47 % Rewrite failures with RHS unbound : 0
% 0.17/0.47 % BW rewrite match attempts : 39
% 0.17/0.47 % BW rewrite match successes : 18
% 0.17/0.47 % Condensation attempts : 0
% 0.17/0.47 % Condensation successes : 0
% 0.17/0.47 % Termbank termtop insertions : 1951
% 0.17/0.47 % Search garbage collected termcells : 2
% 0.17/0.47
% 0.17/0.47 % -------------------------------------------------
% 0.17/0.47 % User time : 0.004 s
% 0.17/0.47 % System time : 0.002 s
% 0.17/0.47 % Total time : 0.006 s
% 0.17/0.47 % Maximum resident set size: 3624 pages
% 0.17/0.47
% 0.17/0.47 % -------------------------------------------------
% 0.17/0.47 % User time : 0.015 s
% 0.17/0.47 % System time : 0.013 s
% 0.17/0.47 % Total time : 0.028 s
% 0.17/0.47 % Maximum resident set size: 4608 pages
% 0.17/0.47 % E exiting
%------------------------------------------------------------------------------