%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GRP515-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 : n012.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:40:09 PM UTC 2026
% Result : Unsatisfiable 0.04s 5.98s
% Output : CNFRefutation 0.04s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 2
% Syntax : Number of clauses : 22 ( 22 unt; 0 nHn; 6 RR)
% Number of literals : 22 ( 21 equ; 5 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 47 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
multiply(X1,multiply(multiply(X2,X3),inverse(multiply(X1,X3)))) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',single_axiom) ).
cnf(prove_these_axioms_3,negated_conjecture,
multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_these_axioms_3) ).
cnf(c_0_2,axiom,
multiply(X1,multiply(multiply(X2,X3),inverse(multiply(X1,X3)))) = X2,
single_axiom ).
cnf(c_0_3,plain,
multiply(X1,multiply(X2,inverse(multiply(X1,multiply(multiply(X2,X3),inverse(multiply(X4,X3))))))) = X4,
inference(spm,[status(thm)],[c_0_2,c_0_2]) ).
cnf(c_0_4,plain,
multiply(X1,multiply(X2,inverse(X2))) = X1,
inference(spm,[status(thm)],[c_0_3,c_0_2]) ).
cnf(c_0_5,plain,
multiply(X1,multiply(X2,inverse(X1))) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_2,c_0_4]),c_0_4]) ).
cnf(c_0_6,plain,
multiply(X1,multiply(multiply(X2,multiply(multiply(X3,X4),inverse(multiply(X1,X4)))),inverse(X3))) = X2,
inference(spm,[status(thm)],[c_0_2,c_0_2]) ).
cnf(c_0_7,plain,
multiply(multiply(X1,X2),multiply(X3,inverse(multiply(X3,X2)))) = X1,
inference(spm,[status(thm)],[c_0_3,c_0_5]) ).
cnf(c_0_8,plain,
multiply(X1,multiply(multiply(X2,X3),inverse(X2))) = multiply(X1,X3),
inference(spm,[status(thm)],[c_0_6,c_0_5]) ).
cnf(c_0_9,plain,
multiply(multiply(X1,X2),multiply(X3,inverse(X1))) = multiply(X3,X2),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_10,plain,
multiply(multiply(X1,X2),X3) = multiply(multiply(X1,X3),X2),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_11,plain,
multiply(X1,multiply(multiply(X2,inverse(X3)),multiply(multiply(X3,X4),inverse(multiply(X1,X4))))) = X2,
inference(rw,[status(thm)],[c_0_6,c_0_10]) ).
cnf(c_0_12,plain,
multiply(multiply(X1,X2),inverse(X2)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_2]),c_0_10]) ).
cnf(c_0_13,negated_conjecture,
multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
inference(fof_simplification,[status(thm)],[prove_these_axioms_3]) ).
cnf(c_0_14,plain,
multiply(X1,X2) = multiply(X2,X1),
inference(spm,[status(thm)],[c_0_5,c_0_12]) ).
cnf(c_0_15,negated_conjecture,
multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
c_0_13 ).
cnf(c_0_16,plain,
multiply(multiply(X1,X2),X3) = multiply(X2,multiply(X1,X3)),
inference(spm,[status(thm)],[c_0_10,c_0_14]) ).
cnf(c_0_17,negated_conjecture,
multiply(c3,multiply(a3,b3)) != multiply(a3,multiply(b3,c3)),
inference(rw,[status(thm)],[c_0_15,c_0_14]) ).
cnf(c_0_18,plain,
multiply(X1,multiply(X2,X3)) = multiply(X3,multiply(X2,X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_16]),c_0_16]) ).
cnf(c_0_19,negated_conjecture,
multiply(b3,multiply(a3,c3)) != multiply(a3,multiply(b3,c3)),
inference(rw,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_20,plain,
multiply(X1,multiply(X2,X3)) = multiply(X2,multiply(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_14]),c_0_16]) ).
cnf(c_0_21,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_20])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : GRP515-1 : TPTP v9.3.1. Released v2.6.0.
% 0.00/0.02 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.04/5.93 % Computer : n012.cluster.edu
% 0.04/5.93 % Model : x86_64 x86_64
% 0.04/5.93 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.04/5.93 % Memory : 8046.5625MB
% 0.04/5.93 % OS : Linux 6.8.0-71-generic
% 0.04/5.93 % CPULimit : 300
% 0.04/5.93 % WCLimit : 300
% 0.04/5.93 % DateTime : Sun Sep 20 20:15:37 UTC 2026
% 0.04/5.94 % CPUTime :
% 0.04/5.94 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.04/5.96 Running first-order theorem proving
% 0.04/5.96 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.04/5.98 % Version: 3.5.1
% 0.04/5.98 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.04/5.98 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.04/5.98 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.04/5.98 % Starting new_bool_3 with 300s (1) cores
% 0.04/5.98 % Starting new_bool_1 with 300s (1) cores
% 0.04/5.98 % Starting sh5l with 300s (1) cores
% 0.04/5.98 % new_bool_3 with pid 779973 completed with status 9
% 0.04/5.98 % new_bool_1 with pid 779974 completed with status 9
% 0.04/5.98 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 779972 completed with status 0
% 0.04/5.98 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.04/5.98 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.04/5.98 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.04/5.98 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.04/5.98 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.04/5.98 % No SInE strategy applied
% 0.04/5.98 % Search class: FUUPF-FFSF21-MFFFFFNN
% 0.04/5.98 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.04/5.98 % Starting SubtermCWHack with 136s (1) cores
% 0.04/5.98 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.04/5.98 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.04/5.98 % Starting new_bool_3 with 136s (1) cores
% 0.04/5.98 % Starting new_bool_1 with 136s (1) cores
% 0.04/5.98 % G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with pid 779979 completed with status 0
% 0.04/5.98 % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y
% 0.04/5.98 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.04/5.98 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.04/5.98 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.04/5.98 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.04/5.98 % No SInE strategy applied
% 0.04/5.98 % Search class: FUUPF-FFSF21-MFFFFFNN
% 0.04/5.98 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.04/5.98 % Starting SubtermCWHack with 136s (1) cores
% 0.04/5.98 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.04/5.98 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.04/5.98 % Preprocessing time : 0.001 s
% 0.04/5.98 % Presaturation interreduction done
% 0.04/5.98
% 0.04/5.98 % Proof found!
% 0.04/5.98 % SZS status Unsatisfiable
% 0.04/5.98 % SZS output start CNFRefutation
% See solution above
% 0.04/5.98 % Parsed axioms : 2
% 0.04/5.98 % Removed by relevancy pruning/SinE : 0
% 0.04/5.98 % Initial clauses : 2
% 0.04/5.98 % Removed in clause preprocessing : 0
% 0.04/5.98 % Initial clauses in saturation : 2
% 0.04/5.98 % Processed clauses : 135
% 0.04/5.98 % ...of these trivial : 40
% 0.04/5.98 % ...subsumed : 54
% 0.04/5.98 % ...remaining for further processing : 41
% 0.04/5.98 % Other redundant clauses eliminated : 0
% 0.04/5.98 % Clauses deleted for lack of memory : 0
% 0.04/5.98 % Backward-subsumed : 0
% 0.04/5.98 % Backward-rewritten : 17
% 0.04/5.98 % Generated clauses : 1631
% 0.04/5.98 % ...of the previous two non-redundant : 1258
% 0.04/5.98 % ...aggressively subsumed : 0
% 0.04/5.98 % Contextual simplify-reflections : 0
% 0.04/5.98 % Paramodulations : 1631
% 0.04/5.98 % Factorizations : 0
% 0.04/5.98 % NegExts : 0
% 0.04/5.98 % Equation resolutions : 0
% 0.04/5.98 % Disequality decompositions : 0
% 0.04/5.98 % Total rewrite steps : 1500
% 0.04/5.98 % ...of those cached : 714
% 0.04/5.98 % Propositional unsat checks : 0
% 0.04/5.98 % Propositional check models : 0
% 0.04/5.98 % Propositional check unsatisfiable : 0
% 0.04/5.98 % Propositional clauses : 0
% 0.04/5.98 % Propositional clauses after purity: 0
% 0.04/5.98 % Propositional unsat core size : 0
% 0.04/5.98 % Propositional preprocessing time : 0.000
% 0.04/5.98 % Propositional encoding time : 0.000
% 0.04/5.98 % Propositional solver time : 0.000
% 0.04/5.98 % Success case prop preproc time : 0.000
% 0.04/5.98 % Success case prop encoding time : 0.000
% 0.04/5.98 % Success case prop solver time : 0.000
% 0.04/5.98 % Current number of processed clauses : 22
% 0.04/5.98 % Positive orientable unit clauses : 18
% 0.04/5.98 % Positive unorientable unit clauses: 4
% 0.04/5.98 % Negative unit clauses : 0
% 0.04/5.98 % Non-unit-clauses : 0
% 0.04/5.98 % Current number of unprocessed clauses: 1062
% 0.04/5.98 % ...number of literals in the above : 1062
% 0.04/5.98 % Current number of archived formulas : 0
% 0.04/5.98 % Current number of archived clauses : 19
% 0.04/5.98 % Clause-clause subsumption calls (NU) : 0
% 0.04/5.98 % Rec. Clause-clause subsumption calls : 0
% 0.04/5.98 % Non-unit clause-clause subsumptions : 0
% 0.04/5.98 % Unit Clause-clause subsumption calls : 40
% 0.04/5.98 % Rewrite failures with RHS unbound : 14
% 0.04/5.98 % BW rewrite match attempts : 224
% 0.04/5.98 % BW rewrite match successes : 144
% 0.04/5.98 % Condensation attempts : 0
% 0.04/5.98 % Condensation successes : 0
% 0.04/5.98 % Termbank termtop insertions : 20203
% 0.04/5.98 % Search garbage collected termcells : 2
% 0.04/5.98
% 0.04/5.98 % -------------------------------------------------
% 0.04/5.98 % User time : 0.013 s
% 0.04/5.98 % System time : 0.004 s
% 0.04/5.98 % Total time : 0.017 s
% 0.04/5.98 % Maximum resident set size: 3576 pages
% 0.04/5.98
% 0.04/5.98 % -------------------------------------------------
% 0.04/5.98 % User time : 0.078 s
% 0.04/5.98 % System time : 0.034 s
% 0.04/5.98 % Total time : 0.112 s
% 0.04/5.98 % Maximum resident set size: 4864 pages
% 0.04/5.98 % E exiting
%------------------------------------------------------------------------------