%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GRP504-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:39:57 PM UTC 2026
% Result : Unsatisfiable 5.44s 11.31s
% Output : CNFRefutation 5.44s
% Verified :
% SZS Type : Refutation
% Derivation depth : 30
% Number of leaves : 3
% Syntax : Number of clauses : 48 ( 48 unt; 0 nHn; 7 RR)
% Number of literals : 48 ( 47 equ; 6 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 11 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 126 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
double_divide(double_divide(X1,inverse(double_divide(X2,X3))),double_divide(inverse(X2),inverse(double_divide(X4,double_divide(X1,X4))))) = X3,
file('/export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p',prove_these_axioms_3) ).
cnf(multiply,axiom,
multiply(X1,X2) = inverse(double_divide(X2,X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiply) ).
cnf(c_0_3,axiom,
double_divide(double_divide(X1,inverse(double_divide(X2,X3))),double_divide(inverse(X2),inverse(double_divide(X4,double_divide(X1,X4))))) = X3,
single_axiom ).
cnf(c_0_4,plain,
double_divide(double_divide(X1,inverse(X2)),double_divide(inverse(double_divide(X3,inverse(double_divide(X4,X2)))),inverse(double_divide(X5,double_divide(X1,X5))))) = double_divide(inverse(X4),inverse(double_divide(X6,double_divide(X3,X6)))),
inference(spm,[status(thm)],[c_0_3,c_0_3]) ).
cnf(c_0_5,plain,
double_divide(inverse(X1),inverse(double_divide(X2,double_divide(X3,X2)))) = double_divide(inverse(X1),inverse(double_divide(X4,double_divide(X3,X4)))),
inference(spm,[status(thm)],[c_0_4,c_0_4]) ).
cnf(c_0_6,plain,
inverse(double_divide(X1,double_divide(X2,X1))) = inverse(double_divide(X3,double_divide(X2,X3))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3,c_0_5]),c_0_3]) ).
cnf(c_0_7,plain,
double_divide(double_divide(X1,inverse(double_divide(X2,double_divide(X3,X2)))),double_divide(inverse(X4),inverse(double_divide(X5,double_divide(X1,X5))))) = double_divide(X3,X4),
inference(spm,[status(thm)],[c_0_3,c_0_6]) ).
cnf(c_0_8,plain,
double_divide(X1,double_divide(X2,inverse(double_divide(X3,double_divide(X4,double_divide(X1,X4)))))) = double_divide(inverse(X3),inverse(double_divide(X5,double_divide(X2,X5)))),
inference(spm,[status(thm)],[c_0_4,c_0_7]) ).
cnf(c_0_9,plain,
double_divide(inverse(double_divide(double_divide(X1,inverse(double_divide(X2,X3))),X1)),inverse(double_divide(X4,double_divide(inverse(X2),X4)))) = X3,
inference(spm,[status(thm)],[c_0_3,c_0_8]) ).
cnf(c_0_10,plain,
double_divide(double_divide(inverse(X1),inverse(double_divide(double_divide(double_divide(X2,inverse(double_divide(X1,X3))),X2),X4))),X3) = X4,
inference(spm,[status(thm)],[c_0_3,c_0_9]) ).
cnf(c_0_11,plain,
double_divide(inverse(X1),inverse(double_divide(X2,double_divide(inverse(double_divide(double_divide(X3,inverse(double_divide(X4,inverse(X4)))),X3)),X2)))) = X1,
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_12,plain,
double_divide(double_divide(X1,inverse(double_divide(double_divide(double_divide(X2,inverse(double_divide(X3,inverse(X3)))),X2),X4))),X1) = X4,
inference(spm,[status(thm)],[c_0_9,c_0_11]) ).
cnf(c_0_13,plain,
double_divide(double_divide(X1,inverse(double_divide(inverse(double_divide(double_divide(X2,inverse(double_divide(X3,inverse(X3)))),X2)),X4))),X1) = X4,
inference(spm,[status(thm)],[c_0_12,c_0_12]) ).
cnf(c_0_14,plain,
double_divide(double_divide(X1,inverse(inverse(X2))),X1) = inverse(double_divide(X3,double_divide(inverse(X2),X3))),
inference(spm,[status(thm)],[c_0_13,c_0_9]) ).
cnf(c_0_15,plain,
double_divide(double_divide(X1,inverse(inverse(X2))),X1) = double_divide(double_divide(X3,inverse(inverse(X2))),X3),
inference(spm,[status(thm)],[c_0_14,c_0_14]) ).
cnf(c_0_16,plain,
double_divide(double_divide(inverse(X1),inverse(double_divide(double_divide(X2,inverse(inverse(X3))),X2))),X4) = double_divide(inverse(inverse(X3)),inverse(double_divide(X1,X4))),
inference(spm,[status(thm)],[c_0_10,c_0_15]) ).
cnf(c_0_17,plain,
double_divide(inverse(inverse(X1)),inverse(double_divide(X2,inverse(X2)))) = double_divide(inverse(inverse(X1)),inverse(double_divide(X3,inverse(X3)))),
inference(spm,[status(thm)],[c_0_12,c_0_16]) ).
cnf(c_0_18,plain,
double_divide(inverse(X1),inverse(double_divide(inverse(double_divide(X2,double_divide(inverse(X3),X2))),inverse(X3)))) = X1,
inference(spm,[status(thm)],[c_0_11,c_0_9]) ).
cnf(c_0_19,plain,
inverse(double_divide(X1,inverse(X1))) = inverse(double_divide(X2,inverse(X2))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3,c_0_17]),c_0_3]) ).
cnf(c_0_20,plain,
double_divide(inverse(X1),inverse(double_divide(double_divide(double_divide(X2,inverse(inverse(X3))),X2),inverse(X3)))) = X1,
inference(spm,[status(thm)],[c_0_18,c_0_14]) ).
cnf(c_0_21,plain,
double_divide(X1,inverse(X1)) = double_divide(X2,inverse(X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_19]),c_0_11]) ).
cnf(c_0_22,plain,
double_divide(double_divide(double_divide(X1,inverse(double_divide(X2,X3))),inverse(double_divide(X4,X5))),double_divide(inverse(X4),inverse(double_divide(double_divide(inverse(X2),inverse(double_divide(X6,double_divide(X1,X6)))),X3)))) = X5,
inference(spm,[status(thm)],[c_0_3,c_0_3]) ).
cnf(c_0_23,plain,
double_divide(inverse(X1),inverse(double_divide(double_divide(double_divide(X2,inverse(X2)),inverse(X3)),inverse(X3)))) = X1,
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_24,plain,
double_divide(X1,double_divide(inverse(X2),inverse(double_divide(inverse(double_divide(X2,X3)),X1)))) = X3,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_10]),c_0_9]) ).
cnf(c_0_25,plain,
double_divide(inverse(X1),inverse(double_divide(double_divide(X2,inverse(X2)),inverse(double_divide(X3,inverse(X3)))))) = X1,
inference(spm,[status(thm)],[c_0_23,c_0_21]) ).
cnf(c_0_26,plain,
double_divide(inverse(inverse(double_divide(X1,X2))),double_divide(inverse(X1),inverse(double_divide(X3,inverse(X3))))) = X2,
inference(spm,[status(thm)],[c_0_24,c_0_21]) ).
cnf(c_0_27,plain,
double_divide(X1,double_divide(inverse(X2),inverse(double_divide(inverse(double_divide(X3,inverse(X3))),X1)))) = inverse(X2),
inference(spm,[status(thm)],[c_0_24,c_0_21]) ).
cnf(c_0_28,plain,
double_divide(inverse(X1),inverse(double_divide(X2,inverse(X2)))) = X1,
inference(spm,[status(thm)],[c_0_25,c_0_21]) ).
cnf(c_0_29,plain,
double_divide(inverse(inverse(double_divide(X1,X2))),X1) = X2,
inference(spm,[status(thm)],[c_0_26,c_0_25]) ).
cnf(c_0_30,plain,
double_divide(inverse(double_divide(X1,inverse(X1))),X2) = inverse(X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_28]) ).
cnf(c_0_31,plain,
inverse(inverse(X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_28]) ).
cnf(c_0_32,plain,
double_divide(double_divide(X1,X2),X1) = X2,
inference(rw,[status(thm)],[c_0_29,c_0_31]) ).
cnf(c_0_33,plain,
double_divide(double_divide(X1,inverse(X1)),X2) = inverse(X2),
inference(spm,[status(thm)],[c_0_32,c_0_21]) ).
cnf(c_0_34,plain,
double_divide(X1,double_divide(X2,X1)) = X2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_31]),c_0_30]),c_0_31]) ).
cnf(c_0_35,negated_conjecture,
multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
inference(fof_simplification,[status(thm)],[prove_these_axioms_3]) ).
cnf(c_0_36,plain,
inverse(double_divide(inverse(X1),inverse(X2))) = double_divide(X2,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_33]),c_0_34]),c_0_34]) ).
cnf(c_0_37,negated_conjecture,
multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
c_0_35 ).
cnf(c_0_38,axiom,
multiply(X1,X2) = inverse(double_divide(X2,X1)),
multiply ).
cnf(c_0_39,plain,
double_divide(inverse(X1),inverse(X2)) = inverse(double_divide(X2,X1)),
inference(spm,[status(thm)],[c_0_31,c_0_36]) ).
cnf(c_0_40,negated_conjecture,
inverse(double_divide(c3,inverse(double_divide(b3,a3)))) != inverse(double_divide(inverse(double_divide(c3,b3)),a3)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_37,c_0_38]),c_0_38]),c_0_38]),c_0_38]) ).
cnf(c_0_41,plain,
inverse(double_divide(inverse(X1),X2)) = double_divide(inverse(X2),X1),
inference(spm,[status(thm)],[c_0_39,c_0_31]) ).
cnf(c_0_42,negated_conjecture,
inverse(double_divide(c3,inverse(double_divide(b3,a3)))) != double_divide(inverse(a3),double_divide(c3,b3)),
inference(rw,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_43,plain,
inverse(double_divide(X1,inverse(X2))) = double_divide(X2,inverse(X1)),
inference(spm,[status(thm)],[c_0_39,c_0_31]) ).
cnf(c_0_44,plain,
double_divide(inverse(double_divide(X1,X2)),X3) = double_divide(X1,inverse(double_divide(X2,X3))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_31]),c_0_31]),c_0_32]),c_0_39]) ).
cnf(c_0_45,negated_conjecture,
double_divide(inverse(a3),double_divide(c3,b3)) != double_divide(double_divide(b3,a3),inverse(c3)),
inference(rw,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_46,plain,
double_divide(double_divide(X1,X2),inverse(X3)) = double_divide(inverse(X2),double_divide(X3,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_44]),c_0_43]) ).
cnf(c_0_47,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_45,c_0_46])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : GRP504-1 : TPTP v9.3.1. Released v2.6.0.
% 0.00/0.06 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/10.41 % Computer : n005.cluster.edu
% 0.14/10.41 % Model : x86_64 x86_64
% 0.14/10.41 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/10.41 % Memory : 8046.5625MB
% 0.14/10.41 % OS : Linux 6.8.0-71-generic
% 0.14/10.42 % CPULimit : 300
% 0.14/10.42 % WCLimit : 300
% 0.14/10.42 % DateTime : Sun Sep 20 20:14:59 UTC 2026
% 0.14/10.42 % CPUTime :
% 0.14/10.42 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/10.48 Running first-order theorem proving
% 0.14/10.48 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
% 5.44/11.31 % Version: 3.5.1
% 5.44/11.31 % Preprocessing class: FSSSSMSSSSSNFFN.
% 5.44/11.31 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.44/11.31 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 5.44/11.31 % Starting new_bool_3 with 300s (1) cores
% 5.44/11.31 % Starting new_bool_1 with 300s (1) cores
% 5.44/11.31 % Starting sh5l with 300s (1) cores
% 5.44/11.31 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 1670697 completed with status 0
% 5.44/11.31 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 5.44/11.31 % Preprocessing class: FSSSSMSSSSSNFFN.
% 5.44/11.31 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.44/11.31 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 5.44/11.31 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 5.44/11.31 % No SInE strategy applied
% 5.44/11.31 % Search class: FUUPF-FFSF21-MFFFFFNN
% 5.44/11.31 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 5.44/11.31 % Starting SubtermCWHack with 136s (1) cores
% 5.44/11.31 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 5.44/11.31 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 5.44/11.31 % Starting new_bool_3 with 136s (1) cores
% 5.44/11.31 % Starting new_bool_1 with 136s (1) cores
% 5.44/11.31 % new_bool_1 with pid 1670705 completed with status 0
% 5.44/11.31 % Result found by new_bool_1
% 5.44/11.31 % Preprocessing class: FSSSSMSSSSSNFFN.
% 5.44/11.31 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.44/11.31 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 5.44/11.31 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 5.44/11.31 % No SInE strategy applied
% 5.44/11.31 % Search class: FUUPF-FFSF21-MFFFFFNN
% 5.44/11.31 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 5.44/11.31 % Starting SubtermCWHack with 136s (1) cores
% 5.44/11.31 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 5.44/11.31 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 5.44/11.31 % Starting new_bool_3 with 136s (1) cores
% 5.44/11.31 % Starting new_bool_1 with 136s (1) cores
% 5.44/11.31 % Preprocessing time : 0.002 s
% 5.44/11.31 % Presaturation interreduction done
% 5.44/11.31
% 5.44/11.31 % Proof found!
% 5.44/11.31 % SZS status Unsatisfiable
% 5.44/11.31 % SZS output start CNFRefutation
% See solution above
% 5.44/11.31 % Parsed axioms : 3
% 5.44/11.31 % Removed by relevancy pruning/SinE : 0
% 5.44/11.31 % Initial clauses : 3
% 5.44/11.31 % Removed in clause preprocessing : 1
% 5.44/11.31 % Initial clauses in saturation : 2
% 5.44/11.31 % Processed clauses : 415
% 5.44/11.31 % ...of these trivial : 82
% 5.44/11.31 % ...subsumed : 232
% 5.44/11.31 % ...remaining for further processing : 101
% 5.44/11.31 % Other redundant clauses eliminated : 0
% 5.44/11.31 % Clauses deleted for lack of memory : 0
% 5.44/11.31 % Backward-subsumed : 6
% 5.44/11.31 % Backward-rewritten : 66
% 5.44/11.31 % Generated clauses : 18385
% 5.44/11.31 % ...of the previous two non-redundant : 17276
% 5.44/11.31 % ...aggressively subsumed : 0
% 5.44/11.31 % Contextual simplify-reflections : 0
% 5.44/11.31 % Paramodulations : 18385
% 5.44/11.31 % Factorizations : 0
% 5.44/11.31 % NegExts : 0
% 5.44/11.31 % Equation resolutions : 0
% 5.44/11.31 % Disequality decompositions : 0
% 5.44/11.31 % Total rewrite steps : 8260
% 5.44/11.31 % ...of those cached : 5767
% 5.44/11.31 % Propositional unsat checks : 0
% 5.44/11.31 % Propositional check models : 0
% 5.44/11.31 % Propositional check unsatisfiable : 0
% 5.44/11.31 % Propositional clauses : 0
% 5.44/11.31 % Propositional clauses after purity: 0
% 5.44/11.31 % Propositional unsat core size : 0
% 5.44/11.31 % Propositional preprocessing time : 0.000
% 5.44/11.31 % Propositional encoding time : 0.000
% 5.44/11.31 % Propositional solver time : 0.000
% 5.44/11.31 % Success case prop preproc time : 0.000
% 5.44/11.31 % Success case prop encoding time : 0.000
% 5.44/11.31 % Success case prop solver time : 0.000
% 5.44/11.31 % Current number of processed clauses : 27
% 5.44/11.31 % Positive orientable unit clauses : 23
% 5.44/11.31 % Positive unorientable unit clauses: 4
% 5.44/11.31 % Negative unit clauses : 0
% 5.44/11.31 % Non-unit-clauses : 0
% 5.44/11.31 % Current number of unprocessed clauses: 16577
% 5.44/11.31 % ...number of literals in the above : 16577
% 5.44/11.31 % Current number of archived formulas : 0
% 5.44/11.31 % Current number of archived clauses : 75
% 5.44/11.31 % Clause-clause subsumption calls (NU) : 0
% 5.44/11.31 % Rec. Clause-clause subsumption calls : 0
% 5.44/11.31 % Non-unit clause-clause subsumptions : 0
% 5.44/11.31 % Unit Clause-clause subsumption calls : 332
% 5.44/11.31 % Rewrite failures with RHS unbound : 1360
% 5.44/11.31 % BW rewrite match attempts : 1349
% 5.44/11.31 % BW rewrite match successes : 212
% 5.44/11.31 % Condensation attempts : 0
% 5.44/11.31 % Condensation successes : 0
% 5.44/11.31 % Termbank termtop insertions : 541799
% 5.44/11.31 % Search garbage collected termcells : 2
% 5.44/11.31
% 5.44/11.31 % -------------------------------------------------
% 5.44/11.31 % User time : 0.734 s
% 5.44/11.31 % System time : 0.038 s
% 5.44/11.31 % Total time : 0.771 s
% 5.44/11.31 % Maximum resident set size: 3376 pages
% 5.44/11.31
% 5.44/11.31 % -------------------------------------------------
% 5.44/11.31 % User time : 3.521 s
% 5.44/11.31 % System time : 0.199 s
% 5.44/11.31 % Total time : 3.720 s
% 5.44/11.31 % Maximum resident set size: 4608 pages
% 5.44/11.31 % E exiting
%------------------------------------------------------------------------------