%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GRP184-4 : TPTP v9.3.1. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n013.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:38:54 PM UTC 2026
% Result : Unsatisfiable 0.13s 5.43s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 14
% Syntax : Number of clauses : 39 ( 39 unt; 0 nHn; 7 RR)
% Number of literals : 39 ( 38 equ; 4 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 68 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(prove_p21x,negated_conjecture,
multiply(least_upper_bound(a,identity),inverse(greatest_lower_bound(a,identity))) != multiply(inverse(greatest_lower_bound(a,identity)),least_upper_bound(a,identity)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_p21x) ).
cnf(p21x_3,hypothesis,
inverse(multiply(X1,X2)) = multiply(inverse(X2),inverse(X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p21x_3) ).
cnf(left_identity,axiom,
multiply(identity,X1) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-0.ax',left_identity) ).
cnf(p21x_1,hypothesis,
inverse(identity) = identity,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p21x_1) ).
cnf(symmetry_of_glb,axiom,
greatest_lower_bound(X1,X2) = greatest_lower_bound(X2,X1),
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',symmetry_of_glb) ).
cnf(symmetry_of_lub,axiom,
least_upper_bound(X1,X2) = least_upper_bound(X2,X1),
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',symmetry_of_lub) ).
cnf(p21x_4,hypothesis,
inverse(greatest_lower_bound(X1,X2)) = least_upper_bound(inverse(X1),inverse(X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p21x_4) ).
cnf(monotony_lub1,axiom,
multiply(X1,least_upper_bound(X2,X3)) = least_upper_bound(multiply(X1,X2),multiply(X1,X3)),
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',monotony_lub1) ).
cnf(monotony_lub2,axiom,
multiply(least_upper_bound(X1,X2),X3) = least_upper_bound(multiply(X1,X3),multiply(X2,X3)),
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',monotony_lub2) ).
cnf(left_inverse,axiom,
multiply(inverse(X1),X1) = identity,
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-0.ax',left_inverse) ).
cnf(associativity_of_lub,axiom,
least_upper_bound(X1,least_upper_bound(X2,X3)) = least_upper_bound(least_upper_bound(X1,X2),X3),
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',associativity_of_lub) ).
cnf(p21x_2,hypothesis,
inverse(inverse(X1)) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p21x_2) ).
cnf(associativity_of_glb,axiom,
greatest_lower_bound(X1,greatest_lower_bound(X2,X3)) = greatest_lower_bound(greatest_lower_bound(X1,X2),X3),
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',associativity_of_glb) ).
cnf(associativity,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-0.ax',associativity) ).
cnf(c_0_14,negated_conjecture,
multiply(least_upper_bound(a,identity),inverse(greatest_lower_bound(a,identity))) != multiply(inverse(greatest_lower_bound(a,identity)),least_upper_bound(a,identity)),
inference(fof_simplification,[status(thm)],[prove_p21x]) ).
cnf(c_0_15,hypothesis,
inverse(multiply(X1,X2)) = multiply(inverse(X2),inverse(X1)),
p21x_3 ).
cnf(c_0_16,axiom,
multiply(identity,X1) = X1,
left_identity ).
cnf(c_0_17,hypothesis,
inverse(identity) = identity,
p21x_1 ).
cnf(c_0_18,negated_conjecture,
multiply(least_upper_bound(a,identity),inverse(greatest_lower_bound(a,identity))) != multiply(inverse(greatest_lower_bound(a,identity)),least_upper_bound(a,identity)),
c_0_14 ).
cnf(c_0_19,axiom,
greatest_lower_bound(X1,X2) = greatest_lower_bound(X2,X1),
symmetry_of_glb ).
cnf(c_0_20,axiom,
least_upper_bound(X1,X2) = least_upper_bound(X2,X1),
symmetry_of_lub ).
cnf(c_0_21,hypothesis,
inverse(greatest_lower_bound(X1,X2)) = least_upper_bound(inverse(X1),inverse(X2)),
p21x_4 ).
cnf(c_0_22,axiom,
multiply(X1,least_upper_bound(X2,X3)) = least_upper_bound(multiply(X1,X2),multiply(X1,X3)),
monotony_lub1 ).
cnf(c_0_23,axiom,
multiply(least_upper_bound(X1,X2),X3) = least_upper_bound(multiply(X1,X3),multiply(X2,X3)),
monotony_lub2 ).
cnf(c_0_24,axiom,
multiply(inverse(X1),X1) = identity,
left_inverse ).
cnf(c_0_25,axiom,
least_upper_bound(X1,least_upper_bound(X2,X3)) = least_upper_bound(least_upper_bound(X1,X2),X3),
associativity_of_lub ).
cnf(c_0_26,hypothesis,
multiply(inverse(X1),identity) = inverse(X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]) ).
cnf(c_0_27,hypothesis,
inverse(inverse(X1)) = X1,
p21x_2 ).
cnf(c_0_28,axiom,
greatest_lower_bound(X1,greatest_lower_bound(X2,X3)) = greatest_lower_bound(greatest_lower_bound(X1,X2),X3),
associativity_of_glb ).
cnf(c_0_29,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
associativity ).
cnf(c_0_30,negated_conjecture,
least_upper_bound(identity,least_upper_bound(identity,least_upper_bound(a,multiply(inverse(a),identity)))) != least_upper_bound(identity,least_upper_bound(multiply(a,identity),least_upper_bound(inverse(a),multiply(a,inverse(a))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_19]),c_0_20]),c_0_20]),c_0_19]),c_0_21]),c_0_17]),c_0_22]),c_0_23]),c_0_16]),c_0_23]),c_0_16]),c_0_24]),c_0_20]),c_0_25]),c_0_20]),c_0_25]),c_0_21]),c_0_17]),c_0_22]),c_0_23]),c_0_16]),c_0_23]),c_0_16]),c_0_25]) ).
cnf(c_0_31,hypothesis,
multiply(X1,identity) = X1,
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_32,hypothesis,
multiply(X1,inverse(X1)) = identity,
inference(spm,[status(thm)],[c_0_24,c_0_27]) ).
cnf(c_0_33,plain,
greatest_lower_bound(X1,X2) = greatest_lower_bound(X2,X1),
c_0_19 ).
cnf(c_0_34,plain,
least_upper_bound(X1,X2) = least_upper_bound(X2,X1),
c_0_20 ).
cnf(c_0_35,plain,
greatest_lower_bound(greatest_lower_bound(X1,X2),X3) = greatest_lower_bound(X1,greatest_lower_bound(X2,X3)),
c_0_28 ).
cnf(c_0_36,plain,
least_upper_bound(least_upper_bound(X1,X2),X3) = least_upper_bound(X1,least_upper_bound(X2,X3)),
c_0_25 ).
cnf(c_0_37,plain,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
c_0_29 ).
cnf(c_0_38,negated_conjecture,
$false,
inference(ar,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_31]),c_0_32]),c_0_33,c_0_34,c_0_35,c_0_36,c_0_37]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GRP184-4 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/5.36 % Computer : n013.cluster.edu
% 0.09/5.36 % Model : x86_64 x86_64
% 0.09/5.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/5.36 % Memory : 8046.5625MB
% 0.09/5.36 % OS : Linux 6.8.0-71-generic
% 0.09/5.36 % CPULimit : 300
% 0.09/5.36 % WCLimit : 300
% 0.09/5.36 % DateTime : Sun Sep 20 20:04:27 UTC 2026
% 0.09/5.36 % CPUTime :
% 0.09/5.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/5.41 Running first-order theorem proving
% 0.13/5.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.13/5.43 % Version: 3.5.1
% 0.13/5.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/5.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/5.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/5.43 % Starting new_bool_3 with 300s (1) cores
% 0.13/5.43 % Starting new_bool_1 with 300s (1) cores
% 0.13/5.43 % Starting sh5l with 300s (1) cores
% 0.13/5.43 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 3295277 completed with status 0
% 0.13/5.43 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.13/5.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/5.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/5.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/5.43 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.13/5.43 % No SInE strategy applied
% 0.13/5.43 % Search class: FUUPM-FFSF21-MFFFFFNN
% 0.13/5.43 % Scheduled 8 strats onto 5 cores with 1500 seconds (1500 total)
% 0.13/5.43 % Starting SubtermCWHack with 136s (1) cores
% 0.13/5.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.13/5.43 % Starting H----_047_B31_F1_PI_AE_R4_CS_SP_S2S with 136s (1) cores
% 0.13/5.43 % Starting G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y with 136s (1) cores
% 0.13/5.43 % Starting U----_043_B31_F1_PI_AE_CS_SP_S2S with 136s (1) cores
% 0.13/5.43 % U----_043_B31_F1_PI_AE_CS_SP_S2S with pid 3295285 completed with status 0
% 0.13/5.43 % Result found by U----_043_B31_F1_PI_AE_CS_SP_S2S
% 0.13/5.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/5.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/5.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/5.43 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.13/5.43 % No SInE strategy applied
% 0.13/5.43 % Search class: FUUPM-FFSF21-MFFFFFNN
% 0.13/5.43 % Scheduled 8 strats onto 5 cores with 1500 seconds (1500 total)
% 0.13/5.43 % Starting SubtermCWHack with 136s (1) cores
% 0.13/5.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.13/5.43 % Starting H----_047_B31_F1_PI_AE_R4_CS_SP_S2S with 136s (1) cores
% 0.13/5.43 % Starting G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y with 136s (1) cores
% 0.13/5.43 % Starting U----_043_B31_F1_PI_AE_CS_SP_S2S with 136s (1) cores
% 0.13/5.43 % Preprocessing time : 0.001 s
% 0.13/5.43
% 0.13/5.43 % Proof found!
% 0.13/5.43 % SZS status Unsatisfiable
% 0.13/5.43 % SZS output start CNFRefutation
% See solution above
% 0.13/5.43 % Parsed axioms : 21
% 0.13/5.43 % Removed by relevancy pruning/SinE : 0
% 0.13/5.43 % Initial clauses : 21
% 0.13/5.43 % Removed in clause preprocessing : 0
% 0.13/5.43 % Initial clauses in saturation : 21
% 0.13/5.43 % Processed clauses : 28
% 0.13/5.43 % ...of these trivial : 1
% 0.13/5.43 % ...subsumed : 0
% 0.13/5.43 % ...remaining for further processing : 27
% 0.13/5.43 % Other redundant clauses eliminated : 0
% 0.13/5.43 % Clauses deleted for lack of memory : 0
% 0.13/5.43 % Backward-subsumed : 0
% 0.13/5.43 % Backward-rewritten : 2
% 0.13/5.43 % Generated clauses : 171
% 0.13/5.43 % ...of the previous two non-redundant : 103
% 0.13/5.43 % ...aggressively subsumed : 0
% 0.13/5.43 % Contextual simplify-reflections : 0
% 0.13/5.43 % Paramodulations : 171
% 0.13/5.43 % Factorizations : 0
% 0.13/5.43 % NegExts : 0
% 0.13/5.43 % Equation resolutions : 0
% 0.13/5.43 % Disequality decompositions : 0
% 0.13/5.43 % Total rewrite steps : 206
% 0.13/5.43 % ...of those cached : 86
% 0.13/5.43 % Propositional unsat checks : 0
% 0.13/5.43 % Propositional check models : 0
% 0.13/5.43 % Propositional check unsatisfiable : 0
% 0.13/5.43 % Propositional clauses : 0
% 0.13/5.43 % Propositional clauses after purity: 0
% 0.13/5.43 % Propositional unsat core size : 0
% 0.13/5.43 % Propositional preprocessing time : 0.000
% 0.13/5.43 % Propositional encoding time : 0.000
% 0.13/5.43 % Propositional solver time : 0.000
% 0.13/5.43 % Success case prop preproc time : 0.000
% 0.13/5.43 % Success case prop encoding time : 0.000
% 0.13/5.43 % Success case prop solver time : 0.000
% 0.13/5.43 % Current number of processed clauses : 25
% 0.13/5.43 % Positive orientable unit clauses : 22
% 0.13/5.43 % Positive unorientable unit clauses: 2
% 0.13/5.43 % Negative unit clauses : 1
% 0.13/5.43 % Non-unit-clauses : 0
% 0.13/5.43 % Current number of unprocessed clauses: 94
% 0.13/5.43 % ...number of literals in the above : 94
% 0.13/5.43 % Current number of archived formulas : 0
% 0.13/5.43 % Current number of archived clauses : 2
% 0.13/5.43 % Clause-clause subsumption calls (NU) : 0
% 0.13/5.43 % Rec. Clause-clause subsumption calls : 0
% 0.13/5.43 % Non-unit clause-clause subsumptions : 0
% 0.13/5.43 % Unit Clause-clause subsumption calls : 0
% 0.13/5.43 % Rewrite failures with RHS unbound : 0
% 0.13/5.43 % BW rewrite match attempts : 21
% 0.13/5.43 % BW rewrite match successes : 15
% 0.13/5.43 % Condensation attempts : 0
% 0.13/5.43 % Condensation successes : 0
% 0.13/5.43 % Termbank termtop insertions : 1643
% 0.13/5.43 % Search garbage collected termcells : 2
% 0.13/5.43
% 0.13/5.43 % -------------------------------------------------
% 0.13/5.43 % User time : 0.004 s
% 0.13/5.43 % System time : 0.001 s
% 0.13/5.43 % Total time : 0.005 s
% 0.13/5.43 % Maximum resident set size: 3592 pages
% 0.13/5.43
% 0.13/5.43 % -------------------------------------------------
% 0.13/5.43 % User time : 0.016 s
% 0.13/5.43 % System time : 0.013 s
% 0.13/5.43 % Total time : 0.028 s
% 0.13/5.43 % Maximum resident set size: 4608 pages
% 0.13/5.43 % E exiting
%------------------------------------------------------------------------------