↑ Up

LisaST---0.9.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : LisaST---0.9
% Problem  : GRP679-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 : n002.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:27 AM UTC 2026

% Result   : Unsatisfiable 2.10s 6.82s
% Output   : CNFRefutation 2.10s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    8
% Syntax   : Number of clauses     :   33 (  33 unt;   0 nHn;   6 RR)
%            Number of literals    :   33 (  32 equ;   5 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;   3 con; 0-2 aty)
%            Number of variables   :   43 (   0 sgn)

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

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

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

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

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

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

cnf(c08,axiom,
    mult('op$uc',X0) = mult(X0,'op$uc') ).

cnf(goals,negated_conjecture,
    mult(mult('op$uc','op$uc'),a) != mult(a,mult('op$uc','op$uc')) ).

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

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

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

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

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

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

cnf(c_7,plain,
    mult('op$uc',X0) = mult(X0,'op$uc'),
    inference(clausification,[status(esa)],[c08]) ).

cnf(c_8,plain,
    mult(mult('op$uc','op$uc'),a) != mult(a,mult('op$uc','op$uc')),
    inference(clausification,[status(esa)],[goals]) ).

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

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

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

cnf(d3,plain,
    ld(X0,mult('op$uc',X0)) = 'op$uc',
    inference(superposition,[status(thm)],[c_7,c_1]) ).

cnf(d4,plain,
    mult(X0,'op$uc') = mult('op$uc',X0),
    inference(superposition,[status(thm)],[d3,c_0]) ).

cnf(d5,plain,
    rd(mult('op$uc',mult(X0,'op$uc')),X0) = mult('op$uc','op$uc'),
    inference(superposition,[status(thm)],[d4,d2]) ).

cnf(d6,plain,
    mult(mult('op$uc','op$uc'),X0) = mult('op$uc',mult(X0,'op$uc')),
    inference(superposition,[status(thm)],[d5,c_2]) ).

cnf(d7,plain,
    mult('op$uc',mult('op$uc',X0)) = mult('op$uc',mult(X0,'op$uc')),
    inference(demodulation,[status(thm)],[d6,d1]) ).

cnf(d8,plain,
    ld('op$uc',mult(X0,'op$uc')) = X0,
    inference(superposition,[status(thm)],[c_7,c_1]) ).

cnf(d9,plain,
    ld('op$uc',mult(X0,mult(X1,mult(X0,'op$uc')))) = mult(X0,mult(X1,X0)),
    inference(superposition,[status(thm)],[c_6,d8]) ).

cnf(d10,plain,
    mult('op$uc',mult(X0,'op$uc')) = mult(X0,mult('op$uc','op$uc')),
    inference(superposition,[status(thm)],[d9,c_1]) ).

cnf(d11,plain,
    mult('op$uc',mult('op$uc',a)) != mult(a,mult('op$uc','op$uc')),
    inference(demodulation,[status(thm)],[c_8,d1]) ).

cnf(d12,plain,
    mult('op$uc',mult('op$uc',a)) != mult('op$uc',mult(a,'op$uc')),
    inference(demodulation,[status(thm)],[d11,d10]) ).

cnf(d13,plain,
    mult('op$uc',mult('op$uc',a)) != mult('op$uc',mult('op$uc',a)),
    inference(demodulation,[status(thm)],[d12,d7]) ).

cnf(d14,plain,
    ld('op$uc',mult('op$uc',X0)) = X0,
    inference(superposition,[status(thm)],[c_7,d8]) ).

cnf(d15,plain,
    X0 = X0,
    inference(demodulation,[status(thm)],[d14,c_1]) ).

cnf(d16,plain,
    $false,
    inference(resolution,[status(thm)],[d15,d13]) ).

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