%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : GRP206-1 : TPTP v9.3.1. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/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:42:53 PM UTC 2026
% Result : Unsatisfiable 0.23s 5.58s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 4
% Syntax : Number of clauses : 11 ( 11 unt; 0 nHn; 4 RR)
% Number of literals : 11 ( 10 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 12 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(prove_moufang1,negated_conjecture,
multiply(multiply(a,multiply(b,c)),a) != multiply(multiply(a,b),multiply(c,a)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_moufang1) ).
cnf(moufang4,axiom,
multiply(X1,multiply(multiply(X2,X3),X1)) = multiply(multiply(X1,X2),multiply(X3,X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',moufang4) ).
cnf(left_identity,axiom,
multiply(identity,X1) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',left_identity) ).
cnf(right_identity,axiom,
multiply(X1,identity) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',right_identity) ).
cnf(c_0_4,negated_conjecture,
multiply(multiply(a,multiply(b,c)),a) != multiply(multiply(a,b),multiply(c,a)),
inference(fof_simplification,[status(thm)],[prove_moufang1]) ).
cnf(c_0_5,axiom,
multiply(X1,multiply(multiply(X2,X3),X1)) = multiply(multiply(X1,X2),multiply(X3,X1)),
moufang4 ).
cnf(c_0_6,axiom,
multiply(identity,X1) = X1,
left_identity ).
cnf(c_0_7,axiom,
multiply(X1,identity) = X1,
right_identity ).
cnf(c_0_8,negated_conjecture,
multiply(multiply(a,multiply(b,c)),a) != multiply(multiply(a,b),multiply(c,a)),
c_0_4 ).
cnf(c_0_9,plain,
multiply(multiply(X1,X2),X1) = multiply(X1,multiply(X2,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_6]),c_0_7]) ).
cnf(c_0_10,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_9]),c_0_5])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : GRP206-1 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.06 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.18/5.45 % Computer : n005.cluster.edu
% 0.18/5.45 % Model : x86_64 x86_64
% 0.18/5.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/5.45 % Memory : 8046.5625MB
% 0.18/5.45 % OS : Linux 6.8.0-71-generic
% 0.18/5.45 % CPULimit : 300
% 0.18/5.45 % WCLimit : 300
% 0.18/5.45 % DateTime : Sun Sep 20 20:06:08 UTC 2026
% 0.18/5.45 % CPUTime :
% 0.18/5.46 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.23/5.52 Running first-order theorem proving
% 0.23/5.53 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.23/5.58 % Version: 3.5.1
% 0.23/5.58 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.23/5.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/5.58 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.23/5.58 % Starting new_bool_3 with 300s (1) cores
% 0.23/5.58 % Starting new_bool_1 with 300s (1) cores
% 0.23/5.58 % Starting sh5l with 300s (1) cores
% 0.23/5.58 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 1647390 completed with status 0
% 0.23/5.58 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.23/5.58 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.23/5.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/5.58 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.23/5.58 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.23/5.58 % No SInE strategy applied
% 0.23/5.58 % Search class: FUUPM-FFSF21-MFFFFFNN
% 0.23/5.58 % Scheduled 8 strats onto 5 cores with 1500 seconds (1500 total)
% 0.23/5.58 % Starting SubtermCWHack with 136s (1) cores
% 0.23/5.58 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.23/5.58 % Starting H----_047_B31_F1_PI_AE_R4_CS_SP_S2S with 136s (1) cores
% 0.23/5.58 % Starting G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y with 136s (1) cores
% 0.23/5.58 % Starting U----_043_B31_F1_PI_AE_CS_SP_S2S with 136s (1) cores
% 0.23/5.58 % U----_043_B31_F1_PI_AE_CS_SP_S2S with pid 1647400 completed with status 0
% 0.23/5.58 % Result found by U----_043_B31_F1_PI_AE_CS_SP_S2S
% 0.23/5.58 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.23/5.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/5.58 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.23/5.58 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.23/5.58 % No SInE strategy applied
% 0.23/5.58 % Search class: FUUPM-FFSF21-MFFFFFNN
% 0.23/5.58 % Scheduled 8 strats onto 5 cores with 1500 seconds (1500 total)
% 0.23/5.58 % Starting SubtermCWHack with 136s (1) cores
% 0.23/5.58 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.23/5.58 % Starting H----_047_B31_F1_PI_AE_R4_CS_SP_S2S with 136s (1) cores
% 0.23/5.58 % Starting G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y with 136s (1) cores
% 0.23/5.58 % Starting U----_043_B31_F1_PI_AE_CS_SP_S2S with 136s (1) cores
% 0.23/5.58 % Preprocessing time : 0.001 s
% 0.23/5.58
% 0.23/5.58 % Proof found!
% 0.23/5.58 % SZS status Unsatisfiable
% 0.23/5.58 % SZS output start CNFRefutation
% See solution above
% 0.23/5.58 % Parsed axioms : 10
% 0.23/5.58 % Removed by relevancy pruning/SinE : 0
% 0.23/5.58 % Initial clauses : 10
% 0.23/5.58 % Removed in clause preprocessing : 0
% 0.23/5.58 % Initial clauses in saturation : 10
% 0.23/5.58 % Processed clauses : 23
% 0.23/5.58 % ...of these trivial : 2
% 0.23/5.58 % ...subsumed : 0
% 0.23/5.58 % ...remaining for further processing : 21
% 0.23/5.58 % Other redundant clauses eliminated : 0
% 0.23/5.58 % Clauses deleted for lack of memory : 0
% 0.23/5.58 % Backward-subsumed : 0
% 0.23/5.58 % Backward-rewritten : 5
% 0.23/5.58 % Generated clauses : 72
% 0.23/5.58 % ...of the previous two non-redundant : 36
% 0.23/5.58 % ...aggressively subsumed : 0
% 0.23/5.58 % Contextual simplify-reflections : 0
% 0.23/5.58 % Paramodulations : 72
% 0.23/5.58 % Factorizations : 0
% 0.23/5.58 % NegExts : 0
% 0.23/5.58 % Equation resolutions : 0
% 0.23/5.58 % Disequality decompositions : 0
% 0.23/5.58 % Total rewrite steps : 49
% 0.23/5.58 % ...of those cached : 22
% 0.23/5.58 % Propositional unsat checks : 0
% 0.23/5.58 % Propositional check models : 0
% 0.23/5.58 % Propositional check unsatisfiable : 0
% 0.23/5.58 % Propositional clauses : 0
% 0.23/5.58 % Propositional clauses after purity: 0
% 0.23/5.58 % Propositional unsat core size : 0
% 0.23/5.58 % Propositional preprocessing time : 0.000
% 0.23/5.58 % Propositional encoding time : 0.000
% 0.23/5.58 % Propositional solver time : 0.000
% 0.23/5.58 % Success case prop preproc time : 0.000
% 0.23/5.58 % Success case prop encoding time : 0.000
% 0.23/5.58 % Success case prop solver time : 0.000
% 0.23/5.58 % Current number of processed clauses : 16
% 0.23/5.58 % Positive orientable unit clauses : 15
% 0.23/5.58 % Positive unorientable unit clauses: 1
% 0.23/5.58 % Negative unit clauses : 0
% 0.23/5.58 % Non-unit-clauses : 0
% 0.23/5.58 % Current number of unprocessed clauses: 21
% 0.23/5.58 % ...number of literals in the above : 21
% 0.23/5.58 % Current number of archived formulas : 0
% 0.23/5.58 % Current number of archived clauses : 5
% 0.23/5.58 % Clause-clause subsumption calls (NU) : 0
% 0.23/5.58 % Rec. Clause-clause subsumption calls : 0
% 0.23/5.58 % Non-unit clause-clause subsumptions : 0
% 0.23/5.58 % Unit Clause-clause subsumption calls : 0
% 0.23/5.58 % Rewrite failures with RHS unbound : 0
% 0.23/5.58 % BW rewrite match attempts : 13
% 0.23/5.58 % BW rewrite match successes : 6
% 0.23/5.58 % Condensation attempts : 0
% 0.23/5.58 % Condensation successes : 0
% 0.23/5.58 % Termbank termtop insertions : 645
% 0.23/5.58 % Search garbage collected termcells : 2
% 0.23/5.58
% 0.23/5.58 % -------------------------------------------------
% 0.23/5.58 % User time : 0.002 s
% 0.23/5.58 % System time : 0.005 s
% 0.23/5.58 % Total time : 0.007 s
% 0.23/5.58 % Maximum resident set size: 3632 pages
% 0.23/5.58
% 0.23/5.58 % -------------------------------------------------
% 0.23/5.58 % User time : 0.015 s
% 0.23/5.58 % System time : 0.017 s
% 0.23/5.58 % Total time : 0.031 s
% 0.23/5.58 % Maximum resident set size: 4608 pages
% 0.23/5.58 % E exiting
%------------------------------------------------------------------------------