%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GRP175-2 : 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 : n004.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:51 PM UTC 2026
% Result : Unsatisfiable 0.16s 10.48s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 7
% Syntax : Number of clauses : 20 ( 20 unt; 0 nHn; 7 RR)
% Number of literals : 20 ( 19 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 25 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(monotony_glb2,axiom,
multiply(greatest_lower_bound(X1,X2),X3) = greatest_lower_bound(multiply(X1,X3),multiply(X2,X3)),
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',monotony_glb2) ).
cnf(left_identity,axiom,
multiply(identity,X1) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-0.ax',left_identity) ).
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(p06b_1,hypothesis,
greatest_lower_bound(identity,b) = identity,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p06b_1) ).
cnf(prove_p06b,negated_conjecture,
greatest_lower_bound(identity,multiply(inverse(a),multiply(b,a))) != identity,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_p06b) ).
cnf(monotony_glb1,axiom,
multiply(X1,greatest_lower_bound(X2,X3)) = greatest_lower_bound(multiply(X1,X2),multiply(X1,X3)),
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',monotony_glb1) ).
cnf(left_inverse,axiom,
multiply(inverse(X1),X1) = identity,
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-0.ax',left_inverse) ).
cnf(c_0_7,axiom,
multiply(greatest_lower_bound(X1,X2),X3) = greatest_lower_bound(multiply(X1,X3),multiply(X2,X3)),
monotony_glb2 ).
cnf(c_0_8,axiom,
multiply(identity,X1) = X1,
left_identity ).
cnf(c_0_9,axiom,
greatest_lower_bound(X1,X2) = greatest_lower_bound(X2,X1),
symmetry_of_glb ).
cnf(c_0_10,hypothesis,
greatest_lower_bound(identity,b) = identity,
p06b_1 ).
cnf(c_0_11,negated_conjecture,
greatest_lower_bound(identity,multiply(inverse(a),multiply(b,a))) != identity,
inference(fof_simplification,[status(thm)],[prove_p06b]) ).
cnf(c_0_12,axiom,
multiply(X1,greatest_lower_bound(X2,X3)) = greatest_lower_bound(multiply(X1,X2),multiply(X1,X3)),
monotony_glb1 ).
cnf(c_0_13,axiom,
multiply(inverse(X1),X1) = identity,
left_inverse ).
cnf(c_0_14,plain,
greatest_lower_bound(X1,multiply(X2,X1)) = multiply(greatest_lower_bound(X2,identity),X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_9]) ).
cnf(c_0_15,hypothesis,
greatest_lower_bound(b,identity) = identity,
inference(rw,[status(thm)],[c_0_10,c_0_9]) ).
cnf(c_0_16,negated_conjecture,
greatest_lower_bound(identity,multiply(inverse(a),multiply(b,a))) != identity,
c_0_11 ).
cnf(c_0_17,plain,
greatest_lower_bound(identity,multiply(inverse(X1),X2)) = multiply(inverse(X1),greatest_lower_bound(X2,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_9]) ).
cnf(c_0_18,hypothesis,
greatest_lower_bound(X1,multiply(b,X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_8]) ).
cnf(c_0_19,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_17]),c_0_9]),c_0_18]),c_0_13])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP175-2 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/10.39 % Computer : n004.cluster.edu
% 0.13/10.39 % Model : x86_64 x86_64
% 0.13/10.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/10.39 % Memory : 8046.5625MB
% 0.13/10.39 % OS : Linux 6.8.0-71-generic
% 0.13/10.39 % CPULimit : 300
% 0.13/10.39 % WCLimit : 300
% 0.13/10.39 % DateTime : Sun Sep 20 20:04:01 UTC 2026
% 0.13/10.39 % CPUTime :
% 0.13/10.39 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.16/10.44 Running first-order theorem proving
% 0.16/10.44 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.16/10.48 % Version: 3.5.1
% 0.16/10.48 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/10.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/10.48 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/10.48 % Starting new_bool_3 with 300s (1) cores
% 0.16/10.48 % Starting new_bool_1 with 300s (1) cores
% 0.16/10.48 % Starting sh5l with 300s (1) cores
% 0.16/10.48 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1368149 completed with status 0
% 0.16/10.48 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.16/10.48 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/10.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/10.48 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/10.48 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.16/10.48 % No SInE strategy applied
% 0.16/10.48 % Search class: FUUPM-FFSF21-MFFFFFNN
% 0.16/10.48 % Scheduled 8 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/10.48 % Starting SubtermCWHack with 136s (1) cores
% 0.16/10.48 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.16/10.48 % Starting H----_047_B31_F1_PI_AE_R4_CS_SP_S2S with 136s (1) cores
% 0.16/10.48 % Starting G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y with 136s (1) cores
% 0.16/10.48 % Starting U----_043_B31_F1_PI_AE_CS_SP_S2S with 136s (1) cores
% 0.16/10.48 % H----_047_B31_F1_PI_AE_R4_CS_SP_S2S with pid 1368157 completed with status 0
% 0.16/10.48 % Result found by H----_047_B31_F1_PI_AE_R4_CS_SP_S2S
% 0.16/10.48 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/10.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/10.48 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/10.48 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.16/10.48 % No SInE strategy applied
% 0.16/10.48 % Search class: FUUPM-FFSF21-MFFFFFNN
% 0.16/10.48 % Scheduled 8 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/10.48 % Starting SubtermCWHack with 136s (1) cores
% 0.16/10.48 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.16/10.48 % Starting H----_047_B31_F1_PI_AE_R4_CS_SP_S2S with 136s (1) cores
% 0.16/10.48 % Preprocessing time : 0.001 s
% 0.16/10.48
% 0.16/10.48 % Proof found!
% 0.16/10.48 % SZS status Unsatisfiable
% 0.16/10.48 % SZS output start CNFRefutation
% See solution above
% 0.16/10.48 % Parsed axioms : 17
% 0.16/10.48 % Removed by relevancy pruning/SinE : 0
% 0.16/10.48 % Initial clauses : 17
% 0.16/10.48 % Removed in clause preprocessing : 0
% 0.16/10.48 % Initial clauses in saturation : 17
% 0.16/10.48 % Processed clauses : 177
% 0.16/10.48 % ...of these trivial : 48
% 0.16/10.48 % ...subsumed : 34
% 0.16/10.48 % ...remaining for further processing : 95
% 0.16/10.48 % Other redundant clauses eliminated : 0
% 0.16/10.48 % Clauses deleted for lack of memory : 0
% 0.16/10.48 % Backward-subsumed : 0
% 0.16/10.48 % Backward-rewritten : 7
% 0.16/10.48 % Generated clauses : 2288
% 0.16/10.48 % ...of the previous two non-redundant : 1243
% 0.16/10.48 % ...aggressively subsumed : 0
% 0.16/10.48 % Contextual simplify-reflections : 0
% 0.16/10.48 % Paramodulations : 2288
% 0.16/10.48 % Factorizations : 0
% 0.16/10.48 % NegExts : 0
% 0.16/10.48 % Equation resolutions : 0
% 0.16/10.48 % Disequality decompositions : 0
% 0.16/10.48 % Total rewrite steps : 2272
% 0.16/10.48 % ...of those cached : 1583
% 0.16/10.48 % Propositional unsat checks : 0
% 0.16/10.48 % Propositional check models : 0
% 0.16/10.48 % Propositional check unsatisfiable : 0
% 0.16/10.48 % Propositional clauses : 0
% 0.16/10.48 % Propositional clauses after purity: 0
% 0.16/10.48 % Propositional unsat core size : 0
% 0.16/10.48 % Propositional preprocessing time : 0.000
% 0.16/10.48 % Propositional encoding time : 0.000
% 0.16/10.48 % Propositional solver time : 0.000
% 0.16/10.48 % Success case prop preproc time : 0.000
% 0.16/10.48 % Success case prop encoding time : 0.000
% 0.16/10.48 % Success case prop solver time : 0.000
% 0.16/10.48 % Current number of processed clauses : 88
% 0.16/10.48 % Positive orientable unit clauses : 79
% 0.16/10.48 % Positive unorientable unit clauses: 9
% 0.16/10.48 % Negative unit clauses : 0
% 0.16/10.48 % Non-unit-clauses : 0
% 0.16/10.48 % Current number of unprocessed clauses: 1078
% 0.16/10.48 % ...number of literals in the above : 1078
% 0.16/10.48 % Current number of archived formulas : 0
% 0.16/10.48 % Current number of archived clauses : 7
% 0.16/10.48 % Clause-clause subsumption calls (NU) : 0
% 0.16/10.48 % Rec. Clause-clause subsumption calls : 0
% 0.16/10.48 % Non-unit clause-clause subsumptions : 0
% 0.16/10.48 % Unit Clause-clause subsumption calls : 8
% 0.16/10.48 % Rewrite failures with RHS unbound : 0
% 0.16/10.48 % BW rewrite match attempts : 95
% 0.16/10.48 % BW rewrite match successes : 52
% 0.16/10.48 % Condensation attempts : 0
% 0.16/10.48 % Condensation successes : 0
% 0.16/10.48 % Termbank termtop insertions : 17164
% 0.16/10.48 % Search garbage collected termcells : 2
% 0.16/10.48
% 0.16/10.48 % -------------------------------------------------
% 0.16/10.48 % User time : 0.019 s
% 0.16/10.48 % System time : 0.007 s
% 0.16/10.48 % Total time : 0.026 s
% 0.16/10.48 % Maximum resident set size: 3588 pages
% 0.16/10.48
% 0.16/10.48 % -------------------------------------------------
% 0.16/10.48 % User time : 0.105 s
% 0.16/10.48 % System time : 0.025 s
% 0.16/10.48 % Total time : 0.130 s
% 0.16/10.48 % Maximum resident set size: 4864 pages
% 0.16/10.48 % E exiting
%------------------------------------------------------------------------------