%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GRP192-1 : 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:38:57 PM UTC 2026
% Result : Unsatisfiable 0.19s 0.46s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 8
% Syntax : Number of clauses : 28 ( 28 unt; 0 nHn; 4 RR)
% Number of literals : 28 ( 27 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 5 ( 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 : 38 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(associativity,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-0.ax',associativity) ).
cnf(left_inverse,axiom,
multiply(inverse(X1),X1) = identity,
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-0.ax',left_inverse) ).
cnf(left_identity,axiom,
multiply(identity,X1) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-0.ax',left_identity) ).
cnf(glb_absorbtion,axiom,
greatest_lower_bound(X1,least_upper_bound(X1,X2)) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-2.ax',glb_absorbtion) ).
cnf(p40a_1,hypothesis,
least_upper_bound(identity,X1) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p40a_1) ).
cnf(symmetry_of_glb,axiom,
greatest_lower_bound(X1,X2) = greatest_lower_bound(X2,X1),
file('/export/starexec/sandbox2/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/sandbox2/benchmark/Axioms/GRP004-2.ax',monotony_glb1) ).
cnf(prove_p40a,negated_conjecture,
multiply(a,b) != multiply(b,a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_p40a) ).
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(inverse(X1))),X1) = identity,
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_14,axiom,
greatest_lower_bound(X1,least_upper_bound(X1,X2)) = X1,
glb_absorbtion ).
cnf(c_0_15,hypothesis,
least_upper_bound(identity,X1) = X1,
p40a_1 ).
cnf(c_0_16,plain,
inverse(inverse(X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_13]),c_0_12]) ).
cnf(c_0_17,axiom,
greatest_lower_bound(X1,X2) = greatest_lower_bound(X2,X1),
symmetry_of_glb ).
cnf(c_0_18,hypothesis,
greatest_lower_bound(identity,X1) = identity,
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,axiom,
multiply(X1,greatest_lower_bound(X2,X3)) = greatest_lower_bound(multiply(X1,X2),multiply(X1,X3)),
monotony_glb1 ).
cnf(c_0_20,plain,
multiply(X1,identity) = X1,
inference(rw,[status(thm)],[c_0_12,c_0_16]) ).
cnf(c_0_21,hypothesis,
greatest_lower_bound(X1,identity) = identity,
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_22,negated_conjecture,
multiply(a,b) != multiply(b,a),
inference(fof_simplification,[status(thm)],[prove_p40a]) ).
cnf(c_0_23,plain,
greatest_lower_bound(X1,multiply(X1,X2)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]),c_0_20]),c_0_17]) ).
cnf(c_0_24,plain,
multiply(X1,inverse(X1)) = identity,
inference(spm,[status(thm)],[c_0_9,c_0_16]) ).
cnf(c_0_25,negated_conjecture,
multiply(a,b) != multiply(b,a),
c_0_22 ).
cnf(c_0_26,plain,
identity = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_21]) ).
cnf(c_0_27,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_26]),c_0_26])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP192-1 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.39 % Computer : n026.cluster.edu
% 0.15/0.39 % Model : x86_64 x86_64
% 0.15/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.39 % Memory : 8046.5625MB
% 0.15/0.39 % OS : Linux 6.8.0-71-generic
% 0.15/0.39 % CPULimit : 300
% 0.15/0.39 % WCLimit : 300
% 0.15/0.39 % DateTime : Sun Sep 20 20:08:22 UTC 2026
% 0.15/0.39 % CPUTime :
% 0.15/0.39 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.44 Running first-order theorem proving
% 0.15/0.44 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.19/0.46 % Version: 3.5.1
% 0.19/0.46 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.46 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.46 % Starting new_bool_3 with 300s (1) cores
% 0.19/0.46 % Starting new_bool_1 with 300s (1) cores
% 0.19/0.46 % Starting sh5l with 300s (1) cores
% 0.19/0.46 % sh5l with pid 484981 completed with status 0
% 0.19/0.46 % Result found by sh5l
% 0.19/0.46 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.46 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.46 % Starting new_bool_3 with 300s (1) cores
% 0.19/0.46 % Starting new_bool_1 with 300s (1) cores
% 0.19/0.46 % Starting sh5l with 300s (1) cores
% 0.19/0.46 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.19/0.46 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.19/0.46 % Search class: FUUPM-FFSF21-SFFFFFNN
% 0.19/0.46 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.46 % Starting SubtermCWHack with 31s (1) cores
% 0.19/0.46 % SubtermCWHack with pid 484987 completed with status 0
% 0.19/0.46 % Result found by SubtermCWHack
% 0.19/0.46 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.46 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.46 % Starting new_bool_3 with 300s (1) cores
% 0.19/0.46 % Starting new_bool_1 with 300s (1) cores
% 0.19/0.46 % Starting sh5l with 300s (1) cores
% 0.19/0.46 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.19/0.46 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.19/0.46 % Search class: FUUPM-FFSF21-SFFFFFNN
% 0.19/0.46 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.46 % Starting SubtermCWHack with 31s (1) cores
% 0.19/0.46 % Preprocessing time : 0.001 s
% 0.19/0.46
% 0.19/0.46 % Proof found!
% 0.19/0.46 % SZS status Unsatisfiable
% 0.19/0.46 % SZS output start CNFRefutation
% See solution above
% 0.19/0.46 % Parsed axioms : 17
% 0.19/0.46 % Removed by relevancy pruning/SinE : 0
% 0.19/0.46 % Initial clauses : 17
% 0.19/0.46 % Removed in clause preprocessing : 0
% 0.19/0.46 % Initial clauses in saturation : 17
% 0.19/0.46 % Processed clauses : 57
% 0.19/0.46 % ...of these trivial : 18
% 0.19/0.46 % ...subsumed : 0
% 0.19/0.46 % ...remaining for further processing : 39
% 0.19/0.46 % Other redundant clauses eliminated : 0
% 0.19/0.46 % Clauses deleted for lack of memory : 0
% 0.19/0.46 % Backward-subsumed : 0
% 0.19/0.46 % Backward-rewritten : 38
% 0.19/0.46 % Generated clauses : 322
% 0.19/0.46 % ...of the previous two non-redundant : 147
% 0.19/0.46 % ...aggressively subsumed : 0
% 0.19/0.46 % Contextual simplify-reflections : 0
% 0.19/0.46 % Paramodulations : 322
% 0.19/0.46 % Factorizations : 0
% 0.19/0.46 % NegExts : 0
% 0.19/0.46 % Equation resolutions : 0
% 0.19/0.46 % Disequality decompositions : 0
% 0.19/0.46 % Total rewrite steps : 377
% 0.19/0.46 % ...of those cached : 181
% 0.19/0.46 % Propositional unsat checks : 0
% 0.19/0.46 % Propositional check models : 0
% 0.19/0.46 % Propositional check unsatisfiable : 0
% 0.19/0.46 % Propositional clauses : 0
% 0.19/0.46 % Propositional clauses after purity: 0
% 0.19/0.46 % Propositional unsat core size : 0
% 0.19/0.46 % Propositional preprocessing time : 0.000
% 0.19/0.46 % Propositional encoding time : 0.000
% 0.19/0.46 % Propositional solver time : 0.000
% 0.19/0.46 % Success case prop preproc time : 0.000
% 0.19/0.46 % Success case prop encoding time : 0.000
% 0.19/0.46 % Success case prop solver time : 0.000
% 0.19/0.46 % Current number of processed clauses : 1
% 0.19/0.46 % Positive orientable unit clauses : 0
% 0.19/0.46 % Positive unorientable unit clauses: 1
% 0.19/0.46 % Negative unit clauses : 0
% 0.19/0.46 % Non-unit-clauses : 0
% 0.19/0.46 % Current number of unprocessed clauses: 88
% 0.19/0.46 % ...number of literals in the above : 88
% 0.19/0.46 % Current number of archived formulas : 0
% 0.19/0.46 % Current number of archived clauses : 38
% 0.19/0.46 % Clause-clause subsumption calls (NU) : 0
% 0.19/0.46 % Rec. Clause-clause subsumption calls : 0
% 0.19/0.46 % Non-unit clause-clause subsumptions : 0
% 0.19/0.46 % Unit Clause-clause subsumption calls : 0
% 0.19/0.46 % Rewrite failures with RHS unbound : 5
% 0.19/0.46 % BW rewrite match attempts : 77
% 0.19/0.46 % BW rewrite match successes : 66
% 0.19/0.46 % Condensation attempts : 0
% 0.19/0.46 % Condensation successes : 0
% 0.19/0.46 % Termbank termtop insertions : 1712
% 0.19/0.46 % Search garbage collected termcells : 2
% 0.19/0.46
% 0.19/0.46 % -------------------------------------------------
% 0.19/0.46 % User time : 0.004 s
% 0.19/0.46 % System time : 0.002 s
% 0.19/0.46 % Total time : 0.006 s
% 0.19/0.46 % Maximum resident set size: 3640 pages
% 0.19/0.46
% 0.19/0.46 % -------------------------------------------------
% 0.19/0.46 % User time : 0.005 s
% 0.19/0.46 % System time : 0.007 s
% 0.19/0.46 % Total time : 0.012 s
% 0.19/0.46 % Maximum resident set size: 4608 pages
% 0.19/0.46 % E exiting
%------------------------------------------------------------------------------