%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : GRP513-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:44:08 PM UTC 2026
% Result : Unsatisfiable 0.26s 0.64s
% Output : CNFRefutation 0.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 2
% Syntax : Number of clauses : 21 ( 21 unt; 0 nHn; 5 RR)
% Number of literals : 21 ( 20 equ; 4 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 : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 42 ( 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_1,negated_conjecture,
multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_these_axioms_1) ).
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(multiply(X1,X2),multiply(X3,inverse(multiply(X3,X2)))) = X1,
inference(spm,[status(thm)],[c_0_3,c_0_5]) ).
cnf(c_0_7,plain,
multiply(X1,multiply(X2,inverse(multiply(X1,multiply(X2,inverse(X3)))))) = X3,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3,c_0_4]),c_0_4]) ).
cnf(c_0_8,plain,
multiply(multiply(X1,X2),multiply(X3,inverse(X1))) = multiply(X3,X2),
inference(spm,[status(thm)],[c_0_3,c_0_6]) ).
cnf(c_0_9,plain,
multiply(X1,multiply(multiply(X2,X3),inverse(X2))) = multiply(X1,X3),
inference(spm,[status(thm)],[c_0_7,c_0_2]) ).
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(X1)),X3)) = multiply(X2,X3),
inference(spm,[status(thm)],[c_0_5,c_0_10]) ).
cnf(c_0_12,plain,
multiply(X1,inverse(multiply(X1,inverse(X2)))) = X2,
inference(spm,[status(thm)],[c_0_4,c_0_11]) ).
cnf(c_0_13,negated_conjecture,
multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
inference(fof_simplification,[status(thm)],[prove_these_axioms_1]) ).
cnf(c_0_14,plain,
multiply(multiply(X1,X2),inverse(X2)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_2,c_0_12]),c_0_10]) ).
cnf(c_0_15,negated_conjecture,
multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
c_0_13 ).
cnf(c_0_16,plain,
multiply(X1,X2) = multiply(X2,X1),
inference(spm,[status(thm)],[c_0_5,c_0_14]) ).
cnf(c_0_17,plain,
multiply(multiply(X1,X2),inverse(X1)) = X2,
inference(spm,[status(thm)],[c_0_12,c_0_14]) ).
cnf(c_0_18,negated_conjecture,
multiply(a1,inverse(a1)) != multiply(b1,inverse(b1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_16]),c_0_16]) ).
cnf(c_0_19,plain,
multiply(X1,inverse(X1)) = multiply(X2,inverse(X2)),
inference(spm,[status(thm)],[c_0_11,c_0_17]) ).
cnf(c_0_20,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_18,c_0_19]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : GRP513-1 : TPTP v9.3.1. Released v2.6.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.22/0.47 % Computer : n005.cluster.edu
% 0.22/0.47 % Model : x86_64 x86_64
% 0.22/0.47 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.22/0.47 % Memory : 8046.5625MB
% 0.22/0.47 % OS : Linux 6.8.0-71-generic
% 0.22/0.47 % CPULimit : 300
% 0.22/0.47 % WCLimit : 300
% 0.22/0.47 % DateTime : Sun Sep 20 20:15:03 UTC 2026
% 0.22/0.48 % CPUTime :
% 0.22/0.48 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.26/0.57 Running first-order theorem proving
% 0.26/0.57 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.26/0.64 % Version: 3.5.1
% 0.26/0.64 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.26/0.64 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.64 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.26/0.64 % Starting new_bool_3 with 300s (1) cores
% 0.26/0.64 % Starting new_bool_1 with 300s (1) cores
% 0.26/0.64 % Starting sh5l with 300s (1) cores
% 0.26/0.64 % new_bool_1 with pid 1671109 completed with status 0
% 0.26/0.64 % Result found by new_bool_1
% 0.26/0.64 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.26/0.64 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.64 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.26/0.64 % Starting new_bool_3 with 300s (1) cores
% 0.26/0.64 % Starting new_bool_1 with 300s (1) cores
% 0.26/0.64 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.26/0.64 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.26/0.64 % Search class: FUUPF-FFSF21-MFFFFFNN
% 0.26/0.64 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.26/0.64 % Starting SubtermCWHack with 31s (1) cores
% 0.26/0.64 % SubtermCWHack with pid 1671116 completed with status 0
% 0.26/0.64 % Result found by SubtermCWHack
% 0.26/0.64 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.26/0.64 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.64 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.26/0.64 % Starting new_bool_3 with 300s (1) cores
% 0.26/0.64 % Starting new_bool_1 with 300s (1) cores
% 0.26/0.64 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.26/0.64 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.26/0.64 % Search class: FUUPF-FFSF21-MFFFFFNN
% 0.26/0.64 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.26/0.64 % Starting SubtermCWHack with 31s (1) cores
% 0.26/0.64 % Preprocessing time : 0.002 s
% 0.26/0.64
% 0.26/0.64 % Proof found!
% 0.26/0.64 % SZS status Unsatisfiable
% 0.26/0.64 % SZS output start CNFRefutation
% See solution above
% 0.26/0.64 % Parsed axioms : 2
% 0.26/0.64 % Removed by relevancy pruning/SinE : 0
% 0.26/0.64 % Initial clauses : 2
% 0.26/0.64 % Removed in clause preprocessing : 0
% 0.26/0.64 % Initial clauses in saturation : 2
% 0.26/0.64 % Processed clauses : 72
% 0.26/0.64 % ...of these trivial : 26
% 0.26/0.64 % ...subsumed : 15
% 0.26/0.64 % ...remaining for further processing : 31
% 0.26/0.64 % Other redundant clauses eliminated : 0
% 0.26/0.64 % Clauses deleted for lack of memory : 0
% 0.26/0.64 % Backward-subsumed : 0
% 0.26/0.64 % Backward-rewritten : 4
% 0.26/0.64 % Generated clauses : 1287
% 0.26/0.64 % ...of the previous two non-redundant : 1023
% 0.26/0.64 % ...aggressively subsumed : 0
% 0.26/0.64 % Contextual simplify-reflections : 0
% 0.26/0.64 % Paramodulations : 1286
% 0.26/0.64 % Factorizations : 0
% 0.26/0.64 % NegExts : 0
% 0.26/0.64 % Equation resolutions : 0
% 0.26/0.64 % Disequality decompositions : 0
% 0.26/0.64 % Total rewrite steps : 438
% 0.26/0.64 % ...of those cached : 235
% 0.26/0.64 % Propositional unsat checks : 0
% 0.26/0.64 % Propositional check models : 0
% 0.26/0.64 % Propositional check unsatisfiable : 0
% 0.26/0.64 % Propositional clauses : 0
% 0.26/0.64 % Propositional clauses after purity: 0
% 0.26/0.64 % Propositional unsat core size : 0
% 0.26/0.64 % Propositional preprocessing time : 0.000
% 0.26/0.64 % Propositional encoding time : 0.000
% 0.26/0.64 % Propositional solver time : 0.000
% 0.26/0.64 % Success case prop preproc time : 0.000
% 0.26/0.64 % Success case prop encoding time : 0.000
% 0.26/0.64 % Success case prop solver time : 0.000
% 0.26/0.64 % Current number of processed clauses : 26
% 0.26/0.64 % Positive orientable unit clauses : 23
% 0.26/0.64 % Positive unorientable unit clauses: 3
% 0.26/0.64 % Negative unit clauses : 0
% 0.26/0.64 % Non-unit-clauses : 0
% 0.26/0.64 % Current number of unprocessed clauses: 951
% 0.26/0.64 % ...number of literals in the above : 951
% 0.26/0.64 % Current number of archived formulas : 0
% 0.26/0.64 % Current number of archived clauses : 5
% 0.26/0.64 % Clause-clause subsumption calls (NU) : 0
% 0.26/0.64 % Rec. Clause-clause subsumption calls : 0
% 0.26/0.64 % Non-unit clause-clause subsumptions : 0
% 0.26/0.64 % Unit Clause-clause subsumption calls : 28
% 0.26/0.64 % Rewrite failures with RHS unbound : 16
% 0.26/0.64 % BW rewrite match attempts : 197
% 0.26/0.64 % BW rewrite match successes : 76
% 0.26/0.64 % Condensation attempts : 0
% 0.26/0.64 % Condensation successes : 0
% 0.26/0.64 % Termbank termtop insertions : 13804
% 0.26/0.64 % Search garbage collected termcells : 2
% 0.26/0.64
% 0.26/0.64 % -------------------------------------------------
% 0.26/0.64 % User time : 0.032 s
% 0.26/0.64 % System time : 0.003 s
% 0.26/0.64 % Total time : 0.035 s
% 0.26/0.64 % Maximum resident set size: 3628 pages
% 0.26/0.64
% 0.26/0.64 % -------------------------------------------------
% 0.26/0.64 % User time : 0.033 s
% 0.26/0.64 % System time : 0.010 s
% 0.26/0.64 % Total time : 0.043 s
% 0.26/0.64 % Maximum resident set size: 4864 pages
% 0.26/0.64 % E exiting
%------------------------------------------------------------------------------