%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GRP181-3 : 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 : n013.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:53 PM UTC 2026
% Result : Unsatisfiable 59.27s 9.13s
% Output : CNFRefutation 59.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 11
% Syntax : Number of clauses : 45 ( 45 unt; 0 nHn; 11 RR)
% Number of literals : 45 ( 44 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 : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 62 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(associativity,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-0.ax',associativity) ).
cnf(left_inverse,axiom,
multiply(inverse(X1),X1) = identity,
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-0.ax',left_inverse) ).
cnf(left_identity,axiom,
multiply(identity,X1) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-0.ax',left_identity) ).
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(symmetry_of_glb,axiom,
greatest_lower_bound(X1,X2) = greatest_lower_bound(X2,X1),
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',symmetry_of_glb) ).
cnf(p12x_3,hypothesis,
inverse(greatest_lower_bound(X1,X2)) = least_upper_bound(inverse(X1),inverse(X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p12x_3) ).
cnf(monotony_lub1,axiom,
multiply(X1,least_upper_bound(X2,X3)) = least_upper_bound(multiply(X1,X2),multiply(X1,X3)),
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',monotony_lub1) ).
cnf(p12x_2,hypothesis,
least_upper_bound(a,c) = least_upper_bound(b,c),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p12x_2) ).
cnf(symmetry_of_lub,axiom,
least_upper_bound(X1,X2) = least_upper_bound(X2,X1),
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',symmetry_of_lub) ).
cnf(p12x_1,hypothesis,
greatest_lower_bound(a,c) = greatest_lower_bound(b,c),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p12x_1) ).
cnf(prove_p12x,negated_conjecture,
a != b,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_p12x) ).
cnf(c_0_11,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
associativity ).
cnf(c_0_12,axiom,
multiply(inverse(X1),X1) = identity,
left_inverse ).
cnf(c_0_13,axiom,
multiply(identity,X1) = X1,
left_identity ).
cnf(c_0_14,plain,
multiply(inverse(X1),multiply(X1,X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13]) ).
cnf(c_0_15,plain,
multiply(inverse(inverse(X1)),identity) = X1,
inference(spm,[status(thm)],[c_0_14,c_0_12]) ).
cnf(c_0_16,plain,
multiply(inverse(inverse(inverse(X1))),X1) = identity,
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_17,plain,
inverse(inverse(X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_16]),c_0_15]) ).
cnf(c_0_18,plain,
multiply(X1,inverse(X1)) = identity,
inference(spm,[status(thm)],[c_0_12,c_0_17]) ).
cnf(c_0_19,plain,
multiply(inverse(identity),X1) = X1,
inference(spm,[status(thm)],[c_0_14,c_0_13]) ).
cnf(c_0_20,plain,
multiply(X1,multiply(X2,inverse(multiply(X1,X2)))) = identity,
inference(spm,[status(thm)],[c_0_11,c_0_18]) ).
cnf(c_0_21,plain,
multiply(X1,identity) = X1,
inference(rw,[status(thm)],[c_0_15,c_0_17]) ).
cnf(c_0_22,plain,
multiply(inverse(inverse(identity)),X1) = X1,
inference(spm,[status(thm)],[c_0_14,c_0_19]) ).
cnf(c_0_23,plain,
multiply(X1,inverse(multiply(X2,X1))) = inverse(X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_20]),c_0_21]) ).
cnf(c_0_24,axiom,
multiply(X1,greatest_lower_bound(X2,X3)) = greatest_lower_bound(multiply(X1,X2),multiply(X1,X3)),
monotony_glb1 ).
cnf(c_0_25,axiom,
greatest_lower_bound(X1,X2) = greatest_lower_bound(X2,X1),
symmetry_of_glb ).
cnf(c_0_26,hypothesis,
inverse(greatest_lower_bound(X1,X2)) = least_upper_bound(inverse(X1),inverse(X2)),
p12x_3 ).
cnf(c_0_27,plain,
inverse(identity) = identity,
inference(spm,[status(thm)],[c_0_12,c_0_22]) ).
cnf(c_0_28,plain,
multiply(inverse(multiply(X1,X2)),X1) = inverse(X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_23]),c_0_17]) ).
cnf(c_0_29,plain,
multiply(X1,multiply(inverse(X1),X2)) = X2,
inference(spm,[status(thm)],[c_0_14,c_0_17]) ).
cnf(c_0_30,plain,
greatest_lower_bound(identity,multiply(inverse(X1),X2)) = multiply(inverse(X1),greatest_lower_bound(X2,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_12]),c_0_25]) ).
cnf(c_0_31,hypothesis,
inverse(greatest_lower_bound(identity,X1)) = least_upper_bound(identity,inverse(X1)),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_32,plain,
inverse(multiply(inverse(X1),X2)) = multiply(inverse(X2),X1),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_33,axiom,
multiply(X1,least_upper_bound(X2,X3)) = least_upper_bound(multiply(X1,X2),multiply(X1,X3)),
monotony_lub1 ).
cnf(c_0_34,plain,
multiply(greatest_lower_bound(X1,X2),least_upper_bound(identity,multiply(inverse(X1),X2))) = X2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_30]),c_0_31]),c_0_32]),c_0_17]) ).
cnf(c_0_35,plain,
least_upper_bound(identity,multiply(inverse(X1),X2)) = multiply(inverse(X1),least_upper_bound(X1,X2)),
inference(spm,[status(thm)],[c_0_33,c_0_12]) ).
cnf(c_0_36,hypothesis,
least_upper_bound(a,c) = least_upper_bound(b,c),
p12x_2 ).
cnf(c_0_37,axiom,
least_upper_bound(X1,X2) = least_upper_bound(X2,X1),
symmetry_of_lub ).
cnf(c_0_38,hypothesis,
greatest_lower_bound(a,c) = greatest_lower_bound(b,c),
p12x_1 ).
cnf(c_0_39,negated_conjecture,
a != b,
inference(fof_simplification,[status(thm)],[prove_p12x]) ).
cnf(c_0_40,plain,
multiply(greatest_lower_bound(X1,X2),multiply(inverse(X1),least_upper_bound(X1,X2))) = X2,
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_41,hypothesis,
least_upper_bound(c,a) = least_upper_bound(c,b),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_37]),c_0_37]) ).
cnf(c_0_42,hypothesis,
greatest_lower_bound(c,a) = greatest_lower_bound(c,b),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_38,c_0_25]),c_0_25]) ).
cnf(c_0_43,negated_conjecture,
a != b,
c_0_39 ).
cnf(c_0_44,hypothesis,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42]),c_0_40]),c_0_43]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP181-3 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.36 % Computer : n013.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.37 % DateTime : Sun Sep 20 20:03:51 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/0.44 Running first-order theorem proving
% 0.14/0.45 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
% 59.27/9.13 % Version: 3.5.1
% 59.27/9.13 % Preprocessing class: FSMSSMSSSSSNFFN.
% 59.27/9.13 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 59.27/9.13 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 59.27/9.13 % Starting new_bool_3 with 300s (1) cores
% 59.27/9.13 % Starting new_bool_1 with 300s (1) cores
% 59.27/9.13 % Starting sh5l with 300s (1) cores
% 59.27/9.13 % new_bool_1 with pid 3294312 completed with status 0
% 59.27/9.13 % Result found by new_bool_1
% 59.27/9.13 % Preprocessing class: FSMSSMSSSSSNFFN.
% 59.27/9.13 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 59.27/9.13 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 59.27/9.13 % Starting new_bool_3 with 300s (1) cores
% 59.27/9.13 % Starting new_bool_1 with 300s (1) cores
% 59.27/9.13 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 59.27/9.13 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 59.27/9.13 % Search class: FUUPM-FFSF21-SFFFFFNN
% 59.27/9.13 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 59.27/9.13 % Starting SubtermCWHack with 31s (1) cores
% 59.27/9.13 % SubtermCWHack with pid 3294319 completed with status 0
% 59.27/9.13 % Result found by SubtermCWHack
% 59.27/9.13 % Preprocessing class: FSMSSMSSSSSNFFN.
% 59.27/9.13 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 59.27/9.13 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 59.27/9.13 % Starting new_bool_3 with 300s (1) cores
% 59.27/9.13 % Starting new_bool_1 with 300s (1) cores
% 59.27/9.13 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 59.27/9.13 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 59.27/9.13 % Search class: FUUPM-FFSF21-SFFFFFNN
% 59.27/9.13 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 59.27/9.13 % Starting SubtermCWHack with 31s (1) cores
% 59.27/9.13 % Preprocessing time : 0.002 s
% 59.27/9.13
% 59.27/9.13 % Proof found!
% 59.27/9.13 % SZS status Unsatisfiable
% 59.27/9.13 % SZS output start CNFRefutation
% See solution above
% 59.27/9.13 % Parsed axioms : 20
% 59.27/9.13 % Removed by relevancy pruning/SinE : 0
% 59.27/9.13 % Initial clauses : 20
% 59.27/9.13 % Removed in clause preprocessing : 0
% 59.27/9.13 % Initial clauses in saturation : 20
% 59.27/9.13 % Processed clauses : 17191
% 59.27/9.13 % ...of these trivial : 6761
% 59.27/9.13 % ...subsumed : 9077
% 59.27/9.13 % ...remaining for further processing : 1353
% 59.27/9.13 % Other redundant clauses eliminated : 0
% 59.27/9.13 % Clauses deleted for lack of memory : 0
% 59.27/9.13 % Backward-subsumed : 0
% 59.27/9.13 % Backward-rewritten : 110
% 59.27/9.13 % Generated clauses : 602526
% 59.27/9.13 % ...of the previous two non-redundant : 385616
% 59.27/9.13 % ...aggressively subsumed : 0
% 59.27/9.13 % Contextual simplify-reflections : 0
% 59.27/9.13 % Paramodulations : 602526
% 59.27/9.13 % Factorizations : 0
% 59.27/9.13 % NegExts : 0
% 59.27/9.13 % Equation resolutions : 0
% 59.27/9.13 % Disequality decompositions : 0
% 59.27/9.13 % Total rewrite steps : 965147
% 59.27/9.13 % ...of those cached : 776540
% 59.27/9.13 % Propositional unsat checks : 0
% 59.27/9.13 % Propositional check models : 0
% 59.27/9.13 % Propositional check unsatisfiable : 0
% 59.27/9.13 % Propositional clauses : 0
% 59.27/9.13 % Propositional clauses after purity: 0
% 59.27/9.13 % Propositional unsat core size : 0
% 59.27/9.13 % Propositional preprocessing time : 0.000
% 59.27/9.13 % Propositional encoding time : 0.000
% 59.27/9.13 % Propositional solver time : 0.000
% 59.27/9.13 % Success case prop preproc time : 0.000
% 59.27/9.13 % Success case prop encoding time : 0.000
% 59.27/9.13 % Success case prop solver time : 0.000
% 59.27/9.13 % Current number of processed clauses : 1243
% 59.27/9.13 % Positive orientable unit clauses : 1195
% 59.27/9.13 % Positive unorientable unit clauses: 47
% 59.27/9.13 % Negative unit clauses : 1
% 59.27/9.13 % Non-unit-clauses : 0
% 59.27/9.13 % Current number of unprocessed clauses: 367259
% 59.27/9.13 % ...number of literals in the above : 367259
% 59.27/9.13 % Current number of archived formulas : 0
% 59.27/9.13 % Current number of archived clauses : 110
% 59.27/9.13 % Clause-clause subsumption calls (NU) : 0
% 59.27/9.13 % Rec. Clause-clause subsumption calls : 0
% 59.27/9.13 % Non-unit clause-clause subsumptions : 0
% 59.27/9.13 % Unit Clause-clause subsumption calls : 270
% 59.27/9.13 % Rewrite failures with RHS unbound : 0
% 59.27/9.13 % BW rewrite match attempts : 8439
% 59.27/9.13 % BW rewrite match successes : 728
% 59.27/9.13 % Condensation attempts : 0
% 59.27/9.13 % Condensation successes : 0
% 59.27/9.13 % Termbank termtop insertions : 8480952
% 59.27/9.13 % Search garbage collected termcells : 2
% 59.27/9.13
% 59.27/9.13 % -------------------------------------------------
% 59.27/9.13 % User time : 8.098 s
% 59.27/9.13 % System time : 0.348 s
% 59.27/9.13 % Total time : 8.446 s
% 59.27/9.13 % Maximum resident set size: 3640 pages
% 59.27/9.13
% 59.27/9.13 % -------------------------------------------------
% 59.27/9.13 % User time : 8.100 s
% 59.27/9.13 % System time : 0.355 s
% 59.27/9.13 % Total time : 8.455 s
% 59.27/9.13 % Maximum resident set size: 4864 pages
% 59.27/9.13 % E exiting
%------------------------------------------------------------------------------