↑ Up

LisaST---0.9.UNS-CRf.s

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

% Computer : n001.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:24:26 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
cnf(c05,axiom,
    mult(X0,unit) = X0 ).

cnf(c06,axiom,
    mult(unit,X0) = X0 ).

cnf(c09,axiom,
    mult(mult(X0,X1),mult(X2,mult(X0,X1))) = mult(mult(mult(X0,mult(X1,X2)),X0),X1) ).

cnf(goals,negated_conjecture,
    mult(mult(a,b),a) != mult(a,mult(b,a)) ).

cnf(c_4,plain,
    mult(X0,unit) = X0,
    inference(clausification,[status(esa)],[c05]) ).

cnf(c_5,plain,
    mult(unit,X0) = X0,
    inference(clausification,[status(esa)],[c06]) ).

cnf(c_8,plain,
    mult(mult(mult(X0,mult(X1,X2)),X0),X1) = mult(mult(X0,X1),mult(X2,mult(X0,X1))),
    inference(clausification,[status(esa)],[c09]) ).

cnf(c_9,plain,
    mult(a,mult(b,a)) != mult(mult(a,b),a),
    inference(clausification,[status(esa)],[goals]) ).

cnf(d0,plain,
    mult(mult(X0,unit),mult(X1,mult(X0,unit))) = mult(mult(X0,mult(unit,X1)),X0),
    inference(superposition,[status(thm)],[c_8,c_4]) ).

cnf(d1,plain,
    mult(X0,mult(X1,mult(X0,unit))) = mult(mult(X0,mult(unit,X1)),X0),
    inference(demodulation,[status(thm)],[d0,c_4]) ).

cnf(d2,plain,
    mult(X0,mult(X1,X0)) = mult(mult(X0,mult(unit,X1)),X0),
    inference(demodulation,[status(thm)],[d1,c_4]) ).

cnf(d3,plain,
    mult(X1,mult(X0,X1)) = mult(mult(X1,X0),X1),
    inference(demodulation,[status(thm)],[d2,c_5]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : GRP671-1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.03  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.35  % Computer : n001.cluster.edu
% 0.09/0.35  % Model    : x86_64 x86_64
% 0.09/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35  % Memory   : 8046.5625MB
% 0.09/0.35  % OS       : Linux 6.8.0-71-generic
% 0.09/0.35  % CPULimit : 300
% 0.09/0.35  % WCLimit  : 300
% 0.09/0.35  % DateTime : Fri Sep 25 15:40:55 UTC 2026
% 0.09/0.35  % CPUTime  : 
% 0.09/0.36  Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 11.69/5.09  % SZS status Unsatisfiable for theBenchmark.p
% 11.69/5.09  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------