↑ Up

LisaST---0.9.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : LisaST---0.9
% Problem  : PUZ021-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 : n005.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 08:22:05 AM UTC 2026

% Result   : Unsatisfiable 18.34s 3.06s
% Output   : CNFRefutation 18.34s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   15
%            Number of leaves      :   11
% Syntax   : Number of clauses     :   63 (   7 unt;  30 nHn;  37 RR)
%            Number of literals    :  136 (   0 equ;  54 neg)
%            Maximal clause size   :    3 (   2 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   1 con; 0-2 aty)
%            Number of variables   :   99 (  10 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(not_knight_and_knave,axiom,
    ( ~ 'a$utruth'(knave(X0),X1)
    | ~ 'a$utruth'(knight(X0),X1) ) ).

cnf(knight_or_knave,axiom,
    ( 'a$utruth'(knave(X0),X1)
    | 'a$utruth'(knight(X0),X1) ) ).

cnf(not_rich_and_poor,axiom,
    ( ~ 'a$utruth'(poor(X0),X1)
    | ~ 'a$utruth'(rich(X0),X1) ) ).

cnf(knights_tell_truth1,axiom,
    ( 'a$utruth'(X2,X1)
    | ~ says(X0,X2)
    | ~ 'a$utruth'(knight(X0),X1) ) ).

cnf(knaves_lie1,axiom,
    ( ~ 'a$utruth'(X2,X1)
    | ~ says(X0,X2)
    | ~ 'a$utruth'(knave(X0),X1) ) ).

cnf(knaves_lie2,axiom,
    ( 'a$utruth'(X2,X1)
    | says(X0,X2)
    | ~ 'a$utruth'(knave(X0),X1) ) ).

cnf(conjunction1,axiom,
    ( 'a$utruth'(X0,X2)
    | ~ 'a$utruth'(and(X0,X1),X2) ) ).

cnf(conjunction2,axiom,
    ( 'a$utruth'(X1,X2)
    | ~ 'a$utruth'(and(X0,X1),X2) ) ).

cnf(conjunction3,axiom,
    ( ~ 'a$utruth'(X1,X2)
    | ~ 'a$utruth'(X0,X2)
    | 'a$utruth'(and(X0,X1),X2) ) ).

cnf(prove_statement_exists1,negated_conjecture,
    ( ~ 'a$utruth'(and(knave(me),rich(me)),X0)
    | ~ says(me,X0) ) ).

cnf(prove_statement_exists2,negated_conjecture,
    ( 'a$utruth'(and(knave(me),rich(me)),X0)
    | says(me,X0) ) ).

cnf(c0,plain,
    ( ~ 'a$utruth'(knave(X0),X1)
    | ~ 'a$utruth'(knight(X0),X1) ),
    inference(clausification,[status(esa)],[not_knight_and_knave]) ).

cnf(c1,plain,
    ( 'a$utruth'(knave(X0),X1)
    | 'a$utruth'(knight(X0),X1) ),
    inference(clausification,[status(esa)],[knight_or_knave]) ).

cnf(c2,plain,
    ( ~ 'a$utruth'(poor(X0),X1)
    | ~ 'a$utruth'(rich(X0),X1) ),
    inference(clausification,[status(esa)],[not_rich_and_poor]) ).

cnf(c4,plain,
    ( 'a$utruth'(X2,X1)
    | ~ says(X0,X2)
    | ~ 'a$utruth'(knight(X0),X1) ),
    inference(clausification,[status(esa)],[knights_tell_truth1]) ).

cnf(c6,plain,
    ( ~ 'a$utruth'(X2,X1)
    | ~ says(X0,X2)
    | ~ 'a$utruth'(knave(X0),X1) ),
    inference(clausification,[status(esa)],[knaves_lie1]) ).

cnf(c7,plain,
    ( 'a$utruth'(X2,X1)
    | says(X0,X2)
    | ~ 'a$utruth'(knave(X0),X1) ),
    inference(clausification,[status(esa)],[knaves_lie2]) ).

cnf(c8,plain,
    ( 'a$utruth'(X0,X2)
    | ~ 'a$utruth'(and(X0,X1),X2) ),
    inference(clausification,[status(esa)],[conjunction1]) ).

cnf(c9,plain,
    ( 'a$utruth'(X1,X2)
    | ~ 'a$utruth'(and(X0,X1),X2) ),
    inference(clausification,[status(esa)],[conjunction2]) ).

cnf(c10,plain,
    ( ~ 'a$utruth'(X1,X2)
    | ~ 'a$utruth'(X0,X2)
    | 'a$utruth'(and(X0,X1),X2) ),
    inference(clausification,[status(esa)],[conjunction3]) ).

cnf(c11,plain,
    ( ~ 'a$utruth'(and(knave(me),rich(me)),X0)
    | ~ says(me,X0) ),
    inference(clausification,[status(esa)],[prove_statement_exists1]) ).

cnf(c12,plain,
    ( 'a$utruth'(and(knave(me),rich(me)),X0)
    | says(me,X0) ),
    inference(clausification,[status(esa)],[prove_statement_exists2]) ).

cnf(d0,plain,
    ( 'a$utruth'(knave(me),X0)
    | says(me,X0) ),
    inference(resolution,[status(thm)],[c12,c8]) ).

cnf(d1,plain,
    ( says(me,X1)
    | 'a$utruth'(X1,X0)
    | says(me,X0) ),
    inference(resolution,[status(thm)],[d0,c7]) ).

cnf(d2,plain,
    ( says(me,X0)
    | 'a$utruth'(X0,X0) ),
    inference(factoring,[status(thm)],[d1]) ).

cnf(d3,plain,
    ( 'a$utruth'(X0,and(X0,X1))
    | says(me,and(X0,X1)) ),
    inference(resolution,[status(thm)],[d2,c8]) ).

cnf(d4,plain,
    ( ~ says(me,X1)
    | ~ 'a$utruth'(X1,X0)
    | says(me,X0) ),
    inference(resolution,[status(thm)],[d0,c6]) ).

cnf(d5,plain,
    ( 'a$utruth'(rich(me),X0)
    | says(me,X0) ),
    inference(resolution,[status(thm)],[c12,c9]) ).

cnf(d6,plain,
    ( ~ 'a$utruth'(rich(X0),X1)
    | says(me,X1)
    | says(me,poor(X0)) ),
    inference(resolution,[status(thm)],[d1,c2]) ).

cnf(d7,plain,
    ( says(me,X0)
    | says(me,poor(me))
    | says(me,X0) ),
    inference(resolution,[status(thm)],[d6,d5]) ).

cnf(d8,plain,
    says(me,poor(me)),
    inference(factoring,[status(thm)],[d7]) ).

cnf(d9,plain,
    ( says(me,X0)
    | ~ 'a$utruth'(poor(me),X0) ),
    inference(resolution,[status(thm)],[d8,d4]) ).

cnf(d10,plain,
    ( 'a$utruth'(X1,and(X0,X1))
    | says(me,and(X0,X1)) ),
    inference(resolution,[status(thm)],[d2,c9]) ).

cnf(d11,plain,
    ( says(me,and(X0,poor(me)))
    | says(me,and(X0,poor(me))) ),
    inference(resolution,[status(thm)],[d10,d9]) ).

cnf(d12,plain,
    ( says(me,X1)
    | ~ 'a$utruth'(and(X0,poor(me)),X1) ),
    inference(resolution,[status(thm)],[d11,d4]) ).

cnf(d13,plain,
    ( says(me,and(and(X0,poor(me)),X1))
    | says(me,and(and(X0,poor(me)),X1)) ),
    inference(resolution,[status(thm)],[d12,d3]) ).

cnf(d14,plain,
    ( ~ says(me,X0)
    | ~ 'a$utruth'(rich(me),X0)
    | ~ 'a$utruth'(knave(me),X0) ),
    inference(resolution,[status(thm)],[c10,c11]) ).

cnf(d15,plain,
    ( 'a$utruth'(knave(X2),X1)
    | ~ says(X2,X0)
    | 'a$utruth'(X0,X1) ),
    inference(resolution,[status(thm)],[c4,c1]) ).

cnf(d16,plain,
    ( 'a$utruth'(knave(me),X0)
    | 'a$utruth'(poor(me),X0) ),
    inference(resolution,[status(thm)],[d8,d15]) ).

cnf(d17,plain,
    ( ~ 'a$utruth'(rich(me),X0)
    | 'a$utruth'(knave(me),X0) ),
    inference(resolution,[status(thm)],[d16,c2]) ).

cnf(d18,plain,
    ( ~ 'a$utruth'(knave(X0),knight(X0))
    | says(me,knight(X0)) ),
    inference(resolution,[status(thm)],[d2,c0]) ).

cnf(d19,plain,
    ( says(me,knight(me))
    | says(me,knight(me)) ),
    inference(resolution,[status(thm)],[d18,d0]) ).

cnf(d20,plain,
    ( says(me,X0)
    | ~ 'a$utruth'(knight(me),X0) ),
    inference(resolution,[status(thm)],[d19,d4]) ).

cnf(d21,plain,
    ( says(me,and(knight(me),X0))
    | says(me,and(knight(me),X0)) ),
    inference(resolution,[status(thm)],[d3,d20]) ).

cnf(d22,plain,
    ( 'a$utruth'(knave(me),X1)
    | 'a$utruth'(and(knight(me),X0),X1) ),
    inference(resolution,[status(thm)],[d21,d15]) ).

cnf(d23,plain,
    ( 'a$utruth'(X1,X0)
    | 'a$utruth'(knave(me),X0) ),
    inference(resolution,[status(thm)],[d22,c9]) ).

cnf(d24,plain,
    ( 'a$utruth'(knave(me),X0)
    | 'a$utruth'(knave(me),X0) ),
    inference(resolution,[status(thm)],[d23,d17]) ).

cnf(d25,plain,
    ( ~ says(me,X0)
    | ~ 'a$utruth'(rich(me),X0) ),
    inference(resolution,[status(thm)],[d24,d14]) ).

cnf(d26,plain,
    ( 'a$utruth'(knave(me),X1)
    | 'a$utruth'(X0,X1)
    | 'a$utruth'(X0,X0) ),
    inference(resolution,[status(thm)],[d2,d15]) ).

cnf(d27,plain,
    ( 'a$utruth'(knave(me),X0)
    | 'a$utruth'(X0,X0) ),
    inference(factoring,[status(thm)],[d26]) ).

cnf(d28,plain,
    ( 'a$utruth'(knave(me),rich(me))
    | 'a$utruth'(knave(me),rich(me)) ),
    inference(resolution,[status(thm)],[d17,d27]) ).

cnf(d29,plain,
    ( ~ says(me,X0)
    | ~ 'a$utruth'(X0,rich(me)) ),
    inference(resolution,[status(thm)],[d28,c6]) ).

cnf(d30,plain,
    ( 'a$utruth'(knave(me),knave(me))
    | 'a$utruth'(knave(me),knave(me)) ),
    inference(factoring,[status(thm)],[d26]) ).

cnf(d31,plain,
    ( ~ says(me,X0)
    | ~ 'a$utruth'(X0,knave(me)) ),
    inference(resolution,[status(thm)],[d30,c6]) ).

cnf(d32,plain,
    ~ says(me,knave(me)),
    inference(resolution,[status(thm)],[d31,d30]) ).

cnf(d33,plain,
    ( says(me,X1)
    | ~ 'a$utruth'(X0,X1)
    | 'a$utruth'(X0,X0) ),
    inference(resolution,[status(thm)],[d2,d4]) ).

cnf(d34,plain,
    ( says(me,X0)
    | says(me,X0)
    | 'a$utruth'(rich(me),rich(me)) ),
    inference(resolution,[status(thm)],[d33,d5]) ).

cnf(d35,plain,
    'a$utruth'(rich(me),rich(me)),
    inference(resolution,[status(thm)],[d34,d32]) ).

cnf(d36,plain,
    ~ says(me,rich(me)),
    inference(resolution,[status(thm)],[d35,d29]) ).

cnf(d37,plain,
    ( says(me,X0)
    | 'a$utruth'(X0,X1) ),
    inference(resolution,[status(thm)],[d24,c7]) ).

cnf(d38,plain,
    'a$utruth'(rich(me),X0),
    inference(resolution,[status(thm)],[d37,d36]) ).

cnf(d39,plain,
    ~ says(me,X0),
    inference(resolution,[status(thm)],[d38,d25]) ).

cnf(d40,plain,
    $false,
    inference(resolution,[status(thm)],[d39,d13]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : PUZ021-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.08/0.35  % Computer : n005.cluster.edu
% 0.08/0.35  % Model    : x86_64 x86_64
% 0.08/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35  % Memory   : 8046.5625MB
% 0.08/0.35  % OS       : Linux 6.8.0-71-generic
% 0.08/0.35  % CPULimit : 300
% 0.08/0.35  % WCLimit  : 300
% 0.08/0.35  % DateTime : Sat Sep 26 05:05:01 UTC 2026
% 0.08/0.36  % CPUTime  : 
% 0.08/0.36  Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 18.34/3.06  % SZS status Unsatisfiable for theBenchmark.p
% 18.34/3.06  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------