↑ Up

LisaST---0.9.UNS-CRf.s

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

% Computer : n014.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 06:56:43 AM UTC 2026

% Result   : Unsatisfiable 104.28s 18.07s
% Output   : CNFRefutation 104.28s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    4
% Syntax   : Number of clauses     :   13 (  13 unt;   0 nHn;   5 RR)
%            Number of literals    :   13 (  12 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    :    5 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :   24 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(l_definition,axiom,
    apply(apply(l,X0),X1) = apply(X0,apply(X1,X1)) ).

cnf(w_definition,axiom,
    apply(apply(w,X0),X1) = apply(apply(X0,X1),X1) ).

cnf(q_definition,axiom,
    apply(apply(apply(q,X0),X1),X2) = apply(X1,apply(X0,X2)) ).

cnf(prove_fixed_point,negated_conjecture,
    apply(X0,f(X0)) != apply(f(X0),apply(X0,f(X0))) ).

cnf(c0,plain,
    apply(X0,apply(X1,X1)) = apply(apply(l,X0),X1),
    inference(clausification,[status(esa)],[l_definition]) ).

cnf(c1,plain,
    apply(apply(X0,X1),X1) = apply(apply(w,X0),X1),
    inference(clausification,[status(esa)],[w_definition]) ).

cnf(c2,plain,
    apply(X0,apply(X1,X2)) = apply(apply(apply(q,X1),X0),X2),
    inference(clausification,[status(esa)],[q_definition]) ).

cnf(c3,plain,
    apply(f(X0),apply(X0,f(X0))) != apply(X0,f(X0)),
    inference(clausification,[status(esa)],[prove_fixed_point]) ).

cnf(d0,plain,
    apply(X1,apply(X0,X1)) = apply(apply(w,apply(q,X0)),X1),
    inference(superposition,[status(thm)],[c2,c1]) ).

cnf(d1,plain,
    apply(apply(w,apply(q,X0)),f(X0)) != apply(X0,f(X0)),
    inference(superposition,[status(thm)],[d0,c3]) ).

cnf(d2,plain,
    apply(X2,apply(X1,apply(X0,apply(apply(q,X0),X1)))) = apply(apply(l,X2),apply(apply(q,X0),X1)),
    inference(superposition,[status(thm)],[c2,c0]) ).

cnf(d3,plain,
    apply(apply(w,apply(apply(l,q),apply(apply(q,X1),X0))),f(apply(X0,apply(X1,apply(apply(q,X1),X0))))) != apply(apply(X0,apply(X1,apply(apply(q,X1),X0))),f(apply(X0,apply(X1,apply(apply(q,X1),X0))))),
    inference(superposition,[status(thm)],[d2,d1]) ).

cnf(d4,plain,
    $false,
    inference(equality_resolution,[status(thm)],[d3]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : COL035-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.57  % Computer : n014.cluster.edu
% 0.10/0.57  % Model    : x86_64 x86_64
% 0.10/0.57  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.57  % Memory   : 8046.5625MB
% 0.10/0.57  % OS       : Linux 6.8.0-71-generic
% 0.10/0.57  % CPULimit : 300
% 0.10/0.57  % WCLimit  : 300
% 0.10/0.57  % DateTime : Sat Sep 26 23:06:47 UTC 2026
% 0.10/0.58  % CPUTime  : 
% 0.10/0.58  Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 104.28/18.07  % SZS status Unsatisfiable for theBenchmark.p
% 104.28/18.07  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------