%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : GRP167-5 : 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 : n019.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:42:43 PM UTC 2026
% Result : Unsatisfiable 0.21s 0.52s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 10
% Syntax : Number of clauses : 44 ( 44 unt; 0 nHn; 6 RR)
% Number of literals : 44 ( 43 equ; 4 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 : 8 ( 8 usr; 2 con; 0-2 aty)
% Number of variables : 59 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(associativity,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-0.ax',associativity) ).
cnf(left_inverse,axiom,
multiply(inverse(X1),X1) = identity,
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-0.ax',left_inverse) ).
cnf(left_identity,axiom,
multiply(identity,X1) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-0.ax',left_identity) ).
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(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(p10,axiom,
inverse(least_upper_bound(X1,X2)) = greatest_lower_bound(inverse(X1),inverse(X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p10) ).
cnf(prove_lat4,negated_conjecture,
a != multiply(positive_part(a),negative_part(a)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_lat4) ).
cnf(lat4_1,axiom,
positive_part(X1) = least_upper_bound(X1,identity),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',lat4_1) ).
cnf(lat4_2,axiom,
negative_part(X1) = greatest_lower_bound(X1,identity),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',lat4_2) ).
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(c_0_10,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
associativity ).
cnf(c_0_11,axiom,
multiply(inverse(X1),X1) = identity,
left_inverse ).
cnf(c_0_12,axiom,
multiply(identity,X1) = X1,
left_identity ).
cnf(c_0_13,plain,
multiply(inverse(X1),multiply(X1,X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12]) ).
cnf(c_0_14,plain,
multiply(inverse(inverse(X1)),identity) = X1,
inference(spm,[status(thm)],[c_0_13,c_0_11]) ).
cnf(c_0_15,plain,
multiply(inverse(inverse(inverse(X1))),X1) = identity,
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_16,plain,
inverse(inverse(X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_15]),c_0_14]) ).
cnf(c_0_17,plain,
multiply(X1,inverse(X1)) = identity,
inference(spm,[status(thm)],[c_0_11,c_0_16]) ).
cnf(c_0_18,plain,
multiply(inverse(identity),X1) = X1,
inference(spm,[status(thm)],[c_0_13,c_0_12]) ).
cnf(c_0_19,plain,
multiply(X1,multiply(X2,inverse(multiply(X1,X2)))) = identity,
inference(spm,[status(thm)],[c_0_10,c_0_17]) ).
cnf(c_0_20,plain,
multiply(X1,identity) = X1,
inference(rw,[status(thm)],[c_0_14,c_0_16]) ).
cnf(c_0_21,plain,
multiply(inverse(inverse(identity)),X1) = X1,
inference(spm,[status(thm)],[c_0_13,c_0_18]) ).
cnf(c_0_22,plain,
multiply(X1,inverse(multiply(X2,X1))) = inverse(X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_19]),c_0_20]) ).
cnf(c_0_23,axiom,
multiply(X1,least_upper_bound(X2,X3)) = least_upper_bound(multiply(X1,X2),multiply(X1,X3)),
monotony_lub1 ).
cnf(c_0_24,axiom,
least_upper_bound(X1,X2) = least_upper_bound(X2,X1),
symmetry_of_lub ).
cnf(c_0_25,axiom,
inverse(least_upper_bound(X1,X2)) = greatest_lower_bound(inverse(X1),inverse(X2)),
p10 ).
cnf(c_0_26,plain,
inverse(identity) = identity,
inference(spm,[status(thm)],[c_0_11,c_0_21]) ).
cnf(c_0_27,plain,
multiply(inverse(multiply(X1,X2)),X1) = inverse(X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_22]),c_0_16]) ).
cnf(c_0_28,plain,
multiply(X1,multiply(inverse(X1),X2)) = X2,
inference(spm,[status(thm)],[c_0_13,c_0_16]) ).
cnf(c_0_29,plain,
least_upper_bound(X1,multiply(X1,X2)) = multiply(X1,least_upper_bound(X2,identity)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_20]),c_0_24]) ).
cnf(c_0_30,plain,
inverse(least_upper_bound(identity,X1)) = greatest_lower_bound(identity,inverse(X1)),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_31,negated_conjecture,
a != multiply(positive_part(a),negative_part(a)),
inference(fof_simplification,[status(thm)],[prove_lat4]) ).
cnf(c_0_32,plain,
inverse(multiply(inverse(X1),X2)) = multiply(inverse(X2),X1),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_33,plain,
multiply(X1,least_upper_bound(identity,inverse(X1))) = least_upper_bound(X1,identity),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_17]),c_0_24]) ).
cnf(c_0_34,plain,
inverse(greatest_lower_bound(identity,inverse(X1))) = least_upper_bound(identity,X1),
inference(spm,[status(thm)],[c_0_16,c_0_30]) ).
cnf(c_0_35,negated_conjecture,
a != multiply(positive_part(a),negative_part(a)),
c_0_31 ).
cnf(c_0_36,axiom,
positive_part(X1) = least_upper_bound(X1,identity),
lat4_1 ).
cnf(c_0_37,axiom,
negative_part(X1) = greatest_lower_bound(X1,identity),
lat4_2 ).
cnf(c_0_38,axiom,
greatest_lower_bound(X1,X2) = greatest_lower_bound(X2,X1),
symmetry_of_glb ).
cnf(c_0_39,plain,
multiply(greatest_lower_bound(identity,inverse(X1)),X1) = greatest_lower_bound(identity,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_24]),c_0_30]),c_0_16]),c_0_16]),c_0_30]) ).
cnf(c_0_40,plain,
inverse(greatest_lower_bound(identity,X1)) = least_upper_bound(identity,inverse(X1)),
inference(spm,[status(thm)],[c_0_34,c_0_16]) ).
cnf(c_0_41,negated_conjecture,
multiply(least_upper_bound(identity,a),greatest_lower_bound(identity,a)) != a,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_35,c_0_36]),c_0_24]),c_0_37]),c_0_38]) ).
cnf(c_0_42,plain,
multiply(least_upper_bound(identity,X1),greatest_lower_bound(identity,X1)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_39]),c_0_40]),c_0_16]) ).
cnf(c_0_43,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_41,c_0_42])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : GRP167-5 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/0.42 % Computer : n019.cluster.edu
% 0.15/0.42 % Model : x86_64 x86_64
% 0.15/0.42 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.42 % Memory : 8046.5625MB
% 0.15/0.42 % OS : Linux 6.8.0-71-generic
% 0.15/0.42 % CPULimit : 300
% 0.15/0.42 % WCLimit : 300
% 0.15/0.42 % DateTime : Sun Sep 20 20:03:50 UTC 2026
% 0.15/0.43 % CPUTime :
% 0.15/0.43 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.21/0.47 Running first-order theorem proving
% 0.21/0.47 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.21/0.52 % Version: 3.5.1
% 0.21/0.52 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.52 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.52 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.52 % Starting new_bool_3 with 300s (1) cores
% 0.21/0.52 % Starting new_bool_1 with 300s (1) cores
% 0.21/0.52 % Starting sh5l with 300s (1) cores
% 0.21/0.52 % sh5l with pid 804931 completed with status 0
% 0.21/0.52 % Result found by sh5l
% 0.21/0.52 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.52 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.52 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.52 % Starting new_bool_3 with 300s (1) cores
% 0.21/0.52 % Starting new_bool_1 with 300s (1) cores
% 0.21/0.52 % Starting sh5l with 300s (1) cores
% 0.21/0.52 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.21/0.52 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.21/0.52 % Search class: FUUPM-FFSF21-SFFFFFNN
% 0.21/0.52 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.52 % Starting SubtermCWHack with 31s (1) cores
% 0.21/0.52 % SubtermCWHack with pid 804934 completed with status 0
% 0.21/0.52 % Result found by SubtermCWHack
% 0.21/0.52 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.52 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.52 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.52 % Starting new_bool_3 with 300s (1) cores
% 0.21/0.52 % Starting new_bool_1 with 300s (1) cores
% 0.21/0.52 % Starting sh5l with 300s (1) cores
% 0.21/0.52 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.21/0.52 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.21/0.52 % Search class: FUUPM-FFSF21-SFFFFFNN
% 0.21/0.52 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.52 % Starting SubtermCWHack with 31s (1) cores
% 0.21/0.52 % Preprocessing time : 0.001 s
% 0.21/0.52
% 0.21/0.52 % Proof found!
% 0.21/0.52 % SZS status Unsatisfiable
% 0.21/0.52 % SZS output start CNFRefutation
% See solution above
% 0.21/0.52 % Parsed axioms : 21
% 0.21/0.52 % Removed by relevancy pruning/SinE : 0
% 0.21/0.52 % Initial clauses : 21
% 0.21/0.52 % Removed in clause preprocessing : 0
% 0.21/0.52 % Initial clauses in saturation : 21
% 0.21/0.52 % Processed clauses : 480
% 0.21/0.52 % ...of these trivial : 222
% 0.21/0.52 % ...subsumed : 103
% 0.21/0.52 % ...remaining for further processing : 155
% 0.21/0.52 % Other redundant clauses eliminated : 0
% 0.21/0.52 % Clauses deleted for lack of memory : 0
% 0.21/0.52 % Backward-subsumed : 0
% 0.21/0.52 % Backward-rewritten : 26
% 0.21/0.52 % Generated clauses : 7441
% 0.21/0.52 % ...of the previous two non-redundant : 4276
% 0.21/0.52 % ...aggressively subsumed : 0
% 0.21/0.52 % Contextual simplify-reflections : 0
% 0.21/0.52 % Paramodulations : 7441
% 0.21/0.52 % Factorizations : 0
% 0.21/0.52 % NegExts : 0
% 0.21/0.52 % Equation resolutions : 0
% 0.21/0.52 % Disequality decompositions : 0
% 0.21/0.52 % Total rewrite steps : 8733
% 0.21/0.52 % ...of those cached : 6348
% 0.21/0.52 % Propositional unsat checks : 0
% 0.21/0.52 % Propositional check models : 0
% 0.21/0.52 % Propositional check unsatisfiable : 0
% 0.21/0.52 % Propositional clauses : 0
% 0.21/0.52 % Propositional clauses after purity: 0
% 0.21/0.52 % Propositional unsat core size : 0
% 0.21/0.52 % Propositional preprocessing time : 0.000
% 0.21/0.52 % Propositional encoding time : 0.000
% 0.21/0.52 % Propositional solver time : 0.000
% 0.21/0.52 % Success case prop preproc time : 0.000
% 0.21/0.52 % Success case prop encoding time : 0.000
% 0.21/0.52 % Success case prop solver time : 0.000
% 0.21/0.52 % Current number of processed clauses : 129
% 0.21/0.52 % Positive orientable unit clauses : 120
% 0.21/0.52 % Positive unorientable unit clauses: 9
% 0.21/0.52 % Negative unit clauses : 0
% 0.21/0.52 % Non-unit-clauses : 0
% 0.21/0.52 % Current number of unprocessed clauses: 3791
% 0.21/0.52 % ...number of literals in the above : 3791
% 0.21/0.52 % Current number of archived formulas : 0
% 0.21/0.52 % Current number of archived clauses : 26
% 0.21/0.52 % Clause-clause subsumption calls (NU) : 0
% 0.21/0.52 % Rec. Clause-clause subsumption calls : 0
% 0.21/0.52 % Non-unit clause-clause subsumptions : 0
% 0.21/0.52 % Unit Clause-clause subsumption calls : 15
% 0.21/0.52 % Rewrite failures with RHS unbound : 0
% 0.21/0.52 % BW rewrite match attempts : 266
% 0.21/0.52 % BW rewrite match successes : 134
% 0.21/0.52 % Condensation attempts : 0
% 0.21/0.52 % Condensation successes : 0
% 0.21/0.52 % Termbank termtop insertions : 60045
% 0.21/0.52 % Search garbage collected termcells : 2
% 0.21/0.52
% 0.21/0.52 % -------------------------------------------------
% 0.21/0.52 % User time : 0.031 s
% 0.21/0.52 % System time : 0.003 s
% 0.21/0.52 % Total time : 0.034 s
% 0.21/0.52 % Maximum resident set size: 3640 pages
% 0.21/0.52
% 0.21/0.52 % -------------------------------------------------
% 0.21/0.52 % User time : 0.034 s
% 0.21/0.52 % System time : 0.006 s
% 0.21/0.52 % Total time : 0.040 s
% 0.21/0.52 % Maximum resident set size: 4608 pages
% 0.21/0.52 % E exiting
%------------------------------------------------------------------------------