%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : REL031-2 : 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 : 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:04:04 PM UTC 2026
% Result : Unsatisfiable 2.00s 0.83s
% Output : CNFRefutation 2.00s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 11
% Syntax : Number of clauses : 36 ( 36 unt; 0 nHn; 12 RR)
% Number of literals : 36 ( 35 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 : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 44 ( 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(goals_18,negated_conjecture,
join(composition(converse(sk2),sk2),one) = one,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals_18) ).
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(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(composition_distributivity_7,axiom,
composition(join(X1,X2),X3) = join(composition(X1,X3),composition(X2,X3)),
file('/export/starexec/sandbox/benchmark/Axioms/REL001-0.ax',composition_distributivity_7) ).
cnf(goals_17,negated_conjecture,
join(composition(converse(sk1),sk1),one) = one,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals_17) ).
cnf(goals_19,negated_conjecture,
join(composition(converse(composition(sk1,sk2)),composition(sk1,sk2)),one) != one,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals_19) ).
cnf(converse_additivity_9,axiom,
converse(join(X1,X2)) = join(converse(X1),converse(X2)),
file('/export/starexec/sandbox/benchmark/Axioms/REL001-0.ax',converse_additivity_9) ).
cnf(composition_associativity_5,axiom,
composition(X1,composition(X2,X3)) = composition(composition(X1,X2),X3),
file('/export/starexec/sandbox/benchmark/Axioms/REL001-0.ax',composition_associativity_5) ).
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,negated_conjecture,
join(composition(converse(sk2),sk2),one) = one,
goals_18 ).
cnf(c_0_16,axiom,
join(X1,X2) = join(X2,X1),
maddux1_join_commutativity_1 ).
cnf(c_0_17,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_18,axiom,
join(X1,join(X2,X3)) = join(join(X1,X2),X3),
maddux2_join_associativity_2 ).
cnf(c_0_19,negated_conjecture,
join(one,composition(converse(sk2),sk2)) = one,
inference(rw,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,plain,
converse(one) = one,
inference(spm,[status(thm)],[c_0_14,c_0_17]) ).
cnf(c_0_21,negated_conjecture,
join(one,join(composition(converse(sk2),sk2),X1)) = join(one,X1),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,axiom,
composition(join(X1,X2),X3) = join(composition(X1,X3),composition(X2,X3)),
composition_distributivity_7 ).
cnf(c_0_23,plain,
composition(one,X1) = X1,
inference(rw,[status(thm)],[c_0_17,c_0_20]) ).
cnf(c_0_24,negated_conjecture,
join(composition(converse(sk1),sk1),one) = one,
goals_17 ).
cnf(c_0_25,negated_conjecture,
join(composition(converse(composition(sk1,sk2)),composition(sk1,sk2)),one) != one,
inference(fof_simplification,[status(thm)],[goals_19]) ).
cnf(c_0_26,negated_conjecture,
join(one,composition(join(converse(sk2),X1),sk2)) = join(one,composition(X1,sk2)),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_27,axiom,
converse(join(X1,X2)) = join(converse(X1),converse(X2)),
converse_additivity_9 ).
cnf(c_0_28,plain,
join(X1,composition(X2,X1)) = composition(join(one,X2),X1),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_29,negated_conjecture,
join(one,composition(converse(sk1),sk1)) = one,
inference(rw,[status(thm)],[c_0_24,c_0_16]) ).
cnf(c_0_30,axiom,
composition(X1,composition(X2,X3)) = composition(composition(X1,X2),X3),
composition_associativity_5 ).
cnf(c_0_31,negated_conjecture,
join(composition(converse(composition(sk1,sk2)),composition(sk1,sk2)),one) != one,
c_0_25 ).
cnf(c_0_32,negated_conjecture,
join(one,composition(converse(join(sk2,X1)),sk2)) = join(one,composition(converse(X1),sk2)),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_33,negated_conjecture,
join(X1,composition(converse(sk1),composition(sk1,X1))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30]),c_0_23]) ).
cnf(c_0_34,negated_conjecture,
join(one,composition(converse(composition(sk1,sk2)),composition(sk1,sk2))) != one,
inference(rw,[status(thm)],[c_0_31,c_0_16]) ).
cnf(c_0_35,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_19]),c_0_13]),c_0_30]),c_0_34]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : REL031-2 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.20/0.46 % Computer : n016.cluster.edu
% 0.20/0.46 % Model : x86_64 x86_64
% 0.20/0.46 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.20/0.46 % Memory : 8046.5625MB
% 0.20/0.46 % OS : Linux 6.8.0-71-generic
% 0.20/0.46 % CPULimit : 300
% 0.20/0.46 % WCLimit : 300
% 0.20/0.46 % DateTime : Mon Sep 21 04:08:52 UTC 2026
% 0.20/0.46 % CPUTime :
% 0.20/0.46 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.24/0.56 Running first-order theorem proving
% 0.24/0.56 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
% 2.00/0.83 % Version: 3.5.1
% 2.00/0.83 % Preprocessing class: FSMSSMSSSSSNFFN.
% 2.00/0.83 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.00/0.83 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.00/0.83 % Starting new_bool_3 with 300s (1) cores
% 2.00/0.83 % Starting new_bool_1 with 300s (1) cores
% 2.00/0.83 % Starting sh5l with 300s (1) cores
% 2.00/0.83 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1518421 completed with status 0
% 2.00/0.83 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 2.00/0.83 % Preprocessing class: FSMSSMSSSSSNFFN.
% 2.00/0.83 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.00/0.83 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.00/0.83 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 2.00/0.83 % No SInE strategy applied
% 2.00/0.83 % Search class: FUUPM-FFMF21-DFFFFFNN
% 2.00/0.83 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 2.00/0.83 % Starting SubtermCWHack with 136s (1) cores
% 2.00/0.83 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 2.00/0.83 % Starting H----_047_B31_F1_PI_AE_R4_CS_SP_S2S with 136s (1) cores
% 2.00/0.83 % Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 136s (1) cores
% 2.00/0.83 % Starting new_bool_3 with 136s (1) cores
% 2.00/0.83 % new_bool_3 with pid 1518431 completed with status 0
% 2.00/0.83 % Result found by new_bool_3
% 2.00/0.83 % Preprocessing class: FSMSSMSSSSSNFFN.
% 2.00/0.83 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.00/0.83 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.00/0.83 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 2.00/0.83 % No SInE strategy applied
% 2.00/0.83 % Search class: FUUPM-FFMF21-DFFFFFNN
% 2.00/0.83 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 2.00/0.83 % Starting SubtermCWHack with 136s (1) cores
% 2.00/0.83 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 2.00/0.83 % Starting H----_047_B31_F1_PI_AE_R4_CS_SP_S2S with 136s (1) cores
% 2.00/0.83 % Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 136s (1) cores
% 2.00/0.83 % Starting new_bool_3 with 136s (1) cores
% 2.00/0.83 % Preprocessing time : 0.002 s
% 2.00/0.83 % Presaturation interreduction done
% 2.00/0.83
% 2.00/0.83 % Proof found!
% 2.00/0.83 % SZS status Unsatisfiable
% 2.00/0.83 % SZS output start CNFRefutation
% See solution above
% 2.00/0.83 % Parsed axioms : 19
% 2.00/0.83 % Removed by relevancy pruning/SinE : 0
% 2.00/0.83 % Initial clauses : 19
% 2.00/0.83 % Removed in clause preprocessing : 1
% 2.00/0.83 % Initial clauses in saturation : 18
% 2.00/0.83 % Processed clauses : 1002
% 2.00/0.83 % ...of these trivial : 484
% 2.00/0.83 % ...subsumed : 172
% 2.00/0.83 % ...remaining for further processing : 346
% 2.00/0.83 % Other redundant clauses eliminated : 0
% 2.00/0.83 % Clauses deleted for lack of memory : 0
% 2.00/0.83 % Backward-subsumed : 0
% 2.00/0.83 % Backward-rewritten : 74
% 2.00/0.83 % Generated clauses : 16223
% 2.00/0.83 % ...of the previous two non-redundant : 9851
% 2.00/0.83 % ...aggressively subsumed : 0
% 2.00/0.83 % Contextual simplify-reflections : 0
% 2.00/0.83 % Paramodulations : 16223
% 2.00/0.83 % Factorizations : 0
% 2.00/0.83 % NegExts : 0
% 2.00/0.83 % Equation resolutions : 0
% 2.00/0.83 % Disequality decompositions : 0
% 2.00/0.83 % Total rewrite steps : 34363
% 2.00/0.83 % ...of those cached : 29295
% 2.00/0.83 % Propositional unsat checks : 0
% 2.00/0.83 % Propositional check models : 0
% 2.00/0.83 % Propositional check unsatisfiable : 0
% 2.00/0.83 % Propositional clauses : 0
% 2.00/0.83 % Propositional clauses after purity: 0
% 2.00/0.83 % Propositional unsat core size : 0
% 2.00/0.83 % Propositional preprocessing time : 0.000
% 2.00/0.83 % Propositional encoding time : 0.000
% 2.00/0.83 % Propositional solver time : 0.000
% 2.00/0.83 % Success case prop preproc time : 0.000
% 2.00/0.83 % Success case prop encoding time : 0.000
% 2.00/0.83 % Success case prop solver time : 0.000
% 2.00/0.83 % Current number of processed clauses : 254
% 2.00/0.83 % Positive orientable unit clauses : 248
% 2.00/0.83 % Positive unorientable unit clauses: 5
% 2.00/0.83 % Negative unit clauses : 1
% 2.00/0.83 % Non-unit-clauses : 0
% 2.00/0.83 % Current number of unprocessed clauses: 8807
% 2.00/0.83 % ...number of literals in the above : 8807
% 2.00/0.83 % Current number of archived formulas : 0
% 2.00/0.83 % Current number of archived clauses : 93
% 2.00/0.83 % Clause-clause subsumption calls (NU) : 0
% 2.00/0.83 % Rec. Clause-clause subsumption calls : 0
% 2.00/0.83 % Non-unit clause-clause subsumptions : 0
% 2.00/0.83 % Unit Clause-clause subsumption calls : 85
% 2.00/0.83 % Rewrite failures with RHS unbound : 0
% 2.00/0.83 % BW rewrite match attempts : 1425
% 2.00/0.83 % BW rewrite match successes : 250
% 2.00/0.83 % Condensation attempts : 0
% 2.00/0.83 % Condensation successes : 0
% 2.00/0.83 % Termbank termtop insertions : 348975
% 2.00/0.83 % Search garbage collected termcells : 2
% 2.00/0.83
% 2.00/0.83 % -------------------------------------------------
% 2.00/0.83 % User time : 0.227 s
% 2.00/0.83 % System time : 0.019 s
% 2.00/0.83 % Total time : 0.246 s
% 2.00/0.83 % Maximum resident set size: 3648 pages
% 2.00/0.83
% 2.00/0.83 % -------------------------------------------------
% 2.00/0.83 % User time : 1.061 s
% 2.00/0.83 % System time : 0.090 s
% 2.00/0.83 % Total time : 1.152 s
% 2.00/0.83 % Maximum resident set size: 4864 pages
% 2.00/0.83 % E exiting
%------------------------------------------------------------------------------