%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : GRP147-1 : TPTP v9.2.1. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n028.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue May 5 04:24:34 PM UTC 2026
% Result : Unsatisfiable 4.61s 3.43s
% Output : CNFRefutation 4.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 8
% Syntax : Number of clauses : 25 ( 25 unt; 0 nHn; 12 RR)
% Number of literals : 25 ( 24 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 : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 28 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(lub_absorbtion,axiom,
least_upper_bound(X1,greatest_lower_bound(X1,X2)) = X1,
file('/export/starexec/sandbox/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/sandbox/benchmark/Axioms/GRP004-2.ax',symmetry_of_glb) ).
cnf(ax_lub1b_2,hypothesis,
greatest_lower_bound(b,c) = b,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax_lub1b_2) ).
cnf(glb_absorbtion,axiom,
greatest_lower_bound(X1,least_upper_bound(X1,X2)) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',glb_absorbtion) ).
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/sandbox/benchmark/Axioms/GRP004-2.ax',associativity_of_lub) ).
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(ax_lub1b_1,hypothesis,
greatest_lower_bound(a,c) = a,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax_lub1b_1) ).
cnf(prove_ax_lub1b,negated_conjecture,
greatest_lower_bound(least_upper_bound(a,b),c) != least_upper_bound(a,b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_ax_lub1b) ).
cnf(c_0_8,axiom,
least_upper_bound(X1,greatest_lower_bound(X1,X2)) = X1,
lub_absorbtion ).
cnf(c_0_9,axiom,
greatest_lower_bound(X1,X2) = greatest_lower_bound(X2,X1),
symmetry_of_glb ).
cnf(c_0_10,plain,
least_upper_bound(X1,greatest_lower_bound(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_11,hypothesis,
greatest_lower_bound(b,c) = b,
ax_lub1b_2 ).
cnf(c_0_12,axiom,
greatest_lower_bound(X1,least_upper_bound(X1,X2)) = X1,
glb_absorbtion ).
cnf(c_0_13,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_14,hypothesis,
least_upper_bound(c,b) = c,
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_15,axiom,
least_upper_bound(X1,X2) = least_upper_bound(X2,X1),
symmetry_of_lub ).
cnf(c_0_16,hypothesis,
greatest_lower_bound(a,c) = a,
ax_lub1b_1 ).
cnf(c_0_17,plain,
greatest_lower_bound(least_upper_bound(X1,X2),least_upper_bound(X1,least_upper_bound(X2,X3))) = least_upper_bound(X1,X2),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_18,hypothesis,
least_upper_bound(b,c) = c,
inference(rw,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,hypothesis,
least_upper_bound(c,a) = c,
inference(spm,[status(thm)],[c_0_10,c_0_16]) ).
cnf(c_0_20,negated_conjecture,
greatest_lower_bound(least_upper_bound(a,b),c) != least_upper_bound(a,b),
prove_ax_lub1b ).
cnf(c_0_21,hypothesis,
greatest_lower_bound(least_upper_bound(X1,b),least_upper_bound(X1,c)) = least_upper_bound(X1,b),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_22,hypothesis,
least_upper_bound(a,c) = c,
inference(rw,[status(thm)],[c_0_19,c_0_15]) ).
cnf(c_0_23,negated_conjecture,
greatest_lower_bound(c,least_upper_bound(a,b)) != least_upper_bound(a,b),
inference(rw,[status(thm)],[c_0_20,c_0_9]) ).
cnf(c_0_24,hypothesis,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_9]),c_0_23]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GRP147-1 : TPTP v9.2.1. Bugfixed v1.2.1.
% 0.00/0.12 % Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.14/0.33 % Computer : n028.cluster.edu
% 0.14/0.33 % Model : x86_64 x86_64
% 0.14/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33 % Memory : 8042.1875MB
% 0.14/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.33 % CPULimit : 300
% 0.14/0.33 % WCLimit : 300
% 0.14/0.33 % DateTime : Mon May 4 18:41:01 EDT 2026
% 0.14/0.34 % CPUTime :
% 0.14/0.35 % start to proof: theBenchmark
% 4.61/3.43 % Version : CSE_E---1.7
% 4.61/3.43 % Problem : theBenchmark.p
% 4.61/3.43 % SZS status Unsatisfiable for theBenchmark.p
% 4.61/3.43 % SZS output start CNFRefutation
% See solution above
% 4.61/3.45 % Total time : 2.375s
%------------------------------------------------------------------------------