%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : REL004-3 : 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 : n008.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:13 PM UTC 2026
% Result : Unsatisfiable 0.20s 0.49s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 25
% Number of leaves : 8
% Syntax : Number of clauses : 63 ( 63 unt; 0 nHn; 8 RR)
% Number of literals : 63 ( 62 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 89 ( 8 sgn)
% Comments :
%------------------------------------------------------------------------------
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(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(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(def_zero_13,axiom,
zero = meet(X1,complement(X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/REL001-0.ax',def_zero_13) ).
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(converse_idempotence_8,axiom,
converse(converse(X1)) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/REL001-0.ax',converse_idempotence_8) ).
cnf(goals_17,negated_conjecture,
converse(complement(sk1)) != complement(converse(sk1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals_17) ).
cnf(c_0_8,axiom,
X1 = join(complement(join(complement(X1),complement(X2))),complement(join(complement(X1),X2))),
maddux3_a_kind_of_de_Morgan_3 ).
cnf(c_0_9,axiom,
meet(X1,X2) = complement(join(complement(X1),complement(X2))),
maddux4_definiton_of_meet_4 ).
cnf(c_0_10,plain,
join(meet(X1,X2),complement(join(complement(X1),X2))) = X1,
inference(rw,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_11,axiom,
join(X1,X2) = join(X2,X1),
maddux1_join_commutativity_1 ).
cnf(c_0_12,plain,
join(meet(X1,X2),meet(X1,complement(X2))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_9]),c_0_11]) ).
cnf(c_0_13,plain,
meet(X1,X2) = meet(X2,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_11]),c_0_9]) ).
cnf(c_0_14,axiom,
zero = meet(X1,complement(X1)),
def_zero_13 ).
cnf(c_0_15,plain,
join(meet(X1,X2),meet(complement(X2),X1)) = X1,
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,plain,
join(zero,meet(X1,complement(complement(X1)))) = X1,
inference(spm,[status(thm)],[c_0_12,c_0_14]) ).
cnf(c_0_17,plain,
complement(complement(X1)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_14]),c_0_13]),c_0_11]),c_0_16]) ).
cnf(c_0_18,plain,
complement(join(X1,complement(X2))) = meet(complement(X1),X2),
inference(spm,[status(thm)],[c_0_9,c_0_17]) ).
cnf(c_0_19,axiom,
join(X1,join(X2,X3)) = join(join(X1,X2),X3),
maddux2_join_associativity_2 ).
cnf(c_0_20,plain,
join(zero,meet(X1,X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_14]),c_0_9]) ).
cnf(c_0_21,plain,
complement(meet(complement(X1),X2)) = join(X1,complement(X2)),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_22,plain,
meet(meet(X1,X2),join(complement(X1),complement(X2))) = zero,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_9]),c_0_13]) ).
cnf(c_0_23,plain,
join(zero,join(meet(X1,X1),X2)) = join(X1,X2),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_24,plain,
join(X1,complement(X1)) = complement(zero),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_14]),c_0_17]) ).
cnf(c_0_25,plain,
meet(zero,join(complement(X1),complement(complement(X1)))) = zero,
inference(spm,[status(thm)],[c_0_22,c_0_14]) ).
cnf(c_0_26,plain,
join(X1,complement(meet(X1,X1))) = complement(zero),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_24]) ).
cnf(c_0_27,plain,
join(X1,join(X2,X3)) = join(X3,join(X1,X2)),
inference(spm,[status(thm)],[c_0_11,c_0_19]) ).
cnf(c_0_28,plain,
meet(zero,join(zero,complement(zero))) = zero,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_25]),c_0_9]),c_0_14]),c_0_11]) ).
cnf(c_0_29,plain,
join(X1,complement(zero)) = complement(zero),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_21]),c_0_17]),c_0_27]),c_0_11]),c_0_24]) ).
cnf(c_0_30,plain,
join(zero,meet(zero,complement(join(zero,complement(zero))))) = zero,
inference(spm,[status(thm)],[c_0_12,c_0_28]) ).
cnf(c_0_31,plain,
meet(zero,complement(X1)) = zero,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_29]),c_0_17]),c_0_13]) ).
cnf(c_0_32,plain,
join(X1,join(X2,X3)) = join(X2,join(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_11]),c_0_19]) ).
cnf(c_0_33,plain,
join(zero,zero) = zero,
inference(rw,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_34,plain,
join(zero,join(X1,meet(X2,X2))) = join(X1,X2),
inference(spm,[status(thm)],[c_0_32,c_0_20]) ).
cnf(c_0_35,plain,
join(zero,join(zero,X1)) = join(zero,X1),
inference(spm,[status(thm)],[c_0_19,c_0_33]) ).
cnf(c_0_36,axiom,
converse(join(X1,X2)) = join(converse(X1),converse(X2)),
converse_additivity_9 ).
cnf(c_0_37,axiom,
converse(converse(X1)) = X1,
converse_idempotence_8 ).
cnf(c_0_38,plain,
join(zero,X1) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_20]) ).
cnf(c_0_39,plain,
converse(join(converse(X1),X2)) = join(X1,converse(X2)),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_40,plain,
meet(X1,X1) = X1,
inference(rw,[status(thm)],[c_0_20,c_0_38]) ).
cnf(c_0_41,plain,
join(complement(zero),X1) = complement(zero),
inference(spm,[status(thm)],[c_0_11,c_0_29]) ).
cnf(c_0_42,plain,
join(X1,converse(complement(zero))) = converse(complement(zero)),
inference(spm,[status(thm)],[c_0_39,c_0_29]) ).
cnf(c_0_43,plain,
join(X1,X1) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_40]),c_0_17]),c_0_17]) ).
cnf(c_0_44,plain,
converse(complement(zero)) = complement(zero),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_45,plain,
join(X1,join(X1,X2)) = join(X1,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_43]),c_0_19]),c_0_43]) ).
cnf(c_0_46,plain,
complement(join(complement(X1),X2)) = meet(complement(X2),X1),
inference(spm,[status(thm)],[c_0_18,c_0_11]) ).
cnf(c_0_47,plain,
join(X1,converse(complement(converse(X1)))) = complement(zero),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_24]),c_0_44]) ).
cnf(c_0_48,plain,
complement(join(complement(X1),meet(X2,X3))) = meet(X1,join(complement(X2),complement(X3))),
inference(spm,[status(thm)],[c_0_9,c_0_9]) ).
cnf(c_0_49,plain,
join(X1,meet(X1,X2)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_15]),c_0_11]) ).
cnf(c_0_50,plain,
meet(X1,complement(converse(complement(converse(complement(X1)))))) = zero,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_17]),c_0_13]) ).
cnf(c_0_51,plain,
meet(X1,join(X1,complement(X2))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_17]),c_0_17]) ).
cnf(c_0_52,plain,
meet(X1,converse(complement(converse(complement(X1))))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_50]),c_0_17]),c_0_38]) ).
cnf(c_0_53,plain,
meet(X1,join(X1,X2)) = X1,
inference(spm,[status(thm)],[c_0_51,c_0_17]) ).
cnf(c_0_54,plain,
join(X1,complement(converse(complement(converse(X1))))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_52]),c_0_17]),c_0_17]) ).
cnf(c_0_55,plain,
meet(X1,join(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_53,c_0_11]) ).
cnf(c_0_56,plain,
join(X1,converse(complement(converse(complement(X1))))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_54]),c_0_37]),c_0_37]) ).
cnf(c_0_57,plain,
converse(complement(converse(complement(X1)))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_13]),c_0_52]) ).
cnf(c_0_58,negated_conjecture,
converse(complement(sk1)) != complement(converse(sk1)),
inference(fof_simplification,[status(thm)],[goals_17]) ).
cnf(c_0_59,plain,
complement(converse(complement(X1))) = converse(X1),
inference(spm,[status(thm)],[c_0_37,c_0_57]) ).
cnf(c_0_60,negated_conjecture,
converse(complement(sk1)) != complement(converse(sk1)),
c_0_58 ).
cnf(c_0_61,plain,
complement(converse(X1)) = converse(complement(X1)),
inference(spm,[status(thm)],[c_0_17,c_0_59]) ).
cnf(c_0_62,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_60,c_0_61])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : REL004-3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.37 % Computer : n008.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 03:58:25 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.44 Running first-order theorem proving
% 0.10/0.44 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.49 % Version: 3.5.1
% 0.20/0.49 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.49 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.49 % Starting new_bool_3 with 300s (1) cores
% 0.20/0.49 % Starting new_bool_1 with 300s (1) cores
% 0.20/0.49 % Starting sh5l with 300s (1) cores
% 0.20/0.49 % sh5l with pid 95511 completed with status 0
% 0.20/0.49 % Result found by sh5l
% 0.20/0.49 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.49 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.49 % Starting new_bool_3 with 300s (1) cores
% 0.20/0.49 % Starting new_bool_1 with 300s (1) cores
% 0.20/0.49 % Starting sh5l with 300s (1) cores
% 0.20/0.49 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.20/0.49 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.20/0.49 % Search class: FUUPM-FFMF21-DFFFFFNN
% 0.20/0.49 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.49 % Starting SubtermCWHack with 28s (1) cores
% 0.20/0.49 % SubtermCWHack with pid 95514 completed with status 0
% 0.20/0.49 % Result found by SubtermCWHack
% 0.20/0.49 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.49 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.49 % Starting new_bool_3 with 300s (1) cores
% 0.20/0.49 % Starting new_bool_1 with 300s (1) cores
% 0.20/0.49 % Starting sh5l with 300s (1) cores
% 0.20/0.49 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.20/0.49 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.20/0.49 % Search class: FUUPM-FFMF21-DFFFFFNN
% 0.20/0.49 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.49 % Starting SubtermCWHack with 28s (1) cores
% 0.20/0.49 % Preprocessing time : 0.001 s
% 0.20/0.49
% 0.20/0.49 % Proof found!
% 0.20/0.49 % SZS status Unsatisfiable
% 0.20/0.49 % SZS output start CNFRefutation
% See solution above
% 0.20/0.49 % Parsed axioms : 17
% 0.20/0.49 % Removed by relevancy pruning/SinE : 2
% 0.20/0.49 % Initial clauses : 15
% 0.20/0.49 % Removed in clause preprocessing : 0
% 0.20/0.49 % Initial clauses in saturation : 15
% 0.20/0.49 % Processed clauses : 343
% 0.20/0.49 % ...of these trivial : 136
% 0.20/0.49 % ...subsumed : 95
% 0.20/0.49 % ...remaining for further processing : 112
% 0.20/0.49 % Other redundant clauses eliminated : 0
% 0.20/0.49 % Clauses deleted for lack of memory : 0
% 0.20/0.49 % Backward-subsumed : 0
% 0.20/0.49 % Backward-rewritten : 37
% 0.20/0.49 % Generated clauses : 3022
% 0.20/0.49 % ...of the previous two non-redundant : 2035
% 0.20/0.49 % ...aggressively subsumed : 0
% 0.20/0.49 % Contextual simplify-reflections : 0
% 0.20/0.49 % Paramodulations : 3022
% 0.20/0.49 % Factorizations : 0
% 0.20/0.49 % NegExts : 0
% 0.20/0.49 % Equation resolutions : 0
% 0.20/0.49 % Disequality decompositions : 0
% 0.20/0.49 % Total rewrite steps : 3131
% 0.20/0.49 % ...of those cached : 2149
% 0.20/0.49 % Propositional unsat checks : 0
% 0.20/0.49 % Propositional check models : 0
% 0.20/0.49 % Propositional check unsatisfiable : 0
% 0.20/0.49 % Propositional clauses : 0
% 0.20/0.49 % Propositional clauses after purity: 0
% 0.20/0.49 % Propositional unsat core size : 0
% 0.20/0.49 % Propositional preprocessing time : 0.000
% 0.20/0.49 % Propositional encoding time : 0.000
% 0.20/0.49 % Propositional solver time : 0.000
% 0.20/0.49 % Success case prop preproc time : 0.000
% 0.20/0.49 % Success case prop encoding time : 0.000
% 0.20/0.49 % Success case prop solver time : 0.000
% 0.20/0.49 % Current number of processed clauses : 75
% 0.20/0.49 % Positive orientable unit clauses : 70
% 0.20/0.49 % Positive unorientable unit clauses: 5
% 0.20/0.49 % Negative unit clauses : 0
% 0.20/0.49 % Non-unit-clauses : 0
% 0.20/0.49 % Current number of unprocessed clauses: 1628
% 0.20/0.49 % ...number of literals in the above : 1628
% 0.20/0.49 % Current number of archived formulas : 0
% 0.20/0.49 % Current number of archived clauses : 37
% 0.20/0.49 % Clause-clause subsumption calls (NU) : 0
% 0.20/0.49 % Rec. Clause-clause subsumption calls : 0
% 0.20/0.49 % Non-unit clause-clause subsumptions : 0
% 0.20/0.49 % Unit Clause-clause subsumption calls : 6
% 0.20/0.49 % Rewrite failures with RHS unbound : 0
% 0.20/0.49 % BW rewrite match attempts : 179
% 0.20/0.49 % BW rewrite match successes : 51
% 0.20/0.49 % Condensation attempts : 0
% 0.20/0.49 % Condensation successes : 0
% 0.20/0.49 % Termbank termtop insertions : 29305
% 0.20/0.49 % Search garbage collected termcells : 8
% 0.20/0.49
% 0.20/0.49 % -------------------------------------------------
% 0.20/0.49 % User time : 0.030 s
% 0.20/0.49 % System time : 0.003 s
% 0.20/0.49 % Total time : 0.033 s
% 0.20/0.49 % Maximum resident set size: 3624 pages
% 0.20/0.49
% 0.20/0.49 % -------------------------------------------------
% 0.20/0.49 % User time : 0.032 s
% 0.20/0.49 % System time : 0.007 s
% 0.20/0.49 % Total time : 0.040 s
% 0.20/0.49 % Maximum resident set size: 4864 pages
% 0.20/0.49 % E exiting
%------------------------------------------------------------------------------