↑ Up

LisaST---0.9.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : LisaST---0.9
% Problem  : SYN170-10 : TPTP v9.3.1. Released v7.5.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox/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 09:21:28 AM UTC 2026

% Result   : Unsatisfiable 26.48s 4.22s
% Output   : CNFRefutation 26.48s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :    9
% Syntax   : Number of clauses     :   31 (  31 unt;   0 nHn;   7 RR)
%            Number of literals    :   31 (  30 equ;   3 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :   12 (  12 usr;   5 con; 0-4 aty)
%            Number of variables   :   40 (  14 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(ifeq_axiom,axiom,
    ifeq(X0,X0,X1,X2) = X1 ).

cnf(axiom_14,axiom,
    p0(b,X0) = true ).

cnf(axiom_19,axiom,
    m0(X0,d,X1) = true ).

cnf(axiom_22,axiom,
    p0(b,c) = true ).

cnf(rule_107,axiom,
    ifeq(m0(e,d,X0),true,ifeq(m0(X0,d,X0),true,q1(e,X0,X0),true),true) = true ).

cnf(rule_129,axiom,
    ifeq(q1(X0,X1,X1),true,k2(X1,X1),true) = true ).

cnf(rule_194,axiom,
    ifeq(k2(X0,X1),true,k3(X1,X1,X0),true) = true ).

cnf(rule_287,axiom,
    ifeq(k3(X0,X0,X1),true,p4(X0,X1,X0),true) = true ).

cnf(prove_this,negated_conjecture,
    p4(X0,c,X1) != true ).

cnf(c0,plain,
    ifeq(X0,X0,X1,X2) = X1,
    inference(clausification,[status(esa)],[ifeq_axiom]) ).

cnf(c14,plain,
    p0(b,X0) = true,
    inference(clausification,[status(esa)],[axiom_14]) ).

cnf(c19,plain,
    m0(X0,d,X1) = true,
    inference(clausification,[status(esa)],[axiom_19]) ).

cnf(c22,plain,
    p0(b,c) = true,
    inference(clausification,[status(esa)],[axiom_22]) ).

cnf(c143,plain,
    ifeq(m0(e,d,X0),true,ifeq(m0(X0,d,X0),true,q1(e,X0,X0),true),true) = true,
    inference(clausification,[status(esa)],[rule_107]) ).

cnf(c165,plain,
    ifeq(q1(X0,X1,X1),true,k2(X1,X1),true) = true,
    inference(clausification,[status(esa)],[rule_129]) ).

cnf(c229,plain,
    ifeq(k2(X0,X1),true,k3(X1,X1,X0),true) = true,
    inference(clausification,[status(esa)],[rule_194]) ).

cnf(c318,plain,
    ifeq(k3(X0,X0,X1),true,p4(X0,X1,X0),true) = true,
    inference(clausification,[status(esa)],[rule_287]) ).

cnf(c362,plain,
    p4(X0,c,X1) != true,
    inference(clausification,[status(esa)],[prove_this]) ).

cnf(d0,plain,
    ifeq(true,true,ifeq(m0(X0,d,X0),true,q1(e,X0,X0),true),true) = true,
    inference(demodulation,[status(thm)],[c143,c19]) ).

cnf(d1,plain,
    ifeq(m0(X0,d,X0),true,q1(e,X0,X0),true) = true,
    inference(demodulation,[status(thm)],[d0,c0]) ).

cnf(d2,plain,
    ifeq(true,true,q1(e,X0,X0),true) = true,
    inference(demodulation,[status(thm)],[d1,c19]) ).

cnf(d3,plain,
    q1(e,X0,X0) = true,
    inference(demodulation,[status(thm)],[d2,c0]) ).

cnf(d4,plain,
    ifeq(true,true,k2(X0,X0),true) = true,
    inference(superposition,[status(thm)],[d3,c165]) ).

cnf(d5,plain,
    k2(X0,X0) = true,
    inference(demodulation,[status(thm)],[d4,c0]) ).

cnf(d6,plain,
    ifeq(true,true,k3(X0,X0,X0),true) = true,
    inference(superposition,[status(thm)],[d5,c229]) ).

cnf(d7,plain,
    k3(X0,X0,X0) = true,
    inference(demodulation,[status(thm)],[d6,c0]) ).

cnf(d8,plain,
    ifeq(true,true,p4(X0,X0,X0),true) = true,
    inference(superposition,[status(thm)],[d7,c318]) ).

cnf(d9,plain,
    p4(X0,X0,X0) = true,
    inference(demodulation,[status(thm)],[d8,c0]) ).

cnf(d10,plain,
    true != true,
    inference(superposition,[status(thm)],[d9,c362]) ).

cnf(d11,plain,
    true = true,
    inference(demodulation,[status(thm)],[c22,c14]) ).

cnf(d12,plain,
    $false,
    inference(resolution,[status(thm)],[d11,d10]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SYN170-10 : TPTP v9.3.1. Released v7.5.0.
% 0.00/0.04  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.08/0.36  % Computer : n006.cluster.edu
% 0.08/0.36  % Model    : x86_64 x86_64
% 0.08/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.36  % Memory   : 8046.5625MB
% 0.08/0.36  % OS       : Linux 6.8.0-71-generic
% 0.08/0.36  % CPULimit : 300
% 0.08/0.36  % WCLimit  : 300
% 0.08/0.36  % DateTime : Sat Sep 26 17:17:40 UTC 2026
% 0.09/0.36  % CPUTime  : 
% 0.09/0.36  Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 26.48/4.22  % SZS status Unsatisfiable for theBenchmark.p
% 26.48/4.22  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------