%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : GRP439-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 : n015.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:43:48 PM UTC 2026
% Result : Unsatisfiable 0.43s 0.56s
% Output : CNFRefutation 0.43s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 2
% Syntax : Number of clauses : 23 ( 23 unt; 0 nHn; 4 RR)
% Number of literals : 23 ( 22 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 14 ( 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 : 79 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
inverse(multiply(X1,multiply(X2,multiply(multiply(inverse(X2),X3),inverse(multiply(X4,multiply(X1,X3))))))) = X4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',single_axiom) ).
cnf(prove_these_axioms_1,negated_conjecture,
multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_these_axioms_1) ).
cnf(c_0_2,axiom,
inverse(multiply(X1,multiply(X2,multiply(multiply(inverse(X2),X3),inverse(multiply(X4,multiply(X1,X3))))))) = X4,
single_axiom ).
cnf(c_0_3,plain,
inverse(multiply(X1,multiply(X2,multiply(multiply(inverse(X2),multiply(multiply(inverse(X1),X3),inverse(multiply(X4,multiply(X5,X3))))),X4)))) = X5,
inference(spm,[status(thm)],[c_0_2,c_0_2]) ).
cnf(c_0_4,plain,
inverse(multiply(X1,multiply(X2,multiply(multiply(inverse(X2),multiply(multiply(inverse(X1),multiply(multiply(inverse(X3),X4),inverse(multiply(X5,multiply(X6,X4))))),X5)),X6)))) = X3,
inference(spm,[status(thm)],[c_0_2,c_0_3]) ).
cnf(c_0_5,plain,
inverse(multiply(X1,multiply(X2,multiply(multiply(inverse(X2),multiply(multiply(inverse(X1),multiply(multiply(X3,X4),inverse(multiply(X5,multiply(X6,X4))))),X5)),X6)))) = multiply(X7,multiply(X8,multiply(multiply(inverse(X8),X9),inverse(multiply(X3,multiply(X7,X9)))))),
inference(spm,[status(thm)],[c_0_4,c_0_2]) ).
cnf(c_0_6,plain,
multiply(X1,multiply(X2,multiply(multiply(inverse(X2),X3),inverse(multiply(inverse(X4),multiply(X1,X3)))))) = X4,
inference(spm,[status(thm)],[c_0_4,c_0_5]) ).
cnf(c_0_7,plain,
inverse(multiply(X1,multiply(X2,multiply(X3,inverse(multiply(X4,multiply(X1,multiply(X5,multiply(multiply(inverse(X5),X6),inverse(multiply(inverse(X3),multiply(inverse(X2),X6)))))))))))) = X4,
inference(spm,[status(thm)],[c_0_2,c_0_6]) ).
cnf(c_0_8,plain,
inverse(multiply(inverse(X1),multiply(X1,multiply(X2,inverse(multiply(X3,X2)))))) = X3,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_5]),c_0_4]) ).
cnf(c_0_9,plain,
multiply(X1,multiply(X2,multiply(multiply(inverse(X2),multiply(X3,inverse(multiply(X4,X3)))),X4))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_8]),c_0_4]) ).
cnf(c_0_10,plain,
inverse(multiply(X1,multiply(X2,multiply(inverse(X2),inverse(multiply(X3,X1)))))) = X3,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_2,c_0_9]),c_0_9]) ).
cnf(c_0_11,plain,
multiply(X1,multiply(X2,multiply(inverse(X2),inverse(multiply(inverse(X3),X1))))) = X3,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_9]),c_0_9]) ).
cnf(c_0_12,plain,
multiply(X1,multiply(X2,multiply(multiply(inverse(X2),multiply(multiply(X3,multiply(inverse(X3),inverse(multiply(X4,X5)))),X4)),X5))) = X1,
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_13,plain,
multiply(multiply(X1,multiply(X2,inverse(multiply(X3,X2)))),multiply(X4,multiply(inverse(X4),X3))) = X1,
inference(spm,[status(thm)],[c_0_11,c_0_8]) ).
cnf(c_0_14,plain,
multiply(X1,multiply(X2,multiply(inverse(X2),multiply(multiply(X3,multiply(inverse(X3),inverse(X4))),X4)))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_12]),c_0_12]) ).
cnf(c_0_15,plain,
multiply(X1,multiply(X2,inverse(multiply(multiply(multiply(X3,multiply(inverse(X3),inverse(X4))),X4),X2)))) = X1,
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_16,plain,
inverse(multiply(multiply(X1,multiply(inverse(X1),inverse(multiply(X2,X3)))),multiply(X4,multiply(inverse(X4),X2)))) = X3,
inference(spm,[status(thm)],[c_0_10,c_0_10]) ).
cnf(c_0_17,plain,
inverse(multiply(inverse(X1),X1)) = multiply(multiply(X2,multiply(inverse(X2),inverse(X3))),X3),
inference(spm,[status(thm)],[c_0_2,c_0_15]) ).
cnf(c_0_18,negated_conjecture,
multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
inference(fof_simplification,[status(thm)],[prove_these_axioms_1]) ).
cnf(c_0_19,plain,
inverse(inverse(multiply(inverse(X1),X1))) = multiply(inverse(X2),X2),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,negated_conjecture,
multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
c_0_18 ).
cnf(c_0_21,plain,
multiply(inverse(X1),X1) = multiply(inverse(X2),X2),
inference(spm,[status(thm)],[c_0_19,c_0_19]) ).
cnf(c_0_22,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_20,c_0_21]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GRP439-1 : TPTP v9.3.1. Released v2.6.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.36 % Computer : n015.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.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Sun Sep 20 20:16:35 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/0.41 Running first-order theorem proving
% 0.15/0.41 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.43/0.56 % Version: 3.5.1
% 0.43/0.56 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.43/0.56 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.43/0.56 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.43/0.56 % Starting new_bool_3 with 300s (1) cores
% 0.43/0.56 % Starting new_bool_1 with 300s (1) cores
% 0.43/0.56 % Starting sh5l with 300s (1) cores
% 0.43/0.56 % sh5l with pid 3836464 completed with status 0
% 0.43/0.56 % Result found by sh5l
% 0.43/0.56 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.43/0.56 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.43/0.56 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.43/0.56 % Starting new_bool_3 with 300s (1) cores
% 0.43/0.56 % Starting new_bool_1 with 300s (1) cores
% 0.43/0.56 % Starting sh5l with 300s (1) cores
% 0.43/0.56 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.43/0.56 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.43/0.56 % Search class: FUUPF-FFSF21-DFFFFFNN
% 0.43/0.56 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.43/0.56 % Starting SubtermCWHack with 31s (1) cores
% 0.43/0.56 % SubtermCWHack with pid 3836472 completed with status 0
% 0.43/0.56 % Result found by SubtermCWHack
% 0.43/0.56 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.43/0.56 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.43/0.56 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.43/0.56 % Starting new_bool_3 with 300s (1) cores
% 0.43/0.56 % Starting new_bool_1 with 300s (1) cores
% 0.43/0.56 % Starting sh5l with 300s (1) cores
% 0.43/0.56 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.43/0.56 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.43/0.56 % Search class: FUUPF-FFSF21-DFFFFFNN
% 0.43/0.56 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.43/0.56 % Starting SubtermCWHack with 31s (1) cores
% 0.43/0.56 % Preprocessing time : 0.001 s
% 0.43/0.56
% 0.43/0.56 % Proof found!
% 0.43/0.56 % SZS status Unsatisfiable
% 0.43/0.56 % SZS output start CNFRefutation
% See solution above
% 0.43/0.56 % Parsed axioms : 2
% 0.43/0.56 % Removed by relevancy pruning/SinE : 0
% 0.43/0.56 % Initial clauses : 2
% 0.43/0.56 % Removed in clause preprocessing : 0
% 0.43/0.56 % Initial clauses in saturation : 2
% 0.43/0.56 % Processed clauses : 74
% 0.43/0.56 % ...of these trivial : 31
% 0.43/0.56 % ...subsumed : 0
% 0.43/0.56 % ...remaining for further processing : 43
% 0.43/0.56 % Other redundant clauses eliminated : 0
% 0.43/0.56 % Clauses deleted for lack of memory : 0
% 0.43/0.56 % Backward-subsumed : 0
% 0.43/0.56 % Backward-rewritten : 1
% 0.43/0.56 % Generated clauses : 6848
% 0.43/0.56 % ...of the previous two non-redundant : 6290
% 0.43/0.56 % ...aggressively subsumed : 0
% 0.43/0.56 % Contextual simplify-reflections : 0
% 0.43/0.56 % Paramodulations : 6847
% 0.43/0.56 % Factorizations : 0
% 0.43/0.56 % NegExts : 0
% 0.43/0.56 % Equation resolutions : 0
% 0.43/0.56 % Disequality decompositions : 0
% 0.43/0.56 % Total rewrite steps : 620
% 0.43/0.56 % ...of those cached : 296
% 0.43/0.56 % Propositional unsat checks : 0
% 0.43/0.56 % Propositional check models : 0
% 0.43/0.56 % Propositional check unsatisfiable : 0
% 0.43/0.56 % Propositional clauses : 0
% 0.43/0.56 % Propositional clauses after purity: 0
% 0.43/0.56 % Propositional unsat core size : 0
% 0.43/0.56 % Propositional preprocessing time : 0.000
% 0.43/0.56 % Propositional encoding time : 0.000
% 0.43/0.56 % Propositional solver time : 0.000
% 0.43/0.56 % Success case prop preproc time : 0.000
% 0.43/0.56 % Success case prop encoding time : 0.000
% 0.43/0.56 % Success case prop solver time : 0.000
% 0.43/0.56 % Current number of processed clauses : 41
% 0.43/0.56 % Positive orientable unit clauses : 36
% 0.43/0.56 % Positive unorientable unit clauses: 5
% 0.43/0.56 % Negative unit clauses : 0
% 0.43/0.56 % Non-unit-clauses : 0
% 0.43/0.56 % Current number of unprocessed clauses: 6212
% 0.43/0.56 % ...number of literals in the above : 6212
% 0.43/0.56 % Current number of archived formulas : 0
% 0.43/0.56 % Current number of archived clauses : 2
% 0.43/0.56 % Clause-clause subsumption calls (NU) : 0
% 0.43/0.56 % Rec. Clause-clause subsumption calls : 0
% 0.43/0.56 % Non-unit clause-clause subsumptions : 0
% 0.43/0.56 % Unit Clause-clause subsumption calls : 97
% 0.43/0.57 % Rewrite failures with RHS unbound : 43
% 0.43/0.57 % BW rewrite match attempts : 475
% 0.43/0.57 % BW rewrite match successes : 18
% 0.43/0.57 % Condensation attempts : 0
% 0.43/0.57 % Condensation successes : 0
% 0.43/0.57 % Termbank termtop insertions : 194270
% 0.43/0.57 % Search garbage collected termcells : 2
% 0.43/0.57
% 0.43/0.57 % -------------------------------------------------
% 0.43/0.57 % User time : 0.128 s
% 0.43/0.57 % System time : 0.012 s
% 0.43/0.57 % Total time : 0.140 s
% 0.43/0.57 % Maximum resident set size: 3632 pages
% 0.43/0.57
% 0.43/0.57 % -------------------------------------------------
% 0.43/0.57 % User time : 0.131 s
% 0.43/0.57 % System time : 0.015 s
% 0.43/0.57 % Total time : 0.146 s
% 0.43/0.57 % Maximum resident set size: 4608 pages
% 0.43/0.57 % E exiting
%------------------------------------------------------------------------------