%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GRP170-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 : n016.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 1.71s 0.82s
% Output : CNFRefutation 1.71s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 15
% Syntax : Number of clauses : 57 ( 57 unt; 0 nHn; 14 RR)
% Number of literals : 57 ( 56 equ; 4 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 : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 88 ( 14 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(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(associativity_of_lub,axiom,
least_upper_bound(X1,least_upper_bound(X2,X3)) = least_upper_bound(least_upper_bound(X1,X2),X3),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-2.ax',associativity_of_lub) ).
cnf(p03a_1,hypothesis,
least_upper_bound(a,b) = b,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p03a_1) ).
cnf(monotony_glb2,axiom,
multiply(greatest_lower_bound(X1,X2),X3) = greatest_lower_bound(multiply(X1,X3),multiply(X2,X3)),
file('/export/starexec/sandbox2/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/sandbox2/benchmark/Axioms/GRP004-2.ax',symmetry_of_glb) ).
cnf(lub_absorbtion,axiom,
least_upper_bound(X1,greatest_lower_bound(X1,X2)) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-2.ax',lub_absorbtion) ).
cnf(associativity_of_glb,axiom,
greatest_lower_bound(X1,greatest_lower_bound(X2,X3)) = greatest_lower_bound(greatest_lower_bound(X1,X2),X3),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-2.ax',associativity_of_glb) ).
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(p03a_2,hypothesis,
least_upper_bound(c,d) = d,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p03a_2) ).
cnf(monotony_lub2,axiom,
multiply(least_upper_bound(X1,X2),X3) = least_upper_bound(multiply(X1,X3),multiply(X2,X3)),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-2.ax',monotony_lub2) ).
cnf(prove_p03a,negated_conjecture,
least_upper_bound(multiply(a,c),multiply(b,d)) != multiply(b,d),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_p03a) ).
cnf(c_0_15,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
associativity ).
cnf(c_0_16,axiom,
multiply(inverse(X1),X1) = identity,
left_inverse ).
cnf(c_0_17,axiom,
multiply(identity,X1) = X1,
left_identity ).
cnf(c_0_18,plain,
multiply(inverse(X1),multiply(X1,X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]) ).
cnf(c_0_19,plain,
multiply(inverse(inverse(X1)),identity) = X1,
inference(spm,[status(thm)],[c_0_18,c_0_16]) ).
cnf(c_0_20,plain,
multiply(inverse(inverse(inverse(X1))),X1) = identity,
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_21,axiom,
greatest_lower_bound(X1,least_upper_bound(X1,X2)) = X1,
glb_absorbtion ).
cnf(c_0_22,axiom,
least_upper_bound(X1,X2) = least_upper_bound(X2,X1),
symmetry_of_lub ).
cnf(c_0_23,plain,
inverse(inverse(X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_20]),c_0_19]) ).
cnf(c_0_24,plain,
greatest_lower_bound(X1,least_upper_bound(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_25,axiom,
least_upper_bound(X1,least_upper_bound(X2,X3)) = least_upper_bound(least_upper_bound(X1,X2),X3),
associativity_of_lub ).
cnf(c_0_26,hypothesis,
least_upper_bound(a,b) = b,
p03a_1 ).
cnf(c_0_27,axiom,
multiply(greatest_lower_bound(X1,X2),X3) = greatest_lower_bound(multiply(X1,X3),multiply(X2,X3)),
monotony_glb2 ).
cnf(c_0_28,plain,
multiply(X1,inverse(X1)) = identity,
inference(spm,[status(thm)],[c_0_16,c_0_23]) ).
cnf(c_0_29,axiom,
greatest_lower_bound(X1,X2) = greatest_lower_bound(X2,X1),
symmetry_of_glb ).
cnf(c_0_30,plain,
greatest_lower_bound(X1,least_upper_bound(X2,least_upper_bound(X3,X1))) = X1,
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_31,hypothesis,
least_upper_bound(b,a) = b,
inference(rw,[status(thm)],[c_0_26,c_0_22]) ).
cnf(c_0_32,axiom,
least_upper_bound(X1,greatest_lower_bound(X1,X2)) = X1,
lub_absorbtion ).
cnf(c_0_33,plain,
greatest_lower_bound(identity,multiply(X1,inverse(X2))) = multiply(greatest_lower_bound(X1,X2),inverse(X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29]) ).
cnf(c_0_34,hypothesis,
greatest_lower_bound(a,least_upper_bound(X1,b)) = a,
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_35,plain,
least_upper_bound(identity,multiply(greatest_lower_bound(X1,X2),inverse(X2))) = identity,
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_36,hypothesis,
greatest_lower_bound(a,least_upper_bound(b,X1)) = a,
inference(spm,[status(thm)],[c_0_34,c_0_22]) ).
cnf(c_0_37,plain,
least_upper_bound(X1,greatest_lower_bound(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_32,c_0_29]) ).
cnf(c_0_38,axiom,
greatest_lower_bound(X1,greatest_lower_bound(X2,X3)) = greatest_lower_bound(greatest_lower_bound(X1,X2),X3),
associativity_of_glb ).
cnf(c_0_39,axiom,
multiply(X1,least_upper_bound(X2,X3)) = least_upper_bound(multiply(X1,X2),multiply(X1,X3)),
monotony_lub1 ).
cnf(c_0_40,hypothesis,
least_upper_bound(identity,multiply(a,inverse(least_upper_bound(b,X1)))) = identity,
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_41,plain,
least_upper_bound(X1,greatest_lower_bound(X2,greatest_lower_bound(X3,X1))) = X1,
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_42,hypothesis,
least_upper_bound(c,d) = d,
p03a_2 ).
cnf(c_0_43,axiom,
multiply(least_upper_bound(X1,X2),X3) = least_upper_bound(multiply(X1,X3),multiply(X2,X3)),
monotony_lub2 ).
cnf(c_0_44,plain,
multiply(inverse(X1),least_upper_bound(X2,multiply(X1,X3))) = least_upper_bound(multiply(inverse(X1),X2),X3),
inference(spm,[status(thm)],[c_0_39,c_0_18]) ).
cnf(c_0_45,hypothesis,
least_upper_bound(identity,multiply(a,inverse(b))) = identity,
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_46,plain,
multiply(X1,identity) = X1,
inference(rw,[status(thm)],[c_0_19,c_0_23]) ).
cnf(c_0_47,hypothesis,
least_upper_bound(d,c) = d,
inference(rw,[status(thm)],[c_0_42,c_0_22]) ).
cnf(c_0_48,plain,
least_upper_bound(X1,multiply(X2,multiply(X3,X1))) = multiply(least_upper_bound(X2,inverse(X3)),multiply(X3,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_18]),c_0_22]) ).
cnf(c_0_49,hypothesis,
least_upper_bound(inverse(b),inverse(a)) = inverse(a),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_46]),c_0_46]),c_0_22]) ).
cnf(c_0_50,negated_conjecture,
least_upper_bound(multiply(a,c),multiply(b,d)) != multiply(b,d),
inference(fof_simplification,[status(thm)],[prove_p03a]) ).
cnf(c_0_51,hypothesis,
least_upper_bound(d,least_upper_bound(c,X1)) = least_upper_bound(d,X1),
inference(spm,[status(thm)],[c_0_25,c_0_47]) ).
cnf(c_0_52,hypothesis,
least_upper_bound(X1,multiply(inverse(b),multiply(a,X1))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_18]) ).
cnf(c_0_53,negated_conjecture,
least_upper_bound(multiply(a,c),multiply(b,d)) != multiply(b,d),
c_0_50 ).
cnf(c_0_54,hypothesis,
least_upper_bound(d,multiply(inverse(b),multiply(a,c))) = d,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_47]) ).
cnf(c_0_55,negated_conjecture,
least_upper_bound(multiply(b,d),multiply(a,c)) != multiply(b,d),
inference(rw,[status(thm)],[c_0_53,c_0_22]) ).
cnf(c_0_56,hypothesis,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_54]),c_0_23]),c_0_23]),c_0_55]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP170-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.11/0.37 % Computer : n016.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Sun Sep 20 20:08:24 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.45 Running first-order theorem proving
% 0.11/0.45 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
% 1.71/0.82 % Version: 3.5.1
% 1.71/0.82 % Preprocessing class: FSMSSMSSSSSNFFN.
% 1.71/0.82 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.71/0.82 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.71/0.82 % Starting new_bool_3 with 300s (1) cores
% 1.71/0.82 % Starting new_bool_1 with 300s (1) cores
% 1.71/0.82 % Starting sh5l with 300s (1) cores
% 1.71/0.82 % sh5l with pid 681696 completed with status 0
% 1.71/0.82 % Result found by sh5l
% 1.71/0.82 % Preprocessing class: FSMSSMSSSSSNFFN.
% 1.71/0.82 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.71/0.82 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.71/0.82 % Starting new_bool_3 with 300s (1) cores
% 1.71/0.82 % Starting new_bool_1 with 300s (1) cores
% 1.71/0.82 % Starting sh5l with 300s (1) cores
% 1.71/0.82 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 1.71/0.82 % SinE strategy is gf500_gu_R04_F100_L20000
% 1.71/0.82 % Search class: FUUPM-FFSF21-SFFFFFNN
% 1.71/0.82 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 1.71/0.82 % Starting SubtermCWHack with 31s (1) cores
% 1.71/0.82 % SubtermCWHack with pid 681699 completed with status 0
% 1.71/0.82 % Result found by SubtermCWHack
% 1.71/0.82 % Preprocessing class: FSMSSMSSSSSNFFN.
% 1.71/0.82 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.71/0.82 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.71/0.82 % Starting new_bool_3 with 300s (1) cores
% 1.71/0.82 % Starting new_bool_1 with 300s (1) cores
% 1.71/0.82 % Starting sh5l with 300s (1) cores
% 1.71/0.82 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 1.71/0.82 % SinE strategy is gf500_gu_R04_F100_L20000
% 1.71/0.82 % Search class: FUUPM-FFSF21-SFFFFFNN
% 1.71/0.82 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 1.71/0.82 % Starting SubtermCWHack with 31s (1) cores
% 1.71/0.82 % Preprocessing time : 0.001 s
% 1.71/0.82
% 1.71/0.82 % Proof found!
% 1.71/0.82 % SZS status Unsatisfiable
% 1.71/0.82 % SZS output start CNFRefutation
% See solution above
% 1.71/0.82 % Parsed axioms : 18
% 1.71/0.82 % Removed by relevancy pruning/SinE : 0
% 1.71/0.82 % Initial clauses : 18
% 1.71/0.82 % Removed in clause preprocessing : 0
% 1.71/0.82 % Initial clauses in saturation : 18
% 1.71/0.82 % Processed clauses : 1332
% 1.71/0.82 % ...of these trivial : 640
% 1.71/0.82 % ...subsumed : 339
% 1.71/0.82 % ...remaining for further processing : 353
% 1.71/0.82 % Other redundant clauses eliminated : 0
% 1.71/0.82 % Clauses deleted for lack of memory : 0
% 1.71/0.82 % Backward-subsumed : 0
% 1.71/0.82 % Backward-rewritten : 39
% 1.71/0.82 % Generated clauses : 31057
% 1.71/0.82 % ...of the previous two non-redundant : 17276
% 1.71/0.82 % ...aggressively subsumed : 0
% 1.71/0.82 % Contextual simplify-reflections : 0
% 1.71/0.82 % Paramodulations : 31057
% 1.71/0.82 % Factorizations : 0
% 1.71/0.82 % NegExts : 0
% 1.71/0.82 % Equation resolutions : 0
% 1.71/0.82 % Disequality decompositions : 0
% 1.71/0.82 % Total rewrite steps : 36356
% 1.71/0.82 % ...of those cached : 27278
% 1.71/0.82 % Propositional unsat checks : 0
% 1.71/0.82 % Propositional check models : 0
% 1.71/0.82 % Propositional check unsatisfiable : 0
% 1.71/0.82 % Propositional clauses : 0
% 1.71/0.82 % Propositional clauses after purity: 0
% 1.71/0.82 % Propositional unsat core size : 0
% 1.71/0.82 % Propositional preprocessing time : 0.000
% 1.71/0.82 % Propositional encoding time : 0.000
% 1.71/0.82 % Propositional solver time : 0.000
% 1.71/0.82 % Success case prop preproc time : 0.000
% 1.71/0.82 % Success case prop encoding time : 0.000
% 1.71/0.82 % Success case prop solver time : 0.000
% 1.71/0.82 % Current number of processed clauses : 314
% 1.71/0.82 % Positive orientable unit clauses : 290
% 1.71/0.82 % Positive unorientable unit clauses: 23
% 1.71/0.82 % Negative unit clauses : 1
% 1.71/0.82 % Non-unit-clauses : 0
% 1.71/0.82 % Current number of unprocessed clauses: 15882
% 1.71/0.82 % ...number of literals in the above : 15882
% 1.71/0.82 % Current number of archived formulas : 0
% 1.71/0.82 % Current number of archived clauses : 39
% 1.71/0.82 % Clause-clause subsumption calls (NU) : 0
% 1.71/0.82 % Rec. Clause-clause subsumption calls : 0
% 1.71/0.82 % Non-unit clause-clause subsumptions : 0
% 1.71/0.82 % Unit Clause-clause subsumption calls : 50
% 1.71/0.82 % Rewrite failures with RHS unbound : 0
% 1.71/0.82 % BW rewrite match attempts : 781
% 1.71/0.82 % BW rewrite match successes : 336
% 1.71/0.82 % Condensation attempts : 0
% 1.71/0.82 % Condensation successes : 0
% 1.71/0.82 % Termbank termtop insertions : 303111
% 1.71/0.82 % Search garbage collected termcells : 2
% 1.71/0.82
% 1.71/0.82 % -------------------------------------------------
% 1.71/0.82 % User time : 0.226 s
% 1.71/0.82 % System time : 0.020 s
% 1.71/0.82 % Total time : 0.246 s
% 1.71/0.82 % Maximum resident set size: 3640 pages
% 1.71/0.82
% 1.71/0.82 % -------------------------------------------------
% 1.71/0.82 % User time : 0.227 s
% 1.71/0.82 % System time : 0.028 s
% 1.71/0.82 % Total time : 0.255 s
% 1.71/0.82 % Maximum resident set size: 4864 pages
% 1.71/0.82 % E exiting
%------------------------------------------------------------------------------