%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : GRP170-4 : 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 : n006.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:39 PM UTC 2026
% Result : Unsatisfiable 1.92s 1.94s
% Output : CNFRefutation 1.92s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 13
% Syntax : Number of clauses : 48 ( 48 unt; 0 nHn; 14 RR)
% Number of literals : 48 ( 47 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 68 ( 9 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(monotony_lub2,axiom,
multiply(least_upper_bound(X1,X2),X3) = least_upper_bound(multiply(X1,X3),multiply(X2,X3)),
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',monotony_lub2) ).
cnf(left_identity,axiom,
multiply(identity,X1) = X1,
file('/export/starexec/sandbox/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/sandbox/benchmark/Axioms/GRP004-2.ax',symmetry_of_lub) ).
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(p03d_1,hypothesis,
least_upper_bound(a,b) = b,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p03d_1) ).
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(left_inverse,axiom,
multiply(inverse(X1),X1) = identity,
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-0.ax',left_inverse) ).
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(associativity,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-0.ax',associativity) ).
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(p03d_2,hypothesis,
greatest_lower_bound(c,d) = c,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p03d_2) ).
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(prove_p03d,negated_conjecture,
least_upper_bound(multiply(a,c),multiply(b,d)) != multiply(b,d),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_p03d) ).
cnf(c_0_13,axiom,
multiply(least_upper_bound(X1,X2),X3) = least_upper_bound(multiply(X1,X3),multiply(X2,X3)),
monotony_lub2 ).
cnf(c_0_14,axiom,
multiply(identity,X1) = X1,
left_identity ).
cnf(c_0_15,axiom,
least_upper_bound(X1,X2) = least_upper_bound(X2,X1),
symmetry_of_lub ).
cnf(c_0_16,axiom,
greatest_lower_bound(X1,least_upper_bound(X1,X2)) = X1,
glb_absorbtion ).
cnf(c_0_17,hypothesis,
least_upper_bound(a,b) = b,
p03d_1 ).
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_13,c_0_14]),c_0_15]) ).
cnf(c_0_19,axiom,
multiply(X1,greatest_lower_bound(X2,X3)) = greatest_lower_bound(multiply(X1,X2),multiply(X1,X3)),
monotony_glb1 ).
cnf(c_0_20,axiom,
multiply(inverse(X1),X1) = identity,
left_inverse ).
cnf(c_0_21,axiom,
greatest_lower_bound(X1,X2) = greatest_lower_bound(X2,X1),
symmetry_of_glb ).
cnf(c_0_22,plain,
greatest_lower_bound(X1,least_upper_bound(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_16,c_0_15]) ).
cnf(c_0_23,hypothesis,
least_upper_bound(b,a) = b,
inference(rw,[status(thm)],[c_0_17,c_0_15]) ).
cnf(c_0_24,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
associativity ).
cnf(c_0_25,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_26,hypothesis,
greatest_lower_bound(c,d) = c,
p03d_2 ).
cnf(c_0_27,plain,
greatest_lower_bound(X1,multiply(least_upper_bound(X2,identity),X1)) = X1,
inference(spm,[status(thm)],[c_0_16,c_0_18]) ).
cnf(c_0_28,axiom,
least_upper_bound(X1,greatest_lower_bound(X1,X2)) = X1,
lub_absorbtion ).
cnf(c_0_29,plain,
multiply(inverse(X1),greatest_lower_bound(X2,X1)) = greatest_lower_bound(identity,multiply(inverse(X1),X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]) ).
cnf(c_0_30,hypothesis,
greatest_lower_bound(b,a) = a,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_21]) ).
cnf(c_0_31,plain,
multiply(inverse(X1),multiply(X1,X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_20]),c_0_14]) ).
cnf(c_0_32,hypothesis,
greatest_lower_bound(c,greatest_lower_bound(d,X1)) = greatest_lower_bound(c,X1),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_33,plain,
greatest_lower_bound(X1,multiply(least_upper_bound(identity,X2),X1)) = X1,
inference(spm,[status(thm)],[c_0_27,c_0_15]) ).
cnf(c_0_34,plain,
least_upper_bound(X1,greatest_lower_bound(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_28,c_0_21]) ).
cnf(c_0_35,hypothesis,
greatest_lower_bound(identity,multiply(inverse(a),b)) = identity,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_20]) ).
cnf(c_0_36,plain,
multiply(inverse(inverse(X1)),identity) = X1,
inference(spm,[status(thm)],[c_0_31,c_0_20]) ).
cnf(c_0_37,plain,
multiply(inverse(inverse(X1)),X2) = multiply(X1,X2),
inference(spm,[status(thm)],[c_0_31,c_0_31]) ).
cnf(c_0_38,hypothesis,
greatest_lower_bound(c,multiply(least_upper_bound(identity,X1),d)) = c,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_26]) ).
cnf(c_0_39,hypothesis,
least_upper_bound(identity,multiply(inverse(a),b)) = multiply(inverse(a),b),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_15]) ).
cnf(c_0_40,plain,
multiply(X1,identity) = X1,
inference(rw,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_41,plain,
multiply(inverse(X1),greatest_lower_bound(X2,multiply(X1,X3))) = greatest_lower_bound(multiply(inverse(X1),X2),X3),
inference(spm,[status(thm)],[c_0_19,c_0_31]) ).
cnf(c_0_42,hypothesis,
greatest_lower_bound(c,multiply(inverse(a),multiply(b,d))) = c,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_24]) ).
cnf(c_0_43,plain,
inverse(inverse(X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_40]),c_0_40]) ).
cnf(c_0_44,negated_conjecture,
least_upper_bound(multiply(a,c),multiply(b,d)) != multiply(b,d),
prove_p03d ).
cnf(c_0_45,hypothesis,
greatest_lower_bound(multiply(b,d),multiply(a,c)) = multiply(a,c),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_43]),c_0_43]),c_0_21]) ).
cnf(c_0_46,negated_conjecture,
least_upper_bound(multiply(b,d),multiply(a,c)) != multiply(b,d),
inference(rw,[status(thm)],[c_0_44,c_0_15]) ).
cnf(c_0_47,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_45]),c_0_46]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GRP170-4 : 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.33 % Computer : n006.cluster.edu
% 0.15/0.33 % Model : x86_64 x86_64
% 0.15/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.33 % Memory : 8042.1875MB
% 0.15/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.33 % CPULimit : 300
% 0.15/0.33 % WCLimit : 300
% 0.15/0.33 % DateTime : Mon May 4 18:27:01 EDT 2026
% 0.15/0.33 % CPUTime :
% 0.15/0.34 % start to proof: theBenchmark
% 1.92/1.94 % Version : CSE_E---1.7
% 1.92/1.94 % Problem : theBenchmark.p
% 1.92/1.94 % SZS status Unsatisfiable for theBenchmark.p
% 1.92/1.94 % SZS output start CNFRefutation
% See solution above
% 1.92/1.94 % Total time : 1.369s
%------------------------------------------------------------------------------