%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : PUZ001+1 : TPTP v9.3.1. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox2/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n026.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 : Thu Sep 24 08:54:15 AM UTC 2026
% Result : Theorem 0.21s 0.53s
% Output : Proof 0.21s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
fof(pel55_1,axiom,
? [X] :
( killed(X,agatha)
& lives(X) ),
file('theBenchmark.p',pel55_1) ).
fof(pel55_2_1,axiom,
lives(agatha),
file('theBenchmark.p',pel55_2_1) ).
fof(pel55_2_2,axiom,
lives(butler),
file('theBenchmark.p',pel55_2_2) ).
fof(pel55_2_3,axiom,
lives(charles),
file('theBenchmark.p',pel55_2_3) ).
fof(pel55_3,axiom,
! [X] :
( lives(X)
=> ( X = charles
| X = butler
| X = agatha ) ),
file('theBenchmark.p',pel55_3) ).
fof(pel55_4,axiom,
! [X,Y] :
( killed(X,Y)
=> hates(X,Y) ),
file('theBenchmark.p',pel55_4) ).
fof(pel55_5,axiom,
! [X,Y] :
( killed(X,Y)
=> ~ richer(X,Y) ),
file('theBenchmark.p',pel55_5) ).
fof(pel55_6,axiom,
! [X] :
( hates(agatha,X)
=> ~ hates(charles,X) ),
file('theBenchmark.p',pel55_6) ).
fof(pel55_7,axiom,
! [X] :
( X != butler
=> hates(agatha,X) ),
file('theBenchmark.p',pel55_7) ).
fof(pel55_8,axiom,
! [X] :
( ~ richer(X,agatha)
=> hates(butler,X) ),
file('theBenchmark.p',pel55_8) ).
fof(pel55_9,axiom,
! [X] :
( hates(agatha,X)
=> hates(butler,X) ),
file('theBenchmark.p',pel55_9) ).
fof(pel55_10,axiom,
! [X] :
? [Y] : ~ hates(X,Y),
file('theBenchmark.p',pel55_10) ).
fof(pel55_11,axiom,
agatha != butler,
file('theBenchmark.p',pel55_11) ).
fof(pel55,conjecture,
killed(agatha,agatha),
file('theBenchmark.p',pel55) ).
fof(f_1_1,plain,
? [X] :
( killed(X,agatha)
& lives(X) ),
inference(fof_nnf,[status(thm)],[pel55_1]) ).
fof(f_1_2,plain,
? [U_0] :
( killed(U_0,agatha)
& lives(U_0) ),
inference(variable_rename,[status(thm)],[f_1_1]) ).
fof(f_1_3,plain,
( killed(sK1,agatha)
& lives(sK1) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(U_0,sK1)],[f_1_2]) ).
cnf(f_1_4,plain,
lives(sK1),
inference(clausify,[status(thm)],[f_1_3]) ).
cnf(f_1_5,plain,
killed(sK1,agatha),
inference(clausify,[status(thm)],[f_1_3]) ).
fof(f_2_1,plain,
lives(agatha),
inference(fof_nnf,[status(thm)],[pel55_2_1]) ).
cnf(f_2_2,plain,
lives(agatha),
inference(clausify,[status(thm)],[f_2_1]) ).
fof(f_3_1,plain,
lives(butler),
inference(fof_nnf,[status(thm)],[pel55_2_2]) ).
cnf(f_3_2,plain,
lives(butler),
inference(clausify,[status(thm)],[f_3_1]) ).
fof(f_4_1,plain,
lives(charles),
inference(fof_nnf,[status(thm)],[pel55_2_3]) ).
cnf(f_4_2,plain,
lives(charles),
inference(clausify,[status(thm)],[f_4_1]) ).
fof(f_5_1,plain,
! [X] :
( X = charles
| X = butler
| X = agatha
| ~ lives(X) ),
inference(fof_nnf,[status(thm)],[pel55_3]) ).
fof(f_5_2,plain,
! [U_1] :
( U_1 = charles
| U_1 = butler
| U_1 = agatha
| ~ lives(U_1) ),
inference(variable_rename,[status(thm)],[f_5_1]) ).
cnf(f_5_3,plain,
( U_1 = charles
| U_1 = butler
| U_1 = agatha
| ~ lives(U_1) ),
inference(clausify,[status(thm)],[f_5_2]) ).
fof(f_6_1,plain,
! [X,Y] :
( hates(X,Y)
| ~ killed(X,Y) ),
inference(fof_nnf,[status(thm)],[pel55_4]) ).
fof(f_6_2,plain,
! [U_3,U_2] :
( hates(U_3,U_2)
| ~ killed(U_3,U_2) ),
inference(variable_rename,[status(thm)],[f_6_1]) ).
cnf(f_6_3,plain,
( hates(U_3,U_2)
| ~ killed(U_3,U_2) ),
inference(clausify,[status(thm)],[f_6_2]) ).
fof(f_7_1,plain,
! [X,Y] :
( ~ richer(X,Y)
| ~ killed(X,Y) ),
inference(fof_nnf,[status(thm)],[pel55_5]) ).
fof(f_7_2,plain,
! [U_5,U_4] :
( ~ richer(U_5,U_4)
| ~ killed(U_5,U_4) ),
inference(variable_rename,[status(thm)],[f_7_1]) ).
cnf(f_7_3,plain,
( ~ richer(U_5,U_4)
| ~ killed(U_5,U_4) ),
inference(clausify,[status(thm)],[f_7_2]) ).
fof(f_8_1,plain,
! [X] :
( ~ hates(charles,X)
| ~ hates(agatha,X) ),
inference(fof_nnf,[status(thm)],[pel55_6]) ).
fof(f_8_2,plain,
! [U_6] :
( ~ hates(charles,U_6)
| ~ hates(agatha,U_6) ),
inference(variable_rename,[status(thm)],[f_8_1]) ).
cnf(f_8_3,plain,
( ~ hates(charles,U_6)
| ~ hates(agatha,U_6) ),
inference(clausify,[status(thm)],[f_8_2]) ).
fof(f_9_1,plain,
! [X] :
( hates(agatha,X)
| X = butler ),
inference(fof_nnf,[status(thm)],[pel55_7]) ).
fof(f_9_2,plain,
! [U_7] :
( hates(agatha,U_7)
| U_7 = butler ),
inference(variable_rename,[status(thm)],[f_9_1]) ).
cnf(f_9_3,plain,
( hates(agatha,U_7)
| U_7 = butler ),
inference(clausify,[status(thm)],[f_9_2]) ).
fof(f_10_1,plain,
! [X] :
( hates(butler,X)
| richer(X,agatha) ),
inference(fof_nnf,[status(thm)],[pel55_8]) ).
fof(f_10_2,plain,
! [U_8] :
( hates(butler,U_8)
| richer(U_8,agatha) ),
inference(variable_rename,[status(thm)],[f_10_1]) ).
cnf(f_10_3,plain,
( hates(butler,U_8)
| richer(U_8,agatha) ),
inference(clausify,[status(thm)],[f_10_2]) ).
fof(f_11_1,plain,
! [X] :
( hates(butler,X)
| ~ hates(agatha,X) ),
inference(fof_nnf,[status(thm)],[pel55_9]) ).
fof(f_11_2,plain,
! [U_9] :
( hates(butler,U_9)
| ~ hates(agatha,U_9) ),
inference(variable_rename,[status(thm)],[f_11_1]) ).
cnf(f_11_3,plain,
( hates(butler,U_9)
| ~ hates(agatha,U_9) ),
inference(clausify,[status(thm)],[f_11_2]) ).
fof(f_12_1,plain,
! [X] :
? [Y] : ~ hates(X,Y),
inference(fof_nnf,[status(thm)],[pel55_10]) ).
fof(f_12_2,plain,
! [U_11] :
? [U_10] : ~ hates(U_11,U_10),
inference(variable_rename,[status(thm)],[f_12_1]) ).
fof(f_12_3,plain,
! [U_11] : ~ hates(U_11,sK2(U_11)),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(U_10,sK2(U_11))],[f_12_2]) ).
cnf(f_12_4,plain,
~ hates(U_11,sK2(U_11)),
inference(clausify,[status(thm)],[f_12_3]) ).
fof(f_13_1,plain,
agatha != butler,
inference(fof_nnf,[status(thm)],[pel55_11]) ).
cnf(f_13_2,plain,
agatha != butler,
inference(clausify,[status(thm)],[f_13_1]) ).
fof(f_14_1,negated_conjecture,
~ killed(agatha,agatha),
inference(negate,[status(cth)],[pel55]) ).
fof(f_14_2,negated_conjecture,
~ killed(agatha,agatha),
inference(definitional_conversion,[status(esa)],[f_14_1]) ).
cnf(f_14_3,negated_conjecture,
~ killed(agatha,agatha),
inference(clausify,[status(thm)],[f_14_2]) ).
cnf(equality_1,axiom,
Eq_x_0 = Eq_x_0,
theory(equality,[reflexivity]) ).
cnf(equality_2,axiom,
( Eq_x_1 = Eq_x_0
| Eq_x_0 != Eq_x_1 ),
theory(equality,[symmetry]) ).
cnf(equality_3,axiom,
( Eq_x_0 = Eq_x_2
| Eq_x_1 != Eq_x_2
| Eq_x_0 != Eq_x_1 ),
theory(equality,[transitivity]) ).
cnf(equality_4,axiom,
( sK2(Eq_x_0) = sK2(Eq_y_0)
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_functions]) ).
cnf(equality_5,axiom,
( lives(Eq_y_0)
| ~ lives(Eq_x_0)
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_predicates]) ).
cnf(equality_6,axiom,
( killed(Eq_y_0,Eq_y_1)
| ~ killed(Eq_x_0,Eq_x_1)
| Eq_x_1 != Eq_y_1
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_predicates]) ).
cnf(equality_7,axiom,
( hates(Eq_y_0,Eq_y_1)
| ~ hates(Eq_x_0,Eq_x_1)
| Eq_x_1 != Eq_y_1
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_predicates]) ).
cnf(equality_8,axiom,
( richer(Eq_y_0,Eq_y_1)
| ~ richer(Eq_x_0,Eq_x_1)
| Eq_x_1 != Eq_y_1
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_predicates]) ).
cnf(sat_proved,plain,
$false,
inference(cadical,[status(thm)],[]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : PUZ001+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.03 This is a FOF_THM_RFO_SEQ problem
% 0.00/0.03 % Command : /export/starexec/sandbox2/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.07/0.34 % Computer : n026.cluster.edu
% 0.07/0.34 % Model : x86_64 x86_64
% 0.07/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.34 % Memory : 8046.5625MB
% 0.07/0.34 % OS : Linux 6.8.0-71-generic
% 0.07/0.34 % CPULimit : 300
% 0.07/0.34 % WCLimit : 300
% 0.07/0.34 % DateTime : Sat Sep 19 19:57:05 UTC 2026
% 0.07/0.34 % CPUTime :
% 0.21/0.53 % SZS status Theorem for theBenchmark
% 0.21/0.53 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------