%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GRP412-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 : 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:39:45 PM UTC 2026
% Result : Unsatisfiable 0.21s 0.63s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 2
% Syntax : Number of clauses : 21 ( 21 unt; 0 nHn; 4 RR)
% Number of literals : 21 ( 20 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 15 ( 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 : 58 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
multiply(X1,inverse(multiply(multiply(multiply(inverse(X2),X2),inverse(multiply(inverse(multiply(X1,inverse(X2))),X3))),X2))) = X3,
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,inverse(multiply(multiply(multiply(inverse(X2),X2),inverse(multiply(inverse(multiply(X1,inverse(X2))),X3))),X2))) = X3,
single_axiom ).
cnf(c_0_3,plain,
multiply(X1,inverse(multiply(multiply(multiply(inverse(X2),X2),inverse(X3)),X2))) = inverse(multiply(multiply(multiply(inverse(X4),X4),inverse(multiply(inverse(multiply(inverse(multiply(X1,inverse(X2))),inverse(X4))),X3))),X4)),
inference(spm,[status(thm)],[c_0_2,c_0_2]) ).
cnf(c_0_4,plain,
inverse(multiply(multiply(multiply(inverse(X1),X1),inverse(multiply(inverse(multiply(inverse(multiply(X2,inverse(X3))),inverse(X1))),multiply(inverse(multiply(X2,inverse(X3))),X4)))),X1)) = X4,
inference(spm,[status(thm)],[c_0_2,c_0_3]) ).
cnf(c_0_5,plain,
multiply(inverse(multiply(X1,inverse(X2))),multiply(X1,inverse(multiply(multiply(multiply(inverse(X2),X2),inverse(X3)),X2)))) = X3,
inference(spm,[status(thm)],[c_0_2,c_0_3]) ).
cnf(c_0_6,plain,
inverse(multiply(multiply(multiply(inverse(X1),X1),inverse(multiply(inverse(multiply(X2,inverse(X1))),multiply(X2,X3)))),X1)) = X3,
inference(spm,[status(thm)],[c_0_4,c_0_4]) ).
cnf(c_0_7,plain,
multiply(inverse(multiply(X1,inverse(X2))),multiply(X1,X3)) = multiply(inverse(multiply(X4,inverse(X2))),multiply(X4,X3)),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_8,plain,
multiply(inverse(multiply(X1,X2)),multiply(X1,X3)) = multiply(inverse(multiply(X4,X2)),multiply(X4,X3)),
inference(spm,[status(thm)],[c_0_7,c_0_6]) ).
cnf(c_0_9,plain,
multiply(X1,inverse(multiply(multiply(multiply(inverse(X2),X2),multiply(X3,inverse(multiply(multiply(multiply(inverse(X4),X4),inverse(X5)),X4)))),X2))) = inverse(multiply(multiply(multiply(inverse(X6),X6),inverse(multiply(inverse(multiply(inverse(multiply(X1,inverse(X2))),inverse(X6))),multiply(multiply(multiply(inverse(X7),X7),inverse(multiply(inverse(multiply(inverse(multiply(X3,inverse(X4))),inverse(X7))),X5))),X7)))),X6)),
inference(spm,[status(thm)],[c_0_3,c_0_3]) ).
cnf(c_0_10,plain,
multiply(inverse(multiply(X1,X2)),multiply(X1,X3)) = multiply(X4,multiply(multiply(multiply(inverse(X2),X2),inverse(multiply(inverse(multiply(X5,inverse(X2))),multiply(X5,X4)))),X3)),
inference(spm,[status(thm)],[c_0_8,c_0_6]) ).
cnf(c_0_11,plain,
inverse(multiply(multiply(multiply(inverse(X1),X1),inverse(multiply(inverse(multiply(X2,X3)),multiply(X2,X3)))),X1)) = inverse(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_2]),c_0_2]) ).
cnf(c_0_12,plain,
multiply(multiply(multiply(inverse(inverse(X1)),inverse(X1)),inverse(multiply(inverse(multiply(inverse(multiply(X2,inverse(X3))),inverse(inverse(X1)))),X4))),inverse(multiply(multiply(multiply(inverse(X1),X1),inverse(multiply(multiply(X2,inverse(multiply(multiply(multiply(inverse(X3),X3),inverse(X4)),X3))),X5))),X1))) = X5,
inference(spm,[status(thm)],[c_0_2,c_0_3]) ).
cnf(c_0_13,plain,
inverse(multiply(multiply(multiply(inverse(X1),X1),inverse(multiply(inverse(X2),X2))),X1)) = inverse(X1),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_14,plain,
multiply(multiply(multiply(inverse(X1),X1),inverse(multiply(inverse(X2),X2))),X1) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_13]),c_0_5]) ).
cnf(c_0_15,plain,
multiply(inverse(multiply(X1,X2)),multiply(X1,X2)) = multiply(inverse(X2),X2),
inference(spm,[status(thm)],[c_0_10,c_0_14]) ).
cnf(c_0_16,negated_conjecture,
multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
inference(fof_simplification,[status(thm)],[prove_these_axioms_1]) ).
cnf(c_0_17,plain,
multiply(inverse(inverse(X1)),inverse(X1)) = multiply(inverse(X2),X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_14]),c_0_15]) ).
cnf(c_0_18,negated_conjecture,
multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
c_0_16 ).
cnf(c_0_19,plain,
multiply(inverse(X1),X1) = multiply(inverse(X2),X2),
inference(spm,[status(thm)],[c_0_17,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.03 % Problem : GRP412-1 : TPTP v9.3.1. Released v2.6.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.37 % Computer : n015.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % 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:15:35 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.45 Running first-order theorem proving
% 0.15/0.45 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.21/0.63 % Version: 3.5.1
% 0.21/0.63 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.21/0.63 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.63 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.21/0.63 % Starting new_bool_3 with 300s (1) cores
% 0.21/0.63 % Starting new_bool_1 with 300s (1) cores
% 0.21/0.63 % Starting sh5l with 300s (1) cores
% 0.21/0.63 % new_bool_1 with pid 3833224 completed with status 0
% 0.21/0.63 % Result found by new_bool_1
% 0.21/0.63 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.21/0.63 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.63 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.21/0.63 % Starting new_bool_3 with 300s (1) cores
% 0.21/0.63 % Starting new_bool_1 with 300s (1) cores
% 0.21/0.63 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.21/0.63 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.63 % Search class: FUUPF-FFSF21-DFFFFFNN
% 0.21/0.63 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.63 % Starting SubtermCWHack with 31s (1) cores
% 0.21/0.63 % SubtermCWHack with pid 3833232 completed with status 0
% 0.21/0.63 % Result found by SubtermCWHack
% 0.21/0.63 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.21/0.63 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.63 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.21/0.63 % Starting new_bool_3 with 300s (1) cores
% 0.21/0.63 % Starting new_bool_1 with 300s (1) cores
% 0.21/0.63 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.21/0.63 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.63 % Search class: FUUPF-FFSF21-DFFFFFNN
% 0.21/0.63 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.63 % Starting SubtermCWHack with 31s (1) cores
% 0.21/0.63 % Preprocessing time : 0.002 s
% 0.21/0.63
% 0.21/0.63 % Proof found!
% 0.21/0.63 % SZS status Unsatisfiable
% 0.21/0.63 % SZS output start CNFRefutation
% See solution above
% 0.21/0.63 % Parsed axioms : 2
% 0.21/0.63 % Removed by relevancy pruning/SinE : 0
% 0.21/0.63 % Initial clauses : 2
% 0.21/0.63 % Removed in clause preprocessing : 0
% 0.21/0.63 % Initial clauses in saturation : 2
% 0.21/0.63 % Processed clauses : 75
% 0.21/0.63 % ...of these trivial : 3
% 0.21/0.63 % ...subsumed : 45
% 0.21/0.63 % ...remaining for further processing : 27
% 0.21/0.63 % Other redundant clauses eliminated : 0
% 0.21/0.63 % Clauses deleted for lack of memory : 0
% 0.21/0.63 % Backward-subsumed : 3
% 0.21/0.63 % Backward-rewritten : 3
% 0.21/0.63 % Generated clauses : 3726
% 0.21/0.63 % ...of the previous two non-redundant : 3314
% 0.21/0.63 % ...aggressively subsumed : 0
% 0.21/0.63 % Contextual simplify-reflections : 0
% 0.21/0.63 % Paramodulations : 3725
% 0.21/0.63 % Factorizations : 0
% 0.21/0.63 % NegExts : 0
% 0.21/0.63 % Equation resolutions : 0
% 0.21/0.63 % Disequality decompositions : 0
% 0.21/0.63 % Total rewrite steps : 503
% 0.21/0.63 % ...of those cached : 334
% 0.21/0.63 % Propositional unsat checks : 0
% 0.21/0.63 % Propositional check models : 0
% 0.21/0.63 % Propositional check unsatisfiable : 0
% 0.21/0.63 % Propositional clauses : 0
% 0.21/0.63 % Propositional clauses after purity: 0
% 0.21/0.63 % Propositional unsat core size : 0
% 0.21/0.63 % Propositional preprocessing time : 0.000
% 0.21/0.63 % Propositional encoding time : 0.000
% 0.21/0.63 % Propositional solver time : 0.000
% 0.21/0.63 % Success case prop preproc time : 0.000
% 0.21/0.63 % Success case prop encoding time : 0.000
% 0.21/0.63 % Success case prop solver time : 0.000
% 0.21/0.63 % Current number of processed clauses : 20
% 0.21/0.63 % Positive orientable unit clauses : 10
% 0.21/0.63 % Positive unorientable unit clauses: 10
% 0.21/0.63 % Negative unit clauses : 0
% 0.21/0.63 % Non-unit-clauses : 0
% 0.21/0.63 % Current number of unprocessed clauses: 3230
% 0.21/0.63 % ...number of literals in the above : 3230
% 0.21/0.63 % Current number of archived formulas : 0
% 0.21/0.63 % Current number of archived clauses : 7
% 0.21/0.63 % Clause-clause subsumption calls (NU) : 0
% 0.21/0.63 % Rec. Clause-clause subsumption calls : 0
% 0.21/0.63 % Non-unit clause-clause subsumptions : 0
% 0.21/0.63 % Unit Clause-clause subsumption calls : 70
% 0.21/0.63 % Rewrite failures with RHS unbound : 354
% 0.21/0.63 % BW rewrite match attempts : 184
% 0.21/0.63 % BW rewrite match successes : 39
% 0.21/0.63 % Condensation attempts : 0
% 0.21/0.63 % Condensation successes : 0
% 0.21/0.63 % Termbank termtop insertions : 199059
% 0.21/0.63 % Search garbage collected termcells : 2
% 0.21/0.63
% 0.21/0.63 % -------------------------------------------------
% 0.21/0.63 % User time : 0.088 s
% 0.21/0.63 % System time : 0.007 s
% 0.21/0.63 % Total time : 0.094 s
% 0.21/0.63 % Maximum resident set size: 3636 pages
% 0.21/0.63
% 0.21/0.63 % -------------------------------------------------
% 0.21/0.63 % User time : 0.089 s
% 0.21/0.63 % System time : 0.013 s
% 0.21/0.63 % Total time : 0.102 s
% 0.21/0.63 % Maximum resident set size: 4608 pages
% 0.21/0.63 % E exiting
%------------------------------------------------------------------------------