↑ Up

Twee---2.7.UNS-CRf.s

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

% Computer : n026.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:25 AM UTC 2026

% Result   : Unsatisfiable 0.18s 0.47s
% Output   : CNFRefutation 0.18s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    4
% Syntax   : Number of clauses     :   10 (  10 unt;   0 nHn;   9 RR)
%            Number of literals    :   10 (   9 equ;   1 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :    3 (   2 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   :    3 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(c1,negated_conjecture,
    greatest_lower_bound(greatest_lower_bound(a,b),c) != c,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_ax_glb1b) ).

cnf(c2,axiom,
    greatest_lower_bound(X,greatest_lower_bound(Y,Z)) = greatest_lower_bound(greatest_lower_bound(X,Y),Z),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',associativity_of_glb) ).

cnf(c3,plain,
    greatest_lower_bound(a,greatest_lower_bound(b,c)) = greatest_lower_bound(greatest_lower_bound(a,b),c),
    inference(substitution,[status(thm)],[c2]) ).

cnf(c4,plain,
    greatest_lower_bound(greatest_lower_bound(a,b),c) = greatest_lower_bound(a,greatest_lower_bound(b,c)),
    inference(symmetry,[status(thm)],[c3]) ).

cnf(c5,axiom,
    greatest_lower_bound(b,c) = c,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',step) ).

cnf(c6,plain,
    greatest_lower_bound(a,greatest_lower_bound(b,c)) = greatest_lower_bound(a,c),
    inference(congruence,[status(thm)],[c5]) ).

cnf(c7,axiom,
    greatest_lower_bound(a,c) = c,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',step) ).

cnf(c8,plain,
    greatest_lower_bound(a,greatest_lower_bound(b,c)) = c,
    inference(transitivity,[status(thm)],[c6,c7]) ).

cnf(c9,plain,
    greatest_lower_bound(greatest_lower_bound(a,b),c) = c,
    inference(transitivity,[status(thm)],[c4,c8]) ).

cnf(c10,plain,
    $false,
    inference(resolution,[status(thm)],[c1,c9]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : GRP139-1 : 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 : n026.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:35:26 UTC 2026
% 0.10/0.38  % CPUTime  : 
% 0.10/0.38  Running run_twee /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.47  Command-line arguments: --flatten-regeneralise
% 0.18/0.47  
% 0.18/0.47  % SZS status Unsatisfiable
% 0.18/0.47  
% 0.18/0.47  % SZS output start CNFRefutation
% See solution above
% 0.18/0.47  
% 0.18/0.47  RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------