%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : TOP049-1 : TPTP v9.3.1. Released v8.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n020.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 03:53:59 PM UTC 2026
% Result : Unsatisfiable 0.11s 0.44s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 13
% Syntax : Number of clauses : 64 ( 64 unt; 0 nHn; 51 RR)
% Number of literals : 64 ( 63 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 10 con; 0-9 aty)
% Number of variables : 19 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(involutory_quandle_01,axiom,
product(product(X1,X2),X2) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',involutory_quandle_01) ).
cnf(knot_08,axiom,
a8 = product(a7,a4),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',knot_08) ).
cnf(involutory_quandle_02,axiom,
product(product(X1,X2),X3) = product(product(X1,X3),product(X2,X3)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',involutory_quandle_02) ).
cnf(knot_09,axiom,
a10 = product(a8,a9),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',knot_09) ).
cnf(knot_11,axiom,
a9 = product(a4,a8),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',knot_11) ).
cnf(involutory_quandle,axiom,
product(X1,X1) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',involutory_quandle) ).
cnf(knot_10,axiom,
a4 = product(a10,a3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',knot_10) ).
cnf(knot_04,axiom,
a2 = product(a3,a4),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',knot_04) ).
cnf(knot,axiom,
a1 = product(a9,a7),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',knot) ).
cnf(knot_03,axiom,
a3 = product(a1,a2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',knot_03) ).
cnf(knot_05,axiom,
a5 = product(a2,a10),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',knot_05) ).
cnf(knot_06,axiom,
a6 = product(a5,a4),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',knot_06) ).
cnf(goal,negated_conjecture,
tuple(a1,a9,a8,a6,a7,a2,a3,a4,a5) != tuple(a2,a10,a9,a7,a8,a3,a4,a5,a6),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goal) ).
cnf(c_0_13,axiom,
product(product(X1,X2),X2) = X1,
involutory_quandle_01 ).
cnf(c_0_14,axiom,
a8 = product(a7,a4),
knot_08 ).
cnf(c_0_15,axiom,
product(product(X1,X2),X3) = product(product(X1,X3),product(X2,X3)),
involutory_quandle_02 ).
cnf(c_0_16,axiom,
a10 = product(a8,a9),
knot_09 ).
cnf(c_0_17,axiom,
a9 = product(a4,a8),
knot_11 ).
cnf(c_0_18,plain,
product(a8,a4) = a7,
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_19,plain,
product(product(X1,a8),a9) = product(product(X1,a9),a10),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,plain,
product(a9,a8) = a4,
inference(spm,[status(thm)],[c_0_13,c_0_17]) ).
cnf(c_0_21,axiom,
product(X1,X1) = X1,
involutory_quandle ).
cnf(c_0_22,plain,
product(product(X1,a8),a4) = product(product(X1,a4),a7),
inference(spm,[status(thm)],[c_0_15,c_0_18]) ).
cnf(c_0_23,plain,
product(product(X1,a9),a10) = product(product(X1,a4),a8),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_17]),c_0_19]) ).
cnf(c_0_24,plain,
product(a9,a10) = product(a4,a9),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]) ).
cnf(c_0_25,plain,
product(a9,a4) = product(a4,a7),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_17]),c_0_21]) ).
cnf(c_0_26,axiom,
a4 = product(a10,a3),
knot_10 ).
cnf(c_0_27,axiom,
a2 = product(a3,a4),
knot_04 ).
cnf(c_0_28,plain,
product(product(a4,a7),a8) = product(a4,a9),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_21]),c_0_24]),c_0_25]) ).
cnf(c_0_29,plain,
product(product(a4,a7),a4) = a9,
inference(spm,[status(thm)],[c_0_13,c_0_25]) ).
cnf(c_0_30,axiom,
a1 = product(a9,a7),
knot ).
cnf(c_0_31,plain,
product(a4,a3) = a10,
inference(spm,[status(thm)],[c_0_13,c_0_26]) ).
cnf(c_0_32,plain,
product(a2,a4) = a3,
inference(spm,[status(thm)],[c_0_13,c_0_27]) ).
cnf(c_0_33,axiom,
a3 = product(a1,a2),
knot_03 ).
cnf(c_0_34,plain,
product(product(a4,a9),a4) = a1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_28]),c_0_29]),c_0_30]) ).
cnf(c_0_35,plain,
product(product(X1,a3),a10) = product(product(X1,a4),a3),
inference(spm,[status(thm)],[c_0_15,c_0_31]) ).
cnf(c_0_36,plain,
product(product(X1,a2),a4) = product(product(X1,a4),a3),
inference(spm,[status(thm)],[c_0_15,c_0_32]) ).
cnf(c_0_37,plain,
product(a3,a2) = a1,
inference(spm,[status(thm)],[c_0_13,c_0_33]) ).
cnf(c_0_38,plain,
product(a1,a4) = product(a4,a9),
inference(spm,[status(thm)],[c_0_13,c_0_34]) ).
cnf(c_0_39,plain,
product(a2,a3) = product(a3,a10),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_21]),c_0_27]) ).
cnf(c_0_40,plain,
product(product(X1,a10),a3) = product(product(X1,a3),a4),
inference(spm,[status(thm)],[c_0_15,c_0_26]) ).
cnf(c_0_41,plain,
product(product(a4,a9),a10) = a9,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_17]),c_0_21]) ).
cnf(c_0_42,plain,
product(a3,a10) = product(a4,a9),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38]),c_0_27]),c_0_39]) ).
cnf(c_0_43,plain,
product(a10,a9) = a8,
inference(spm,[status(thm)],[c_0_13,c_0_16]) ).
cnf(c_0_44,plain,
product(product(product(a4,a9),a3),a4) = product(a9,a3),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_45,plain,
a3 = a9,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_42]),c_0_23]),c_0_21]),c_0_17]) ).
cnf(c_0_46,plain,
product(product(X1,a10),a9) = product(product(X1,a9),a8),
inference(spm,[status(thm)],[c_0_15,c_0_43]) ).
cnf(c_0_47,axiom,
a5 = product(a2,a10),
knot_05 ).
cnf(c_0_48,plain,
a9 = a4,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_44,c_0_45]),c_0_13]),c_0_21]),c_0_45]),c_0_21]) ).
cnf(c_0_49,axiom,
a6 = product(a5,a4),
knot_06 ).
cnf(c_0_50,plain,
product(product(a2,a9),a8) = product(a5,a9),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_51,negated_conjecture,
tuple(a1,a9,a8,a6,a7,a2,a3,a4,a5) != tuple(a2,a10,a9,a7,a8,a3,a4,a5,a6),
inference(fof_simplification,[status(thm)],[goal]) ).
cnf(c_0_52,plain,
product(a7,a8) = a10,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_16]),c_0_21]),c_0_18]) ).
cnf(c_0_53,plain,
a8 = a4,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_45]),c_0_43]) ).
cnf(c_0_54,plain,
a10 = a7,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_48]),c_0_18]) ).
cnf(c_0_55,plain,
product(a2,a4) = a4,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_32,c_0_45]),c_0_48]) ).
cnf(c_0_56,plain,
product(a6,a4) = a5,
inference(spm,[status(thm)],[c_0_13,c_0_49]) ).
cnf(c_0_57,plain,
a6 = a4,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_50,c_0_48]),c_0_32]),c_0_45]),c_0_48]),c_0_17]),c_0_48]),c_0_48]),c_0_49]) ).
cnf(c_0_58,negated_conjecture,
tuple(a1,a9,a8,a6,a7,a2,a3,a4,a5) != tuple(a2,a10,a9,a7,a8,a3,a4,a5,a6),
c_0_51 ).
cnf(c_0_59,plain,
a1 = a4,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_48]),c_0_21]),c_0_21]) ).
cnf(c_0_60,plain,
a7 = a4,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_52,c_0_53]),c_0_14]),c_0_53]),c_0_54]) ).
cnf(c_0_61,plain,
a2 = a4,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_55]),c_0_21]) ).
cnf(c_0_62,plain,
a5 = a4,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_56,c_0_57]),c_0_21]) ).
cnf(c_0_63,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_58,c_0_45]),c_0_45]),c_0_59]),c_0_48]),c_0_53]),c_0_57]),c_0_60]),c_0_61]),c_0_48]),c_0_62]),c_0_61]),c_0_54]),c_0_60]),c_0_48]),c_0_60]),c_0_53]),c_0_48]),c_0_62]),c_0_57])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : TOP049-1 : TPTP v9.3.1. Released v8.1.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.38 % Computer : n020.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Mon Sep 21 12:48:32 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.42 Running first-order theorem proving
% 0.11/0.42 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.11/0.44 % Version: 3.5.1
% 0.11/0.44 % Preprocessing class: FSSSSMSMSSSNFFN.
% 0.11/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.44 % Starting G----_0031_C18_F1_SE_CS_SP_S0Y with 1500s (5) cores
% 0.11/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.11/0.44 % Starting sh5l with 300s (1) cores
% 0.11/0.44 % G----_0031_C18_F1_SE_CS_SP_S0Y with pid 2949932 completed with status 0
% 0.11/0.44 % Result found by G----_0031_C18_F1_SE_CS_SP_S0Y
% 0.11/0.44 % Preprocessing class: FSSSSMSMSSSNFFN.
% 0.11/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.44 % Starting G----_0031_C18_F1_SE_CS_SP_S0Y with 1500s (5) cores
% 0.11/0.44 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.11/0.44 % No SInE strategy applied
% 0.11/0.44 % Search class: FUUPS-FFSM33-SFFFFFNN
% 0.11/0.44 % partial match(1): FUUPS-FFSF33-SFFFFFNN
% 0.11/0.44 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.11/0.44 % Starting SubtermCWHack with 136s (1) cores
% 0.11/0.44 % Starting G----_0031_C18_F1_SE_CS_SP_S0Y with 151s (1) cores
% 0.11/0.44 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.11/0.44 % Starting new_bool_3 with 136s (1) cores
% 0.11/0.44 % Starting new_bool_1 with 136s (1) cores
% 0.11/0.44 % G----_0031_C18_F1_SE_CS_SP_S0Y with pid 2949937 completed with status 0
% 0.11/0.44 % Result found by G----_0031_C18_F1_SE_CS_SP_S0Y
% 0.11/0.44 % Preprocessing class: FSSSSMSMSSSNFFN.
% 0.11/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.44 % Starting G----_0031_C18_F1_SE_CS_SP_S0Y with 1500s (5) cores
% 0.11/0.44 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.11/0.44 % No SInE strategy applied
% 0.11/0.44 % Search class: FUUPS-FFSM33-SFFFFFNN
% 0.11/0.44 % partial match(1): FUUPS-FFSF33-SFFFFFNN
% 0.11/0.44 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.11/0.44 % Starting SubtermCWHack with 136s (1) cores
% 0.11/0.44 % Starting G----_0031_C18_F1_SE_CS_SP_S0Y with 151s (1) cores
% 0.11/0.44 % Preprocessing time : 0.001 s
% 0.11/0.44
% 0.11/0.44 % Proof found!
% 0.11/0.44 % SZS status Unsatisfiable
% 0.11/0.44 % SZS output start CNFRefutation
% See solution above
% 0.11/0.44 % Parsed axioms : 14
% 0.11/0.44 % Removed by relevancy pruning/SinE : 0
% 0.11/0.44 % Initial clauses : 14
% 0.11/0.44 % Removed in clause preprocessing : 0
% 0.11/0.44 % Initial clauses in saturation : 14
% 0.11/0.44 % Processed clauses : 139
% 0.11/0.44 % ...of these trivial : 49
% 0.11/0.44 % ...subsumed : 0
% 0.11/0.44 % ...remaining for further processing : 89
% 0.11/0.44 % Other redundant clauses eliminated : 0
% 0.11/0.44 % Clauses deleted for lack of memory : 0
% 0.11/0.44 % Backward-subsumed : 0
% 0.11/0.44 % Backward-rewritten : 77
% 0.11/0.44 % Generated clauses : 327
% 0.11/0.44 % ...of the previous two non-redundant : 320
% 0.11/0.44 % ...aggressively subsumed : 0
% 0.11/0.44 % Contextual simplify-reflections : 0
% 0.11/0.44 % Paramodulations : 327
% 0.11/0.44 % Factorizations : 0
% 0.11/0.44 % NegExts : 0
% 0.11/0.44 % Equation resolutions : 0
% 0.11/0.44 % Disequality decompositions : 0
% 0.11/0.44 % Total rewrite steps : 603
% 0.11/0.44 % ...of those cached : 483
% 0.11/0.44 % Propositional unsat checks : 0
% 0.11/0.44 % Propositional check models : 0
% 0.11/0.44 % Propositional check unsatisfiable : 0
% 0.11/0.44 % Propositional clauses : 0
% 0.11/0.44 % Propositional clauses after purity: 0
% 0.11/0.44 % Propositional unsat core size : 0
% 0.11/0.44 % Propositional preprocessing time : 0.000
% 0.11/0.44 % Propositional encoding time : 0.000
% 0.11/0.44 % Propositional solver time : 0.000
% 0.11/0.44 % Success case prop preproc time : 0.000
% 0.11/0.44 % Success case prop encoding time : 0.000
% 0.11/0.44 % Success case prop solver time : 0.000
% 0.11/0.44 % Current number of processed clauses : 12
% 0.11/0.44 % Positive orientable unit clauses : 12
% 0.11/0.44 % Positive unorientable unit clauses: 0
% 0.11/0.44 % Negative unit clauses : 0
% 0.11/0.44 % Non-unit-clauses : 0
% 0.11/0.44 % Current number of unprocessed clauses: 182
% 0.11/0.44 % ...number of literals in the above : 182
% 0.11/0.44 % Current number of archived formulas : 0
% 0.11/0.44 % Current number of archived clauses : 77
% 0.11/0.44 % Clause-clause subsumption calls (NU) : 0
% 0.11/0.44 % Rec. Clause-clause subsumption calls : 0
% 0.11/0.44 % Non-unit clause-clause subsumptions : 0
% 0.11/0.44 % Unit Clause-clause subsumption calls : 0
% 0.11/0.44 % Rewrite failures with RHS unbound : 0
% 0.11/0.44 % BW rewrite match attempts : 40
% 0.11/0.44 % BW rewrite match successes : 13
% 0.11/0.44 % Condensation attempts : 0
% 0.11/0.44 % Condensation successes : 0
% 0.11/0.44 % Termbank termtop insertions : 4246
% 0.11/0.44 % Search garbage collected termcells : 2
% 0.11/0.44
% 0.11/0.44 % -------------------------------------------------
% 0.11/0.44 % User time : 0.007 s
% 0.11/0.44 % System time : 0.001 s
% 0.11/0.44 % Total time : 0.008 s
% 0.11/0.44 % Maximum resident set size: 3636 pages
% 0.11/0.44
% 0.11/0.44 % -------------------------------------------------
% 0.11/0.44 % User time : 0.028 s
% 0.11/0.44 % System time : 0.009 s
% 0.11/0.44 % Total time : 0.038 s
% 0.11/0.44 % Maximum resident set size: 4864 pages
% 0.11/0.44 % E exiting
%------------------------------------------------------------------------------