%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : PUZ001+2 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox2/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 08:22:42 AM UTC 2026
% Result : Theorem 0.10s 0.39s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 1
% Syntax : Number of formulae : 3 ( 2 unt; 0 def)
% Number of atoms : 31 ( 8 equ)
% Maximal formula atoms : 29 ( 10 avg)
% Number of connectives : 36 ( 8 ~; 2 |; 16 &)
% ( 0 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 8 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 7 ( 4 usr; 2 prp; 0-4 aty)
% Number of functors : 10 ( 10 usr; 10 con; 0-0 aty)
% Number of variables : 30 ( 2 sgn 14 !; 14 ?)
% Comments :
%------------------------------------------------------------------------------
fof(background,axiom,
? [A,B,C] :
( 'AuntAgatha' != 'Butler'
& ! [Z] :
( $true
=> ~ ! [A1] :
( $true
=> ? [B1] : predicate2(B1,hate,Z,A1) ) )
& ! [W,X] :
( predicate2(X,hate,'AuntAgatha',W)
=> ? [Y] : predicate2(Y,hate,'Butler',W) )
& ! [T] :
( ~ ? [U] :
( T = U
& property2(U,rich,comp_than,'AuntAgatha') )
=> ? [V] : predicate2(V,hate,'Butler',T) )
& ! [R] :
( R != 'Butler'
=> ? [S] : predicate2(S,hate,'AuntAgatha',R) )
& ~ ? [Q] : predicate2(Q,hate,'AuntAgatha','Butler')
& ! [N,O] :
( predicate2(O,hate,'AuntAgatha',N)
=> ~ ? [P] : predicate2(P,hate,'Charles',N) )
& ! [J] :
( $true
=> ~ ? [K,L,M] :
( J = M
& property2(M,rich,comp_than,K)
& predicate2(L,kill,J,K) ) )
& ! [F] :
( $true
=> ! [G,H] :
( predicate2(H,kill,F,G)
=> ? [I] : predicate2(I,hate,F,G) ) )
& ! [D,E] :
( ( modifier_pp(E,in,'DreadburyMansion')
& predicate1(E,live,D) )
=> ( D = 'Charles'
| D = 'Butler'
| D = 'AuntAgatha' ) )
& predicate2(C,kill,A,'AuntAgatha')
& modifier_pp(B,in,'DreadburyMansion')
& predicate1(B,live,A) ),
file('theBenchmark.p',background) ).
cnf(c_17,plain,
A != B,
inference(clausify,[status(thm)],[background]) ).
cnf(c_18,plain,
$false,
inference(copy,[status(thm)],[c_17]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : PUZ001+2 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.36 % Computer : n004.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Sat Sep 26 05:02:36 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.10/0.37 % Process 863879 was started by sandbox2 on n004,
% 0.10/0.37 % Sat Sep 26 05:02:36 2026
% 0.10/0.37 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.10/0.38
% 0.10/0.38 % From the command line: assign(max_seconds, 300).
% 0.10/0.39
% 0.10/0.39 % SZS status Theorem for theBenchmark
% 0.10/0.39
% 0.10/0.39 % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.10/0.39 % Length of proof is 3.
% 0.10/0.39 % Level of proof is 2.
% 0.10/0.39 % Maximum clause weight is 0.000.
% 0.10/0.39 % Given clauses 0.
% 0.10/0.39
% 0.10/0.39 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------