%------------------------------------------------------------------------------
% File : Twee---2.7
% Problem : GRP182-2 : TPTP v9.3.1. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run_twee /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n009.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 : Tue Sep 29 10:09:36 AM UTC 2026
% Result : Unsatisfiable 0.10s 0.47s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 3
% Syntax : Number of clauses : 9 ( 9 unt; 0 nHn; 3 RR)
% Number of literals : 9 ( 8 equ; 1 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; 2 con; 0-2 aty)
% Number of variables : 12 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c1,negated_conjecture,
least_upper_bound(identity,greatest_lower_bound(a,identity)) != identity,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_p17a) ).
cnf(c2,axiom,
greatest_lower_bound(X,Y) = greatest_lower_bound(Y,X),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',symmetry_of_glb) ).
cnf(c3,plain,
greatest_lower_bound(X2,X3) = greatest_lower_bound(X3,X2),
inference(substitution,[status(thm)],[c2]) ).
cnf(c4,plain,
least_upper_bound(X3,greatest_lower_bound(X2,X3)) = least_upper_bound(X3,greatest_lower_bound(X3,X2)),
inference(congruence,[status(thm)],[c3]) ).
cnf(c5,axiom,
least_upper_bound(X2,greatest_lower_bound(X2,Y2)) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lub_absorbtion) ).
cnf(c6,plain,
least_upper_bound(X3,greatest_lower_bound(X3,X2)) = X3,
inference(substitution,[status(thm)],[c5]) ).
cnf(c7,plain,
least_upper_bound(X3,greatest_lower_bound(X2,X3)) = X3,
inference(transitivity,[status(thm)],[c4,c6]) ).
cnf(c8,plain,
least_upper_bound(identity,greatest_lower_bound(a,identity)) = identity,
inference(substitution,[status(thm)],[c7]) ).
cnf(c9,plain,
$false,
inference(resolution,[status(thm)],[c1,c8]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP182-2 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.04 % Command : run_twee /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.37 % Computer : n009.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Sun Sep 27 09:36:00 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_twee /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.47 Command-line arguments: --lhs-weight 9 --flip-ordering --complete-subsets --normalise-queue-percent 10 --cp-renormalise-threshold 10
% 0.10/0.47
% 0.10/0.47 % SZS status Unsatisfiable
% 0.10/0.47
% 0.10/0.47 % SZS output start CNFRefutation
% See solution above
% 0.10/0.47
% 0.10/0.47 RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------