%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GRP185-3 : 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 : n011.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:55 PM UTC 2026
% Result : Unsatisfiable 36.14s 5.89s
% Output : CNFRefutation 36.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 9
% Syntax : Number of clauses : 29 ( 29 unt; 0 nHn; 6 RR)
% Number of literals : 29 ( 28 equ; 5 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 : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 52 ( 5 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(prove_p22b,negated_conjecture,
greatest_lower_bound(least_upper_bound(multiply(a,b),identity),multiply(least_upper_bound(a,identity),least_upper_bound(b,identity))) != least_upper_bound(multiply(a,b),identity),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_p22b) ).
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(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(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(glb_absorbtion,axiom,
greatest_lower_bound(X1,least_upper_bound(X1,X2)) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',glb_absorbtion) ).
cnf(c_0_9,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
associativity ).
cnf(c_0_10,axiom,
multiply(inverse(X1),X1) = identity,
left_inverse ).
cnf(c_0_11,axiom,
multiply(identity,X1) = X1,
left_identity ).
cnf(c_0_12,negated_conjecture,
greatest_lower_bound(least_upper_bound(multiply(a,b),identity),multiply(least_upper_bound(a,identity),least_upper_bound(b,identity))) != least_upper_bound(multiply(a,b),identity),
inference(fof_simplification,[status(thm)],[prove_p22b]) ).
cnf(c_0_13,plain,
multiply(inverse(X1),multiply(X1,X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11]) ).
cnf(c_0_14,negated_conjecture,
greatest_lower_bound(least_upper_bound(multiply(a,b),identity),multiply(least_upper_bound(a,identity),least_upper_bound(b,identity))) != least_upper_bound(multiply(a,b),identity),
c_0_12 ).
cnf(c_0_15,axiom,
least_upper_bound(X1,X2) = least_upper_bound(X2,X1),
symmetry_of_lub ).
cnf(c_0_16,axiom,
multiply(X1,least_upper_bound(X2,X3)) = least_upper_bound(multiply(X1,X2),multiply(X1,X3)),
monotony_lub1 ).
cnf(c_0_17,axiom,
multiply(least_upper_bound(X1,X2),X3) = least_upper_bound(multiply(X1,X3),multiply(X2,X3)),
monotony_lub2 ).
cnf(c_0_18,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_19,plain,
multiply(inverse(inverse(X1)),identity) = X1,
inference(spm,[status(thm)],[c_0_13,c_0_10]) ).
cnf(c_0_20,plain,
multiply(inverse(inverse(X1)),X2) = multiply(X1,X2),
inference(spm,[status(thm)],[c_0_13,c_0_13]) ).
cnf(c_0_21,axiom,
greatest_lower_bound(X1,least_upper_bound(X1,X2)) = X1,
glb_absorbtion ).
cnf(c_0_22,negated_conjecture,
greatest_lower_bound(least_upper_bound(identity,multiply(a,b)),least_upper_bound(identity,least_upper_bound(multiply(a,identity),least_upper_bound(b,multiply(a,b))))) != least_upper_bound(identity,multiply(a,b)),
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_14,c_0_15]),c_0_15]),c_0_15]),c_0_15]),c_0_16]),c_0_17]),c_0_11]),c_0_17]),c_0_11]),c_0_18]) ).
cnf(c_0_23,plain,
multiply(X1,identity) = X1,
inference(rw,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_24,plain,
greatest_lower_bound(least_upper_bound(X1,X2),least_upper_bound(X1,least_upper_bound(X2,X3))) = least_upper_bound(X1,X2),
inference(spm,[status(thm)],[c_0_21,c_0_18]) ).
cnf(c_0_25,plain,
least_upper_bound(X1,least_upper_bound(X2,X3)) = least_upper_bound(X3,least_upper_bound(X1,X2)),
inference(spm,[status(thm)],[c_0_15,c_0_18]) ).
cnf(c_0_26,negated_conjecture,
greatest_lower_bound(least_upper_bound(identity,multiply(a,b)),least_upper_bound(identity,least_upper_bound(a,least_upper_bound(b,multiply(a,b))))) != least_upper_bound(identity,multiply(a,b)),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_27,plain,
greatest_lower_bound(least_upper_bound(X1,X2),least_upper_bound(X1,least_upper_bound(X3,least_upper_bound(X4,X2)))) = least_upper_bound(X1,X2),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_28,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_27])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP185-3 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.55 % Computer : n011.cluster.edu
% 0.09/0.55 % Model : x86_64 x86_64
% 0.09/0.55 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.55 % Memory : 8046.5625MB
% 0.09/0.55 % OS : Linux 6.8.0-71-generic
% 0.09/0.55 % CPULimit : 300
% 0.09/0.55 % WCLimit : 300
% 0.09/0.55 % DateTime : Sun Sep 20 20:05:26 UTC 2026
% 0.09/0.55 % CPUTime :
% 0.09/0.55 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.59 Running first-order theorem proving
% 0.13/0.59 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
% 36.14/5.89 % Version: 3.5.1
% 36.14/5.89 % Preprocessing class: FSMSSMSSSSSNFFN.
% 36.14/5.89 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 36.14/5.89 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 36.14/5.89 % Starting new_bool_3 with 300s (1) cores
% 36.14/5.89 % Starting new_bool_1 with 300s (1) cores
% 36.14/5.89 % Starting sh5l with 300s (1) cores
% 36.14/5.89 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 54578 completed with status 0
% 36.14/5.89 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 36.14/5.89 % Preprocessing class: FSMSSMSSSSSNFFN.
% 36.14/5.89 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 36.14/5.89 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 36.14/5.89 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 36.14/5.89 % No SInE strategy applied
% 36.14/5.89 % Search class: FUUPM-FFSF21-MFFFFFNN
% 36.14/5.89 % Scheduled 8 strats onto 5 cores with 1500 seconds (1500 total)
% 36.14/5.89 % Starting SubtermCWHack with 136s (1) cores
% 36.14/5.89 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 36.14/5.89 % Starting H----_047_B31_F1_PI_AE_R4_CS_SP_S2S with 136s (1) cores
% 36.14/5.89 % Starting G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y with 136s (1) cores
% 36.14/5.89 % Starting U----_043_B31_F1_PI_AE_CS_SP_S2S with 136s (1) cores
% 36.14/5.89 % U----_043_B31_F1_PI_AE_CS_SP_S2S with pid 54588 completed with status 0
% 36.14/5.89 % Result found by U----_043_B31_F1_PI_AE_CS_SP_S2S
% 36.14/5.89 % Preprocessing class: FSMSSMSSSSSNFFN.
% 36.14/5.89 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 36.14/5.89 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 36.14/5.89 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 36.14/5.89 % No SInE strategy applied
% 36.14/5.89 % Search class: FUUPM-FFSF21-MFFFFFNN
% 36.14/5.89 % Scheduled 8 strats onto 5 cores with 1500 seconds (1500 total)
% 36.14/5.89 % Starting SubtermCWHack with 136s (1) cores
% 36.14/5.89 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 36.14/5.89 % Starting H----_047_B31_F1_PI_AE_R4_CS_SP_S2S with 136s (1) cores
% 36.14/5.89 % Starting G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y with 136s (1) cores
% 36.14/5.89 % Starting U----_043_B31_F1_PI_AE_CS_SP_S2S with 136s (1) cores
% 36.14/5.89 % Preprocessing time : 0.001 s
% 36.14/5.89
% 36.14/5.89 % Proof found!
% 36.14/5.89 % SZS status Unsatisfiable
% 36.14/5.89 % SZS output start CNFRefutation
% See solution above
% 36.14/5.89 % Parsed axioms : 16
% 36.14/5.89 % Removed by relevancy pruning/SinE : 0
% 36.14/5.89 % Initial clauses : 16
% 36.14/5.89 % Removed in clause preprocessing : 0
% 36.14/5.89 % Initial clauses in saturation : 16
% 36.14/5.89 % Processed clauses : 8073
% 36.14/5.89 % ...of these trivial : 2596
% 36.14/5.89 % ...subsumed : 4827
% 36.14/5.89 % ...remaining for further processing : 650
% 36.14/5.89 % Other redundant clauses eliminated : 0
% 36.14/5.89 % Clauses deleted for lack of memory : 0
% 36.14/5.89 % Backward-subsumed : 0
% 36.14/5.89 % Backward-rewritten : 69
% 36.14/5.89 % Generated clauses : 231049
% 36.14/5.89 % ...of the previous two non-redundant : 153592
% 36.14/5.89 % ...aggressively subsumed : 0
% 36.14/5.89 % Contextual simplify-reflections : 0
% 36.14/5.89 % Paramodulations : 231049
% 36.14/5.89 % Factorizations : 0
% 36.14/5.89 % NegExts : 0
% 36.14/5.89 % Equation resolutions : 0
% 36.14/5.89 % Disequality decompositions : 0
% 36.14/5.89 % Total rewrite steps : 420842
% 36.14/5.89 % ...of those cached : 333250
% 36.14/5.89 % Propositional unsat checks : 0
% 36.14/5.89 % Propositional check models : 0
% 36.14/5.89 % Propositional check unsatisfiable : 0
% 36.14/5.89 % Propositional clauses : 0
% 36.14/5.89 % Propositional clauses after purity: 0
% 36.14/5.89 % Propositional unsat core size : 0
% 36.14/5.89 % Propositional preprocessing time : 0.000
% 36.14/5.89 % Propositional encoding time : 0.000
% 36.14/5.89 % Propositional solver time : 0.000
% 36.14/5.89 % Success case prop preproc time : 0.000
% 36.14/5.89 % Success case prop encoding time : 0.000
% 36.14/5.89 % Success case prop solver time : 0.000
% 36.14/5.89 % Current number of processed clauses : 581
% 36.14/5.89 % Positive orientable unit clauses : 517
% 36.14/5.89 % Positive unorientable unit clauses: 64
% 36.14/5.89 % Negative unit clauses : 0
% 36.14/5.89 % Non-unit-clauses : 0
% 36.14/5.89 % Current number of unprocessed clauses: 145337
% 36.14/5.89 % ...number of literals in the above : 145337
% 36.14/5.89 % Current number of archived formulas : 0
% 36.14/5.89 % Current number of archived clauses : 69
% 36.14/5.89 % Clause-clause subsumption calls (NU) : 0
% 36.14/5.89 % Rec. Clause-clause subsumption calls : 0
% 36.14/5.89 % Non-unit clause-clause subsumptions : 0
% 36.14/5.89 % Unit Clause-clause subsumption calls : 710
% 36.14/5.89 % Rewrite failures with RHS unbound : 2121
% 36.14/5.89 % BW rewrite match attempts : 4612
% 36.14/5.89 % BW rewrite match successes : 1384
% 36.14/5.89 % Condensation attempts : 0
% 36.14/5.89 % Condensation successes : 0
% 36.14/5.89 % Termbank termtop insertions : 3097641
% 36.14/5.89 % Search garbage collected termcells : 2
% 36.14/5.89
% 36.14/5.89 % -------------------------------------------------
% 36.14/5.89 % User time : 4.866 s
% 36.14/5.89 % System time : 0.210 s
% 36.14/5.89 % Total time : 5.077 s
% 36.14/5.89 % Maximum resident set size: 3640 pages
% 36.14/5.89
% 36.14/5.89 % -------------------------------------------------
% 36.14/5.89 % User time : 24.559 s
% 36.14/5.89 % System time : 1.084 s
% 36.14/5.89 % Total time : 25.643 s
% 36.14/5.89 % Maximum resident set size: 4864 pages
% 36.14/5.89 % E exiting
%------------------------------------------------------------------------------