%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : GRP184-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 : n017.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:45 PM UTC 2026
% Result : Unsatisfiable 21.40s 13.11s
% Output : CNFRefutation 21.58s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 18
% Syntax : Number of clauses : 88 ( 88 unt; 0 nHn; 7 RR)
% Number of literals : 88 ( 87 equ; 4 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 : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 155 ( 11 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(p21x_3,hypothesis,
inverse(multiply(X1,X2)) = multiply(inverse(X2),inverse(X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p21x_3) ).
cnf(p21x_1,hypothesis,
inverse(identity) = identity,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p21x_1) ).
cnf(left_identity,axiom,
multiply(identity,X1) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-0.ax',left_identity) ).
cnf(p21x_2,hypothesis,
inverse(inverse(X1)) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p21x_2) ).
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(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(left_inverse,axiom,
multiply(inverse(X1),X1) = identity,
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-0.ax',left_inverse) ).
cnf(p21x_4,hypothesis,
inverse(greatest_lower_bound(X1,X2)) = least_upper_bound(inverse(X1),inverse(X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p21x_4) ).
cnf(monotony_glb2,axiom,
multiply(greatest_lower_bound(X1,X2),X3) = greatest_lower_bound(multiply(X1,X3),multiply(X2,X3)),
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',monotony_glb2) ).
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(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(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_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(p21x_5,hypothesis,
inverse(least_upper_bound(X1,X2)) = greatest_lower_bound(inverse(X1),inverse(X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p21x_5) ).
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(associativity,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-0.ax',associativity) ).
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(prove_p21x,negated_conjecture,
multiply(least_upper_bound(a,identity),inverse(greatest_lower_bound(a,identity))) != multiply(inverse(greatest_lower_bound(a,identity)),least_upper_bound(a,identity)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_p21x) ).
cnf(c_0_18,hypothesis,
inverse(multiply(X1,X2)) = multiply(inverse(X2),inverse(X1)),
p21x_3 ).
cnf(c_0_19,hypothesis,
inverse(identity) = identity,
p21x_1 ).
cnf(c_0_20,axiom,
multiply(identity,X1) = X1,
left_identity ).
cnf(c_0_21,hypothesis,
multiply(inverse(X1),identity) = inverse(X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]) ).
cnf(c_0_22,hypothesis,
inverse(inverse(X1)) = X1,
p21x_2 ).
cnf(c_0_23,axiom,
multiply(X1,least_upper_bound(X2,X3)) = least_upper_bound(multiply(X1,X2),multiply(X1,X3)),
monotony_lub1 ).
cnf(c_0_24,hypothesis,
multiply(X1,identity) = X1,
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_25,axiom,
least_upper_bound(X1,X2) = least_upper_bound(X2,X1),
symmetry_of_lub ).
cnf(c_0_26,axiom,
multiply(inverse(X1),X1) = identity,
left_inverse ).
cnf(c_0_27,hypothesis,
inverse(greatest_lower_bound(X1,X2)) = least_upper_bound(inverse(X1),inverse(X2)),
p21x_4 ).
cnf(c_0_28,axiom,
multiply(greatest_lower_bound(X1,X2),X3) = greatest_lower_bound(multiply(X1,X3),multiply(X2,X3)),
monotony_glb2 ).
cnf(c_0_29,axiom,
greatest_lower_bound(X1,X2) = greatest_lower_bound(X2,X1),
symmetry_of_glb ).
cnf(c_0_30,hypothesis,
least_upper_bound(X1,multiply(X1,X2)) = multiply(X1,least_upper_bound(X2,identity)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]) ).
cnf(c_0_31,hypothesis,
multiply(X1,inverse(X1)) = identity,
inference(spm,[status(thm)],[c_0_26,c_0_22]) ).
cnf(c_0_32,hypothesis,
least_upper_bound(identity,inverse(X1)) = inverse(greatest_lower_bound(X1,identity)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_19]),c_0_25]) ).
cnf(c_0_33,axiom,
least_upper_bound(X1,greatest_lower_bound(X1,X2)) = X1,
lub_absorbtion ).
cnf(c_0_34,axiom,
greatest_lower_bound(X1,least_upper_bound(X1,X2)) = X1,
glb_absorbtion ).
cnf(c_0_35,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_36,plain,
greatest_lower_bound(X1,multiply(X2,X1)) = multiply(greatest_lower_bound(X2,identity),X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_20]),c_0_29]) ).
cnf(c_0_37,hypothesis,
multiply(X1,inverse(greatest_lower_bound(X1,identity))) = least_upper_bound(X1,identity),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_25]),c_0_32]) ).
cnf(c_0_38,plain,
least_upper_bound(X1,greatest_lower_bound(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_33,c_0_29]) ).
cnf(c_0_39,plain,
greatest_lower_bound(X1,least_upper_bound(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_34,c_0_25]) ).
cnf(c_0_40,plain,
greatest_lower_bound(X1,greatest_lower_bound(least_upper_bound(X1,X2),X3)) = greatest_lower_bound(X1,X3),
inference(spm,[status(thm)],[c_0_35,c_0_34]) ).
cnf(c_0_41,hypothesis,
greatest_lower_bound(least_upper_bound(X1,identity),inverse(greatest_lower_bound(X1,identity))) = identity,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_31]),c_0_29]) ).
cnf(c_0_42,hypothesis,
inverse(least_upper_bound(X1,X2)) = greatest_lower_bound(inverse(X1),inverse(X2)),
p21x_5 ).
cnf(c_0_43,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_44,plain,
least_upper_bound(X1,least_upper_bound(X2,X1)) = least_upper_bound(X2,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_25]) ).
cnf(c_0_45,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
associativity ).
cnf(c_0_46,axiom,
multiply(X1,greatest_lower_bound(X2,X3)) = greatest_lower_bound(multiply(X1,X2),multiply(X1,X3)),
monotony_glb1 ).
cnf(c_0_47,hypothesis,
inverse(multiply(inverse(X1),X2)) = multiply(inverse(X2),X1),
inference(spm,[status(thm)],[c_0_18,c_0_22]) ).
cnf(c_0_48,plain,
least_upper_bound(X1,greatest_lower_bound(X2,greatest_lower_bound(X3,X1))) = X1,
inference(spm,[status(thm)],[c_0_38,c_0_35]) ).
cnf(c_0_49,hypothesis,
inverse(greatest_lower_bound(inverse(X1),X2)) = least_upper_bound(X1,inverse(X2)),
inference(spm,[status(thm)],[c_0_27,c_0_22]) ).
cnf(c_0_50,hypothesis,
greatest_lower_bound(X1,inverse(greatest_lower_bound(X1,identity))) = greatest_lower_bound(X1,identity),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_51,hypothesis,
inverse(greatest_lower_bound(X1,inverse(X2))) = least_upper_bound(inverse(X1),X2),
inference(spm,[status(thm)],[c_0_27,c_0_22]) ).
cnf(c_0_52,hypothesis,
inverse(least_upper_bound(identity,X1)) = greatest_lower_bound(identity,inverse(X1)),
inference(spm,[status(thm)],[c_0_42,c_0_19]) ).
cnf(c_0_53,plain,
least_upper_bound(X1,least_upper_bound(greatest_lower_bound(X2,X1),X3)) = least_upper_bound(X1,X3),
inference(spm,[status(thm)],[c_0_43,c_0_38]) ).
cnf(c_0_54,plain,
least_upper_bound(X1,least_upper_bound(X2,least_upper_bound(X1,X3))) = least_upper_bound(X2,least_upper_bound(X1,X3)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_43]),c_0_43]) ).
cnf(c_0_55,plain,
multiply(inverse(X1),multiply(X1,X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_26]),c_0_20]) ).
cnf(c_0_56,hypothesis,
multiply(X1,greatest_lower_bound(X2,inverse(X1))) = greatest_lower_bound(identity,multiply(X1,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_31]),c_0_29]) ).
cnf(c_0_57,hypothesis,
inverse(greatest_lower_bound(identity,multiply(inverse(X1),X2))) = least_upper_bound(identity,multiply(inverse(X2),X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_47]),c_0_29]) ).
cnf(c_0_58,plain,
least_upper_bound(X1,least_upper_bound(X2,greatest_lower_bound(X3,X1))) = least_upper_bound(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_34]),c_0_43]) ).
cnf(c_0_59,hypothesis,
least_upper_bound(X1,greatest_lower_bound(identity,inverse(X1))) = least_upper_bound(identity,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_29]),c_0_51]),c_0_19]),c_0_29]),c_0_51]),c_0_19]),c_0_52]) ).
cnf(c_0_60,plain,
least_upper_bound(X1,least_upper_bound(X2,X3)) = least_upper_bound(X2,least_upper_bound(X1,X3)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_34]),c_0_43]),c_0_43]),c_0_54]) ).
cnf(c_0_61,hypothesis,
least_upper_bound(identity,least_upper_bound(X1,inverse(X2))) = least_upper_bound(X1,inverse(greatest_lower_bound(X2,identity))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_49]),c_0_35]),c_0_49]) ).
cnf(c_0_62,hypothesis,
greatest_lower_bound(X1,multiply(X1,X2)) = multiply(X1,greatest_lower_bound(X2,identity)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_24]),c_0_29]) ).
cnf(c_0_63,plain,
multiply(inverse(X1),least_upper_bound(X2,multiply(X1,X3))) = least_upper_bound(multiply(inverse(X1),X2),X3),
inference(spm,[status(thm)],[c_0_23,c_0_55]) ).
cnf(c_0_64,hypothesis,
least_upper_bound(identity,multiply(inverse(X1),X2)) = multiply(inverse(greatest_lower_bound(X1,X2)),X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_56]),c_0_22]),c_0_57]) ).
cnf(c_0_65,hypothesis,
greatest_lower_bound(least_upper_bound(X1,identity),inverse(greatest_lower_bound(identity,X1))) = identity,
inference(spm,[status(thm)],[c_0_41,c_0_29]) ).
cnf(c_0_66,hypothesis,
least_upper_bound(X1,inverse(greatest_lower_bound(X1,identity))) = least_upper_bound(X1,inverse(X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_60]),c_0_25]),c_0_61]),c_0_25]) ).
cnf(c_0_67,hypothesis,
inverse(least_upper_bound(inverse(X1),X2)) = greatest_lower_bound(X1,inverse(X2)),
inference(spm,[status(thm)],[c_0_42,c_0_22]) ).
cnf(c_0_68,hypothesis,
inverse(least_upper_bound(X1,inverse(X2))) = greatest_lower_bound(inverse(X1),X2),
inference(spm,[status(thm)],[c_0_42,c_0_22]) ).
cnf(c_0_69,hypothesis,
inverse(multiply(X1,inverse(X2))) = multiply(X2,inverse(X1)),
inference(spm,[status(thm)],[c_0_18,c_0_22]) ).
cnf(c_0_70,hypothesis,
multiply(greatest_lower_bound(X1,identity),X1) = multiply(X1,greatest_lower_bound(X1,identity)),
inference(spm,[status(thm)],[c_0_62,c_0_36]) ).
cnf(c_0_71,hypothesis,
multiply(X1,greatest_lower_bound(inverse(X1),X2)) = greatest_lower_bound(identity,multiply(X1,X2)),
inference(spm,[status(thm)],[c_0_46,c_0_31]) ).
cnf(c_0_72,negated_conjecture,
multiply(least_upper_bound(a,identity),inverse(greatest_lower_bound(a,identity))) != multiply(inverse(greatest_lower_bound(a,identity)),least_upper_bound(a,identity)),
prove_p21x ).
cnf(c_0_73,hypothesis,
multiply(X1,multiply(inverse(greatest_lower_bound(X1,X2)),X2)) = least_upper_bound(X1,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_64]),c_0_22]),c_0_22]),c_0_24]) ).
cnf(c_0_74,hypothesis,
greatest_lower_bound(least_upper_bound(identity,X1),inverse(greatest_lower_bound(identity,X1))) = identity,
inference(spm,[status(thm)],[c_0_65,c_0_25]) ).
cnf(c_0_75,hypothesis,
least_upper_bound(X1,inverse(greatest_lower_bound(identity,X1))) = least_upper_bound(X1,inverse(X1)),
inference(spm,[status(thm)],[c_0_66,c_0_29]) ).
cnf(c_0_76,hypothesis,
multiply(X1,inverse(multiply(X2,X1))) = inverse(X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_18]),c_0_22]) ).
cnf(c_0_77,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_46,c_0_26]),c_0_29]) ).
cnf(c_0_78,hypothesis,
greatest_lower_bound(X1,greatest_lower_bound(identity,inverse(X1))) = greatest_lower_bound(X1,inverse(X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_66]),c_0_22]),c_0_25]),c_0_68]),c_0_29]),c_0_51]),c_0_19]),c_0_52]),c_0_29]) ).
cnf(c_0_79,hypothesis,
multiply(least_upper_bound(identity,X1),X1) = multiply(X1,least_upper_bound(identity,X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_70]),c_0_29]),c_0_47]),c_0_51]),c_0_19]),c_0_29]),c_0_51]),c_0_19]) ).
cnf(c_0_80,hypothesis,
greatest_lower_bound(identity,multiply(X1,least_upper_bound(identity,X1))) = greatest_lower_bound(identity,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_50]),c_0_29]),c_0_56]),c_0_24]),c_0_29]),c_0_51]),c_0_19]) ).
cnf(c_0_81,negated_conjecture,
multiply(inverse(greatest_lower_bound(identity,a)),least_upper_bound(identity,a)) != multiply(least_upper_bound(identity,a),inverse(greatest_lower_bound(identity,a))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_72,c_0_29]),c_0_29]),c_0_25]),c_0_25]) ).
cnf(c_0_82,hypothesis,
multiply(least_upper_bound(identity,X1),inverse(greatest_lower_bound(identity,X1))) = least_upper_bound(X1,inverse(X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_74]),c_0_19]),c_0_20]),c_0_43]),c_0_75]),c_0_61]),c_0_66]) ).
cnf(c_0_83,hypothesis,
multiply(inverse(multiply(X1,X2)),X1) = inverse(X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_76,c_0_76]),c_0_22]) ).
cnf(c_0_84,hypothesis,
multiply(least_upper_bound(identity,X1),greatest_lower_bound(X1,inverse(X1))) = greatest_lower_bound(identity,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_78]),c_0_51]),c_0_19]),c_0_79]),c_0_80]),c_0_51]),c_0_19]) ).
cnf(c_0_85,negated_conjecture,
multiply(inverse(greatest_lower_bound(identity,a)),least_upper_bound(identity,a)) != least_upper_bound(a,inverse(a)),
inference(rw,[status(thm)],[c_0_81,c_0_82]) ).
cnf(c_0_86,hypothesis,
multiply(inverse(greatest_lower_bound(identity,X1)),least_upper_bound(identity,X1)) = least_upper_bound(X1,inverse(X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_83,c_0_84]),c_0_51]),c_0_25]) ).
cnf(c_0_87,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_85,c_0_86])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GRP184-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.16/0.33 % Computer : n017.cluster.edu
% 0.16/0.33 % Model : x86_64 x86_64
% 0.16/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.33 % Memory : 8042.1875MB
% 0.16/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.33 % CPULimit : 300
% 0.16/0.33 % WCLimit : 300
% 0.16/0.33 % DateTime : Mon May 4 18:27:42 EDT 2026
% 0.16/0.33 % CPUTime :
% 0.16/0.34 % start to proof: theBenchmark
% 21.40/13.11 % Version : CSE_E---1.7
% 21.40/13.11 % Problem : theBenchmark.p
% 21.40/13.11 % SZS status Unsatisfiable for theBenchmark.p
% 21.40/13.11 % SZS output start CNFRefutation
% See solution above
% 21.58/13.20 % Total time : 9.387s
%------------------------------------------------------------------------------