%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : BOO074-1 : TPTP v9.3.1. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n019.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 12:07:06 PM UTC 2026
% Result : Unsatisfiable 0.14s 0.56s
% Output : CNFRefutation 1.36s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 2
% Syntax : Number of clauses : 42 ( 42 unt; 0 nHn; 5 RR)
% Number of literals : 42 ( 41 equ; 4 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 13 ( 3 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 69 ( 17 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(dn1,axiom,
inverse(add(inverse(add(inverse(add(X1,X2)),X3)),inverse(add(X1,inverse(add(inverse(X3),inverse(add(X3,X4)))))))) = X3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dn1) ).
cnf(huntinton_3,negated_conjecture,
add(inverse(add(inverse(a),b)),inverse(add(inverse(a),inverse(b)))) != a,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',huntinton_3) ).
cnf(c_0_2,axiom,
inverse(add(inverse(add(inverse(add(X1,X2)),X3)),inverse(add(X1,inverse(add(inverse(X3),inverse(add(X3,X4)))))))) = X3,
dn1 ).
cnf(c_0_3,plain,
inverse(add(inverse(add(inverse(add(inverse(add(inverse(add(inverse(inverse(X1)),X2)),X1)),X3)),inverse(X1))),X1)) = inverse(X1),
inference(spm,[status(thm)],[c_0_2,c_0_2]) ).
cnf(c_0_4,plain,
inverse(add(inverse(add(X1,inverse(X1))),X1)) = inverse(X1),
inference(spm,[status(thm)],[c_0_3,c_0_2]) ).
cnf(c_0_5,plain,
inverse(add(inverse(X1),inverse(add(X1,inverse(add(inverse(X1),inverse(add(X1,X2)))))))) = X1,
inference(spm,[status(thm)],[c_0_2,c_0_4]) ).
cnf(c_0_6,plain,
inverse(add(inverse(add(inverse(add(X1,X2)),X3)),inverse(add(X1,X3)))) = X3,
inference(spm,[status(thm)],[c_0_2,c_0_5]) ).
cnf(c_0_7,plain,
inverse(add(inverse(add(X1,X2)),inverse(add(inverse(X1),X2)))) = X2,
inference(spm,[status(thm)],[c_0_6,c_0_5]) ).
cnf(c_0_8,plain,
inverse(add(inverse(add(X1,X2)),inverse(add(inverse(add(X3,X1)),X2)))) = X2,
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_9,plain,
inverse(add(inverse(X1),inverse(add(X1,X1)))) = X1,
inference(spm,[status(thm)],[c_0_5,c_0_5]) ).
cnf(c_0_10,plain,
inverse(add(inverse(add(inverse(X1),X1)),inverse(X1))) = X1,
inference(spm,[status(thm)],[c_0_8,c_0_3]) ).
cnf(c_0_11,plain,
inverse(add(inverse(add(X1,inverse(add(X1,X1)))),X1)) = inverse(add(X1,X1)),
inference(spm,[status(thm)],[c_0_7,c_0_9]) ).
cnf(c_0_12,plain,
inverse(add(X1,inverse(add(inverse(X1),inverse(X1))))) = inverse(X1),
inference(spm,[status(thm)],[c_0_6,c_0_10]) ).
cnf(c_0_13,plain,
inverse(add(inverse(add(X1,X1)),inverse(add(X1,X1)))) = X1,
inference(spm,[status(thm)],[c_0_6,c_0_11]) ).
cnf(c_0_14,plain,
inverse(add(inverse(X1),inverse(X1))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_12]),c_0_12]) ).
cnf(c_0_15,plain,
add(X1,X1) = X1,
inference(rw,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_16,plain,
inverse(add(inverse(add(inverse(add(X1,X2)),X1)),inverse(X1))) = X1,
inference(spm,[status(thm)],[c_0_6,c_0_15]) ).
cnf(c_0_17,plain,
inverse(inverse(X1)) = X1,
inference(rw,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,plain,
inverse(add(inverse(add(add(X1,inverse(X1)),X1)),inverse(X1))) = X1,
inference(spm,[status(thm)],[c_0_7,c_0_4]) ).
cnf(c_0_19,plain,
inverse(add(X1,add(X2,X1))) = inverse(add(X2,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_6]),c_0_17]) ).
cnf(c_0_20,plain,
inverse(add(X1,inverse(add(add(X1,inverse(X1)),inverse(X1))))) = inverse(X1),
inference(spm,[status(thm)],[c_0_6,c_0_18]) ).
cnf(c_0_21,plain,
add(X1,add(X2,X1)) = add(X2,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_19]),c_0_15]),c_0_19]),c_0_15]),c_0_17]) ).
cnf(c_0_22,plain,
add(inverse(add(X1,X2)),inverse(add(inverse(X1),X2))) = inverse(X2),
inference(spm,[status(thm)],[c_0_17,c_0_7]) ).
cnf(c_0_23,plain,
inverse(add(inverse(add(inverse(X1),X2)),inverse(add(X1,X2)))) = X2,
inference(spm,[status(thm)],[c_0_6,c_0_20]) ).
cnf(c_0_24,plain,
add(inverse(add(inverse(X1),X2)),inverse(X2)) = inverse(X2),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_25,plain,
inverse(add(X1,inverse(add(inverse(X2),inverse(add(X2,X1)))))) = inverse(add(X2,X1)),
inference(spm,[status(thm)],[c_0_6,c_0_23]) ).
cnf(c_0_26,plain,
add(inverse(add(X1,X2)),inverse(X2)) = inverse(X2),
inference(spm,[status(thm)],[c_0_24,c_0_17]) ).
cnf(c_0_27,plain,
inverse(add(X1,inverse(inverse(X1)))) = inverse(X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_25]),c_0_25]) ).
cnf(c_0_28,plain,
add(inverse(add(X1,inverse(X2))),X2) = X2,
inference(spm,[status(thm)],[c_0_26,c_0_17]) ).
cnf(c_0_29,plain,
inverse(add(add(inverse(X1),inverse(add(X1,X1))),inverse(X1))) = X1,
inference(spm,[status(thm)],[c_0_27,c_0_9]) ).
cnf(c_0_30,plain,
inverse(add(inverse(X1),inverse(add(X2,X1)))) = X1,
inference(spm,[status(thm)],[c_0_6,c_0_28]) ).
cnf(c_0_31,plain,
add(X1,inverse(add(inverse(X2),inverse(add(X2,X1))))) = add(X2,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_25]),c_0_17]) ).
cnf(c_0_32,plain,
add(inverse(X1),inverse(add(X2,X1))) = inverse(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_15]),c_0_30]),c_0_15]),c_0_15]) ).
cnf(c_0_33,plain,
inverse(add(inverse(add(inverse(add(X1,X2)),X3)),inverse(add(X3,X1)))) = X3,
inference(spm,[status(thm)],[c_0_2,c_0_31]) ).
cnf(c_0_34,plain,
add(add(X1,X2),X1) = add(X1,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_17]),c_0_17]) ).
cnf(c_0_35,negated_conjecture,
add(inverse(add(inverse(a),b)),inverse(add(inverse(a),inverse(b)))) != a,
inference(fof_simplification,[status(thm)],[huntinton_3]) ).
cnf(c_0_36,plain,
add(inverse(X1),inverse(add(X1,X2))) = inverse(X1),
inference(spm,[status(thm)],[c_0_32,c_0_34]) ).
cnf(c_0_37,negated_conjecture,
add(inverse(add(inverse(a),b)),inverse(add(inverse(a),inverse(b)))) != a,
c_0_35 ).
cnf(c_0_38,plain,
add(X1,X2) = add(X2,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_36]),c_0_17]) ).
cnf(c_0_39,negated_conjecture,
add(inverse(add(b,inverse(a))),inverse(add(inverse(a),inverse(b)))) != a,
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_40,plain,
add(inverse(add(X1,X2)),inverse(add(X2,inverse(X1)))) = inverse(X2),
inference(spm,[status(thm)],[c_0_22,c_0_38]) ).
cnf(c_0_41,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_39,c_0_40]),c_0_17])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : BOO074-1 : TPTP v9.3.1. Released v2.6.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.35 % Computer : n019.cluster.edu
% 0.08/0.35 % Model : x86_64 x86_64
% 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35 % Memory : 8046.5625MB
% 0.08/0.35 % OS : Linux 6.8.0-71-generic
% 0.08/0.35 % CPULimit : 300
% 0.08/0.35 % WCLimit : 300
% 0.08/0.35 % DateTime : Mon Sep 21 13:52:19 UTC 2026
% 0.08/0.35 % CPUTime :
% 0.08/0.35 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.38 Running first-order theorem proving
% 0.08/0.38 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.14/0.56 % Version: 3.5.1
% 0.14/0.56 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.14/0.56 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.56 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.14/0.56 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.56 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.56 % Starting sh5l with 300s (1) cores
% 0.14/0.56 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 2741783 completed with status 0
% 0.14/0.56 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.14/0.56 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.14/0.56 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.56 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.14/0.56 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.56 % No SInE strategy applied
% 0.14/0.56 % Search class: FUUPF-FFSF21-DFFFFFNN
% 0.14/0.56 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.56 % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.56 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.14/0.56 % Starting U----_116XG_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.14/0.56 % Starting new_bool_3 with 136s (1) cores
% 0.14/0.56 % Starting new_bool_1 with 136s (1) cores
% 0.14/0.56 % U----_116XG_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with pid 2741787 completed with status 0
% 0.14/0.56 % Result found by U----_116XG_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN
% 0.14/0.56 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.14/0.56 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.56 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.14/0.56 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.56 % No SInE strategy applied
% 0.14/0.56 % Search class: FUUPF-FFSF21-DFFFFFNN
% 0.14/0.56 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.56 % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.56 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.14/0.56 % Starting U----_116XG_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.14/0.56 % Preprocessing time : 0.002 s
% 0.14/0.56 % Presaturation interreduction done
% 0.14/0.56
% 0.14/0.56 % Proof found!
% 0.14/0.56 % SZS status Unsatisfiable
% 0.14/0.56 % SZS output start CNFRefutation
% See solution above
% 1.36/0.56 % Parsed axioms : 2
% 1.36/0.56 % Removed by relevancy pruning/SinE : 0
% 1.36/0.56 % Initial clauses : 2
% 1.36/0.56 % Removed in clause preprocessing : 0
% 1.36/0.56 % Initial clauses in saturation : 2
% 1.36/0.56 % Processed clauses : 159
% 1.36/0.56 % ...of these trivial : 79
% 1.36/0.56 % ...subsumed : 4
% 1.36/0.56 % ...remaining for further processing : 76
% 1.36/0.56 % Other redundant clauses eliminated : 0
% 1.36/0.56 % Clauses deleted for lack of memory : 0
% 1.36/0.56 % Backward-subsumed : 0
% 1.36/0.56 % Backward-rewritten : 49
% 1.36/0.56 % Generated clauses : 5187
% 1.36/0.56 % ...of the previous two non-redundant : 3629
% 1.36/0.56 % ...aggressively subsumed : 0
% 1.36/0.56 % Contextual simplify-reflections : 0
% 1.36/0.56 % Paramodulations : 5187
% 1.36/0.56 % Factorizations : 0
% 1.36/0.56 % NegExts : 0
% 1.36/0.56 % Equation resolutions : 0
% 1.36/0.56 % Disequality decompositions : 0
% 1.36/0.56 % Total rewrite steps : 8198
% 1.36/0.56 % ...of those cached : 7493
% 1.36/0.56 % Propositional unsat checks : 0
% 1.36/0.56 % Propositional check models : 0
% 1.36/0.56 % Propositional check unsatisfiable : 0
% 1.36/0.56 % Propositional clauses : 0
% 1.36/0.56 % Propositional clauses after purity: 0
% 1.36/0.56 % Propositional unsat core size : 0
% 1.36/0.56 % Propositional preprocessing time : 0.000
% 1.36/0.56 % Propositional encoding time : 0.000
% 1.36/0.56 % Propositional solver time : 0.000
% 1.36/0.56 % Success case prop preproc time : 0.000
% 1.36/0.56 % Success case prop encoding time : 0.000
% 1.36/0.56 % Success case prop solver time : 0.000
% 1.36/0.56 % Current number of processed clauses : 25
% 1.36/0.56 % Positive orientable unit clauses : 23
% 1.36/0.56 % Positive unorientable unit clauses: 1
% 1.36/0.56 % Negative unit clauses : 1
% 1.36/0.56 % Non-unit-clauses : 0
% 1.36/0.56 % Current number of unprocessed clauses: 2827
% 1.36/0.56 % ...number of literals in the above : 2827
% 1.36/0.56 % Current number of archived formulas : 0
% 1.36/0.56 % Current number of archived clauses : 51
% 1.36/0.56 % Clause-clause subsumption calls (NU) : 0
% 1.36/0.56 % Rec. Clause-clause subsumption calls : 0
% 1.36/0.56 % Non-unit clause-clause subsumptions : 0
% 1.36/0.56 % Unit Clause-clause subsumption calls : 18
% 1.36/0.56 % Rewrite failures with RHS unbound : 0
% 1.36/0.56 % BW rewrite match attempts : 875
% 1.36/0.56 % BW rewrite match successes : 116
% 1.36/0.56 % Condensation attempts : 0
% 1.36/0.56 % Condensation successes : 0
% 1.36/0.56 % Termbank termtop insertions : 131673
% 1.36/0.56 % Search garbage collected termcells : 2
% 1.36/0.56
% 1.36/0.56 % -------------------------------------------------
% 1.36/0.56 % User time : 0.145 s
% 1.36/0.56 % System time : 0.008 s
% 1.36/0.56 % Total time : 0.153 s
% 1.36/0.56 % Maximum resident set size: 3592 pages
% 1.36/0.56
% 1.36/0.56 % -------------------------------------------------
% 1.36/0.56 % User time : 0.723 s
% 1.36/0.56 % System time : 0.051 s
% 1.36/0.56 % Total time : 0.774 s
% 1.36/0.56 % Maximum resident set size: 4864 pages
% 1.36/0.56 % E exiting
%------------------------------------------------------------------------------