%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GRP191-2 : 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:57 PM UTC 2026
% Result : Unsatisfiable 0.16s 0.49s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 10
% Syntax : Number of clauses : 34 ( 34 unt; 0 nHn; 9 RR)
% Number of literals : 34 ( 33 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 : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 48 ( 3 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(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(p39d_1,hypothesis,
greatest_lower_bound(a,b) = b,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p39d_1) ).
cnf(prove_p39d,negated_conjecture,
least_upper_bound(inverse(a),inverse(b)) != inverse(b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_p39d) ).
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(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(c_0_10,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
associativity ).
cnf(c_0_11,axiom,
multiply(inverse(X1),X1) = identity,
left_inverse ).
cnf(c_0_12,axiom,
multiply(identity,X1) = X1,
left_identity ).
cnf(c_0_13,plain,
multiply(inverse(X1),multiply(X1,X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12]) ).
cnf(c_0_14,plain,
multiply(inverse(inverse(X1)),identity) = X1,
inference(spm,[status(thm)],[c_0_13,c_0_11]) ).
cnf(c_0_15,plain,
multiply(inverse(inverse(inverse(X1))),X1) = identity,
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_16,plain,
inverse(inverse(X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_15]),c_0_14]) ).
cnf(c_0_17,axiom,
multiply(greatest_lower_bound(X1,X2),X3) = greatest_lower_bound(multiply(X1,X3),multiply(X2,X3)),
monotony_glb2 ).
cnf(c_0_18,plain,
multiply(X1,inverse(X1)) = identity,
inference(spm,[status(thm)],[c_0_11,c_0_16]) ).
cnf(c_0_19,axiom,
greatest_lower_bound(X1,X2) = greatest_lower_bound(X2,X1),
symmetry_of_glb ).
cnf(c_0_20,axiom,
least_upper_bound(X1,greatest_lower_bound(X1,X2)) = X1,
lub_absorbtion ).
cnf(c_0_21,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_17,c_0_18]),c_0_19]) ).
cnf(c_0_22,hypothesis,
greatest_lower_bound(a,b) = b,
p39d_1 ).
cnf(c_0_23,negated_conjecture,
least_upper_bound(inverse(a),inverse(b)) != inverse(b),
inference(fof_simplification,[status(thm)],[prove_p39d]) ).
cnf(c_0_24,axiom,
multiply(X1,least_upper_bound(X2,X3)) = least_upper_bound(multiply(X1,X2),multiply(X1,X3)),
monotony_lub1 ).
cnf(c_0_25,plain,
least_upper_bound(identity,multiply(greatest_lower_bound(X1,X2),inverse(X2))) = identity,
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_26,hypothesis,
greatest_lower_bound(b,a) = b,
inference(rw,[status(thm)],[c_0_22,c_0_19]) ).
cnf(c_0_27,negated_conjecture,
least_upper_bound(inverse(a),inverse(b)) != inverse(b),
c_0_23 ).
cnf(c_0_28,axiom,
least_upper_bound(X1,X2) = least_upper_bound(X2,X1),
symmetry_of_lub ).
cnf(c_0_29,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_24,c_0_13]) ).
cnf(c_0_30,hypothesis,
least_upper_bound(identity,multiply(b,inverse(a))) = identity,
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_31,plain,
multiply(X1,identity) = X1,
inference(rw,[status(thm)],[c_0_14,c_0_16]) ).
cnf(c_0_32,negated_conjecture,
least_upper_bound(inverse(b),inverse(a)) != inverse(b),
inference(rw,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_33,hypothesis,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31]),c_0_31]),c_0_32]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP191-2 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.36 % Computer : n016.cluster.edu
% 0.11/0.36 % Model : x86_64 x86_64
% 0.11/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36 % Memory : 8046.5625MB
% 0.11/0.36 % OS : Linux 6.8.0-71-generic
% 0.11/0.36 % CPULimit : 300
% 0.11/0.36 % WCLimit : 300
% 0.11/0.36 % DateTime : Sun Sep 20 20:10:22 UTC 2026
% 0.11/0.36 % CPUTime :
% 0.11/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.40 Running first-order theorem proving
% 0.11/0.40 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.16/0.49 % Version: 3.5.1
% 0.16/0.49 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.49 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.49 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.49 % Starting new_bool_3 with 300s (1) cores
% 0.16/0.49 % Starting new_bool_1 with 300s (1) cores
% 0.16/0.49 % Starting sh5l with 300s (1) cores
% 0.16/0.49 % new_bool_1 with pid 686659 completed with status 0
% 0.16/0.49 % Result found by new_bool_1
% 0.16/0.49 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.49 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.49 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.49 % Starting new_bool_3 with 300s (1) cores
% 0.16/0.49 % Starting new_bool_1 with 300s (1) cores
% 0.16/0.49 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.16/0.49 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.49 % Search class: FUUPM-FFSF21-SFFFFFNN
% 0.16/0.49 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.49 % Starting SubtermCWHack with 31s (1) cores
% 0.16/0.49 % SubtermCWHack with pid 686666 completed with status 0
% 0.16/0.49 % Result found by SubtermCWHack
% 0.16/0.49 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.49 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.49 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.49 % Starting new_bool_3 with 300s (1) cores
% 0.16/0.49 % Starting new_bool_1 with 300s (1) cores
% 0.16/0.49 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.16/0.49 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.49 % Search class: FUUPM-FFSF21-SFFFFFNN
% 0.16/0.49 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.49 % Starting SubtermCWHack with 31s (1) cores
% 0.16/0.49 % Preprocessing time : 0.001 s
% 0.16/0.49
% 0.16/0.49 % Proof found!
% 0.16/0.49 % SZS status Unsatisfiable
% 0.16/0.49 % SZS output start CNFRefutation
% See solution above
% 0.16/0.49 % Parsed axioms : 17
% 0.16/0.49 % Removed by relevancy pruning/SinE : 0
% 0.16/0.49 % Initial clauses : 17
% 0.16/0.49 % Removed in clause preprocessing : 0
% 0.16/0.49 % Initial clauses in saturation : 17
% 0.16/0.49 % Processed clauses : 818
% 0.16/0.49 % ...of these trivial : 281
% 0.16/0.49 % ...subsumed : 334
% 0.16/0.49 % ...remaining for further processing : 203
% 0.16/0.49 % Other redundant clauses eliminated : 0
% 0.16/0.49 % Clauses deleted for lack of memory : 0
% 0.16/0.49 % Backward-subsumed : 0
% 0.16/0.49 % Backward-rewritten : 27
% 0.16/0.49 % Generated clauses : 13534
% 0.16/0.49 % ...of the previous two non-redundant : 7756
% 0.16/0.49 % ...aggressively subsumed : 0
% 0.16/0.49 % Contextual simplify-reflections : 0
% 0.16/0.49 % Paramodulations : 13534
% 0.16/0.49 % Factorizations : 0
% 0.16/0.49 % NegExts : 0
% 0.16/0.49 % Equation resolutions : 0
% 0.16/0.49 % Disequality decompositions : 0
% 0.16/0.49 % Total rewrite steps : 14942
% 0.16/0.49 % ...of those cached : 10736
% 0.16/0.49 % Propositional unsat checks : 0
% 0.16/0.49 % Propositional check models : 0
% 0.16/0.49 % Propositional check unsatisfiable : 0
% 0.16/0.49 % Propositional clauses : 0
% 0.16/0.49 % Propositional clauses after purity: 0
% 0.16/0.49 % Propositional unsat core size : 0
% 0.16/0.49 % Propositional preprocessing time : 0.000
% 0.16/0.49 % Propositional encoding time : 0.000
% 0.16/0.49 % Propositional solver time : 0.000
% 0.16/0.49 % Success case prop preproc time : 0.000
% 0.16/0.49 % Success case prop encoding time : 0.000
% 0.16/0.49 % Success case prop solver time : 0.000
% 0.16/0.49 % Current number of processed clauses : 176
% 0.16/0.49 % Positive orientable unit clauses : 161
% 0.16/0.49 % Positive unorientable unit clauses: 14
% 0.16/0.49 % Negative unit clauses : 1
% 0.16/0.49 % Non-unit-clauses : 0
% 0.16/0.49 % Current number of unprocessed clauses: 6913
% 0.16/0.49 % ...number of literals in the above : 6913
% 0.16/0.49 % Current number of archived formulas : 0
% 0.16/0.49 % Current number of archived clauses : 27
% 0.16/0.49 % Clause-clause subsumption calls (NU) : 0
% 0.16/0.49 % Rec. Clause-clause subsumption calls : 0
% 0.16/0.49 % Non-unit clause-clause subsumptions : 0
% 0.16/0.49 % Unit Clause-clause subsumption calls : 36
% 0.16/0.49 % Rewrite failures with RHS unbound : 0
% 0.16/0.49 % BW rewrite match attempts : 507
% 0.16/0.49 % BW rewrite match successes : 275
% 0.16/0.49 % Condensation attempts : 0
% 0.16/0.49 % Condensation successes : 0
% 0.16/0.49 % Termbank termtop insertions : 119798
% 0.16/0.49 % Search garbage collected termcells : 2
% 0.16/0.49
% 0.16/0.49 % -------------------------------------------------
% 0.16/0.49 % User time : 0.057 s
% 0.16/0.49 % System time : 0.006 s
% 0.16/0.49 % Total time : 0.063 s
% 0.16/0.49 % Maximum resident set size: 3640 pages
% 0.16/0.49
% 0.16/0.49 % -------------------------------------------------
% 0.16/0.49 % User time : 0.059 s
% 0.16/0.49 % System time : 0.011 s
% 0.16/0.49 % Total time : 0.069 s
% 0.16/0.49 % Maximum resident set size: 4864 pages
% 0.16/0.49 % E exiting
%------------------------------------------------------------------------------