↑ Up

LisaST---0.9.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : LisaST---0.9
% Problem  : HEN001-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p

% Computer : n014.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 : Sun Sep 27 07:31:42 AM UTC 2026

% Result   : Unsatisfiable 9.53s 11.70s
% Output   : CNFRefutation 9.53s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    3
% Syntax   : Number of clauses     :    8 (   6 unt;   0 nHn;   6 RR)
%            Number of literals    :   10 (   0 equ;   5 neg)
%            Maximal clause size   :    2 (   1 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-3 aty)
%            Number of functors    :    3 (   3 usr;   3 con; 0-0 aty)
%            Number of variables   :    6 (   2 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(prove_everything_divide_identity_is_zero,negated_conjecture,
    ~ quotient(x,identity,zero) ).

cnf(quotient_less_equal,axiom,
    ( quotient(X0,X1,zero)
    | ~ 'less$uequal'(X0,X1) ) ).

cnf(identity_is_largest,axiom,
    'less$uequal'(X0,identity) ).

cnf(c0,plain,
    ~ quotient(x,identity,zero),
    inference(clausification,[status(esa)],[prove_everything_divide_identity_is_zero]) ).

cnf(c1,plain,
    ( quotient(X0,X1,zero)
    | ~ 'less$uequal'(X0,X1) ),
    inference(clausification,[status(esa)],[quotient_less_equal]) ).

cnf(c7,plain,
    'less$uequal'(X0,identity),
    inference(clausification,[status(esa)],[identity_is_largest]) ).

cnf(d0,plain,
    ~ 'less$uequal'(x,identity),
    inference(resolution,[status(thm)],[c1,c0]) ).

cnf(d1,plain,
    $false,
    inference(resolution,[status(thm)],[c7,d0]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : HEN001-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/10.39  % Computer : n014.cluster.edu
% 0.12/10.39  % Model    : x86_64 x86_64
% 0.12/10.39  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/10.39  % Memory   : 8046.5625MB
% 0.12/10.39  % OS       : Linux 6.8.0-71-generic
% 0.12/10.39  % CPULimit : 300
% 0.12/10.39  % WCLimit  : 300
% 0.12/10.39  % DateTime : Fri Sep 25 15:54:58 UTC 2026
% 0.12/10.39  % CPUTime  : 
% 0.12/10.39  Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 9.53/11.70  % SZS status Unsatisfiable for theBenchmark.p
% 9.53/11.70  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------