↑ Up

LisaST---0.9.UNS-CRf.s

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

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

% Result   : Unsatisfiable 9.65s 1.69s
% Output   : CNFRefutation 9.65s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    8
% Syntax   : Number of clauses     :   23 (  18 unt;   0 nHn;  19 RR)
%            Number of literals    :   37 (   4 equ;  16 neg)
%            Maximal clause size   :    5 (   1 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :   10 (  10 usr;   5 con; 0-2 aty)
%            Number of variables   :   21 (   2 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(make_node,axiom,
    ( ~ siblings(X0,X1)
    | ~ contradictory(X4,X5)
    | ~ 'failure$unode'(X1,or(X3,X5))
    | ~ 'failure$unode'(X0,or(X2,X4))
    | 'failure$unode'('parent$uof'(X0,X1),or(X2,X3)) ) ).

cnf(x_contradicts_not_x,axiom,
    contradictory(X0,negate(X0)) ).

cnf(n_left_and_n_right_are_siblings,axiom,
    siblings('left$uchild$uof'(X0),'right$uchild$uof'(X0)) ).

cnf(n_left_is_atom,hypothesis,
    'failure$unode'('n$uleft',or(empty,atom)) ).

cnf(n_right_is_not_atom,hypothesis,
    'failure$unode'('n$uright',or(empty,negate(atom))) ).

cnf(n_left_equals_left_child_of_n,hypothesis,
    'n$uleft' = 'left$uchild$uof'(n) ).

cnf(n_right_equals_right_child_of_n,hypothesis,
    'n$uright' = 'right$uchild$uof'(n) ).

cnf(goal_is_there_an_empty_node,negated_conjecture,
    ~ 'failure$unode'(X0,or(empty,empty)) ).

cnf(c0,plain,
    ( 'failure$unode'('parent$uof'(X3,X0),or(X4,X1))
    | ~ contradictory(X5,X2)
    | ~ 'failure$unode'(X3,or(X4,X5))
    | ~ siblings(X3,X0)
    | ~ 'failure$unode'(X0,or(X1,X2)) ),
    inference(clausification,[status(esa)],[make_node]) ).

cnf(c2,plain,
    contradictory(X0,negate(X0)),
    inference(clausification,[status(esa)],[x_contradicts_not_x]) ).

cnf(c3,plain,
    siblings('left$uchild$uof'(X0),'right$uchild$uof'(X0)),
    inference(clausification,[status(esa)],[n_left_and_n_right_are_siblings]) ).

cnf(c4,plain,
    'failure$unode'('n$uleft',or(empty,atom)),
    inference(clausification,[status(esa)],[n_left_is_atom]) ).

cnf(c5,plain,
    'failure$unode'('n$uright',or(empty,negate(atom))),
    inference(clausification,[status(esa)],[n_right_is_not_atom]) ).

cnf(c6,plain,
    'n$uleft' = 'left$uchild$uof'(n),
    inference(clausification,[status(esa)],[n_left_equals_left_child_of_n]) ).

cnf(c7,plain,
    'n$uright' = 'right$uchild$uof'(n),
    inference(clausification,[status(esa)],[n_right_equals_right_child_of_n]) ).

cnf(c8,plain,
    ~ 'failure$unode'(X0,or(empty,empty)),
    inference(clausification,[status(esa)],[goal_is_there_an_empty_node]) ).

cnf(d0,plain,
    ( ~ contradictory(atom,X2)
    | 'failure$unode'('parent$uof'('n$uleft',X0),or(empty,X1))
    | ~ 'failure$unode'(X0,or(X1,X2))
    | ~ siblings('n$uleft',X0) ),
    inference(resolution,[status(thm)],[c4,c0]) ).

cnf(d1,plain,
    ( ~ contradictory(atom,negate(atom))
    | 'failure$unode'('parent$uof'('n$uleft','n$uright'),or(empty,empty))
    | ~ siblings('n$uleft','n$uright') ),
    inference(resolution,[status(thm)],[d0,c5]) ).

cnf(d2,plain,
    ( 'failure$unode'('parent$uof'('n$uleft','n$uright'),or(empty,empty))
    | ~ siblings('n$uleft','n$uright') ),
    inference(resolution,[status(thm)],[c2,d1]) ).

cnf(d3,plain,
    siblings('n$uleft','right$uchild$uof'(n)),
    inference(superposition,[status(thm)],[c6,c3]) ).

cnf(d4,plain,
    siblings('n$uleft','n$uright'),
    inference(demodulation,[status(thm)],[d3,c7]) ).

cnf(d5,plain,
    'failure$unode'('parent$uof'('n$uleft','n$uright'),or(empty,empty)),
    inference(resolution,[status(thm)],[d4,d2]) ).

cnf(d6,plain,
    $false,
    inference(resolution,[status(thm)],[c8,d5]) ).

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