%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : GRP171-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 : n011.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:42:45 PM UTC 2026
% Result : Unsatisfiable 0.15s 0.61s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 10
% Syntax : Number of clauses : 29 ( 29 unt; 0 nHn; 9 RR)
% Number of literals : 29 ( 28 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 4 ( 1 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 : 38 ( 8 sgn)
% Comments :
%------------------------------------------------------------------------------
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(p04a_2,hypothesis,
least_upper_bound(identity,b) = b,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p04a_2) ).
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(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(left_identity,axiom,
multiply(identity,X1) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-0.ax',left_identity) ).
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(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(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(p04a_1,hypothesis,
least_upper_bound(identity,a) = a,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p04a_1) ).
cnf(prove_p04a,negated_conjecture,
least_upper_bound(identity,multiply(a,b)) != multiply(a,b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_p04a) ).
cnf(c_0_10,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_11,hypothesis,
least_upper_bound(identity,b) = b,
p04a_2 ).
cnf(c_0_12,axiom,
greatest_lower_bound(X1,least_upper_bound(X1,X2)) = X1,
glb_absorbtion ).
cnf(c_0_13,hypothesis,
least_upper_bound(identity,least_upper_bound(b,X1)) = least_upper_bound(b,X1),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_14,axiom,
multiply(least_upper_bound(X1,X2),X3) = least_upper_bound(multiply(X1,X3),multiply(X2,X3)),
monotony_lub2 ).
cnf(c_0_15,axiom,
multiply(identity,X1) = X1,
left_identity ).
cnf(c_0_16,axiom,
least_upper_bound(X1,X2) = least_upper_bound(X2,X1),
symmetry_of_lub ).
cnf(c_0_17,hypothesis,
greatest_lower_bound(identity,least_upper_bound(b,X1)) = identity,
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_18,plain,
least_upper_bound(X1,multiply(X2,X1)) = multiply(least_upper_bound(X2,identity),X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]) ).
cnf(c_0_19,hypothesis,
greatest_lower_bound(identity,multiply(least_upper_bound(X1,identity),b)) = identity,
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_20,axiom,
least_upper_bound(X1,greatest_lower_bound(X1,X2)) = X1,
lub_absorbtion ).
cnf(c_0_21,axiom,
greatest_lower_bound(X1,X2) = greatest_lower_bound(X2,X1),
symmetry_of_glb ).
cnf(c_0_22,hypothesis,
greatest_lower_bound(identity,multiply(least_upper_bound(identity,X1),b)) = identity,
inference(spm,[status(thm)],[c_0_19,c_0_16]) ).
cnf(c_0_23,hypothesis,
least_upper_bound(identity,a) = a,
p04a_1 ).
cnf(c_0_24,negated_conjecture,
least_upper_bound(identity,multiply(a,b)) != multiply(a,b),
inference(fof_simplification,[status(thm)],[prove_p04a]) ).
cnf(c_0_25,plain,
least_upper_bound(X1,greatest_lower_bound(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_26,hypothesis,
greatest_lower_bound(identity,multiply(a,b)) = identity,
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_27,negated_conjecture,
least_upper_bound(identity,multiply(a,b)) != multiply(a,b),
c_0_24 ).
cnf(c_0_28,hypothesis,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_16]),c_0_27]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GRP171-1 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.53 % Computer : n011.cluster.edu
% 0.09/0.53 % Model : x86_64 x86_64
% 0.09/0.53 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.53 % Memory : 8046.5625MB
% 0.09/0.53 % OS : Linux 6.8.0-71-generic
% 0.09/0.53 % CPULimit : 300
% 0.09/0.53 % WCLimit : 300
% 0.09/0.53 % DateTime : Sun Sep 20 20:03:41 UTC 2026
% 0.09/0.53 % CPUTime :
% 0.09/0.53 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.58 Running first-order theorem proving
% 0.15/0.58 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.15/0.61 % Version: 3.5.1
% 0.15/0.61 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.61 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.61 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.61 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.61 % Starting new_bool_1 with 300s (1) cores
% 0.15/0.61 % Starting sh5l with 300s (1) cores
% 0.15/0.61 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 50834 completed with status 0
% 0.15/0.61 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.15/0.61 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.61 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.61 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.61 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/0.61 % No SInE strategy applied
% 0.15/0.61 % Search class: FUUPM-FFSF21-SFFFFFNN
% 0.15/0.61 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.61 % Starting SubtermCWHack with 136s (1) cores
% 0.15/0.61 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.15/0.61 % Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 0.15/0.61 % Starting new_bool_3 with 136s (1) cores
% 0.15/0.61 % Starting new_bool_1 with 136s (1) cores
% 0.15/0.61 % SAT001_MinMin_p005000_rr_RG with pid 50841 completed with status 0
% 0.15/0.61 % Result found by SAT001_MinMin_p005000_rr_RG
% 0.15/0.61 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.61 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.61 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.61 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/0.61 % No SInE strategy applied
% 0.15/0.61 % Search class: FUUPM-FFSF21-SFFFFFNN
% 0.15/0.61 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.61 % Starting SubtermCWHack with 136s (1) cores
% 0.15/0.61 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.15/0.61 % Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 0.15/0.61 % Preprocessing time : 0.001 s
% 0.15/0.61 % Presaturation interreduction done
% 0.15/0.61
% 0.15/0.61 % Proof found!
% 0.15/0.61 % SZS status Unsatisfiable
% 0.15/0.61 % SZS output start CNFRefutation
% See solution above
% 0.15/0.61 % Parsed axioms : 18
% 0.15/0.61 % Removed by relevancy pruning/SinE : 0
% 0.15/0.61 % Initial clauses : 18
% 0.15/0.61 % Removed in clause preprocessing : 0
% 0.15/0.61 % Initial clauses in saturation : 18
% 0.15/0.61 % Processed clauses : 258
% 0.15/0.61 % ...of these trivial : 84
% 0.15/0.61 % ...subsumed : 62
% 0.15/0.61 % ...remaining for further processing : 111
% 0.15/0.61 % Other redundant clauses eliminated : 0
% 0.15/0.61 % Clauses deleted for lack of memory : 0
% 0.15/0.61 % Backward-subsumed : 0
% 0.15/0.61 % Backward-rewritten : 8
% 0.15/0.61 % Generated clauses : 2369
% 0.15/0.61 % ...of the previous two non-redundant : 1257
% 0.15/0.61 % ...aggressively subsumed : 0
% 0.15/0.61 % Contextual simplify-reflections : 0
% 0.15/0.61 % Paramodulations : 2369
% 0.15/0.61 % Factorizations : 0
% 0.15/0.61 % NegExts : 0
% 0.15/0.61 % Equation resolutions : 0
% 0.15/0.61 % Disequality decompositions : 0
% 0.15/0.61 % Total rewrite steps : 2357
% 0.15/0.61 % ...of those cached : 1610
% 0.15/0.61 % Propositional unsat checks : 0
% 0.15/0.61 % Propositional check models : 0
% 0.15/0.61 % Propositional check unsatisfiable : 0
% 0.15/0.61 % Propositional clauses : 0
% 0.15/0.61 % Propositional clauses after purity: 0
% 0.15/0.61 % Propositional unsat core size : 0
% 0.15/0.61 % Propositional preprocessing time : 0.000
% 0.15/0.61 % Propositional encoding time : 0.000
% 0.15/0.61 % Propositional solver time : 0.000
% 0.15/0.61 % Success case prop preproc time : 0.000
% 0.15/0.61 % Success case prop encoding time : 0.000
% 0.15/0.61 % Success case prop solver time : 0.000
% 0.15/0.61 % Current number of processed clauses : 85
% 0.15/0.61 % Positive orientable unit clauses : 78
% 0.15/0.61 % Positive unorientable unit clauses: 6
% 0.15/0.61 % Negative unit clauses : 1
% 0.15/0.61 % Non-unit-clauses : 0
% 0.15/0.61 % Current number of unprocessed clauses: 1026
% 0.15/0.61 % ...number of literals in the above : 1026
% 0.15/0.61 % Current number of archived formulas : 0
% 0.15/0.61 % Current number of archived clauses : 26
% 0.15/0.61 % Clause-clause subsumption calls (NU) : 0
% 0.15/0.61 % Rec. Clause-clause subsumption calls : 0
% 0.15/0.61 % Non-unit clause-clause subsumptions : 0
% 0.15/0.61 % Unit Clause-clause subsumption calls : 14
% 0.15/0.61 % Rewrite failures with RHS unbound : 0
% 0.15/0.61 % BW rewrite match attempts : 206
% 0.15/0.61 % BW rewrite match successes : 138
% 0.15/0.61 % Condensation attempts : 0
% 0.15/0.61 % Condensation successes : 0
% 0.15/0.61 % Termbank termtop insertions : 17681
% 0.15/0.61 % Search garbage collected termcells : 2
% 0.15/0.61
% 0.15/0.61 % -------------------------------------------------
% 0.15/0.61 % User time : 0.012 s
% 0.15/0.61 % System time : 0.005 s
% 0.15/0.61 % Total time : 0.017 s
% 0.15/0.61 % Maximum resident set size: 3640 pages
% 0.15/0.61
% 0.15/0.61 % -------------------------------------------------
% 0.15/0.61 % User time : 0.067 s
% 0.15/0.61 % System time : 0.015 s
% 0.15/0.61 % Total time : 0.082 s
% 0.15/0.61 % Maximum resident set size: 4608 pages
% 0.15/0.61 % E exiting
%------------------------------------------------------------------------------