%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : GRP169-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 : n008.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:44 PM UTC 2026
% Result : Unsatisfiable 0.16s 1.07s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of clauses : 27 ( 27 unt; 0 nHn; 7 RR)
% Number of literals : 27 ( 26 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 : 39 ( 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_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(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(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(p02b_1,hypothesis,
greatest_lower_bound(inverse(a),inverse(b)) = inverse(a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p02b_1) ).
cnf(prove_p02b,negated_conjecture,
greatest_lower_bound(a,b) != b,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_p02b) ).
cnf(c_0_8,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
associativity ).
cnf(c_0_9,axiom,
multiply(inverse(X1),X1) = identity,
left_inverse ).
cnf(c_0_10,axiom,
multiply(identity,X1) = X1,
left_identity ).
cnf(c_0_11,plain,
multiply(inverse(X1),multiply(X1,X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10]) ).
cnf(c_0_12,plain,
multiply(inverse(inverse(X1)),identity) = X1,
inference(spm,[status(thm)],[c_0_11,c_0_9]) ).
cnf(c_0_13,plain,
multiply(inverse(inverse(X1)),X2) = multiply(X1,X2),
inference(spm,[status(thm)],[c_0_11,c_0_11]) ).
cnf(c_0_14,axiom,
multiply(greatest_lower_bound(X1,X2),X3) = greatest_lower_bound(multiply(X1,X3),multiply(X2,X3)),
monotony_glb2 ).
cnf(c_0_15,axiom,
greatest_lower_bound(X1,X2) = greatest_lower_bound(X2,X1),
symmetry_of_glb ).
cnf(c_0_16,axiom,
multiply(X1,greatest_lower_bound(X2,X3)) = greatest_lower_bound(multiply(X1,X2),multiply(X1,X3)),
monotony_glb1 ).
cnf(c_0_17,plain,
multiply(X1,identity) = X1,
inference(rw,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_18,plain,
multiply(greatest_lower_bound(X1,inverse(X2)),X2) = greatest_lower_bound(identity,multiply(X1,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_9]),c_0_15]) ).
cnf(c_0_19,hypothesis,
greatest_lower_bound(inverse(a),inverse(b)) = inverse(a),
p02b_1 ).
cnf(c_0_20,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_16,c_0_9]),c_0_15]) ).
cnf(c_0_21,plain,
inverse(inverse(X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_17]),c_0_17]) ).
cnf(c_0_22,negated_conjecture,
greatest_lower_bound(a,b) != b,
inference(fof_simplification,[status(thm)],[prove_p02b]) ).
cnf(c_0_23,hypothesis,
multiply(inverse(a),greatest_lower_bound(a,b)) = multiply(inverse(a),b),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]),c_0_15]) ).
cnf(c_0_24,plain,
multiply(X1,multiply(inverse(X1),X2)) = X2,
inference(spm,[status(thm)],[c_0_11,c_0_21]) ).
cnf(c_0_25,negated_conjecture,
greatest_lower_bound(a,b) != b,
c_0_22 ).
cnf(c_0_26,hypothesis,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_23]),c_0_21]),c_0_24]),c_0_25]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GRP169-2 : 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.97 % Computer : n008.cluster.edu
% 0.09/0.97 % Model : x86_64 x86_64
% 0.09/0.97 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.97 % Memory : 8046.5625MB
% 0.09/0.97 % OS : Linux 6.8.0-71-generic
% 0.09/0.97 % CPULimit : 300
% 0.09/0.97 % WCLimit : 300
% 0.09/0.97 % DateTime : Sun Sep 20 20:04:27 UTC 2026
% 0.09/0.98 % CPUTime :
% 0.09/0.98 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/1.01 Running first-order theorem proving
% 0.09/1.01 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/1.07 % Version: 3.5.1
% 0.16/1.07 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/1.07 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/1.07 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/1.07 % Starting new_bool_3 with 300s (1) cores
% 0.16/1.07 % Starting new_bool_1 with 300s (1) cores
% 0.16/1.07 % Starting sh5l with 300s (1) cores
% 0.16/1.07 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 3487730 completed with status 0
% 0.16/1.07 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.16/1.07 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/1.07 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/1.07 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/1.07 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.16/1.07 % No SInE strategy applied
% 0.16/1.07 % Search class: FUUPM-FFSF21-SFFFFFNN
% 0.16/1.07 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/1.07 % Starting SubtermCWHack with 136s (1) cores
% 0.16/1.07 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.16/1.07 % Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 0.16/1.07 % Starting new_bool_3 with 136s (1) cores
% 0.16/1.07 % Starting new_bool_1 with 136s (1) cores
% 0.16/1.07 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 3487736 completed with status 0
% 0.16/1.07 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.16/1.07 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/1.07 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/1.07 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/1.07 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.16/1.07 % No SInE strategy applied
% 0.16/1.07 % Search class: FUUPM-FFSF21-SFFFFFNN
% 0.16/1.07 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/1.07 % Starting SubtermCWHack with 136s (1) cores
% 0.16/1.07 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.16/1.07 % Preprocessing time : 0.001 s
% 0.16/1.07 % Presaturation interreduction done
% 0.16/1.07
% 0.16/1.07 % Proof found!
% 0.16/1.07 % SZS status Unsatisfiable
% 0.16/1.07 % SZS output start CNFRefutation
% See solution above
% 0.16/1.07 % Parsed axioms : 17
% 0.16/1.07 % Removed by relevancy pruning/SinE : 0
% 0.16/1.07 % Initial clauses : 17
% 0.16/1.07 % Removed in clause preprocessing : 0
% 0.16/1.07 % Initial clauses in saturation : 17
% 0.16/1.07 % Processed clauses : 367
% 0.16/1.07 % ...of these trivial : 90
% 0.16/1.07 % ...subsumed : 158
% 0.16/1.07 % ...remaining for further processing : 119
% 0.16/1.07 % Other redundant clauses eliminated : 0
% 0.16/1.07 % Clauses deleted for lack of memory : 0
% 0.16/1.07 % Backward-subsumed : 0
% 0.16/1.07 % Backward-rewritten : 8
% 0.16/1.07 % Generated clauses : 3238
% 0.16/1.07 % ...of the previous two non-redundant : 2076
% 0.16/1.07 % ...aggressively subsumed : 0
% 0.16/1.07 % Contextual simplify-reflections : 0
% 0.16/1.07 % Paramodulations : 3238
% 0.16/1.07 % Factorizations : 0
% 0.16/1.07 % NegExts : 0
% 0.16/1.07 % Equation resolutions : 0
% 0.16/1.07 % Disequality decompositions : 0
% 0.16/1.07 % Total rewrite steps : 3165
% 0.16/1.07 % ...of those cached : 2075
% 0.16/1.07 % Propositional unsat checks : 0
% 0.16/1.07 % Propositional check models : 0
% 0.16/1.07 % Propositional check unsatisfiable : 0
% 0.16/1.07 % Propositional clauses : 0
% 0.16/1.07 % Propositional clauses after purity: 0
% 0.16/1.07 % Propositional unsat core size : 0
% 0.16/1.07 % Propositional preprocessing time : 0.000
% 0.16/1.07 % Propositional encoding time : 0.000
% 0.16/1.07 % Propositional solver time : 0.000
% 0.16/1.07 % Success case prop preproc time : 0.000
% 0.16/1.07 % Success case prop encoding time : 0.000
% 0.16/1.07 % Success case prop solver time : 0.000
% 0.16/1.07 % Current number of processed clauses : 94
% 0.16/1.07 % Positive orientable unit clauses : 84
% 0.16/1.07 % Positive unorientable unit clauses: 9
% 0.16/1.07 % Negative unit clauses : 1
% 0.16/1.07 % Non-unit-clauses : 0
% 0.16/1.07 % Current number of unprocessed clauses: 1732
% 0.16/1.07 % ...number of literals in the above : 1732
% 0.16/1.07 % Current number of archived formulas : 0
% 0.16/1.07 % Current number of archived clauses : 25
% 0.16/1.07 % Clause-clause subsumption calls (NU) : 0
% 0.16/1.07 % Rec. Clause-clause subsumption calls : 0
% 0.16/1.07 % Non-unit clause-clause subsumptions : 0
% 0.16/1.07 % Unit Clause-clause subsumption calls : 22
% 0.16/1.07 % Rewrite failures with RHS unbound : 0
% 0.16/1.07 % BW rewrite match attempts : 180
% 0.16/1.07 % BW rewrite match successes : 132
% 0.16/1.07 % Condensation attempts : 0
% 0.16/1.07 % Condensation successes : 0
% 0.16/1.07 % Termbank termtop insertions : 27977
% 0.16/1.07 % Search garbage collected termcells : 2
% 0.16/1.07
% 0.16/1.07 % -------------------------------------------------
% 0.16/1.07 % User time : 0.034 s
% 0.16/1.07 % System time : 0.005 s
% 0.16/1.07 % Total time : 0.039 s
% 0.16/1.07 % Maximum resident set size: 3640 pages
% 0.16/1.07
% 0.16/1.07 % -------------------------------------------------
% 0.16/1.07 % User time : 0.129 s
% 0.16/1.07 % System time : 0.028 s
% 0.16/1.07 % Total time : 0.158 s
% 0.16/1.07 % Maximum resident set size: 4864 pages
% 0.16/1.07 % E exiting
%------------------------------------------------------------------------------