↑ Up

LisaST---0.9.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : LisaST---0.9
% Problem  : SYN563-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 : n008.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:29:05 AM UTC 2026

% Result   : Unsatisfiable 46.47s 7.13s
% Output   : CNFRefutation 46.47s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   17
%            Number of leaves      :   13
% Syntax   : Number of clauses     :   48 (  48 unt;   0 nHn;  22 RR)
%            Number of literals    :   48 (  47 equ;   3 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :    6 (   2 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   :   52 (   4 sgn)

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

cnf(ifeq_axiom_001,axiom,
    ifeq(X0,X0,X1,X2) = X1 ).

cnf(p2_1,negated_conjecture,
    p2(X0,X0) = true ).

cnf(p6_2,negated_conjecture,
    p6(X0,X0) = true ).

cnf(p2_4,negated_conjecture,
    p2(f4(c7),f4(c8)) = true ).

cnf(p5_7,negated_conjecture,
    p5(f3(f3(X0)),f3(f4(X0))) = true ).

cnf(p6_9,negated_conjecture,
    ifeq2(p6(c7,X0),true,p6(c7,f3(X0)),true) = true ).

cnf(p6_10,negated_conjecture,
    ifeq2(p5(X0,X1),true,p6(f4(X0),X1),true) = true ).

cnf(p2_11,negated_conjecture,
    ifeq2(p2(X0,X1),true,p2(f3(X0),f3(X1)),true) = true ).

cnf(p5_15,negated_conjecture,
    ifeq2(p6(X0,X1),true,ifeq2(p5(X1,X2),true,p5(X0,X2),true),true) = true ).

cnf(p6_16,negated_conjecture,
    ifeq2(p2(X0,X1),true,ifeq2(p2(X2,X3),true,ifeq2(p6(X2,X0),true,p6(X3,X1),true),true),true) = true ).

cnf(not_p6_5,negated_conjecture,
    ifeq(p6(f4(c7),f3(f4(c8))),true,a,b) = b ).

cnf(goal,negated_conjecture,
    a != b ).

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

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

cnf(c2,plain,
    p2(X0,X0) = true,
    inference(clausification,[status(esa)],[p2_1]) ).

cnf(c3,plain,
    p6(X0,X0) = true,
    inference(clausification,[status(esa)],[p6_2]) ).

cnf(c4,plain,
    p2(f4(c7),f4(c8)) = true,
    inference(clausification,[status(esa)],[p2_4]) ).

cnf(c6,plain,
    p5(f3(f3(X0)),f3(f4(X0))) = true,
    inference(clausification,[status(esa)],[p5_7]) ).

cnf(c8,plain,
    ifeq2(p6(c7,X0),true,p6(c7,f3(X0)),true) = true,
    inference(clausification,[status(esa)],[p6_9]) ).

cnf(c9,plain,
    ifeq2(p5(X0,X1),true,p6(f4(X0),X1),true) = true,
    inference(clausification,[status(esa)],[p6_10]) ).

cnf(c10,plain,
    ifeq2(p2(X0,X1),true,p2(f3(X0),f3(X1)),true) = true,
    inference(clausification,[status(esa)],[p2_11]) ).

cnf(c14,plain,
    ifeq2(p6(X0,X1),true,ifeq2(p5(X1,X2),true,p5(X0,X2),true),true) = true,
    inference(clausification,[status(esa)],[p5_15]) ).

cnf(c15,plain,
    ifeq2(p2(X0,X1),true,ifeq2(p2(X2,X3),true,ifeq2(p6(X2,X0),true,p6(X3,X1),true),true),true) = true,
    inference(clausification,[status(esa)],[p6_16]) ).

cnf(c18,plain,
    ifeq(p6(f4(c7),f3(f4(c8))),true,a,b) = b,
    inference(clausification,[status(esa)],[not_p6_5]) ).

cnf(c19,plain,
    b != a,
    inference(clausification,[status(esa)],[goal]) ).

cnf(d0,plain,
    ifeq2(p2(X1,X2),true,ifeq2(true,true,ifeq2(p6(X0,X1),true,p6(X0,X2),true),true),true) = true,
    inference(superposition,[status(thm)],[c2,c15]) ).

cnf(d1,plain,
    ifeq2(p2(X1,X2),true,ifeq2(p6(X0,X1),true,p6(X0,X2),true),true) = true,
    inference(demodulation,[status(thm)],[d0,c0]) ).

cnf(d2,plain,
    ifeq2(true,true,p2(f3(f4(c7)),f3(f4(c8))),true) = true,
    inference(superposition,[status(thm)],[c4,c10]) ).

cnf(d3,plain,
    p2(f3(f4(c7)),f3(f4(c8))) = true,
    inference(demodulation,[status(thm)],[d2,c0]) ).

cnf(d4,plain,
    ifeq2(true,true,ifeq2(p6(X0,f3(f4(c7))),true,p6(X0,f3(f4(c8))),true),true) = true,
    inference(superposition,[status(thm)],[d3,d1]) ).

cnf(d5,plain,
    ifeq2(p6(X0,f3(f4(c7))),true,p6(X0,f3(f4(c8))),true) = true,
    inference(demodulation,[status(thm)],[d4,c0]) ).

cnf(d6,plain,
    ifeq2(true,true,p6(c7,f3(c7)),true) = true,
    inference(superposition,[status(thm)],[c3,c8]) ).

cnf(d7,plain,
    p6(c7,f3(c7)) = true,
    inference(demodulation,[status(thm)],[d6,c0]) ).

cnf(d8,plain,
    ifeq2(true,true,p6(c7,f3(f3(c7))),true) = true,
    inference(superposition,[status(thm)],[d7,c8]) ).

cnf(d9,plain,
    p6(c7,f3(f3(c7))) = true,
    inference(demodulation,[status(thm)],[d8,c0]) ).

cnf(d10,plain,
    ifeq2(true,true,ifeq2(p5(f3(f3(c7)),X0),true,p5(c7,X0),true),true) = true,
    inference(superposition,[status(thm)],[d9,c14]) ).

cnf(d11,plain,
    ifeq2(p5(f3(f3(c7)),X0),true,p5(c7,X0),true) = true,
    inference(demodulation,[status(thm)],[d10,c0]) ).

cnf(d12,plain,
    ifeq2(true,true,p5(c7,f3(f4(c7))),true) = true,
    inference(superposition,[status(thm)],[c6,d11]) ).

cnf(d13,plain,
    p5(c7,f3(f4(c7))) = true,
    inference(demodulation,[status(thm)],[d12,c0]) ).

cnf(d14,plain,
    ifeq2(true,true,p6(f4(c7),f3(f4(c7))),true) = true,
    inference(superposition,[status(thm)],[d13,c9]) ).

cnf(d15,plain,
    p6(f4(c7),f3(f4(c7))) = true,
    inference(demodulation,[status(thm)],[d14,c0]) ).

cnf(d16,plain,
    ifeq2(true,true,p6(f4(c7),f3(f4(c8))),true) = true,
    inference(superposition,[status(thm)],[d15,d5]) ).

cnf(d17,plain,
    p6(f4(c7),f3(f4(c8))) = true,
    inference(demodulation,[status(thm)],[d16,c0]) ).

cnf(d18,plain,
    ifeq(true,true,a,b) = b,
    inference(demodulation,[status(thm)],[c18,d17]) ).

cnf(d19,plain,
    a = b,
    inference(demodulation,[status(thm)],[d18,c1]) ).

cnf(d20,plain,
    a != a,
    inference(demodulation,[status(thm)],[c19,d19]) ).

cnf(d21,plain,
    $false,
    inference(equality_resolution,[status(thm)],[d20]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN563-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 : n008.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 18:14:39 UTC 2026
% 0.08/0.36  % CPUTime  : 
% 0.08/0.36  Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 46.47/7.13  % SZS status Unsatisfiable for theBenchmark.p
% 46.47/7.13  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------