%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GRP190-2 : TPTP v9.3.1. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n020.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:56 PM UTC 2026
% Result : Unsatisfiable 1.09s 0.71s
% Output : CNFRefutation 1.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 13
% Syntax : Number of clauses : 46 ( 46 unt; 0 nHn; 8 RR)
% Number of literals : 46 ( 45 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 77 ( 14 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(associativity,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-0.ax',associativity) ).
cnf(left_inverse,axiom,
multiply(inverse(X1),X1) = identity,
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-0.ax',left_inverse) ).
cnf(left_identity,axiom,
multiply(identity,X1) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-0.ax',left_identity) ).
cnf(glb_absorbtion,axiom,
greatest_lower_bound(X1,least_upper_bound(X1,X2)) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-2.ax',glb_absorbtion) ).
cnf(symmetry_of_lub,axiom,
least_upper_bound(X1,X2) = least_upper_bound(X2,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-2.ax',symmetry_of_lub) ).
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/sandbox2/benchmark/Axioms/GRP004-2.ax',associativity_of_lub) ).
cnf(monotony_glb2,axiom,
multiply(greatest_lower_bound(X1,X2),X3) = greatest_lower_bound(multiply(X1,X3),multiply(X2,X3)),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-2.ax',monotony_glb2) ).
cnf(symmetry_of_glb,axiom,
greatest_lower_bound(X1,X2) = greatest_lower_bound(X2,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-2.ax',symmetry_of_glb) ).
cnf(p39c_1,hypothesis,
least_upper_bound(a,b) = a,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p39c_1) ).
cnf(lub_absorbtion,axiom,
least_upper_bound(X1,greatest_lower_bound(X1,X2)) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-2.ax',lub_absorbtion) ).
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/sandbox2/benchmark/Axioms/GRP004-2.ax',associativity_of_glb) ).
cnf(monotony_lub1,axiom,
multiply(X1,least_upper_bound(X2,X3)) = least_upper_bound(multiply(X1,X2),multiply(X1,X3)),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-2.ax',monotony_lub1) ).
cnf(prove_p39c,negated_conjecture,
greatest_lower_bound(inverse(a),inverse(b)) != inverse(a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_p39c) ).
cnf(c_0_13,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
associativity ).
cnf(c_0_14,axiom,
multiply(inverse(X1),X1) = identity,
left_inverse ).
cnf(c_0_15,axiom,
multiply(identity,X1) = X1,
left_identity ).
cnf(c_0_16,plain,
multiply(inverse(X1),multiply(X1,X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]) ).
cnf(c_0_17,plain,
multiply(inverse(inverse(X1)),identity) = X1,
inference(spm,[status(thm)],[c_0_16,c_0_14]) ).
cnf(c_0_18,plain,
multiply(inverse(inverse(inverse(X1))),X1) = identity,
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_19,axiom,
greatest_lower_bound(X1,least_upper_bound(X1,X2)) = X1,
glb_absorbtion ).
cnf(c_0_20,axiom,
least_upper_bound(X1,X2) = least_upper_bound(X2,X1),
symmetry_of_lub ).
cnf(c_0_21,plain,
inverse(inverse(X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_18]),c_0_17]) ).
cnf(c_0_22,plain,
greatest_lower_bound(X1,least_upper_bound(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_23,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_24,axiom,
multiply(greatest_lower_bound(X1,X2),X3) = greatest_lower_bound(multiply(X1,X3),multiply(X2,X3)),
monotony_glb2 ).
cnf(c_0_25,plain,
multiply(X1,inverse(X1)) = identity,
inference(spm,[status(thm)],[c_0_14,c_0_21]) ).
cnf(c_0_26,axiom,
greatest_lower_bound(X1,X2) = greatest_lower_bound(X2,X1),
symmetry_of_glb ).
cnf(c_0_27,plain,
greatest_lower_bound(X1,least_upper_bound(X2,least_upper_bound(X3,X1))) = X1,
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_28,hypothesis,
least_upper_bound(a,b) = a,
p39c_1 ).
cnf(c_0_29,axiom,
least_upper_bound(X1,greatest_lower_bound(X1,X2)) = X1,
lub_absorbtion ).
cnf(c_0_30,plain,
greatest_lower_bound(identity,multiply(X1,inverse(X2))) = multiply(greatest_lower_bound(X1,X2),inverse(X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]) ).
cnf(c_0_31,hypothesis,
greatest_lower_bound(b,least_upper_bound(X1,a)) = b,
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_32,plain,
least_upper_bound(identity,multiply(greatest_lower_bound(X1,X2),inverse(X2))) = identity,
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_33,hypothesis,
greatest_lower_bound(b,least_upper_bound(a,X1)) = b,
inference(spm,[status(thm)],[c_0_31,c_0_20]) ).
cnf(c_0_34,plain,
least_upper_bound(X1,greatest_lower_bound(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_29,c_0_26]) ).
cnf(c_0_35,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_36,axiom,
multiply(X1,least_upper_bound(X2,X3)) = least_upper_bound(multiply(X1,X2),multiply(X1,X3)),
monotony_lub1 ).
cnf(c_0_37,hypothesis,
least_upper_bound(identity,multiply(b,inverse(least_upper_bound(a,X1)))) = identity,
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_38,plain,
least_upper_bound(X1,greatest_lower_bound(X2,greatest_lower_bound(X3,X1))) = X1,
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_39,plain,
multiply(inverse(X1),least_upper_bound(X2,multiply(X1,X3))) = least_upper_bound(multiply(inverse(X1),X2),X3),
inference(spm,[status(thm)],[c_0_36,c_0_16]) ).
cnf(c_0_40,hypothesis,
least_upper_bound(identity,multiply(b,inverse(a))) = identity,
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_41,plain,
multiply(X1,identity) = X1,
inference(rw,[status(thm)],[c_0_17,c_0_21]) ).
cnf(c_0_42,negated_conjecture,
greatest_lower_bound(inverse(a),inverse(b)) != inverse(a),
inference(fof_simplification,[status(thm)],[prove_p39c]) ).
cnf(c_0_43,hypothesis,
least_upper_bound(inverse(a),inverse(b)) = inverse(b),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41]),c_0_41]),c_0_20]) ).
cnf(c_0_44,negated_conjecture,
greatest_lower_bound(inverse(a),inverse(b)) != inverse(a),
c_0_42 ).
cnf(c_0_45,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_43]),c_0_44]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP190-2 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.36 % Computer : n020.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.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Sun Sep 20 20:06:33 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.46 Running first-order theorem proving
% 0.14/0.46 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
% 1.09/0.71 % Version: 3.5.1
% 1.09/0.71 % Preprocessing class: FSMSSMSSSSSNFFN.
% 1.09/0.71 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.09/0.71 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.09/0.71 % Starting new_bool_3 with 300s (1) cores
% 1.09/0.71 % Starting new_bool_1 with 300s (1) cores
% 1.09/0.71 % Starting sh5l with 300s (1) cores
% 1.09/0.71 % sh5l with pid 1107919 completed with status 0
% 1.09/0.71 % Result found by sh5l
% 1.09/0.71 % Preprocessing class: FSMSSMSSSSSNFFN.
% 1.09/0.71 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.09/0.71 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.09/0.71 % Starting new_bool_3 with 300s (1) cores
% 1.09/0.71 % Starting new_bool_1 with 300s (1) cores
% 1.09/0.71 % Starting sh5l with 300s (1) cores
% 1.09/0.71 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 1.09/0.71 % SinE strategy is gf500_gu_R04_F100_L20000
% 1.09/0.71 % Search class: FUUPM-FFSF21-SFFFFFNN
% 1.09/0.71 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 1.09/0.71 % Starting SubtermCWHack with 31s (1) cores
% 1.09/0.71 % SubtermCWHack with pid 1107923 completed with status 0
% 1.09/0.71 % Result found by SubtermCWHack
% 1.09/0.71 % Preprocessing class: FSMSSMSSSSSNFFN.
% 1.09/0.71 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.09/0.71 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.09/0.71 % Starting new_bool_3 with 300s (1) cores
% 1.09/0.71 % Starting new_bool_1 with 300s (1) cores
% 1.09/0.71 % Starting sh5l with 300s (1) cores
% 1.09/0.71 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 1.09/0.71 % SinE strategy is gf500_gu_R04_F100_L20000
% 1.09/0.71 % Search class: FUUPM-FFSF21-SFFFFFNN
% 1.09/0.71 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 1.09/0.71 % Starting SubtermCWHack with 31s (1) cores
% 1.09/0.71 % Preprocessing time : 0.002 s
% 1.09/0.71
% 1.09/0.71 % Proof found!
% 1.09/0.71 % SZS status Unsatisfiable
% 1.09/0.71 % SZS output start CNFRefutation
% See solution above
% 1.09/0.71 % Parsed axioms : 17
% 1.09/0.71 % Removed by relevancy pruning/SinE : 0
% 1.09/0.71 % Initial clauses : 17
% 1.09/0.71 % Removed in clause preprocessing : 0
% 1.09/0.71 % Initial clauses in saturation : 17
% 1.09/0.71 % Processed clauses : 909
% 1.09/0.71 % ...of these trivial : 348
% 1.09/0.71 % ...subsumed : 346
% 1.09/0.71 % ...remaining for further processing : 215
% 1.09/0.71 % Other redundant clauses eliminated : 0
% 1.09/0.71 % Clauses deleted for lack of memory : 0
% 1.09/0.71 % Backward-subsumed : 0
% 1.09/0.71 % Backward-rewritten : 26
% 1.09/0.71 % Generated clauses : 15876
% 1.09/0.71 % ...of the previous two non-redundant : 9261
% 1.09/0.71 % ...aggressively subsumed : 0
% 1.09/0.71 % Contextual simplify-reflections : 0
% 1.09/0.71 % Paramodulations : 15876
% 1.09/0.71 % Factorizations : 0
% 1.09/0.71 % NegExts : 0
% 1.09/0.71 % Equation resolutions : 0
% 1.09/0.71 % Disequality decompositions : 0
% 1.09/0.71 % Total rewrite steps : 17516
% 1.09/0.71 % ...of those cached : 12561
% 1.09/0.71 % Propositional unsat checks : 0
% 1.09/0.71 % Propositional check models : 0
% 1.09/0.71 % Propositional check unsatisfiable : 0
% 1.09/0.71 % Propositional clauses : 0
% 1.09/0.71 % Propositional clauses after purity: 0
% 1.09/0.71 % Propositional unsat core size : 0
% 1.09/0.71 % Propositional preprocessing time : 0.000
% 1.09/0.71 % Propositional encoding time : 0.000
% 1.09/0.71 % Propositional solver time : 0.000
% 1.09/0.71 % Success case prop preproc time : 0.000
% 1.09/0.71 % Success case prop encoding time : 0.000
% 1.09/0.71 % Success case prop solver time : 0.000
% 1.09/0.71 % Current number of processed clauses : 189
% 1.09/0.71 % Positive orientable unit clauses : 170
% 1.09/0.71 % Positive unorientable unit clauses: 18
% 1.09/0.71 % Negative unit clauses : 1
% 1.09/0.71 % Non-unit-clauses : 0
% 1.09/0.71 % Current number of unprocessed clauses: 8333
% 1.09/0.71 % ...number of literals in the above : 8333
% 1.09/0.71 % Current number of archived formulas : 0
% 1.09/0.71 % Current number of archived clauses : 26
% 1.09/0.71 % Clause-clause subsumption calls (NU) : 0
% 1.09/0.71 % Rec. Clause-clause subsumption calls : 0
% 1.09/0.71 % Non-unit clause-clause subsumptions : 0
% 1.09/0.71 % Unit Clause-clause subsumption calls : 44
% 1.09/0.71 % Rewrite failures with RHS unbound : 0
% 1.09/0.71 % BW rewrite match attempts : 547
% 1.09/0.71 % BW rewrite match successes : 289
% 1.09/0.71 % Condensation attempts : 0
% 1.09/0.71 % Condensation successes : 0
% 1.09/0.71 % Termbank termtop insertions : 142621
% 1.09/0.71 % Search garbage collected termcells : 2
% 1.09/0.71
% 1.09/0.71 % -------------------------------------------------
% 1.09/0.71 % User time : 0.211 s
% 1.09/0.71 % System time : 0.019 s
% 1.09/0.71 % Total time : 0.230 s
% 1.09/0.71 % Maximum resident set size: 3640 pages
% 1.09/0.71
% 1.09/0.71 % -------------------------------------------------
% 1.09/0.71 % User time : 0.214 s
% 1.09/0.71 % System time : 0.025 s
% 1.09/0.71 % Total time : 0.239 s
% 1.09/0.71 % Maximum resident set size: 4864 pages
% 1.09/0.71 % E exiting
%------------------------------------------------------------------------------