%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : BOO072-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 : n005.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:05 PM UTC 2026
% Result : Unsatisfiable 0.63s 0.63s
% Output : CNFRefutation 0.63s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 2
% Syntax : Number of clauses : 43 ( 43 unt; 0 nHn; 4 RR)
% Number of literals : 43 ( 42 equ; 3 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 : 73 ( 18 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_1,negated_conjecture,
add(b,a) != add(a,b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',huntinton_1) ).
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(inverse(X1),inverse(X2))),X2) = 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(X1,inverse(add(X2,inverse(X1)))) = X1,
inference(spm,[status(thm)],[c_0_32,c_0_17]) ).
cnf(c_0_35,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_36,plain,
add(X1,inverse(add(X2,inverse(add(inverse(X2),X1))))) = add(inverse(X2),X1),
inference(spm,[status(thm)],[c_0_31,c_0_17]) ).
cnf(c_0_37,plain,
add(X1,inverse(add(inverse(X1),X2))) = X1,
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_38,negated_conjecture,
add(b,a) != add(a,b),
inference(fof_simplification,[status(thm)],[huntinton_1]) ).
cnf(c_0_39,plain,
add(X1,inverse(X2)) = add(inverse(X2),X1),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_40,negated_conjecture,
add(b,a) != add(a,b),
c_0_38 ).
cnf(c_0_41,plain,
add(X1,X2) = add(X2,X1),
inference(spm,[status(thm)],[c_0_39,c_0_17]) ).
cnf(c_0_42,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_40,c_0_41])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : BOO072-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.10/0.36 % Computer : n005.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Mon Sep 21 13:51:47 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.43 Running first-order theorem proving
% 0.15/0.43 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.63/0.63 % Version: 3.5.1
% 0.63/0.63 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.63/0.63 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.63/0.63 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.63/0.63 % Starting new_bool_3 with 300s (1) cores
% 0.63/0.63 % Starting new_bool_1 with 300s (1) cores
% 0.63/0.63 % Starting sh5l with 300s (1) cores
% 0.63/0.63 % new_bool_1 with pid 3643945 completed with status 9
% 0.63/0.63 % new_bool_3 with pid 3643944 completed with status 9
% 0.63/0.63 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 3643943 completed with status 0
% 0.63/0.63 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.63/0.63 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.63/0.63 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.63/0.63 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.63/0.63 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.63/0.63 % No SInE strategy applied
% 0.63/0.63 % Search class: FUUPF-FFSF21-DFFFFFNN
% 0.63/0.63 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.63/0.63 % Starting SubtermCWHack with 136s (1) cores
% 0.63/0.63 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.63/0.63 % Starting U----_116XG_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.63/0.63 % Starting new_bool_3 with 136s (1) cores
% 0.63/0.63 % Starting new_bool_1 with 136s (1) cores
% 0.63/0.63 % U----_116XG_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with pid 3643949 completed with status 0
% 0.63/0.63 % Result found by U----_116XG_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN
% 0.63/0.63 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.63/0.63 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.63/0.63 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.63/0.63 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.63/0.63 % No SInE strategy applied
% 0.63/0.63 % Search class: FUUPF-FFSF21-DFFFFFNN
% 0.63/0.63 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.63/0.63 % Starting SubtermCWHack with 136s (1) cores
% 0.63/0.63 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.63/0.63 % Starting U----_116XG_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.63/0.63 % Preprocessing time : 0.001 s
% 0.63/0.63 % Presaturation interreduction done
% 0.63/0.63
% 0.63/0.63 % Proof found!
% 0.63/0.63 % SZS status Unsatisfiable
% 0.63/0.63 % SZS output start CNFRefutation
% See solution above
% 0.63/0.63 % Parsed axioms : 2
% 0.63/0.63 % Removed by relevancy pruning/SinE : 0
% 0.63/0.63 % Initial clauses : 2
% 0.63/0.63 % Removed in clause preprocessing : 0
% 0.63/0.63 % Initial clauses in saturation : 2
% 0.63/0.63 % Processed clauses : 139
% 0.63/0.63 % ...of these trivial : 66
% 0.63/0.63 % ...subsumed : 0
% 0.63/0.63 % ...remaining for further processing : 73
% 0.63/0.63 % Other redundant clauses eliminated : 0
% 0.63/0.63 % Clauses deleted for lack of memory : 0
% 0.63/0.63 % Backward-subsumed : 1
% 0.63/0.63 % Backward-rewritten : 49
% 0.63/0.63 % Generated clauses : 4973
% 0.63/0.63 % ...of the previous two non-redundant : 3579
% 0.63/0.63 % ...aggressively subsumed : 0
% 0.63/0.63 % Contextual simplify-reflections : 0
% 0.63/0.63 % Paramodulations : 4973
% 0.63/0.63 % Factorizations : 0
% 0.63/0.63 % NegExts : 0
% 0.63/0.63 % Equation resolutions : 0
% 0.63/0.63 % Disequality decompositions : 0
% 0.63/0.63 % Total rewrite steps : 7089
% 0.63/0.63 % ...of those cached : 6453
% 0.63/0.63 % Propositional unsat checks : 0
% 0.63/0.63 % Propositional check models : 0
% 0.63/0.63 % Propositional check unsatisfiable : 0
% 0.63/0.63 % Propositional clauses : 0
% 0.63/0.63 % Propositional clauses after purity: 0
% 0.63/0.63 % Propositional unsat core size : 0
% 0.63/0.63 % Propositional preprocessing time : 0.000
% 0.63/0.63 % Propositional encoding time : 0.000
% 0.63/0.63 % Propositional solver time : 0.000
% 0.63/0.63 % Success case prop preproc time : 0.000
% 0.63/0.63 % Success case prop encoding time : 0.000
% 0.63/0.63 % Success case prop solver time : 0.000
% 0.63/0.63 % Current number of processed clauses : 21
% 0.63/0.63 % Positive orientable unit clauses : 20
% 0.63/0.63 % Positive unorientable unit clauses: 1
% 0.63/0.63 % Negative unit clauses : 0
% 0.63/0.63 % Non-unit-clauses : 0
% 0.63/0.63 % Current number of unprocessed clauses: 3210
% 0.63/0.63 % ...number of literals in the above : 3210
% 0.63/0.63 % Current number of archived formulas : 0
% 0.63/0.63 % Current number of archived clauses : 52
% 0.63/0.63 % Clause-clause subsumption calls (NU) : 0
% 0.63/0.63 % Rec. Clause-clause subsumption calls : 0
% 0.63/0.63 % Non-unit clause-clause subsumptions : 0
% 0.63/0.63 % Unit Clause-clause subsumption calls : 33
% 0.63/0.63 % Rewrite failures with RHS unbound : 0
% 0.63/0.63 % BW rewrite match attempts : 788
% 0.63/0.63 % BW rewrite match successes : 138
% 0.63/0.63 % Condensation attempts : 0
% 0.63/0.63 % Condensation successes : 0
% 0.63/0.63 % Termbank termtop insertions : 126150
% 0.63/0.63 % Search garbage collected termcells : 2
% 0.63/0.63
% 0.63/0.63 % -------------------------------------------------
% 0.63/0.63 % User time : 0.077 s
% 0.63/0.63 % System time : 0.008 s
% 0.63/0.63 % Total time : 0.085 s
% 0.63/0.63 % Maximum resident set size: 3636 pages
% 0.63/0.63
% 0.63/0.63 % -------------------------------------------------
% 0.63/0.63 % User time : 0.462 s
% 0.63/0.63 % System time : 0.081 s
% 0.63/0.63 % Total time : 0.542 s
% 0.63/0.63 % Maximum resident set size: 4864 pages
% 0.63/0.63 % E exiting
%------------------------------------------------------------------------------