↑ Up

Twee---2.7.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Twee---2.7
% Problem  : GRP166-1 : TPTP v9.3.1. Bugfixed v1.2.1.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_twee /export/starexec/sandbox/benchmark/theBenchmark.p

% Computer : n003.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:29 AM UTC 2026

% Result   : Unsatisfiable 0.18s 0.50s
% Output   : CNFRefutation 0.18s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   18
%            Number of leaves      :   10
% Syntax   : Number of clauses     :   53 (  53 unt;   0 nHn;  11 RR)
%            Number of literals    :   53 (  52 equ;   1 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    :    7 (   7 usr;   3 con; 0-2 aty)
%            Number of variables   :   68 (   2 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(c1,negated_conjecture,
    least_upper_bound(a,multiply(a,b)) != multiply(a,b),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_lat2a) ).

cnf(c2,axiom,
    least_upper_bound(X,Y) = least_upper_bound(Y,X),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',symmetry_of_lub) ).

cnf(c3,plain,
    least_upper_bound(X2,multiply(X2,b)) = least_upper_bound(multiply(X2,b),X2),
    inference(substitution,[status(thm)],[c2]) ).

cnf(c4,axiom,
    multiply(multiply(X2,Y2),Z) = multiply(X2,multiply(Y2,Z)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',associativity) ).

cnf(c5,plain,
    multiply(multiply(inverse(X2),X2),X3) = multiply(inverse(X2),multiply(X2,X3)),
    inference(substitution,[status(thm)],[c4]) ).

cnf(c6,plain,
    multiply(inverse(X3),multiply(X3,X2)) = multiply(multiply(inverse(X3),X3),X2),
    inference(symmetry,[status(thm)],[c5]) ).

cnf(c7,axiom,
    multiply(inverse(X2),X2) = identity,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',step) ).

cnf(c8,plain,
    multiply(multiply(inverse(X3),X3),X2) = multiply(identity,X2),
    inference(congruence,[status(thm)],[c7]) ).

cnf(c9,axiom,
    multiply(identity,X2) = X2,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',step) ).

cnf(c10,plain,
    multiply(multiply(inverse(X3),X3),X2) = X2,
    inference(transitivity,[status(thm)],[c8,c9]) ).

cnf(c11,plain,
    multiply(inverse(X3),multiply(X3,X2)) = X2,
    inference(transitivity,[status(thm)],[c6,c10]) ).

cnf(c12,plain,
    X2 = multiply(inverse(X3),multiply(X3,X2)),
    inference(symmetry,[status(thm)],[c11]) ).

cnf(c13,plain,
    multiply(inverse(inverse(X3)),X2) = multiply(inverse(inverse(X3)),multiply(inverse(X3),multiply(X3,X2))),
    inference(congruence,[status(thm)],[c12]) ).

cnf(c14,plain,
    multiply(inverse(inverse(X3)),multiply(inverse(X3),multiply(X3,X2))) = multiply(X3,X2),
    inference(substitution,[status(thm)],[c11]) ).

cnf(c15,plain,
    multiply(inverse(inverse(X3)),X2) = multiply(X3,X2),
    inference(transitivity,[status(thm)],[c13,c14]) ).

cnf(c16,plain,
    multiply(inverse(inverse(X2)),identity) = multiply(X2,identity),
    inference(substitution,[status(thm)],[c15]) ).

cnf(c17,plain,
    multiply(X2,identity) = multiply(inverse(inverse(X2)),identity),
    inference(symmetry,[status(thm)],[c16]) ).

cnf(c18,plain,
    identity = multiply(inverse(X2),X2),
    inference(symmetry,[status(thm)],[c7]) ).

cnf(c19,plain,
    multiply(inverse(inverse(X2)),identity) = multiply(inverse(inverse(X2)),multiply(inverse(X2),X2)),
    inference(congruence,[status(thm)],[c18]) ).

cnf(c20,plain,
    multiply(inverse(inverse(X2)),multiply(inverse(X2),X2)) = X2,
    inference(substitution,[status(thm)],[c11]) ).

cnf(c21,plain,
    multiply(inverse(inverse(X2)),identity) = X2,
    inference(transitivity,[status(thm)],[c19,c20]) ).

cnf(c22,plain,
    multiply(X2,identity) = X2,
    inference(transitivity,[status(thm)],[c17,c21]) ).

cnf(c23,plain,
    X2 = multiply(X2,identity),
    inference(symmetry,[status(thm)],[c22]) ).

cnf(c24,plain,
    greatest_lower_bound(multiply(X2,b),X2) = greatest_lower_bound(multiply(X2,b),multiply(X2,identity)),
    inference(congruence,[status(thm)],[c23]) ).

cnf(c25,axiom,
    multiply(X2,greatest_lower_bound(Y2,Z2)) = greatest_lower_bound(multiply(X2,Y2),multiply(X2,Z2)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',monotony_glb1) ).

cnf(c26,plain,
    multiply(X3,greatest_lower_bound(X4,X2)) = greatest_lower_bound(multiply(X3,X4),multiply(X3,X2)),
    inference(substitution,[status(thm)],[c25]) ).

cnf(c27,plain,
    greatest_lower_bound(multiply(X4,X2),multiply(X4,X3)) = multiply(X4,greatest_lower_bound(X2,X3)),
    inference(symmetry,[status(thm)],[c26]) ).

cnf(c28,axiom,
    greatest_lower_bound(X2,Y2) = greatest_lower_bound(Y2,X2),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',symmetry_of_glb) ).

cnf(c29,plain,
    greatest_lower_bound(X2,X3) = greatest_lower_bound(X3,X2),
    inference(substitution,[status(thm)],[c28]) ).

cnf(c30,plain,
    multiply(X4,greatest_lower_bound(X2,X3)) = multiply(X4,greatest_lower_bound(X3,X2)),
    inference(congruence,[status(thm)],[c29]) ).

cnf(c31,plain,
    greatest_lower_bound(multiply(X4,X2),multiply(X4,X3)) = multiply(X4,greatest_lower_bound(X3,X2)),
    inference(transitivity,[status(thm)],[c27,c30]) ).

cnf(c32,plain,
    greatest_lower_bound(multiply(X2,b),multiply(X2,identity)) = multiply(X2,greatest_lower_bound(identity,b)),
    inference(substitution,[status(thm)],[c31]) ).

cnf(c33,plain,
    least_upper_bound(b,identity) = least_upper_bound(identity,b),
    inference(substitution,[status(thm)],[c2]) ).

cnf(c34,plain,
    least_upper_bound(identity,b) = least_upper_bound(b,identity),
    inference(symmetry,[status(thm)],[c33]) ).

cnf(c35,axiom,
    least_upper_bound(b,identity) = b,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',step) ).

cnf(c36,plain,
    least_upper_bound(identity,b) = b,
    inference(transitivity,[status(thm)],[c34,c35]) ).

cnf(c37,plain,
    b = least_upper_bound(identity,b),
    inference(symmetry,[status(thm)],[c36]) ).

cnf(c38,plain,
    greatest_lower_bound(identity,b) = greatest_lower_bound(identity,least_upper_bound(identity,b)),
    inference(congruence,[status(thm)],[c37]) ).

cnf(c39,axiom,
    greatest_lower_bound(X2,least_upper_bound(X2,Y2)) = X2,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',glb_absorbtion) ).

cnf(c40,plain,
    greatest_lower_bound(identity,least_upper_bound(identity,b)) = identity,
    inference(substitution,[status(thm)],[c39]) ).

cnf(c41,plain,
    greatest_lower_bound(identity,b) = identity,
    inference(transitivity,[status(thm)],[c38,c40]) ).

cnf(c42,plain,
    multiply(X2,greatest_lower_bound(identity,b)) = multiply(X2,identity),
    inference(congruence,[status(thm)],[c41]) ).

cnf(c43,plain,
    multiply(X2,greatest_lower_bound(identity,b)) = X2,
    inference(transitivity,[status(thm)],[c42,c22]) ).

cnf(c44,plain,
    greatest_lower_bound(multiply(X2,b),multiply(X2,identity)) = X2,
    inference(transitivity,[status(thm)],[c32,c43]) ).

cnf(c45,plain,
    greatest_lower_bound(multiply(X2,b),X2) = X2,
    inference(transitivity,[status(thm)],[c24,c44]) ).

cnf(c46,plain,
    X2 = greatest_lower_bound(multiply(X2,b),X2),
    inference(symmetry,[status(thm)],[c45]) ).

cnf(c47,plain,
    least_upper_bound(multiply(X2,b),X2) = least_upper_bound(multiply(X2,b),greatest_lower_bound(multiply(X2,b),X2)),
    inference(congruence,[status(thm)],[c46]) ).

cnf(c48,axiom,
    least_upper_bound(X2,greatest_lower_bound(X2,Y2)) = X2,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',lub_absorbtion) ).

cnf(c49,plain,
    least_upper_bound(multiply(X2,b),greatest_lower_bound(multiply(X2,b),X2)) = multiply(X2,b),
    inference(substitution,[status(thm)],[c48]) ).

cnf(c50,plain,
    least_upper_bound(multiply(X2,b),X2) = multiply(X2,b),
    inference(transitivity,[status(thm)],[c47,c49]) ).

cnf(c51,plain,
    least_upper_bound(X2,multiply(X2,b)) = multiply(X2,b),
    inference(transitivity,[status(thm)],[c3,c50]) ).

cnf(c52,plain,
    least_upper_bound(a,multiply(a,b)) = multiply(a,b),
    inference(substitution,[status(thm)],[c51]) ).

cnf(c53,plain,
    $false,
    inference(resolution,[status(thm)],[c1,c52]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : GRP166-1 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.04  % Command  : run_twee /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.37  % Computer : n003.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:25 UTC 2026
% 0.10/0.37  % CPUTime  : 
% 0.10/0.37  Running run_twee /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.50  Command-line arguments: --flatten-regeneralise
% 0.18/0.50  
% 0.18/0.50  % SZS status Unsatisfiable
% 0.18/0.50  
% 0.18/0.51  % SZS output start CNFRefutation
% See solution above
% 0.18/0.53  
% 0.18/0.53  RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------