%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : PUZ061+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 : n014.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 1.23s 1.72s
% Output : CNFRefutation 1.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 2
% Syntax : Number of formulae : 21 ( 6 unt; 0 def)
% Number of atoms : 110 ( 0 equ)
% Maximal formula atoms : 25 ( 5 avg)
% Number of connectives : 124 ( 35 ~; 31 |; 39 &)
% ( 1 <=>; 18 =>; 0 <=; 0 <~>)
% Maximal formula depth : 26 ( 6 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-6 aty)
% Number of functors : 6 ( 6 usr; 6 con; 0-0 aty)
% Number of variables : 104 ( 28 sgn 59 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(prove_this,conjecture,
! [X1,X2,X3,X4,X5,X6] :
( ( ! [X7,X8] :
( ( alive(X8)
& eats(X8,X6) )
=> likes(X8,X7) )
& ! [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(c_0_1,plain,
! [X1,X2,X3,X6,X5,X4] :
( epred1_6(X4,X5,X6,X3,X2,X1)
<=> ( ! [X7,X8] :
( ( alive(X8)
& eats(X8,X6) )
=> likes(X8,X7) )
& ! [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) ) ) ),
introduced(definition) ).
fof(c_0_2,plain,
! [X1,X2,X3,X6,X5,X4] :
( epred1_6(X4,X5,X6,X3,X2,X1)
=> ( ! [X7,X8] :
( ( alive(X8)
& eats(X8,X6) )
=> likes(X8,X7) )
& ! [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) ) ) ),
inference(split_equiv,[status(thm)],[c_0_1]) ).
fof(c_0_3,negated_conjecture,
~ ! [X1,X2,X3,X4,X5,X6] :
( epred1_6(X4,X5,X6,X3,X2,X1)
=> likes(X2,X1) ),
inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[prove_this]),c_0_1]) ).
fof(c_0_4,plain,
! [X29,X30,X31,X32,X33,X34,X35,X36,X37,X38,X39,X40,X41,X42] :
( ( ~ alive(X36)
| ~ eats(X36,X32)
| likes(X36,X35)
| ~ epred1_6(X34,X33,X32,X31,X30,X29) )
& ( ~ food(X37)
| likes(X30,X37)
| ~ epred1_6(X34,X33,X32,X31,X30,X29) )
& ( food(X33)
| ~ epred1_6(X34,X33,X32,X31,X30,X29) )
& ( food(X32)
| ~ epred1_6(X34,X33,X32,X31,X30,X29) )
& ( ~ eats(X39,X38)
| ~ not_killed_by(X39,X38)
| food(X38)
| ~ epred1_6(X34,X33,X32,X31,X30,X29) )
& ( eats(X31,X29)
| ~ epred1_6(X34,X33,X32,X31,X30,X29) )
& ( alive(X31)
| ~ epred1_6(X34,X33,X32,X31,X30,X29) )
& ( ~ eats(X31,X40)
| eats(X34,X40)
| ~ epred1_6(X34,X33,X32,X31,X30,X29) )
& ( ~ alive(X41)
| not_killed_by(X41,X42)
| ~ epred1_6(X34,X33,X32,X31,X30,X29) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])])]) ).
fof(c_0_5,negated_conjecture,
( epred1_6(esk4_0,esk5_0,esk6_0,esk3_0,esk2_0,esk1_0)
& ~ likes(esk2_0,esk1_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])]) ).
cnf(c_0_6,plain,
( food(X2)
| ~ eats(X1,X2)
| ~ not_killed_by(X1,X2)
| ~ epred1_6(X3,X4,X5,X6,X7,X8) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,negated_conjecture,
epred1_6(esk4_0,esk5_0,esk6_0,esk3_0,esk2_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,plain,
( not_killed_by(X1,X2)
| ~ alive(X1)
| ~ epred1_6(X3,X4,X5,X6,X7,X8) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_9,plain,
( likes(X2,X1)
| ~ food(X1)
| ~ epred1_6(X3,X4,X5,X6,X2,X7) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_10,negated_conjecture,
( food(X1)
| ~ not_killed_by(X2,X1)
| ~ eats(X2,X1) ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_11,negated_conjecture,
( not_killed_by(X1,X2)
| ~ alive(X1) ),
inference(spm,[status(thm)],[c_0_8,c_0_7]) ).
cnf(c_0_12,plain,
( eats(X1,X2)
| ~ epred1_6(X3,X4,X5,X1,X6,X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_13,plain,
( alive(X1)
| ~ epred1_6(X2,X3,X4,X1,X5,X6) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_14,negated_conjecture,
~ likes(esk2_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_15,negated_conjecture,
( likes(esk2_0,X1)
| ~ food(X1) ),
inference(spm,[status(thm)],[c_0_9,c_0_7]) ).
cnf(c_0_16,negated_conjecture,
( food(X1)
| ~ eats(X2,X1)
| ~ alive(X2) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_17,negated_conjecture,
eats(esk3_0,esk1_0),
inference(spm,[status(thm)],[c_0_12,c_0_7]) ).
cnf(c_0_18,negated_conjecture,
alive(esk3_0),
inference(spm,[status(thm)],[c_0_13,c_0_7]) ).
cnf(c_0_19,negated_conjecture,
~ food(esk1_0),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_20,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18])]),c_0_19]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : PUZ061+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.15/0.33 % Computer : n014.cluster.edu
% 0.15/0.33 % Model : x86_64 x86_64
% 0.15/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.33 % Memory : 8042.1875MB
% 0.15/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.33 % CPULimit : 300
% 0.15/0.33 % WCLimit : 300
% 0.15/0.33 % DateTime : Tue May 5 01:35:51 EDT 2026
% 0.15/0.33 % CPUTime :
% 0.15/0.34 % start to proof: theBenchmark
% 1.23/1.72 % Version : CSE_E---1.7
% 1.23/1.72 % Problem : theBenchmark.p
% 1.23/1.72 % SZS status Theorem for theBenchmark.p
% 1.23/1.72 % SZS output start CNFRefutation
% See solution above
% 1.23/1.72 % Total time : 1.370s
%------------------------------------------------------------------------------