↑ Up

LisaST---0.9.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : LisaST---0.9
% Problem  : SYN006-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 : 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:20:39 AM UTC 2026

% Result   : Unsatisfiable 8.77s 11.59s
% Output   : CNFRefutation 8.77s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    7
% Syntax   : Number of clauses     :   20 (  12 unt;   6 nHn;  13 RR)
%            Number of literals    :   32 (   0 equ;  12 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number of predicates  :    7 (   6 usr;   1 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   1 con; 0-1 aty)
%            Number of variables   :   31 (  17 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(clause_1,negated_conjecture,
    ( q2(X0,f(X1))
    | q1(f(X0),X1)
    | ~ p1(X0,f(X1)) ) ).

cnf(clause_2,negated_conjecture,
    p1(a,X0) ).

cnf(clause_3,negated_conjecture,
    ~ q2(X0,f(X1)) ).

cnf(clause_4,negated_conjecture,
    ( q4(X0,f(X1))
    | q3(f(X0),X1)
    | ~ p2(X0,f(X1)) ) ).

cnf(clause_5,negated_conjecture,
    ~ q3(X0,g(X1)) ).

cnf(clause_6,negated_conjecture,
    ~ q4(f(f(X0)),f(g(f(X1)))) ).

cnf(clause_7,negated_conjecture,
    ( p2(f(X0),X1)
    | ~ q1(X0,f(X1)) ) ).

cnf(c0,plain,
    ( q2(X0,f(X1))
    | q1(f(X0),X1)
    | ~ p1(X0,f(X1)) ),
    inference(clausification,[status(esa)],[clause_1]) ).

cnf(c1,plain,
    p1(a,X0),
    inference(clausification,[status(esa)],[clause_2]) ).

cnf(c2,plain,
    ~ q2(X0,f(X1)),
    inference(clausification,[status(esa)],[clause_3]) ).

cnf(c3,plain,
    ( q4(X0,f(X1))
    | q3(f(X0),X1)
    | ~ p2(X0,f(X1)) ),
    inference(clausification,[status(esa)],[clause_4]) ).

cnf(c4,plain,
    ~ q3(X0,g(X1)),
    inference(clausification,[status(esa)],[clause_5]) ).

cnf(c5,plain,
    ~ q4(f(f(X0)),f(g(f(X1)))),
    inference(clausification,[status(esa)],[clause_6]) ).

cnf(c6,plain,
    ( p2(f(X0),X1)
    | ~ q1(X0,f(X1)) ),
    inference(clausification,[status(esa)],[clause_7]) ).

cnf(d0,plain,
    ( q2(a,f(X0))
    | q1(f(a),X0) ),
    inference(resolution,[status(thm)],[c0,c1]) ).

cnf(d1,plain,
    q1(f(a),X0),
    inference(resolution,[status(thm)],[c2,d0]) ).

cnf(d2,plain,
    p2(f(f(a)),X0),
    inference(resolution,[status(thm)],[d1,c6]) ).

cnf(d3,plain,
    ( q4(f(f(a)),f(X0))
    | q3(f(f(f(a))),X0) ),
    inference(resolution,[status(thm)],[d2,c3]) ).

cnf(d4,plain,
    q3(f(f(f(a))),g(f(X0))),
    inference(resolution,[status(thm)],[d3,c5]) ).

cnf(d5,plain,
    $false,
    inference(resolution,[status(thm)],[c4,d4]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SYN006-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.09/10.37  % Computer : n008.cluster.edu
% 0.09/10.37  % Model    : x86_64 x86_64
% 0.09/10.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/10.37  % Memory   : 8046.5625MB
% 0.09/10.37  % OS       : Linux 6.8.0-71-generic
% 0.09/10.37  % CPULimit : 300
% 0.09/10.37  % WCLimit  : 300
% 0.09/10.37  % DateTime : Sat Sep 26 17:04:37 UTC 2026
% 0.09/10.38  % CPUTime  : 
% 0.09/10.38  Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 8.77/11.59  % SZS status Unsatisfiable for theBenchmark.p
% 8.77/11.59  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------