↑ Up

LisaST---0.9.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : LisaST---0.9
% Problem  : GRP669-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 : n006.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 48.52s 26.17s
% Output   : CNFRefutation 48.52s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    7
% Syntax   : Number of clauses     :   28 (  28 unt;   0 nHn;   5 RR)
%            Number of literals    :   28 (  27 equ;   4 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :    7 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   4 con; 0-2 aty)
%            Number of variables   :   58 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(c03,axiom,
    mult(rd(X0,X1),X1) = X0 ).

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

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

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

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

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

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

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_4,plain,
    mult(X0,unit) = X0,
    inference(clausification,[status(esa)],[c05]) ).

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

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

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

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

cnf(d0,plain,
    mult(a,mult(mult(b,c),mult(a,b))) != mult(mult(a,b),mult(c,mult(a,b))),
    inference(demodulation,[status(thm)],[c_10,c_6]) ).

cnf(d1,plain,
    mult(a,mult(b,mult(mult(c,a),b))) != mult(mult(a,b),mult(c,mult(a,b))),
    inference(demodulation,[status(thm)],[d0,c_9]) ).

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

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

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

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

cnf(d6,plain,
    mult(X1,mult(mult(X3,mult(mult(X0,X1),X2)),X1)) = mult(mult(X1,X3),mult(X0,mult(X1,mult(X2,X1)))),
    inference(superposition,[status(thm)],[c_7,c_9]) ).

cnf(d7,plain,
    rd(mult(X0,mult(X1,mult(X0,X2))),X2) = mult(mult(X0,X1),X0),
    inference(superposition,[status(thm)],[c_6,c_3]) ).

cnf(d8,plain,
    rd(mult(X0,mult(X1,mult(X0,X2))),X2) = mult(X0,mult(X1,X0)),
    inference(demodulation,[status(thm)],[d7,d3]) ).

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

cnf(d10,plain,
    rd(mult(X0,mult(mult(X1,mult(mult(X2,X0),X1)),X0)),X0) = mult(mult(X0,X1),mult(X2,mult(X0,X1))),
    inference(demodulation,[status(thm)],[d9,d6]) ).

cnf(d11,plain,
    mult(X0,rd(mult(mult(X1,mult(mult(X2,X0),X1)),X0),X0)) = mult(mult(X0,X1),mult(X2,mult(X0,X1))),
    inference(demodulation,[status(thm)],[d10,d5]) ).

cnf(d12,plain,
    mult(X2,mult(X0,mult(mult(X1,X2),X0))) = mult(mult(X2,X0),mult(X1,mult(X2,X0))),
    inference(demodulation,[status(thm)],[d11,c_3]) ).

cnf(d13,plain,
    $false,
    inference(resolution,[status(thm)],[d12,d1]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : GRP669-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.09/15.38  % Computer : n006.cluster.edu
% 0.09/15.38  % Model    : x86_64 x86_64
% 0.09/15.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/15.38  % Memory   : 8046.5625MB
% 0.09/15.38  % OS       : Linux 6.8.0-71-generic
% 0.09/15.38  % CPULimit : 300
% 0.09/15.38  % WCLimit  : 300
% 0.09/15.38  % DateTime : Fri Sep 25 15:34:42 UTC 2026
% 0.09/15.39  % CPUTime  : 
% 0.09/15.39  Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 48.52/26.17  % SZS status Unsatisfiable for theBenchmark.p
% 48.52/26.17  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------