↑ Up

LisaST---0.9.UNS-CRf.s

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

% Computer : n016.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:21:32 AM UTC 2026

% Result   : Unsatisfiable 11.26s 16.89s
% Output   : CNFRefutation 11.26s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   35
%            Number of leaves      :   12
% Syntax   : Number of clauses     :   60 (  12 unt;   0 nHn;  55 RR)
%            Number of literals    :  216 (   0 equ; 170 neg)
%            Maximal clause size   :    7 (   3 avg)
%            Maximal term depth    :    6 (   2 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-3 aty)
%            Number of functors    :    8 (   8 usr;   3 con; 0-2 aty)
%            Number of variables   :   65 (   7 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(no_missionaries_is_safe,axiom,
    safe(n0,X0) ).

cnf(same_or_more_missionaries_is_safe,axiom,
    ( safe(X0,X1)
    | ~ 'greater$uor$uequal'(X0,X1) ) ).

cnf(great_eq_base,axiom,
    'greater$uor$uequal'(X0,n0) ).

cnf(great_eq_recursive,axiom,
    ( ~ 'greater$uor$uequal'(X0,X1)
    | 'greater$uor$uequal'(s(X0),s(X1)) ) ).

cnf(cannibal_east_to_west,axiom,
    ( achievable(west(m(X0),c(s(X1))),boatonwest,east(m(X2),c(X3)))
    | ~ safe(X2,X3)
    | ~ safe(X0,s(X1))
    | ~ achievable(west(m(X0),c(X1)),boatoneast,east(m(X2),c(s(X3)))) ) ).

cnf(two_cannibals_west_to_east,axiom,
    ( achievable(west(m(X0),c(X1)),boatoneast,east(m(X2),c(s(s(X3)))))
    | ~ safe(X2,s(s(X3)))
    | ~ safe(X0,X1)
    | ~ achievable(west(m(X0),c(s(s(X1)))),boatonwest,east(m(X2),c(X3))) ) ).

cnf(missionary_east_to_west,axiom,
    ( achievable(west(m(s(X0)),c(X1)),boatonwest,east(m(X2),c(X3)))
    | ~ safe(X2,X3)
    | ~ safe(s(X0),X1)
    | ~ achievable(west(m(X0),c(X1)),boatoneast,east(m(s(X2)),c(X3))) ) ).

cnf(two_missionaries_west_to_east,axiom,
    ( achievable(west(m(X0),c(X1)),boatoneast,east(m(s(s(X2))),c(X3)))
    | ~ safe(s(s(X2)),X3)
    | ~ safe(X0,X1)
    | ~ achievable(west(m(s(s(X0))),c(X1)),boatonwest,east(m(X2),c(X3))) ) ).

cnf(missionary_and_cannibal_west_to_east,axiom,
    ( achievable(west(m(X0),c(X1)),boatoneast,east(m(s(X2)),c(s(X3))))
    | ~ safe(s(X2),s(X3))
    | ~ safe(X0,X1)
    | ~ achievable(west(m(s(X0)),c(s(X1))),boatonwest,east(m(X2),c(X3))) ) ).

cnf(missionary_and_cannibal_east_to_west,axiom,
    ( achievable(west(m(s(X0)),c(s(X1))),boatonwest,east(m(X2),c(X3)))
    | ~ safe(X2,X3)
    | ~ safe(s(X0),s(X1))
    | ~ achievable(west(m(X0),c(X1)),boatoneast,east(m(s(X2)),c(s(X3)))) ) ).

cnf(start_on_west_bank,hypothesis,
    achievable(west(m(s(s(s(n0)))),c(s(s(s(n0))))),boatonwest,east(m(n0),c(n0))) ).

cnf(prove_can_get_to_east_bank,negated_conjecture,
    ~ achievable(west(m(n0),c(n0)),X0,east(m(s(s(s(n0)))),c(s(s(s(n0)))))) ).

cnf(c0,plain,
    safe(n0,X0),
    inference(clausification,[status(esa)],[no_missionaries_is_safe]) ).

cnf(c1,plain,
    ( safe(X0,X1)
    | ~ 'greater$uor$uequal'(X0,X1) ),
    inference(clausification,[status(esa)],[same_or_more_missionaries_is_safe]) ).

cnf(c2,plain,
    'greater$uor$uequal'(X0,n0),
    inference(clausification,[status(esa)],[great_eq_base]) ).

cnf(c3,plain,
    ( ~ 'greater$uor$uequal'(X0,X1)
    | 'greater$uor$uequal'(s(X0),s(X1)) ),
    inference(clausification,[status(esa)],[great_eq_recursive]) ).

cnf(c5,plain,
    ( achievable(west(m(X0),c(s(X1))),boatonwest,east(m(X2),c(X3)))
    | ~ safe(X2,X3)
    | ~ safe(X0,s(X1))
    | ~ achievable(west(m(X0),c(X1)),boatoneast,east(m(X2),c(s(X3)))) ),
    inference(clausification,[status(esa)],[cannibal_east_to_west]) ).

cnf(c6,plain,
    ( achievable(west(m(X0),c(X1)),boatoneast,east(m(X2),c(s(s(X3)))))
    | ~ safe(X2,s(s(X3)))
    | ~ safe(X0,X1)
    | ~ achievable(west(m(X0),c(s(s(X1)))),boatonwest,east(m(X2),c(X3))) ),
    inference(clausification,[status(esa)],[two_cannibals_west_to_east]) ).

cnf(c9,plain,
    ( achievable(west(m(s(X0)),c(X1)),boatonwest,east(m(X2),c(X3)))
    | ~ safe(X2,X3)
    | ~ safe(s(X0),X1)
    | ~ achievable(west(m(X0),c(X1)),boatoneast,east(m(s(X2)),c(X3))) ),
    inference(clausification,[status(esa)],[missionary_east_to_west]) ).

cnf(c10,plain,
    ( achievable(west(m(X0),c(X1)),boatoneast,east(m(s(s(X2))),c(X3)))
    | ~ safe(s(s(X2)),X3)
    | ~ safe(X0,X1)
    | ~ achievable(west(m(s(s(X0))),c(X1)),boatonwest,east(m(X2),c(X3))) ),
    inference(clausification,[status(esa)],[two_missionaries_west_to_east]) ).

cnf(c12,plain,
    ( achievable(west(m(X0),c(X1)),boatoneast,east(m(s(X2)),c(s(X3))))
    | ~ safe(s(X2),s(X3))
    | ~ safe(X0,X1)
    | ~ achievable(west(m(s(X0)),c(s(X1))),boatonwest,east(m(X2),c(X3))) ),
    inference(clausification,[status(esa)],[missionary_and_cannibal_west_to_east]) ).

cnf(c13,plain,
    ( achievable(west(m(s(X0)),c(s(X1))),boatonwest,east(m(X2),c(X3)))
    | ~ safe(X2,X3)
    | ~ safe(s(X0),s(X1))
    | ~ achievable(west(m(X0),c(X1)),boatoneast,east(m(s(X2)),c(s(X3)))) ),
    inference(clausification,[status(esa)],[missionary_and_cannibal_east_to_west]) ).

cnf(c14,plain,
    achievable(west(m(s(s(s(n0)))),c(s(s(s(n0))))),boatonwest,east(m(n0),c(n0))),
    inference(clausification,[status(esa)],[start_on_west_bank]) ).

cnf(c15,plain,
    ~ achievable(west(m(n0),c(n0)),X0,east(m(s(s(s(n0)))),c(s(s(s(n0)))))),
    inference(clausification,[status(esa)],[prove_can_get_to_east_bank]) ).

cnf(d0,plain,
    ( safe(s(X0),s(X1))
    | ~ 'greater$uor$uequal'(X0,X1) ),
    inference(resolution,[status(thm)],[c3,c1]) ).

cnf(d1,plain,
    ( achievable(west(m(s(s(s(n0)))),c(s(n0))),boatoneast,east(m(n0),c(s(s(n0)))))
    | ~ safe(n0,s(s(n0)))
    | ~ safe(s(s(s(n0))),s(n0)) ),
    inference(resolution,[status(thm)],[c6,c14]) ).

cnf(d2,plain,
    ( achievable(west(m(s(s(s(n0)))),c(s(n0))),boatoneast,east(m(n0),c(s(s(n0)))))
    | ~ safe(s(s(s(n0))),s(n0)) ),
    inference(resolution,[status(thm)],[c0,d1]) ).

cnf(d3,plain,
    ( achievable(west(m(s(s(s(n0)))),c(s(s(n0)))),boatonwest,east(m(n0),c(s(n0))))
    | ~ safe(s(s(s(n0))),s(s(n0)))
    | ~ safe(n0,s(n0))
    | ~ safe(s(s(s(n0))),s(n0)) ),
    inference(resolution,[status(thm)],[d2,c5]) ).

cnf(d4,plain,
    ( achievable(west(m(s(s(s(n0)))),c(s(s(n0)))),boatonwest,east(m(n0),c(s(n0))))
    | ~ safe(s(s(s(n0))),s(s(n0)))
    | ~ safe(s(s(s(n0))),s(n0)) ),
    inference(resolution,[status(thm)],[c0,d3]) ).

cnf(d5,plain,
    ( achievable(west(m(s(s(s(n0)))),c(n0)),boatoneast,east(m(n0),c(s(s(s(n0))))))
    | ~ safe(n0,s(s(s(n0))))
    | ~ safe(s(s(s(n0))),n0)
    | ~ safe(s(s(s(n0))),s(s(n0)))
    | ~ safe(s(s(s(n0))),s(n0)) ),
    inference(resolution,[status(thm)],[d4,c6]) ).

cnf(d6,plain,
    ( achievable(west(m(s(s(s(n0)))),c(n0)),boatoneast,east(m(n0),c(s(s(s(n0))))))
    | ~ safe(s(s(s(n0))),s(s(n0)))
    | ~ safe(s(s(s(n0))),s(n0))
    | ~ safe(s(s(s(n0))),n0) ),
    inference(resolution,[status(thm)],[c0,d5]) ).

cnf(d7,plain,
    safe(X0,n0),
    inference(resolution,[status(thm)],[c2,c1]) ).

cnf(d8,plain,
    ( achievable(west(m(s(s(s(n0)))),c(n0)),boatoneast,east(m(n0),c(s(s(s(n0))))))
    | ~ safe(s(s(s(n0))),s(s(n0)))
    | ~ safe(s(s(s(n0))),s(n0)) ),
    inference(resolution,[status(thm)],[d7,d6]) ).

cnf(d9,plain,
    ( achievable(west(m(s(s(s(n0)))),c(s(n0))),boatonwest,east(m(n0),c(s(s(n0)))))
    | ~ safe(s(s(s(n0))),s(n0))
    | ~ safe(n0,s(s(n0)))
    | ~ safe(s(s(s(n0))),s(s(n0)))
    | ~ safe(s(s(s(n0))),s(n0)) ),
    inference(resolution,[status(thm)],[d8,c5]) ).

cnf(d10,plain,
    ( achievable(west(m(s(s(s(n0)))),c(s(n0))),boatonwest,east(m(n0),c(s(s(n0)))))
    | ~ safe(s(s(s(n0))),s(s(n0)))
    | ~ safe(s(s(s(n0))),s(n0)) ),
    inference(resolution,[status(thm)],[c0,d9]) ).

cnf(d11,plain,
    ( achievable(west(m(s(n0)),c(s(n0))),boatoneast,east(m(s(s(n0))),c(s(s(n0)))))
    | ~ safe(s(s(n0)),s(s(n0)))
    | ~ safe(s(n0),s(n0))
    | ~ safe(s(s(s(n0))),s(s(n0)))
    | ~ safe(s(s(s(n0))),s(n0)) ),
    inference(resolution,[status(thm)],[d10,c10]) ).

cnf(d12,plain,
    ( achievable(west(m(s(s(n0))),c(s(s(n0)))),boatonwest,east(m(s(n0)),c(s(n0))))
    | ~ safe(s(s(n0)),s(s(n0)))
    | ~ safe(s(n0),s(n0))
    | ~ safe(s(s(s(n0))),s(s(n0)))
    | ~ safe(s(s(s(n0))),s(n0))
    | ~ safe(s(s(n0)),s(s(n0)))
    | ~ safe(s(n0),s(n0)) ),
    inference(resolution,[status(thm)],[d11,c13]) ).

cnf(d13,plain,
    ( achievable(west(m(n0),c(s(s(n0)))),boatoneast,east(m(s(s(s(n0)))),c(s(n0))))
    | ~ safe(s(s(s(n0))),s(n0))
    | ~ safe(n0,s(s(n0)))
    | ~ safe(s(s(s(n0))),s(s(n0)))
    | ~ safe(s(s(s(n0))),s(n0))
    | ~ safe(s(s(n0)),s(s(n0)))
    | ~ safe(s(n0),s(n0)) ),
    inference(resolution,[status(thm)],[d12,c10]) ).

cnf(d14,plain,
    ( achievable(west(m(n0),c(s(s(n0)))),boatoneast,east(m(s(s(s(n0)))),c(s(n0))))
    | ~ safe(s(s(s(n0))),s(s(n0)))
    | ~ safe(s(s(s(n0))),s(n0))
    | ~ safe(s(s(n0)),s(s(n0)))
    | ~ safe(s(n0),s(n0)) ),
    inference(resolution,[status(thm)],[c0,d13]) ).

cnf(d15,plain,
    ( achievable(west(m(n0),c(s(s(s(n0))))),boatonwest,east(m(s(s(s(n0)))),c(n0)))
    | ~ safe(n0,s(s(s(n0))))
    | ~ safe(s(s(s(n0))),n0)
    | ~ safe(s(s(s(n0))),s(s(n0)))
    | ~ safe(s(s(s(n0))),s(n0))
    | ~ safe(s(s(n0)),s(s(n0)))
    | ~ safe(s(n0),s(n0)) ),
    inference(resolution,[status(thm)],[d14,c5]) ).

cnf(d16,plain,
    ( achievable(west(m(n0),c(s(s(s(n0))))),boatonwest,east(m(s(s(s(n0)))),c(n0)))
    | ~ safe(s(s(s(n0))),s(s(n0)))
    | ~ safe(s(s(s(n0))),s(n0))
    | ~ safe(s(s(s(n0))),n0)
    | ~ safe(s(s(n0)),s(s(n0)))
    | ~ safe(s(n0),s(n0)) ),
    inference(resolution,[status(thm)],[c0,d15]) ).

cnf(d17,plain,
    ( achievable(west(m(n0),c(s(s(s(n0))))),boatonwest,east(m(s(s(s(n0)))),c(n0)))
    | ~ safe(s(s(s(n0))),s(s(n0)))
    | ~ safe(s(s(s(n0))),s(n0))
    | ~ safe(s(s(n0)),s(s(n0)))
    | ~ safe(s(n0),s(n0)) ),
    inference(resolution,[status(thm)],[d7,d16]) ).

cnf(d18,plain,
    ( achievable(west(m(n0),c(s(n0))),boatoneast,east(m(s(s(s(n0)))),c(s(s(n0)))))
    | ~ safe(s(s(s(n0))),s(s(n0)))
    | ~ safe(n0,s(n0))
    | ~ safe(s(s(s(n0))),s(s(n0)))
    | ~ safe(s(s(s(n0))),s(n0))
    | ~ safe(s(s(n0)),s(s(n0)))
    | ~ safe(s(n0),s(n0)) ),
    inference(resolution,[status(thm)],[d17,c6]) ).

cnf(d19,plain,
    ( achievable(west(m(n0),c(s(n0))),boatoneast,east(m(s(s(s(n0)))),c(s(s(n0)))))
    | ~ safe(s(s(s(n0))),s(s(n0)))
    | ~ safe(s(s(s(n0))),s(n0))
    | ~ safe(s(s(n0)),s(s(n0)))
    | ~ safe(s(n0),s(n0)) ),
    inference(resolution,[status(thm)],[c0,d18]) ).

cnf(d20,plain,
    ( achievable(west(m(s(n0)),c(s(n0))),boatonwest,east(m(s(s(n0))),c(s(s(n0)))))
    | ~ safe(s(n0),s(n0))
    | ~ safe(s(s(n0)),s(s(n0)))
    | ~ safe(s(s(s(n0))),s(s(n0)))
    | ~ safe(s(s(s(n0))),s(n0))
    | ~ safe(s(s(n0)),s(s(n0)))
    | ~ safe(s(n0),s(n0)) ),
    inference(resolution,[status(thm)],[d19,c9]) ).

cnf(d21,plain,
    ( achievable(west(m(n0),c(n0)),boatoneast,east(m(s(s(s(n0)))),c(s(s(s(n0))))))
    | ~ safe(s(s(s(n0))),s(s(s(n0))))
    | ~ safe(n0,n0)
    | ~ safe(s(s(s(n0))),s(s(n0)))
    | ~ safe(s(s(s(n0))),s(n0))
    | ~ safe(s(s(n0)),s(s(n0)))
    | ~ safe(s(n0),s(n0)) ),
    inference(resolution,[status(thm)],[d20,c12]) ).

cnf(d22,plain,
    ( achievable(west(m(n0),c(n0)),boatoneast,east(m(s(s(s(n0)))),c(s(s(s(n0))))))
    | ~ safe(s(s(s(n0))),s(s(s(n0))))
    | ~ safe(s(s(s(n0))),s(s(n0)))
    | ~ safe(s(s(s(n0))),s(n0))
    | ~ safe(s(s(n0)),s(s(n0)))
    | ~ safe(s(n0),s(n0)) ),
    inference(resolution,[status(thm)],[c0,d21]) ).

cnf(d23,plain,
    ( ~ safe(s(s(s(n0))),s(s(s(n0))))
    | ~ safe(s(s(s(n0))),s(s(n0)))
    | ~ safe(s(s(s(n0))),s(n0))
    | ~ safe(s(s(n0)),s(s(n0)))
    | ~ safe(s(n0),s(n0)) ),
    inference(resolution,[status(thm)],[c15,d22]) ).

cnf(d24,plain,
    ( ~ 'greater$uor$uequal'(s(s(n0)),s(s(n0)))
    | ~ safe(s(s(s(n0))),s(s(n0)))
    | ~ safe(s(s(s(n0))),s(n0))
    | ~ safe(s(s(n0)),s(s(n0)))
    | ~ safe(s(n0),s(n0)) ),
    inference(resolution,[status(thm)],[d23,d0]) ).

cnf(d25,plain,
    ( ~ 'greater$uor$uequal'(s(s(n0)),s(n0))
    | ~ 'greater$uor$uequal'(s(s(n0)),s(s(n0)))
    | ~ safe(s(s(s(n0))),s(n0))
    | ~ safe(s(s(n0)),s(s(n0)))
    | ~ safe(s(n0),s(n0)) ),
    inference(resolution,[status(thm)],[d24,d0]) ).

cnf(d26,plain,
    ( ~ 'greater$uor$uequal'(s(n0),s(n0))
    | ~ 'greater$uor$uequal'(s(s(n0)),s(n0))
    | ~ safe(s(s(s(n0))),s(n0))
    | ~ safe(s(s(n0)),s(s(n0)))
    | ~ safe(s(n0),s(n0)) ),
    inference(resolution,[status(thm)],[d25,c3]) ).

cnf(d27,plain,
    ( ~ 'greater$uor$uequal'(s(s(n0)),n0)
    | ~ 'greater$uor$uequal'(s(s(n0)),s(n0))
    | ~ 'greater$uor$uequal'(s(n0),s(n0))
    | ~ safe(s(s(n0)),s(s(n0)))
    | ~ safe(s(n0),s(n0)) ),
    inference(resolution,[status(thm)],[d26,d0]) ).

cnf(d28,plain,
    ( ~ 'greater$uor$uequal'(s(s(n0)),s(n0))
    | ~ 'greater$uor$uequal'(s(n0),s(n0))
    | ~ safe(s(s(n0)),s(s(n0)))
    | ~ safe(s(n0),s(n0)) ),
    inference(resolution,[status(thm)],[c2,d27]) ).

cnf(d29,plain,
    ( ~ 'greater$uor$uequal'(s(n0),s(n0))
    | ~ 'greater$uor$uequal'(s(s(n0)),s(n0))
    | ~ 'greater$uor$uequal'(s(n0),s(n0))
    | ~ safe(s(n0),s(n0)) ),
    inference(resolution,[status(thm)],[d28,d0]) ).

cnf(d30,plain,
    ( ~ 'greater$uor$uequal'(s(n0),n0)
    | ~ 'greater$uor$uequal'(s(n0),s(n0))
    | ~ safe(s(n0),s(n0)) ),
    inference(resolution,[status(thm)],[d29,c3]) ).

cnf(d31,plain,
    ( ~ 'greater$uor$uequal'(s(n0),s(n0))
    | ~ safe(s(n0),s(n0)) ),
    inference(resolution,[status(thm)],[c2,d30]) ).

cnf(d32,plain,
    ( ~ 'greater$uor$uequal'(n0,n0)
    | ~ safe(s(n0),s(n0)) ),
    inference(resolution,[status(thm)],[d31,c3]) ).

cnf(d33,plain,
    ~ safe(s(n0),s(n0)),
    inference(resolution,[status(thm)],[c2,d32]) ).

cnf(d34,plain,
    ~ 'greater$uor$uequal'(n0,n0),
    inference(resolution,[status(thm)],[d33,d0]) ).

cnf(d35,plain,
    $false,
    inference(resolution,[status(thm)],[c2,d34]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01  % Problem  : PUZ008-3 : TPTP v9.3.1. Released v1.2.0.
% 0.00/0.02  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/5.38   % Computer : n016.cluster.edu
% 0.09/5.38   % Model    : x86_64 x86_64
% 0.09/5.38   % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/5.38   % Memory   : 8046.5625MB
% 0.09/5.38   % OS       : Linux 6.8.0-71-generic
% 0.02/15.22  % CPULimit : 300
% 0.02/15.22  % WCLimit  : 300
% 0.02/15.22  % DateTime : Sat Sep 26 05:03:06 UTC 2026
% 0.02/15.22  % CPUTime  : 
% 0.02/15.22  Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 11.26/16.89  % SZS status Unsatisfiable for theBenchmark.p
% 11.26/16.89  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------