%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : GRP185-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 : n002.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:50 PM UTC 2026
% Result : Unsatisfiable 27.23s 4.48s
% Output : CNFRefutation 27.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 10
% Syntax : Number of clauses : 29 ( 29 unt; 0 nHn; 8 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 : 46 ( 5 sgn)
% Comments :
%------------------------------------------------------------------------------
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(p22b_3,hypothesis,
inverse(multiply(X1,X2)) = multiply(inverse(X2),inverse(X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p22b_3) ).
cnf(left_identity,axiom,
multiply(identity,X1) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-0.ax',left_identity) ).
cnf(p22b_1,hypothesis,
inverse(identity) = identity,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p22b_1) ).
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(p22b_2,hypothesis,
inverse(inverse(X1)) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p22b_2) ).
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_10,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_11,hypothesis,
inverse(multiply(X1,X2)) = multiply(inverse(X2),inverse(X1)),
p22b_3 ).
cnf(c_0_12,axiom,
multiply(identity,X1) = X1,
left_identity ).
cnf(c_0_13,hypothesis,
inverse(identity) = identity,
p22b_1 ).
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_10 ).
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,hypothesis,
multiply(inverse(X1),identity) = inverse(X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13]) ).
cnf(c_0_20,hypothesis,
inverse(inverse(X1)) = X1,
p22b_2 ).
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_12]),c_0_17]),c_0_12]),c_0_18]) ).
cnf(c_0_23,hypothesis,
multiply(X1,identity) = X1,
inference(spm,[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-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/0.36 % Computer : n002.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Sun Sep 20 20:08:02 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.42 Running first-order theorem proving
% 0.09/0.42 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
% 27.23/4.47 % Version: 3.5.1
% 27.23/4.47 % Preprocessing class: FSMSSMSSSSSNFFN.
% 27.23/4.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 27.23/4.47 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 27.23/4.47 % Starting new_bool_3 with 300s (1) cores
% 27.23/4.47 % Starting new_bool_1 with 300s (1) cores
% 27.23/4.47 % Starting sh5l with 300s (1) cores
% 27.23/4.47 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1591238 completed with status 0
% 27.23/4.47 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 27.23/4.47 % Preprocessing class: FSMSSMSSSSSNFFN.
% 27.23/4.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 27.23/4.47 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 27.23/4.47 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 27.23/4.47 % No SInE strategy applied
% 27.23/4.47 % Search class: FUUPM-FFSF21-MFFFFFNN
% 27.23/4.47 % Scheduled 8 strats onto 5 cores with 1500 seconds (1500 total)
% 27.23/4.47 % Starting SubtermCWHack with 136s (1) cores
% 27.23/4.47 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 27.23/4.47 % Starting H----_047_B31_F1_PI_AE_R4_CS_SP_S2S with 136s (1) cores
% 27.23/4.48 % Starting G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y with 136s (1) cores
% 27.23/4.48 % Starting U----_043_B31_F1_PI_AE_CS_SP_S2S with 136s (1) cores
% 27.23/4.48 % U----_043_B31_F1_PI_AE_CS_SP_S2S with pid 1591248 completed with status 0
% 27.23/4.48 % Result found by U----_043_B31_F1_PI_AE_CS_SP_S2S
% 27.23/4.48 % Preprocessing class: FSMSSMSSSSSNFFN.
% 27.23/4.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 27.23/4.48 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 27.23/4.48 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 27.23/4.48 % No SInE strategy applied
% 27.23/4.48 % Search class: FUUPM-FFSF21-MFFFFFNN
% 27.23/4.48 % Scheduled 8 strats onto 5 cores with 1500 seconds (1500 total)
% 27.23/4.48 % Starting SubtermCWHack with 136s (1) cores
% 27.23/4.48 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 27.23/4.48 % Starting H----_047_B31_F1_PI_AE_R4_CS_SP_S2S with 136s (1) cores
% 27.23/4.48 % Starting G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y with 136s (1) cores
% 27.23/4.48 % Starting U----_043_B31_F1_PI_AE_CS_SP_S2S with 136s (1) cores
% 27.23/4.48 % Preprocessing time : 0.001 s
% 27.23/4.48
% 27.23/4.48 % Proof found!
% 27.23/4.48 % SZS status Unsatisfiable
% 27.23/4.48 % SZS output start CNFRefutation
% See solution above
% 27.23/4.48 % Parsed axioms : 19
% 27.23/4.48 % Removed by relevancy pruning/SinE : 0
% 27.23/4.48 % Initial clauses : 19
% 27.23/4.48 % Removed in clause preprocessing : 0
% 27.23/4.48 % Initial clauses in saturation : 19
% 27.23/4.48 % Processed clauses : 8112
% 27.23/4.48 % ...of these trivial : 2539
% 27.23/4.48 % ...subsumed : 4928
% 27.23/4.48 % ...remaining for further processing : 645
% 27.23/4.48 % Other redundant clauses eliminated : 0
% 27.23/4.48 % Clauses deleted for lack of memory : 0
% 27.23/4.48 % Backward-subsumed : 0
% 27.23/4.48 % Backward-rewritten : 57
% 27.23/4.48 % Generated clauses : 223829
% 27.23/4.48 % ...of the previous two non-redundant : 150086
% 27.23/4.48 % ...aggressively subsumed : 0
% 27.23/4.48 % Contextual simplify-reflections : 0
% 27.23/4.48 % Paramodulations : 223829
% 27.23/4.48 % Factorizations : 0
% 27.23/4.48 % NegExts : 0
% 27.23/4.48 % Equation resolutions : 0
% 27.23/4.48 % Disequality decompositions : 0
% 27.23/4.48 % Total rewrite steps : 416477
% 27.23/4.48 % ...of those cached : 328308
% 27.23/4.48 % Propositional unsat checks : 0
% 27.23/4.48 % Propositional check models : 0
% 27.23/4.48 % Propositional check unsatisfiable : 0
% 27.23/4.48 % Propositional clauses : 0
% 27.23/4.48 % Propositional clauses after purity: 0
% 27.23/4.48 % Propositional unsat core size : 0
% 27.23/4.48 % Propositional preprocessing time : 0.000
% 27.23/4.48 % Propositional encoding time : 0.000
% 27.23/4.48 % Propositional solver time : 0.000
% 27.23/4.48 % Success case prop preproc time : 0.000
% 27.23/4.48 % Success case prop encoding time : 0.000
% 27.23/4.48 % Success case prop solver time : 0.000
% 27.23/4.48 % Current number of processed clauses : 588
% 27.23/4.48 % Positive orientable unit clauses : 521
% 27.23/4.48 % Positive unorientable unit clauses: 67
% 27.23/4.48 % Negative unit clauses : 0
% 27.23/4.48 % Non-unit-clauses : 0
% 27.23/4.48 % Current number of unprocessed clauses: 141797
% 27.23/4.48 % ...number of literals in the above : 141797
% 27.23/4.48 % Current number of archived formulas : 0
% 27.23/4.48 % Current number of archived clauses : 57
% 27.23/4.48 % Clause-clause subsumption calls (NU) : 0
% 27.23/4.48 % Rec. Clause-clause subsumption calls : 0
% 27.23/4.48 % Non-unit clause-clause subsumptions : 0
% 27.23/4.48 % Unit Clause-clause subsumption calls : 705
% 27.23/4.48 % Rewrite failures with RHS unbound : 2108
% 27.23/4.48 % BW rewrite match attempts : 4589
% 27.23/4.48 % BW rewrite match successes : 1371
% 27.23/4.48 % Condensation attempts : 0
% 27.23/4.48 % Condensation successes : 0
% 27.23/4.48 % Termbank termtop insertions : 3038015
% 27.23/4.48 % Search garbage collected termcells : 2
% 27.23/4.48
% 27.23/4.48 % -------------------------------------------------
% 27.23/4.48 % User time : 3.392 s
% 27.23/4.48 % System time : 0.159 s
% 27.23/4.48 % Total time : 3.551 s
% 27.23/4.48 % Maximum resident set size: 3384 pages
% 27.23/4.48
% 27.23/4.48 % -------------------------------------------------
% 27.23/4.48 % User time : 18.504 s
% 27.23/4.48 % System time : 0.790 s
% 27.23/4.48 % Total time : 19.294 s
% 27.23/4.48 % Maximum resident set size: 4608 pages
% 27.23/4.48 % E exiting
%------------------------------------------------------------------------------