↑ Up

LisaST---0.9.UNS-CRf.s

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

% Computer : n012.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:23:59 AM UTC 2026

% Result   : Unsatisfiable 6.92s 1.61s
% Output   : CNFRefutation 6.92s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    4
% Syntax   : Number of clauses     :   13 (  13 unt;   0 nHn;   5 RR)
%            Number of literals    :   13 (  12 equ;   4 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    :    6 (   6 usr;   3 con; 0-2 aty)
%            Number of variables   :   11 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(multiply,axiom,
    multiply(X0,X1) = divide(X0,divide(identity,X1)) ).

cnf(inverse,axiom,
    inverse(X0) = divide(identity,X0) ).

cnf(identity,axiom,
    identity = divide(X0,X0) ).

cnf(prove_these_axioms_1,negated_conjecture,
    multiply(inverse(a1),a1) != multiply(inverse(b1),b1) ).

cnf(c1,plain,
    multiply(X0,X1) = divide(X0,divide(identity,X1)),
    inference(clausification,[status(esa)],[multiply]) ).

cnf(c2,plain,
    inverse(X0) = divide(identity,X0),
    inference(clausification,[status(esa)],[inverse]) ).

cnf(c3,plain,
    identity = divide(X0,X0),
    inference(clausification,[status(esa)],[identity]) ).

cnf(c4,plain,
    multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
    inference(clausification,[status(esa)],[prove_these_axioms_1]) ).

cnf(d0,plain,
    multiply(X1,X0) = divide(X1,inverse(X0)),
    inference(demodulation,[status(thm)],[c1,c2]) ).

cnf(d1,plain,
    identity = multiply(inverse(X0),X0),
    inference(superposition,[status(thm)],[d0,c3]) ).

cnf(d2,plain,
    identity != multiply(inverse(b1),b1),
    inference(demodulation,[status(thm)],[c4,d1]) ).

cnf(d3,plain,
    identity != identity,
    inference(demodulation,[status(thm)],[d2,d1]) ).

cnf(d4,plain,
    $false,
    inference(equality_resolution,[status(thm)],[d3]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01  % Problem  : GRP545-1 : TPTP v9.3.1. Released v2.6.0.
% 0.00/0.02  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.05/0.31  % Computer : n012.cluster.edu
% 0.05/0.31  % Model    : x86_64 x86_64
% 0.05/0.31  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.05/0.31  % Memory   : 8046.5625MB
% 0.05/0.31  % OS       : Linux 6.8.0-71-generic
% 0.05/0.31  % CPULimit : 300
% 0.05/0.31  % WCLimit  : 300
% 0.05/0.31  % DateTime : Fri Sep 25 14:59:06 UTC 2026
% 0.05/0.31  % CPUTime  : 
% 0.05/0.31  Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 6.92/1.61  % SZS status Unsatisfiable for theBenchmark.p
% 6.92/1.61  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------