%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : PHI009+1 : TPTP v9.2.1. Released v7.2.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 : n013.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:01:09 PM UTC 2026
% Result : Theorem 1.26s 1.71s
% Output : CNFRefutation 1.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 2
% Syntax : Number of formulae : 21 ( 5 unt; 0 def)
% Number of atoms : 162 ( 11 equ)
% Maximal formula atoms : 74 ( 7 avg)
% Number of connectives : 241 ( 100 ~; 104 |; 25 &)
% ( 1 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 23 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-4 aty)
% Number of variables : 43 ( 1 sgn 15 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(description_theorem_1,conjecture,
! [X1] :
( property(X1)
=> ( ? [X4] :
( object(X4)
& exemplifies_property(X1,X4)
& ! [X5] :
( object(X5)
=> ( exemplifies_property(X1,X5)
=> X5 = X4 ) ) )
=> ? [X6] :
( object(X6)
& is_the(X6,X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',description_theorem_1) ).
fof(description_axiom_schema_instance,axiom,
! [X1,X2,X3] :
( ( property(X1)
& property(X2)
& object(X3) )
=> ( ( is_the(X3,X1)
& exemplifies_property(X2,X3) )
<=> ? [X4] :
( object(X4)
& exemplifies_property(X1,X4)
& ! [X5] :
( object(X5)
=> ( exemplifies_property(X1,X5)
=> X5 = X4 ) )
& exemplifies_property(X2,X4) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',description_axiom_schema_instance) ).
fof(c_0_2,negated_conjecture,
~ ! [X1] :
( property(X1)
=> ( ? [X4] :
( object(X4)
& exemplifies_property(X1,X4)
& ! [X5] :
( object(X5)
=> ( exemplifies_property(X1,X5)
=> X5 = X4 ) ) )
=> ? [X6] :
( object(X6)
& is_the(X6,X1) ) ) ),
inference(assume_negation,[status(cth)],[description_theorem_1]) ).
fof(c_0_3,plain,
! [X16,X17,X18,X20,X21] :
( ( object(esk1_3(X16,X17,X18))
| ~ is_the(X18,X16)
| ~ exemplifies_property(X17,X18)
| ~ property(X16)
| ~ property(X17)
| ~ object(X18) )
& ( exemplifies_property(X16,esk1_3(X16,X17,X18))
| ~ is_the(X18,X16)
| ~ exemplifies_property(X17,X18)
| ~ property(X16)
| ~ property(X17)
| ~ object(X18) )
& ( ~ object(X20)
| ~ exemplifies_property(X16,X20)
| X20 = esk1_3(X16,X17,X18)
| ~ is_the(X18,X16)
| ~ exemplifies_property(X17,X18)
| ~ property(X16)
| ~ property(X17)
| ~ object(X18) )
& ( exemplifies_property(X17,esk1_3(X16,X17,X18))
| ~ is_the(X18,X16)
| ~ exemplifies_property(X17,X18)
| ~ property(X16)
| ~ property(X17)
| ~ object(X18) )
& ( is_the(X18,X16)
| object(esk2_4(X16,X17,X18,X21))
| ~ object(X21)
| ~ exemplifies_property(X16,X21)
| ~ exemplifies_property(X17,X21)
| ~ property(X16)
| ~ property(X17)
| ~ object(X18) )
& ( exemplifies_property(X17,X18)
| object(esk2_4(X16,X17,X18,X21))
| ~ object(X21)
| ~ exemplifies_property(X16,X21)
| ~ exemplifies_property(X17,X21)
| ~ property(X16)
| ~ property(X17)
| ~ object(X18) )
& ( is_the(X18,X16)
| exemplifies_property(X16,esk2_4(X16,X17,X18,X21))
| ~ object(X21)
| ~ exemplifies_property(X16,X21)
| ~ exemplifies_property(X17,X21)
| ~ property(X16)
| ~ property(X17)
| ~ object(X18) )
& ( exemplifies_property(X17,X18)
| exemplifies_property(X16,esk2_4(X16,X17,X18,X21))
| ~ object(X21)
| ~ exemplifies_property(X16,X21)
| ~ exemplifies_property(X17,X21)
| ~ property(X16)
| ~ property(X17)
| ~ object(X18) )
& ( is_the(X18,X16)
| esk2_4(X16,X17,X18,X21) != X21
| ~ object(X21)
| ~ exemplifies_property(X16,X21)
| ~ exemplifies_property(X17,X21)
| ~ property(X16)
| ~ property(X17)
| ~ object(X18) )
& ( exemplifies_property(X17,X18)
| esk2_4(X16,X17,X18,X21) != X21
| ~ object(X21)
| ~ exemplifies_property(X16,X21)
| ~ exemplifies_property(X17,X21)
| ~ property(X16)
| ~ property(X17)
| ~ object(X18) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[description_axiom_schema_instance])])])])]) ).
fof(c_0_4,negated_conjecture,
! [X25,X26] :
( property(esk3_0)
& object(esk4_0)
& exemplifies_property(esk3_0,esk4_0)
& ( ~ object(X25)
| ~ exemplifies_property(esk3_0,X25)
| X25 = esk4_0 )
& ( ~ object(X26)
| ~ is_the(X26,esk3_0) ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])])]) ).
cnf(c_0_5,plain,
( is_the(X1,X2)
| object(esk2_4(X2,X3,X1,X4))
| ~ object(X4)
| ~ exemplifies_property(X2,X4)
| ~ exemplifies_property(X3,X4)
| ~ property(X2)
| ~ property(X3)
| ~ object(X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_6,negated_conjecture,
exemplifies_property(esk3_0,esk4_0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,negated_conjecture,
object(esk4_0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,negated_conjecture,
property(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_9,negated_conjecture,
( is_the(X1,X2)
| object(esk2_4(X2,esk3_0,X1,esk4_0))
| ~ exemplifies_property(X2,esk4_0)
| ~ object(X1)
| ~ property(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_6]),c_0_7]),c_0_8])]) ).
cnf(c_0_10,negated_conjecture,
( ~ object(X1)
| ~ is_the(X1,esk3_0) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_11,plain,
( is_the(X1,X2)
| exemplifies_property(X2,esk2_4(X2,X3,X1,X4))
| ~ object(X4)
| ~ exemplifies_property(X2,X4)
| ~ exemplifies_property(X3,X4)
| ~ property(X2)
| ~ property(X3)
| ~ object(X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_12,negated_conjecture,
( X1 = esk4_0
| ~ object(X1)
| ~ exemplifies_property(esk3_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_13,negated_conjecture,
( object(esk2_4(esk3_0,esk3_0,X1,esk4_0))
| ~ object(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_6]),c_0_8])]),c_0_10]) ).
cnf(c_0_14,negated_conjecture,
( exemplifies_property(X1,esk2_4(X1,esk3_0,X2,esk4_0))
| is_the(X2,X1)
| ~ exemplifies_property(X1,esk4_0)
| ~ object(X2)
| ~ property(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_6]),c_0_7]),c_0_8])]) ).
cnf(c_0_15,negated_conjecture,
( esk2_4(esk3_0,esk3_0,X1,esk4_0) = esk4_0
| ~ exemplifies_property(esk3_0,esk2_4(esk3_0,esk3_0,X1,esk4_0))
| ~ object(X1) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,negated_conjecture,
( exemplifies_property(esk3_0,esk2_4(esk3_0,esk3_0,X1,esk4_0))
| ~ object(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_6]),c_0_8])]),c_0_10]) ).
cnf(c_0_17,plain,
( is_the(X1,X2)
| esk2_4(X2,X3,X1,X4) != X4
| ~ object(X4)
| ~ exemplifies_property(X2,X4)
| ~ exemplifies_property(X3,X4)
| ~ property(X2)
| ~ property(X3)
| ~ object(X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_18,negated_conjecture,
( esk2_4(esk3_0,esk3_0,X1,esk4_0) = esk4_0
| ~ object(X1) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,negated_conjecture,
~ object(X1),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_6]),c_0_7]),c_0_8])]),c_0_10]) ).
cnf(c_0_20,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_7,c_0_19]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : PHI009+1 : TPTP v9.2.1. Released v7.2.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 : n013.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:25:11 EDT 2026
% 0.15/0.33 % CPUTime :
% 0.15/0.34 % start to proof: theBenchmark
% 1.26/1.71 % Version : CSE_E---1.7
% 1.26/1.71 % Problem : theBenchmark.p
% 1.26/1.71 % SZS status Theorem for theBenchmark.p
% 1.26/1.71 % SZS output start CNFRefutation
% See solution above
% 1.26/1.71 % Total time : 1.367s
%------------------------------------------------------------------------------