%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : GRP139-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 : n022.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:33 PM UTC 2026
% Result : Unsatisfiable 1.26s 1.72s
% Output : CNFRefutation 1.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 5
% Syntax : Number of clauses : 15 ( 15 unt; 0 nHn; 10 RR)
% Number of literals : 15 ( 14 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 11 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(ax_glb1b_1_1,hypothesis,
greatest_lower_bound(a,c) = c,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax_glb1b_1_1) ).
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(prove_ax_glb1b,negated_conjecture,
greatest_lower_bound(greatest_lower_bound(a,b),c) != c,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_ax_glb1b) ).
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/sandbox/benchmark/Axioms/GRP004-2.ax',associativity_of_glb) ).
cnf(ax_glb1b_2_2,hypothesis,
greatest_lower_bound(b,c) = c,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax_glb1b_2_2) ).
cnf(c_0_5,hypothesis,
greatest_lower_bound(a,c) = c,
ax_glb1b_1_1 ).
cnf(c_0_6,axiom,
greatest_lower_bound(X1,X2) = greatest_lower_bound(X2,X1),
symmetry_of_glb ).
cnf(c_0_7,negated_conjecture,
greatest_lower_bound(greatest_lower_bound(a,b),c) != c,
prove_ax_glb1b ).
cnf(c_0_8,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_9,hypothesis,
greatest_lower_bound(c,a) = c,
inference(rw,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_10,hypothesis,
greatest_lower_bound(b,c) = c,
ax_glb1b_2_2 ).
cnf(c_0_11,negated_conjecture,
greatest_lower_bound(c,greatest_lower_bound(a,b)) != c,
inference(rw,[status(thm)],[c_0_7,c_0_6]) ).
cnf(c_0_12,hypothesis,
greatest_lower_bound(c,greatest_lower_bound(a,X1)) = greatest_lower_bound(c,X1),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_13,hypothesis,
greatest_lower_bound(c,b) = c,
inference(rw,[status(thm)],[c_0_10,c_0_6]) ).
cnf(c_0_14,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_12]),c_0_13])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GRP139-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.15/0.34 % Computer : n022.cluster.edu
% 0.15/0.34 % Model : x86_64 x86_64
% 0.15/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.34 % Memory : 8042.1875MB
% 0.15/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.34 % CPULimit : 300
% 0.15/0.34 % WCLimit : 300
% 0.15/0.34 % DateTime : Mon May 4 18:25:36 EDT 2026
% 0.15/0.34 % CPUTime :
% 0.15/0.35 % start to proof: theBenchmark
% 1.26/1.72 % Version : CSE_E---1.7
% 1.26/1.72 % Problem : theBenchmark.p
% 1.26/1.72 % SZS status Unsatisfiable for theBenchmark.p
% 1.26/1.72 % SZS output start CNFRefutation
% See solution above
% 1.26/1.72 % Total time : 1.371s
%------------------------------------------------------------------------------