%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : GRP511-1 : TPTP v9.3.1. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n011.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:44:08 PM UTC 2026
% Result : Unsatisfiable 0.30s 0.64s
% Output : CNFRefutation 0.30s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 2
% Syntax : Number of clauses : 24 ( 24 unt; 0 nHn; 6 RR)
% Number of literals : 24 ( 23 equ; 5 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 7 ( 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 : 44 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
multiply(multiply(multiply(X1,X2),X3),inverse(multiply(X1,X3))) = X2,
file('/export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p',prove_these_axioms_3) ).
cnf(c_0_2,axiom,
multiply(multiply(multiply(X1,X2),X3),inverse(multiply(X1,X3))) = X2,
single_axiom ).
cnf(c_0_3,plain,
multiply(multiply(X1,X2),inverse(multiply(multiply(multiply(X3,X1),X4),X2))) = inverse(multiply(X3,X4)),
inference(spm,[status(thm)],[c_0_2,c_0_2]) ).
cnf(c_0_4,plain,
multiply(X1,inverse(multiply(multiply(X2,X1),inverse(multiply(X2,X3))))) = X3,
inference(spm,[status(thm)],[c_0_2,c_0_2]) ).
cnf(c_0_5,plain,
multiply(multiply(X1,inverse(multiply(X2,X3))),inverse(X1)) = inverse(multiply(X2,X3)),
inference(spm,[status(thm)],[c_0_3,c_0_2]) ).
cnf(c_0_6,plain,
inverse(multiply(X1,multiply(X2,inverse(multiply(multiply(X1,X2),X3))))) = X3,
inference(spm,[status(thm)],[c_0_4,c_0_3]) ).
cnf(c_0_7,plain,
multiply(multiply(X1,X2),inverse(X1)) = X2,
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_8,plain,
multiply(X1,inverse(multiply(X2,X1))) = inverse(X2),
inference(spm,[status(thm)],[c_0_7,c_0_7]) ).
cnf(c_0_9,plain,
multiply(X1,inverse(inverse(X2))) = multiply(X2,X1),
inference(spm,[status(thm)],[c_0_4,c_0_8]) ).
cnf(c_0_10,plain,
multiply(X1,multiply(inverse(X1),X2)) = X2,
inference(spm,[status(thm)],[c_0_7,c_0_9]) ).
cnf(c_0_11,plain,
multiply(inverse(inverse(X1)),X2) = multiply(X1,X2),
inference(spm,[status(thm)],[c_0_10,c_0_10]) ).
cnf(c_0_12,plain,
multiply(X1,X2) = multiply(X2,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_11]),c_0_9]),c_0_9]) ).
cnf(c_0_13,plain,
inverse(inverse(inverse(X1))) = inverse(X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_11]),c_0_8]) ).
cnf(c_0_14,negated_conjecture,
multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
inference(fof_simplification,[status(thm)],[prove_these_axioms_3]) ).
cnf(c_0_15,plain,
multiply(multiply(X1,X2),inverse(X2)) = X1,
inference(spm,[status(thm)],[c_0_7,c_0_12]) ).
cnf(c_0_16,plain,
inverse(inverse(X1)) = X1,
inference(spm,[status(thm)],[c_0_13,c_0_6]) ).
cnf(c_0_17,negated_conjecture,
multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
c_0_14 ).
cnf(c_0_18,plain,
multiply(multiply(X1,X2),X3) = multiply(X2,multiply(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_2]),c_0_16]) ).
cnf(c_0_19,negated_conjecture,
multiply(c3,multiply(a3,b3)) != multiply(a3,multiply(b3,c3)),
inference(rw,[status(thm)],[c_0_17,c_0_12]) ).
cnf(c_0_20,plain,
multiply(X1,multiply(X2,X3)) = multiply(X3,multiply(X2,X1)),
inference(spm,[status(thm)],[c_0_12,c_0_18]) ).
cnf(c_0_21,negated_conjecture,
multiply(b3,multiply(a3,c3)) != multiply(a3,multiply(b3,c3)),
inference(rw,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_22,plain,
multiply(X1,multiply(X2,X3)) = multiply(X2,multiply(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_12]),c_0_18]) ).
cnf(c_0_23,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_22])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : GRP511-1 : TPTP v9.3.1. Released v2.6.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.21/0.47 % Computer : n011.cluster.edu
% 0.21/0.47 % Model : x86_64 x86_64
% 0.21/0.47 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.21/0.47 % Memory : 8046.5625MB
% 0.21/0.47 % OS : Linux 6.8.0-71-generic
% 0.21/0.47 % CPULimit : 300
% 0.21/0.47 % WCLimit : 300
% 0.21/0.47 % DateTime : Sun Sep 20 20:15:26 UTC 2026
% 0.21/0.47 % CPUTime :
% 0.21/0.47 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.25/0.55 Running first-order theorem proving
% 0.25/0.55 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 0.30/0.64 % Version: 3.5.1
% 0.30/0.64 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.30/0.64 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.30/0.64 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.30/0.64 % Starting new_bool_3 with 300s (1) cores
% 0.30/0.64 % Starting new_bool_1 with 300s (1) cores
% 0.30/0.64 % Starting sh5l with 300s (1) cores
% 0.30/0.64 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 82379 completed with status 0
% 0.30/0.64 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.30/0.64 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.30/0.64 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.30/0.64 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.30/0.64 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.30/0.64 % No SInE strategy applied
% 0.30/0.64 % Search class: FUUPF-FFSF21-MFFFFFNN
% 0.30/0.64 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.30/0.64 % Starting SubtermCWHack with 136s (1) cores
% 0.30/0.64 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.30/0.64 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.30/0.64 % Starting new_bool_3 with 136s (1) cores
% 0.30/0.64 % Starting new_bool_1 with 136s (1) cores
% 0.30/0.64 % new_bool_3 with pid 82383 completed with status 0
% 0.30/0.64 % Result found by new_bool_3
% 0.30/0.64 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.30/0.64 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.30/0.64 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.30/0.64 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.30/0.64 % No SInE strategy applied
% 0.30/0.64 % Search class: FUUPF-FFSF21-MFFFFFNN
% 0.30/0.64 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.30/0.64 % Starting SubtermCWHack with 136s (1) cores
% 0.30/0.64 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.30/0.64 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.30/0.64 % Starting new_bool_3 with 136s (1) cores
% 0.30/0.64 % Preprocessing time : 0.002 s
% 0.30/0.64 % Presaturation interreduction done
% 0.30/0.64
% 0.30/0.64 % Proof found!
% 0.30/0.64 % SZS status Unsatisfiable
% 0.30/0.64 % SZS output start CNFRefutation
% See solution above
% 0.30/0.64 % Parsed axioms : 2
% 0.30/0.64 % Removed by relevancy pruning/SinE : 0
% 0.30/0.64 % Initial clauses : 2
% 0.30/0.64 % Removed in clause preprocessing : 0
% 0.30/0.64 % Initial clauses in saturation : 2
% 0.30/0.64 % Processed clauses : 146
% 0.30/0.64 % ...of these trivial : 38
% 0.30/0.64 % ...subsumed : 66
% 0.30/0.64 % ...remaining for further processing : 42
% 0.30/0.64 % Other redundant clauses eliminated : 0
% 0.30/0.64 % Clauses deleted for lack of memory : 0
% 0.30/0.64 % Backward-subsumed : 1
% 0.30/0.64 % Backward-rewritten : 20
% 0.30/0.64 % Generated clauses : 1429
% 0.30/0.64 % ...of the previous two non-redundant : 1084
% 0.30/0.64 % ...aggressively subsumed : 0
% 0.30/0.64 % Contextual simplify-reflections : 0
% 0.30/0.64 % Paramodulations : 1429
% 0.30/0.64 % Factorizations : 0
% 0.30/0.64 % NegExts : 0
% 0.30/0.64 % Equation resolutions : 0
% 0.30/0.64 % Disequality decompositions : 0
% 0.30/0.64 % Total rewrite steps : 1699
% 0.30/0.64 % ...of those cached : 966
% 0.30/0.64 % Propositional unsat checks : 0
% 0.30/0.64 % Propositional check models : 0
% 0.30/0.64 % Propositional check unsatisfiable : 0
% 0.30/0.64 % Propositional clauses : 0
% 0.30/0.64 % Propositional clauses after purity: 0
% 0.30/0.64 % Propositional unsat core size : 0
% 0.30/0.64 % Propositional preprocessing time : 0.000
% 0.30/0.64 % Propositional encoding time : 0.000
% 0.30/0.64 % Propositional solver time : 0.000
% 0.30/0.64 % Success case prop preproc time : 0.000
% 0.30/0.64 % Success case prop encoding time : 0.000
% 0.30/0.64 % Success case prop solver time : 0.000
% 0.30/0.64 % Current number of processed clauses : 19
% 0.30/0.64 % Positive orientable unit clauses : 15
% 0.30/0.64 % Positive unorientable unit clauses: 4
% 0.30/0.64 % Negative unit clauses : 0
% 0.30/0.64 % Non-unit-clauses : 0
% 0.30/0.64 % Current number of unprocessed clauses: 817
% 0.30/0.64 % ...number of literals in the above : 817
% 0.30/0.64 % Current number of archived formulas : 0
% 0.30/0.64 % Current number of archived clauses : 23
% 0.30/0.64 % Clause-clause subsumption calls (NU) : 0
% 0.30/0.64 % Rec. Clause-clause subsumption calls : 0
% 0.30/0.64 % Non-unit clause-clause subsumptions : 0
% 0.30/0.64 % Unit Clause-clause subsumption calls : 38
% 0.30/0.64 % Rewrite failures with RHS unbound : 21
% 0.30/0.64 % BW rewrite match attempts : 187
% 0.30/0.64 % BW rewrite match successes : 120
% 0.30/0.64 % Condensation attempts : 0
% 0.30/0.64 % Condensation successes : 0
% 0.30/0.64 % Termbank termtop insertions : 14123
% 0.30/0.64 % Search garbage collected termcells : 2
% 0.30/0.64
% 0.30/0.64 % -------------------------------------------------
% 0.30/0.64 % User time : 0.035 s
% 0.30/0.64 % System time : 0.002 s
% 0.30/0.64 % Total time : 0.037 s
% 0.30/0.64 % Maximum resident set size: 3372 pages
% 0.30/0.64
% 0.30/0.64 % -------------------------------------------------
% 0.30/0.64 % User time : 0.138 s
% 0.30/0.64 % System time : 0.025 s
% 0.30/0.64 % Total time : 0.163 s
% 0.30/0.64 % Maximum resident set size: 4608 pages
% 0.30/0.64 % E exiting
%------------------------------------------------------------------------------