↑ Up

LisaST---0.9.UNS-CRf.s

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

% Computer : n007.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:31 AM UTC 2026

% Result   : Unsatisfiable 20.71s 4.50s
% Output   : CNFRefutation 20.71s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :   14
% Syntax   : Number of clauses     :   51 (  51 unt;   0 nHn;  13 RR)
%            Number of literals    :   51 (  50 equ;   2 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :    5 (   1 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :   17 (  17 usr;   5 con; 0-4 aty)
%            Number of variables   :   70 (  33 sgn)

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

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

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

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

cnf(axiom_28,axiom,
    k0(e) = true ).

cnf(axiom_30,axiom,
    n0(e,e) = true ).

cnf(rule_006,axiom,
    ifeq(m0(X0,X0,X1),true,m1(X1,X1,X1),true) = true ).

cnf(rule_085,axiom,
    ifeq(p0(X0,X1),true,p1(X1,X1,X1),true) = true ).

cnf(rule_150,axiom,
    ifeq(m1(X0,X0,X1),true,p2(X1,X1,X1),true) = true ).

cnf(rule_177,axiom,
    ifeq(p1(X0,X0,X0),true,ifeq(k0(X1),true,q2(X0,X1,X1),true),true) = true ).

cnf(rule_240,axiom,
    ifeq(p2(X0,X1,X2),true,n3(X2),true) = true ).

cnf(rule_255,axiom,
    ifeq(q2(X0,X1,X2),true,ifeq(n0(X0,X1),true,q3(X1,X2),true),true) = true ).

cnf(rule_298,axiom,
    ifeq(q3(X0,X1),true,ifeq(n3(X2),true,ifeq(p0(X3,X2),true,r4(X2),true),true),true) = true ).

cnf(prove_this,negated_conjecture,
    r4(b) != 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(c18,plain,
    p0(c,b) = true,
    inference(clausification,[status(esa)],[axiom_18]) ).

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

cnf(c28,plain,
    k0(e) = true,
    inference(clausification,[status(esa)],[axiom_28]) ).

cnf(c30,plain,
    n0(e,e) = true,
    inference(clausification,[status(esa)],[axiom_30]) ).

cnf(c44,plain,
    ifeq(m0(X0,X0,X1),true,m1(X1,X1,X1),true) = true,
    inference(clausification,[status(esa)],[rule_006]) ).

cnf(c121,plain,
    ifeq(p0(X0,X1),true,p1(X1,X1,X1),true) = true,
    inference(clausification,[status(esa)],[rule_085]) ).

cnf(c185,plain,
    ifeq(m1(X0,X0,X1),true,p2(X1,X1,X1),true) = true,
    inference(clausification,[status(esa)],[rule_150]) ).

cnf(c212,plain,
    ifeq(p1(X0,X0,X0),true,ifeq(k0(X1),true,q2(X0,X1,X1),true),true) = true,
    inference(clausification,[status(esa)],[rule_177]) ).

cnf(c273,plain,
    ifeq(p2(X0,X1,X2),true,n3(X2),true) = true,
    inference(clausification,[status(esa)],[rule_240]) ).

cnf(c288,plain,
    ifeq(q2(X0,X1,X2),true,ifeq(n0(X0,X1),true,q3(X1,X2),true),true) = true,
    inference(clausification,[status(esa)],[rule_255]) ).

cnf(c329,plain,
    ifeq(q3(X0,X1),true,ifeq(n3(X2),true,ifeq(p0(X3,X2),true,r4(X2),true),true),true) = true,
    inference(clausification,[status(esa)],[rule_298]) ).

cnf(c362,plain,
    r4(b) != true,
    inference(clausification,[status(esa)],[prove_this]) ).

cnf(d0,plain,
    ifeq(true,true,m1(X0,X0,X0),true) = true,
    inference(superposition,[status(thm)],[c19,c44]) ).

cnf(d1,plain,
    m1(X0,X0,X0) = true,
    inference(demodulation,[status(thm)],[d0,c0]) ).

cnf(d2,plain,
    ifeq(true,true,p2(X0,X0,X0),true) = true,
    inference(superposition,[status(thm)],[d1,c185]) ).

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

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

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

cnf(d6,plain,
    ifeq(q3(X0,X1),true,ifeq(n3(b),true,ifeq(true,true,r4(b),true),true),true) = true,
    inference(superposition,[status(thm)],[c18,c329]) ).

cnf(d7,plain,
    ifeq(q3(X0,X1),true,ifeq(true,true,ifeq(true,true,r4(b),true),true),true) = true,
    inference(demodulation,[status(thm)],[d6,d5]) ).

cnf(d8,plain,
    ifeq(q3(X0,X1),true,ifeq(true,true,r4(b),true),true) = true,
    inference(demodulation,[status(thm)],[d7,c0]) ).

cnf(d9,plain,
    ifeq(q3(X0,X1),true,r4(b),true) = true,
    inference(demodulation,[status(thm)],[d8,c0]) ).

cnf(d10,plain,
    ifeq(q2(e,e,X0),true,ifeq(true,true,q3(e,X0),true),true) = true,
    inference(superposition,[status(thm)],[c30,c288]) ).

cnf(d11,plain,
    ifeq(q2(e,e,X0),true,q3(e,X0),true) = true,
    inference(demodulation,[status(thm)],[d10,c0]) ).

cnf(d12,plain,
    ifeq(true,true,p1(X0,X0,X0),true) = true,
    inference(superposition,[status(thm)],[c14,c121]) ).

cnf(d13,plain,
    p1(X0,X0,X0) = true,
    inference(demodulation,[status(thm)],[d12,c0]) ).

cnf(d14,plain,
    ifeq(p1(X0,X0,X0),true,ifeq(true,true,q2(X0,e,e),true),true) = true,
    inference(superposition,[status(thm)],[c28,c212]) ).

cnf(d15,plain,
    ifeq(true,true,ifeq(true,true,q2(X0,e,e),true),true) = true,
    inference(demodulation,[status(thm)],[d14,d13]) ).

cnf(d16,plain,
    ifeq(true,true,q2(X0,e,e),true) = true,
    inference(demodulation,[status(thm)],[d15,c0]) ).

cnf(d17,plain,
    q2(X0,e,e) = true,
    inference(demodulation,[status(thm)],[d16,c0]) ).

cnf(d18,plain,
    ifeq(true,true,q3(e,e),true) = true,
    inference(superposition,[status(thm)],[d17,d11]) ).

cnf(d19,plain,
    q3(e,e) = true,
    inference(demodulation,[status(thm)],[d18,c0]) ).

cnf(d20,plain,
    ifeq(true,true,r4(b),true) = true,
    inference(superposition,[status(thm)],[d19,d9]) ).

cnf(d21,plain,
    r4(b) = true,
    inference(demodulation,[status(thm)],[d20,c0]) ).

cnf(d22,plain,
    $false,
    inference(resolution,[status(thm)],[c362,d21]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SYN193-10 : TPTP v9.3.1. Released v7.3.0.
% 0.00/0.03  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.37  % Computer : n007.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 : Sat Sep 26 17:18:10 UTC 2026
% 0.09/0.37  % CPUTime  : 
% 0.09/0.37  Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 20.71/4.50  % SZS status Unsatisfiable for theBenchmark.p
% 20.71/4.50  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------