%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GRP168-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 : n006.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:49 PM UTC 2026
% Result : Unsatisfiable 0.15s 5.65s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 4
% Syntax : Number of clauses : 11 ( 11 unt; 0 nHn; 7 RR)
% Number of literals : 11 ( 10 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 : 12 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(prove_p01b,negated_conjecture,
greatest_lower_bound(multiply(inverse(c),multiply(a,c)),multiply(inverse(c),multiply(b,c))) != multiply(inverse(c),multiply(a,c)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_p01b) ).
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(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(p01b_1,hypothesis,
greatest_lower_bound(a,b) = a,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p01b_1) ).
cnf(c_0_4,negated_conjecture,
greatest_lower_bound(multiply(inverse(c),multiply(a,c)),multiply(inverse(c),multiply(b,c))) != multiply(inverse(c),multiply(a,c)),
inference(fof_simplification,[status(thm)],[prove_p01b]) ).
cnf(c_0_5,negated_conjecture,
greatest_lower_bound(multiply(inverse(c),multiply(a,c)),multiply(inverse(c),multiply(b,c))) != multiply(inverse(c),multiply(a,c)),
c_0_4 ).
cnf(c_0_6,axiom,
multiply(X1,greatest_lower_bound(X2,X3)) = greatest_lower_bound(multiply(X1,X2),multiply(X1,X3)),
monotony_glb1 ).
cnf(c_0_7,negated_conjecture,
multiply(inverse(c),greatest_lower_bound(multiply(a,c),multiply(b,c))) != multiply(inverse(c),multiply(a,c)),
inference(rw,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_8,axiom,
multiply(greatest_lower_bound(X1,X2),X3) = greatest_lower_bound(multiply(X1,X3),multiply(X2,X3)),
monotony_glb2 ).
cnf(c_0_9,hypothesis,
greatest_lower_bound(a,b) = a,
p01b_1 ).
cnf(c_0_10,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_7,c_0_8]),c_0_9])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP168-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.11/5.59 % Computer : n006.cluster.edu
% 0.11/5.59 % Model : x86_64 x86_64
% 0.11/5.59 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/5.59 % Memory : 8046.5625MB
% 0.11/5.59 % OS : Linux 6.8.0-71-generic
% 0.11/5.59 % CPULimit : 300
% 0.11/5.59 % WCLimit : 300
% 0.11/5.59 % DateTime : Sun Sep 20 20:03:38 UTC 2026
% 0.11/5.59 % CPUTime :
% 0.11/5.59 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/5.63 Running first-order theorem proving
% 0.15/5.64 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.15/5.65 % Version: 3.5.1
% 0.15/5.65 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/5.65 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.65 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/5.65 % Starting new_bool_3 with 300s (1) cores
% 0.15/5.65 % Starting new_bool_1 with 300s (1) cores
% 0.15/5.65 % Starting sh5l with 300s (1) cores
% 0.15/5.65 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1143993 completed with status 0
% 0.15/5.65 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.15/5.65 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/5.65 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.65 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/5.65 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/5.65 % No SInE strategy applied
% 0.15/5.65 % Search class: FUUPM-FFSF21-MFFFFFNN
% 0.15/5.65 % Scheduled 8 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/5.65 % Starting SubtermCWHack with 136s (1) cores
% 0.15/5.65 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.15/5.65 % Starting H----_047_B31_F1_PI_AE_R4_CS_SP_S2S with 136s (1) cores
% 0.15/5.65 % Starting G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y with 136s (1) cores
% 0.15/5.65 % Starting U----_043_B31_F1_PI_AE_CS_SP_S2S with 136s (1) cores
% 0.15/5.65 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1143999 completed with status 0
% 0.15/5.65 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.15/5.65 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/5.65 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.65 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/5.65 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/5.65 % No SInE strategy applied
% 0.15/5.65 % Search class: FUUPM-FFSF21-MFFFFFNN
% 0.15/5.65 % Scheduled 8 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/5.65 % Starting SubtermCWHack with 136s (1) cores
% 0.15/5.65 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.15/5.65 % Preprocessing time : 0.001 s
% 0.15/5.65 % Presaturation interreduction done
% 0.15/5.65
% 0.15/5.65 % Proof found!
% 0.15/5.65 % SZS status Unsatisfiable
% 0.15/5.65 % SZS output start CNFRefutation
% See solution above
% 0.15/5.65 % Parsed axioms : 17
% 0.15/5.65 % Removed by relevancy pruning/SinE : 0
% 0.15/5.65 % Initial clauses : 17
% 0.15/5.65 % Removed in clause preprocessing : 0
% 0.15/5.65 % Initial clauses in saturation : 17
% 0.15/5.65 % Processed clauses : 15
% 0.15/5.65 % ...of these trivial : 0
% 0.15/5.65 % ...subsumed : 0
% 0.15/5.65 % ...remaining for further processing : 15
% 0.15/5.65 % Other redundant clauses eliminated : 0
% 0.15/5.65 % Clauses deleted for lack of memory : 0
% 0.15/5.65 % Backward-subsumed : 0
% 0.15/5.65 % Backward-rewritten : 2
% 0.15/5.65 % Generated clauses : 0
% 0.15/5.65 % ...of the previous two non-redundant : 1
% 0.15/5.65 % ...aggressively subsumed : 0
% 0.15/5.65 % Contextual simplify-reflections : 0
% 0.15/5.65 % Paramodulations : 0
% 0.15/5.65 % Factorizations : 0
% 0.15/5.65 % NegExts : 0
% 0.15/5.65 % Equation resolutions : 0
% 0.15/5.65 % Disequality decompositions : 0
% 0.15/5.65 % Total rewrite steps : 3
% 0.15/5.65 % ...of those cached : 0
% 0.15/5.65 % Propositional unsat checks : 0
% 0.15/5.65 % Propositional check models : 0
% 0.15/5.65 % Propositional check unsatisfiable : 0
% 0.15/5.65 % Propositional clauses : 0
% 0.15/5.65 % Propositional clauses after purity: 0
% 0.15/5.65 % Propositional unsat core size : 0
% 0.15/5.65 % Propositional preprocessing time : 0.000
% 0.15/5.65 % Propositional encoding time : 0.000
% 0.15/5.65 % Propositional solver time : 0.000
% 0.15/5.65 % Success case prop preproc time : 0.000
% 0.15/5.65 % Success case prop encoding time : 0.000
% 0.15/5.65 % Success case prop solver time : 0.000
% 0.15/5.65 % Current number of processed clauses : 13
% 0.15/5.65 % Positive orientable unit clauses : 11
% 0.15/5.65 % Positive unorientable unit clauses: 2
% 0.15/5.65 % Negative unit clauses : 0
% 0.15/5.65 % Non-unit-clauses : 0
% 0.15/5.65 % Current number of unprocessed clauses: 3
% 0.15/5.65 % ...number of literals in the above : 3
% 0.15/5.65 % Current number of archived formulas : 0
% 0.15/5.65 % Current number of archived clauses : 2
% 0.15/5.65 % Clause-clause subsumption calls (NU) : 0
% 0.15/5.65 % Rec. Clause-clause subsumption calls : 0
% 0.15/5.65 % Non-unit clause-clause subsumptions : 0
% 0.15/5.65 % Unit Clause-clause subsumption calls : 0
% 0.15/5.65 % Rewrite failures with RHS unbound : 0
% 0.15/5.65 % BW rewrite match attempts : 19
% 0.15/5.65 % BW rewrite match successes : 14
% 0.15/5.65 % Condensation attempts : 0
% 0.15/5.65 % Condensation successes : 0
% 0.15/5.65 % Termbank termtop insertions : 249
% 0.15/5.65 % Search garbage collected termcells : 2
% 0.15/5.65
% 0.15/5.65 % -------------------------------------------------
% 0.15/5.65 % User time : 0.001 s
% 0.15/5.65 % System time : 0.004 s
% 0.15/5.65 % Total time : 0.005 s
% 0.15/5.65 % Maximum resident set size: 3640 pages
% 0.15/5.65
% 0.15/5.65 % -------------------------------------------------
% 0.15/5.65 % User time : 0.012 s
% 0.15/5.65 % System time : 0.010 s
% 0.15/5.65 % Total time : 0.023 s
% 0.15/5.65 % Maximum resident set size: 4608 pages
% 0.15/5.65 % E exiting
%------------------------------------------------------------------------------