%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : REL008-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 : n018.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:51 PM UTC 2026
% Result : Unsatisfiable 0.30s 0.70s
% Output : CNFRefutation 0.30s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 5
% Syntax : Number of clauses : 16 ( 16 unt; 0 nHn; 4 RR)
% Number of literals : 16 ( 15 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 : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 27 ( 0 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(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(composition_distributivity_7,axiom,
composition(join(X1,X2),X3) = join(composition(X1,X3),composition(X2,X3)),
file('/export/starexec/sandbox2/benchmark/Axioms/REL001-0.ax',composition_distributivity_7) ).
cnf(goals_17,negated_conjecture,
composition(sk1,join(sk2,sk3)) != join(composition(sk1,sk2),composition(sk1,sk3)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals_17) ).
cnf(c_0_5,axiom,
converse(composition(X1,X2)) = composition(converse(X2),converse(X1)),
converse_multiplicativity_10 ).
cnf(c_0_6,axiom,
converse(converse(X1)) = X1,
converse_idempotence_8 ).
cnf(c_0_7,axiom,
converse(join(X1,X2)) = join(converse(X1),converse(X2)),
converse_additivity_9 ).
cnf(c_0_8,plain,
converse(composition(converse(X1),X2)) = composition(converse(X2),X1),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_9,axiom,
composition(join(X1,X2),X3) = join(composition(X1,X3),composition(X2,X3)),
composition_distributivity_7 ).
cnf(c_0_10,negated_conjecture,
composition(sk1,join(sk2,sk3)) != join(composition(sk1,sk2),composition(sk1,sk3)),
inference(fof_simplification,[status(thm)],[goals_17]) ).
cnf(c_0_11,plain,
converse(join(composition(converse(X1),X2),X3)) = join(composition(converse(X2),X1),converse(X3)),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_12,plain,
join(composition(X1,converse(X2)),converse(composition(X2,X3))) = composition(join(X1,converse(X3)),converse(X2)),
inference(spm,[status(thm)],[c_0_9,c_0_5]) ).
cnf(c_0_13,negated_conjecture,
composition(sk1,join(sk2,sk3)) != join(composition(sk1,sk2),composition(sk1,sk3)),
c_0_10 ).
cnf(c_0_14,plain,
join(composition(X1,X2),composition(X1,X3)) = composition(X1,join(X2,X3)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_7]),c_0_5]),c_0_6]),c_0_6]),c_0_6]) ).
cnf(c_0_15,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_14])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : REL008-3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.19/0.50 % Computer : n018.cluster.edu
% 0.19/0.50 % Model : x86_64 x86_64
% 0.19/0.50 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.50 % Memory : 8046.5625MB
% 0.19/0.50 % OS : Linux 6.8.0-71-generic
% 0.19/0.50 % CPULimit : 300
% 0.19/0.50 % WCLimit : 300
% 0.19/0.50 % DateTime : Mon Sep 21 04:00:28 UTC 2026
% 0.19/0.51 % CPUTime :
% 0.19/0.51 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.24/0.59 Running first-order theorem proving
% 0.24/0.59 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.30/0.70 % Version: 3.5.1
% 0.30/0.70 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.30/0.70 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.30/0.70 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.30/0.70 % Starting new_bool_3 with 300s (1) cores
% 0.30/0.70 % Starting new_bool_1 with 300s (1) cores
% 0.30/0.70 % Starting sh5l with 300s (1) cores
% 0.30/0.70 % new_bool_1 with pid 923724 completed with status 0
% 0.30/0.70 % Result found by new_bool_1
% 0.30/0.70 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.30/0.70 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.30/0.70 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.30/0.70 % Starting new_bool_3 with 300s (1) cores
% 0.30/0.70 % Starting new_bool_1 with 300s (1) cores
% 0.30/0.70 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.30/0.70 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.30/0.70 % Search class: FUUPM-FFMF21-DFFFFFNN
% 0.30/0.70 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.30/0.70 % Starting SubtermCWHack with 31s (1) cores
% 0.30/0.70 % SubtermCWHack with pid 923729 completed with status 0
% 0.30/0.70 % Result found by SubtermCWHack
% 0.30/0.70 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.30/0.70 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.30/0.70 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.30/0.70 % Starting new_bool_3 with 300s (1) cores
% 0.30/0.70 % Starting new_bool_1 with 300s (1) cores
% 0.30/0.70 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.30/0.70 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.30/0.70 % Search class: FUUPM-FFMF21-DFFFFFNN
% 0.30/0.70 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.30/0.70 % Starting SubtermCWHack with 31s (1) cores
% 0.30/0.70 % Preprocessing time : 0.002 s
% 0.30/0.70
% 0.30/0.70 % Proof found!
% 0.30/0.70 % SZS status Unsatisfiable
% 0.30/0.70 % SZS output start CNFRefutation
% See solution above
% 0.30/0.70 % Parsed axioms : 17
% 0.30/0.70 % Removed by relevancy pruning/SinE : 3
% 0.30/0.70 % Initial clauses : 14
% 0.30/0.70 % Removed in clause preprocessing : 0
% 0.30/0.70 % Initial clauses in saturation : 14
% 0.30/0.70 % Processed clauses : 474
% 0.30/0.70 % ...of these trivial : 211
% 0.30/0.70 % ...subsumed : 187
% 0.30/0.70 % ...remaining for further processing : 76
% 0.30/0.70 % Other redundant clauses eliminated : 0
% 0.30/0.70 % Clauses deleted for lack of memory : 0
% 0.30/0.70 % Backward-subsumed : 0
% 0.30/0.70 % Backward-rewritten : 1
% 0.30/0.70 % Generated clauses : 2554
% 0.30/0.70 % ...of the previous two non-redundant : 2271
% 0.30/0.70 % ...aggressively subsumed : 0
% 0.30/0.70 % Contextual simplify-reflections : 0
% 0.30/0.70 % Paramodulations : 2554
% 0.30/0.70 % Factorizations : 0
% 0.30/0.70 % NegExts : 0
% 0.30/0.70 % Equation resolutions : 0
% 0.30/0.70 % Disequality decompositions : 0
% 0.30/0.70 % Total rewrite steps : 1849
% 0.30/0.70 % ...of those cached : 975
% 0.30/0.70 % Propositional unsat checks : 0
% 0.30/0.70 % Propositional check models : 0
% 0.30/0.70 % Propositional check unsatisfiable : 0
% 0.30/0.70 % Propositional clauses : 0
% 0.30/0.70 % Propositional clauses after purity: 0
% 0.30/0.70 % Propositional unsat core size : 0
% 0.30/0.70 % Propositional preprocessing time : 0.000
% 0.30/0.70 % Propositional encoding time : 0.000
% 0.30/0.70 % Propositional solver time : 0.000
% 0.30/0.70 % Success case prop preproc time : 0.000
% 0.30/0.70 % Success case prop encoding time : 0.000
% 0.30/0.70 % Success case prop solver time : 0.000
% 0.30/0.70 % Current number of processed clauses : 75
% 0.30/0.70 % Positive orientable unit clauses : 59
% 0.30/0.70 % Positive unorientable unit clauses: 16
% 0.30/0.70 % Negative unit clauses : 0
% 0.30/0.70 % Non-unit-clauses : 0
% 0.30/0.70 % Current number of unprocessed clauses: 1811
% 0.30/0.70 % ...number of literals in the above : 1811
% 0.30/0.70 % Current number of archived formulas : 0
% 0.30/0.70 % Current number of archived clauses : 1
% 0.30/0.70 % Clause-clause subsumption calls (NU) : 0
% 0.30/0.70 % Rec. Clause-clause subsumption calls : 0
% 0.30/0.70 % Non-unit clause-clause subsumptions : 0
% 0.30/0.70 % Unit Clause-clause subsumption calls : 65
% 0.30/0.70 % Rewrite failures with RHS unbound : 0
% 0.30/0.70 % BW rewrite match attempts : 132
% 0.30/0.70 % BW rewrite match successes : 33
% 0.30/0.70 % Condensation attempts : 0
% 0.30/0.70 % Condensation successes : 0
% 0.30/0.70 % Termbank termtop insertions : 31065
% 0.30/0.70 % Search garbage collected termcells : 11
% 0.30/0.70
% 0.30/0.70 % -------------------------------------------------
% 0.30/0.70 % User time : 0.049 s
% 0.30/0.70 % System time : 0.009 s
% 0.30/0.70 % Total time : 0.057 s
% 0.30/0.70 % Maximum resident set size: 3648 pages
% 0.30/0.70
% 0.30/0.70 % -------------------------------------------------
% 0.30/0.70 % User time : 0.050 s
% 0.30/0.70 % System time : 0.017 s
% 0.30/0.70 % Total time : 0.066 s
% 0.30/0.70 % Maximum resident set size: 4608 pages
% 0.30/0.70 % E exiting
%------------------------------------------------------------------------------