↑ Up

LisaST---0.9.UNS-CRf.s

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

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

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

% Comments : 
%------------------------------------------------------------------------------
cnf(f01,axiom,
    mult(X0,ld(X0,X1)) = X1 ).

cnf(f02,axiom,
    ld(X0,mult(X0,X1)) = X1 ).

cnf(f03,axiom,
    mult(rd(X0,X1),X1) = X0 ).

cnf(f04,axiom,
    rd(mult(X0,X1),X1) = X0 ).

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

cnf(goal,negated_conjecture,
    tuple(mult(X0,x1(X0)),mult('x1$u2'(X0),X0)) != tuple(x1(X0),'x1$u2'(X0)) ).

cnf(c0,plain,
    mult(X0,ld(X0,X1)) = X1,
    inference(clausification,[status(esa)],[f01]) ).

cnf(c1,plain,
    ld(X0,mult(X0,X1)) = X1,
    inference(clausification,[status(esa)],[f02]) ).

cnf(c2,plain,
    mult(rd(X0,X1),X1) = X0,
    inference(clausification,[status(esa)],[f03]) ).

cnf(c3,plain,
    rd(mult(X0,X1),X1) = X0,
    inference(clausification,[status(esa)],[f04]) ).

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

cnf(c5,plain,
    tuple(mult(X0,x1(X0)),mult('x1$u2'(X0),X0)) != tuple(x1(X0),'x1$u2'(X0)),
    inference(clausification,[status(esa)],[goal]) ).

cnf(d0,plain,
    ld(rd(X0,X1),X0) = X1,
    inference(superposition,[status(thm)],[c2,c1]) ).

cnf(d1,plain,
    rd(mult(mult(X0,X1),mult(X2,X0)),X0) = mult(X0,mult(X1,X2)),
    inference(superposition,[status(thm)],[c4,c3]) ).

cnf(d2,plain,
    rd(mult(mult(X1,X2),X0),X1) = mult(X1,mult(X2,rd(X0,X1))),
    inference(superposition,[status(thm)],[c2,d1]) ).

cnf(d3,plain,
    mult(X0,mult(X1,rd(X0,X0))) = mult(X0,X1),
    inference(superposition,[status(thm)],[d2,c3]) ).

cnf(d4,plain,
    ld(X0,mult(X0,X1)) = mult(X1,rd(X0,X0)),
    inference(superposition,[status(thm)],[d3,c1]) ).

cnf(d5,plain,
    X1 = mult(X1,rd(X0,X0)),
    inference(demodulation,[status(thm)],[d4,c1]) ).

cnf(d6,plain,
    ld(X0,X0) = rd(X1,X1),
    inference(superposition,[status(thm)],[d5,c1]) ).

cnf(d7,plain,
    rd(X1,X1) = rd(X2,X2),
    inference(superposition,[status(thm)],[d6,d6]) ).

cnf(d8,plain,
    ld(rd(X1,X1),X0) = X0,
    inference(superposition,[status(thm)],[d7,d0]) ).

cnf(d9,plain,
    X1 = mult(rd(X0,X0),X1),
    inference(superposition,[status(thm)],[c1,d8]) ).

cnf(d10,plain,
    tuple(mult(rd(X0,X0),x1(rd(X0,X0))),'x1$u2'(rd(X0,X0))) != tuple(x1(rd(X0,X0)),'x1$u2'(rd(X0,X0))),
    inference(superposition,[status(thm)],[d5,c5]) ).

cnf(d11,plain,
    tuple(x1(rd(X0,X0)),'x1$u2'(rd(X0,X0))) != tuple(x1(rd(X0,X0)),'x1$u2'(rd(X0,X0))),
    inference(demodulation,[status(thm)],[d10,d9]) ).

cnf(d12,plain,
    mult(mult(X2,X0),mult(ld(X0,X1),X2)) = mult(mult(X2,X1),X2),
    inference(superposition,[status(thm)],[c0,c4]) ).

cnf(d13,plain,
    ld(mult(X0,mult(X1,X2)),mult(mult(X0,X1),mult(X2,X0))) = X0,
    inference(superposition,[status(thm)],[c4,c1]) ).

cnf(d14,plain,
    ld(mult(X2,X1),mult(mult(X2,X0),mult(ld(X0,X1),X2))) = X2,
    inference(superposition,[status(thm)],[c0,d13]) ).

cnf(d15,plain,
    ld(mult(X0,X2),mult(mult(X0,X2),X0)) = X0,
    inference(demodulation,[status(thm)],[d14,d12]) ).

cnf(d16,plain,
    X0 = X0,
    inference(demodulation,[status(thm)],[d15,c1]) ).

cnf(d17,plain,
    $false,
    inference(resolution,[status(thm)],[d16,d11]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : GRP656-10 : TPTP v9.3.1. Released v8.1.0.
% 0.00/0.04  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.37  % Computer : n013.cluster.edu
% 0.09/0.37  % Model    : x86_64 x86_64
% 0.09/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37  % Memory   : 8046.5625MB
% 0.09/0.37  % OS       : Linux 6.8.0-71-generic
% 0.09/0.37  % CPULimit : 300
% 0.09/0.37  % WCLimit  : 300
% 0.09/0.37  % DateTime : Fri Sep 25 15:30:51 UTC 2026
% 0.09/0.37  % CPUTime  : 
% 0.09/0.37  Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 10.24/8.40  % SZS status Unsatisfiable for theBenchmark.p
% 10.24/8.40  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------