%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : PUZ060+1 : TPTP v9.2.1. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n028.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue May 5 05:02:50 PM UTC 2026
% Result : Theorem 0.27s 1.61s
% Output : CNFRefutation 0.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 1
% Syntax : Number of formulae : 19 ( 9 unt; 0 def)
% Number of atoms : 66 ( 0 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 64 ( 17 ~; 13 |; 24 &)
% ( 0 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 6 con; 0-0 aty)
% Number of variables : 41 ( 3 sgn 28 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(prove_this,conjecture,
! [X1,X2,X3,X4,X5,X6] :
( ( ! [X7] :
( food(X7)
=> likes(X2,X7) )
& food(X5)
& food(X6)
& ! [X7] :
( ? [X8] :
( eats(X8,X7)
& not_killed_by(X8,X7) )
=> food(X7) )
& eats(X3,X1)
& alive(X3)
& ! [X7] :
( eats(X3,X7)
=> eats(X4,X7) )
& ! [X8] :
( alive(X8)
=> ! [X7] : not_killed_by(X8,X7) ) )
=> likes(X2,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
fof(i_0_1,negated_conjecture,
~ ! [X1,X2,X3,X4,X5,X6] :
( ( ! [X7] :
( food(X7)
=> likes(X2,X7) )
& food(X5)
& food(X6)
& ! [X7] :
( ? [X8] :
( eats(X8,X7)
& not_killed_by(X8,X7) )
=> food(X7) )
& eats(X3,X1)
& alive(X3)
& ! [X7] :
( eats(X3,X7)
=> eats(X4,X7) )
& ! [X8] :
( alive(X8)
=> ! [X7] : not_killed_by(X8,X7) ) )
=> likes(X2,X1) ),
inference(assume_negation,[status(cth)],[prove_this]) ).
fof(i_0_2,negated_conjecture,
! [X27,X28,X29,X30,X31,X32] :
( ( ~ food(X27)
| likes(esk2_0,X27) )
& food(esk5_0)
& food(esk6_0)
& ( ~ eats(X29,X28)
| ~ not_killed_by(X29,X28)
| food(X28) )
& eats(esk3_0,esk1_0)
& alive(esk3_0)
& ( ~ eats(esk3_0,X30)
| eats(esk4_0,X30) )
& ( ~ alive(X31)
| not_killed_by(X31,X32) )
& ~ likes(esk2_0,esk1_0) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[i_0_1])])])]) ).
cnf(i_0_3,negated_conjecture,
( food(X2)
| ~ eats(X1,X2)
| ~ not_killed_by(X1,X2) ),
inference(split_conjunct,[status(thm)],[i_0_2]),
[final] ).
cnf(i_0_4,negated_conjecture,
( eats(esk4_0,X1)
| ~ eats(esk3_0,X1) ),
inference(split_conjunct,[status(thm)],[i_0_2]),
[final] ).
cnf(i_0_5,negated_conjecture,
( not_killed_by(X1,X2)
| ~ alive(X1) ),
inference(split_conjunct,[status(thm)],[i_0_2]),
[final] ).
cnf(i_0_6,negated_conjecture,
( likes(esk2_0,X1)
| ~ food(X1) ),
inference(split_conjunct,[status(thm)],[i_0_2]),
[final] ).
cnf(i_0_7,negated_conjecture,
~ likes(esk2_0,esk1_0),
inference(split_conjunct,[status(thm)],[i_0_2]),
[final] ).
cnf(i_0_8,negated_conjecture,
eats(esk3_0,esk1_0),
inference(split_conjunct,[status(thm)],[i_0_2]),
[final] ).
cnf(i_0_9,negated_conjecture,
alive(esk3_0),
inference(split_conjunct,[status(thm)],[i_0_2]),
[final] ).
cnf(i_0_10,negated_conjecture,
food(esk6_0),
inference(split_conjunct,[status(thm)],[i_0_2]),
[final] ).
cnf(i_0_11,negated_conjecture,
food(esk5_0),
inference(split_conjunct,[status(thm)],[i_0_2]),
[final] ).
cnf(i_0_12,plain,
eats(esk4_0,esk1_0),
inference(scs_inference,[],[i_0_8,i_0_4]) ).
cnf(i_0_13,plain,
( ~ eats(esk3_0,X1)
| eats(esk4_0,X1) ),
inference(rename_variables,[],[i_0_4]) ).
cnf(i_0_14,plain,
not_killed_by(esk3_0,X1),
inference(scs_inference,[],[i_0_8,i_0_9,i_0_4,i_0_5]) ).
cnf(i_0_15,plain,
( ~ alive(X1)
| not_killed_by(X1,X2) ),
inference(rename_variables,[],[i_0_5]) ).
cnf(i_0_16,plain,
~ food(esk1_0),
inference(scs_inference,[],[i_0_7,i_0_8,i_0_9,i_0_4,i_0_5,i_0_6]) ).
cnf(i_0_17,plain,
( likes(esk2_0,X1)
| ~ food(X1) ),
inference(rename_variables,[],[i_0_6]) ).
cnf(i_0_18,plain,
$false,
inference(scs_inference,[],[i_0_7,i_0_8,i_0_9,i_0_4,i_0_5,i_0_6,i_0_3]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : PUZ060+1 : TPTP v9.2.1. Released v3.1.0.
% 0.00/0.12 % Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.16/0.33 % Computer : n028.cluster.edu
% 0.16/0.33 % Model : x86_64 x86_64
% 0.16/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.33 % Memory : 8042.1875MB
% 0.16/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.33 % CPULimit : 300
% 0.16/0.33 % WCLimit : 300
% 0.16/0.33 % DateTime : Tue May 5 01:35:46 EDT 2026
% 0.16/0.33 % CPUTime :
% 0.16/0.34 % start to proof: theBenchmark
% 0.27/1.61 % Version : CSE_E---1.7
% 0.27/1.61 % Problem : theBenchmark.p
% 0.27/1.61 % SZS status Theorem for theBenchmark.p
% 0.27/1.61 % SZS output start CNFRefutation
% See solution above
% 0.27/1.64 % Total time : 1.271s
%------------------------------------------------------------------------------