%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : GRP186-4 : TPTP v9.3.1. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n026.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 0.24s 0.56s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 5
% Syntax : Number of clauses : 14 ( 14 unt; 0 nHn; 5 RR)
% Number of literals : 14 ( 13 equ; 4 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 : 15 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(prove_p23x,negated_conjecture,
least_upper_bound(multiply(a,b),identity) != multiply(a,least_upper_bound(inverse(a),b)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_p23x) ).
cnf(symmetry_of_lub,axiom,
least_upper_bound(X1,X2) = least_upper_bound(X2,X1),
file('/export/starexec/sandbox2/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/sandbox2/benchmark/Axioms/GRP004-2.ax',monotony_lub1) ).
cnf(left_inverse,axiom,
multiply(inverse(X1),X1) = identity,
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-0.ax',left_inverse) ).
cnf(p23x_2,hypothesis,
inverse(inverse(X1)) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p23x_2) ).
cnf(c_0_5,negated_conjecture,
least_upper_bound(multiply(a,b),identity) != multiply(a,least_upper_bound(inverse(a),b)),
inference(fof_simplification,[status(thm)],[prove_p23x]) ).
cnf(c_0_6,negated_conjecture,
least_upper_bound(multiply(a,b),identity) != multiply(a,least_upper_bound(inverse(a),b)),
c_0_5 ).
cnf(c_0_7,axiom,
least_upper_bound(X1,X2) = least_upper_bound(X2,X1),
symmetry_of_lub ).
cnf(c_0_8,axiom,
multiply(X1,least_upper_bound(X2,X3)) = least_upper_bound(multiply(X1,X2),multiply(X1,X3)),
monotony_lub1 ).
cnf(c_0_9,axiom,
multiply(inverse(X1),X1) = identity,
left_inverse ).
cnf(c_0_10,hypothesis,
inverse(inverse(X1)) = X1,
p23x_2 ).
cnf(c_0_11,negated_conjecture,
least_upper_bound(multiply(a,b),multiply(a,inverse(a))) != least_upper_bound(identity,multiply(a,b)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_6,c_0_7]),c_0_7]),c_0_8]) ).
cnf(c_0_12,hypothesis,
multiply(X1,inverse(X1)) = identity,
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_13,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_12]),c_0_7])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : GRP186-4 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.20/0.46 % Computer : n026.cluster.edu
% 0.20/0.46 % Model : x86_64 x86_64
% 0.20/0.46 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.20/0.46 % Memory : 8046.5625MB
% 0.20/0.46 % OS : Linux 6.8.0-71-generic
% 0.20/0.46 % CPULimit : 300
% 0.20/0.46 % WCLimit : 300
% 0.20/0.46 % DateTime : Sun Sep 20 20:07:53 UTC 2026
% 0.20/0.46 % CPUTime :
% 0.20/0.46 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.24/0.53 Running first-order theorem proving
% 0.24/0.53 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 0.24/0.56 % Version: 3.5.1
% 0.24/0.56 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.24/0.56 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.56 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.24/0.56 % Starting new_bool_3 with 300s (1) cores
% 0.24/0.56 % Starting new_bool_1 with 300s (1) cores
% 0.24/0.56 % Starting sh5l with 300s (1) cores
% 0.24/0.56 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 483629 completed with status 0
% 0.24/0.56 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.24/0.56 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.24/0.56 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.56 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.24/0.56 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.24/0.56 % No SInE strategy applied
% 0.24/0.56 % Search class: FUUPM-FFSF21-MFFFFFNN
% 0.24/0.56 % Scheduled 8 strats onto 5 cores with 1500 seconds (1500 total)
% 0.24/0.56 % Starting SubtermCWHack with 136s (1) cores
% 0.24/0.56 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.24/0.56 % Starting H----_047_B31_F1_PI_AE_R4_CS_SP_S2S with 136s (1) cores
% 0.24/0.56 % Starting G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y with 136s (1) cores
% 0.24/0.56 % Starting U----_043_B31_F1_PI_AE_CS_SP_S2S with 136s (1) cores
% 0.24/0.56 % U----_043_B31_F1_PI_AE_CS_SP_S2S with pid 483640 completed with status 0
% 0.24/0.56 % Result found by U----_043_B31_F1_PI_AE_CS_SP_S2S
% 0.24/0.56 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.24/0.56 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.56 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.24/0.56 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.24/0.56 % No SInE strategy applied
% 0.24/0.56 % Search class: FUUPM-FFSF21-MFFFFFNN
% 0.24/0.56 % Scheduled 8 strats onto 5 cores with 1500 seconds (1500 total)
% 0.24/0.56 % Starting SubtermCWHack with 136s (1) cores
% 0.24/0.56 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.24/0.56 % Starting H----_047_B31_F1_PI_AE_R4_CS_SP_S2S with 136s (1) cores
% 0.24/0.56 % Starting G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y with 136s (1) cores
% 0.24/0.56 % Starting U----_043_B31_F1_PI_AE_CS_SP_S2S with 136s (1) cores
% 0.24/0.56 % Preprocessing time : 0.002 s
% 0.24/0.56
% 0.24/0.56 % Proof found!
% 0.24/0.56 % SZS status Unsatisfiable
% 0.24/0.56 % SZS output start CNFRefutation
% See solution above
% 0.24/0.56 % Parsed axioms : 19
% 0.24/0.56 % Removed by relevancy pruning/SinE : 0
% 0.24/0.56 % Initial clauses : 19
% 0.24/0.56 % Removed in clause preprocessing : 0
% 0.24/0.56 % Initial clauses in saturation : 19
% 0.24/0.56 % Processed clauses : 21
% 0.24/0.56 % ...of these trivial : 0
% 0.24/0.56 % ...subsumed : 0
% 0.24/0.56 % ...remaining for further processing : 21
% 0.24/0.56 % Other redundant clauses eliminated : 0
% 0.24/0.56 % Clauses deleted for lack of memory : 0
% 0.24/0.56 % Backward-subsumed : 0
% 0.24/0.56 % Backward-rewritten : 2
% 0.24/0.56 % Generated clauses : 104
% 0.24/0.56 % ...of the previous two non-redundant : 62
% 0.24/0.56 % ...aggressively subsumed : 0
% 0.24/0.56 % Contextual simplify-reflections : 0
% 0.24/0.56 % Paramodulations : 104
% 0.24/0.56 % Factorizations : 0
% 0.24/0.56 % NegExts : 0
% 0.24/0.56 % Equation resolutions : 0
% 0.24/0.56 % Disequality decompositions : 0
% 0.24/0.56 % Total rewrite steps : 99
% 0.24/0.56 % ...of those cached : 34
% 0.24/0.56 % Propositional unsat checks : 0
% 0.24/0.56 % Propositional check models : 0
% 0.24/0.56 % Propositional check unsatisfiable : 0
% 0.24/0.56 % Propositional clauses : 0
% 0.24/0.56 % Propositional clauses after purity: 0
% 0.24/0.56 % Propositional unsat core size : 0
% 0.24/0.56 % Propositional preprocessing time : 0.000
% 0.24/0.56 % Propositional encoding time : 0.000
% 0.24/0.56 % Propositional solver time : 0.000
% 0.24/0.56 % Success case prop preproc time : 0.000
% 0.24/0.56 % Success case prop encoding time : 0.000
% 0.24/0.56 % Success case prop solver time : 0.000
% 0.24/0.56 % Current number of processed clauses : 19
% 0.24/0.56 % Positive orientable unit clauses : 17
% 0.24/0.56 % Positive unorientable unit clauses: 2
% 0.24/0.56 % Negative unit clauses : 0
% 0.24/0.56 % Non-unit-clauses : 0
% 0.24/0.56 % Current number of unprocessed clauses: 60
% 0.24/0.56 % ...number of literals in the above : 60
% 0.24/0.56 % Current number of archived formulas : 0
% 0.24/0.56 % Current number of archived clauses : 2
% 0.24/0.56 % Clause-clause subsumption calls (NU) : 0
% 0.24/0.56 % Rec. Clause-clause subsumption calls : 0
% 0.24/0.56 % Non-unit clause-clause subsumptions : 0
% 0.24/0.56 % Unit Clause-clause subsumption calls : 0
% 0.24/0.56 % Rewrite failures with RHS unbound : 0
% 0.24/0.56 % BW rewrite match attempts : 21
% 0.24/0.56 % BW rewrite match successes : 17
% 0.24/0.56 % Condensation attempts : 0
% 0.24/0.56 % Condensation successes : 0
% 0.24/0.56 % Termbank termtop insertions : 1041
% 0.24/0.56 % Search garbage collected termcells : 2
% 0.24/0.56
% 0.24/0.56 % -------------------------------------------------
% 0.24/0.56 % User time : 0.005 s
% 0.24/0.56 % System time : 0.005 s
% 0.24/0.56 % Total time : 0.010 s
% 0.24/0.56 % Maximum resident set size: 3640 pages
% 0.24/0.56
% 0.24/0.56 % -------------------------------------------------
% 0.24/0.56 % User time : 0.032 s
% 0.24/0.56 % System time : 0.020 s
% 0.24/0.56 % Total time : 0.052 s
% 0.24/0.56 % Maximum resident set size: 4608 pages
% 0.24/0.56 % E exiting
%------------------------------------------------------------------------------