%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : PHI010+1 : TPTP v9.3.1. Released v7.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n015.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 01:58:16 PM UTC 2026
% Result : Theorem 0.11s 0.43s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 3
% Syntax : Number of formulae : 19 ( 5 unt; 0 def)
% Number of atoms : 137 ( 28 equ)
% Maximal formula atoms : 74 ( 7 avg)
% Number of connectives : 199 ( 81 ~; 81 |; 28 &)
% ( 1 <=>; 8 =>; 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 : 5 ( 5 usr; 3 con; 0-4 aty)
% Number of variables : 36 ( 2 sgn 19 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(description_axiom_identity_instance,axiom,
! [X2,X1,X3] :
( ( object(X3)
& object(X1)
& property(X2) )
=> ( ( X1 = X3
& is_the(X1,X2) )
<=> ? [X4] :
( X4 = X3
& ! [X5] :
( object(X5)
=> ( exemplifies_property(X2,X5)
=> X5 = X4 ) )
& exemplifies_property(X2,X4)
& object(X4) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',description_axiom_identity_instance) ).
fof(description_is_property_and_described_is_object,axiom,
! [X1,X2] :
( is_the(X1,X2)
=> ( object(X1)
& property(X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',description_is_property_and_described_is_object) ).
fof(lemma_1,conjecture,
! [X1,X2,X4] :
( ( object(X4)
& property(X2)
& object(X1) )
=> ( ( X1 = X4
& is_the(X1,X2) )
=> exemplifies_property(X2,X4) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',lemma_1) ).
fof(c_0_3,plain,
! [X11,X12,X13,X15,X16] :
( ( ~ object(X13)
| ~ object(X12)
| ~ property(X11)
| X16 != X13
| ~ exemplifies_property(X11,X16)
| ~ object(X16)
| esk5_4(X11,X12,X13,X16) != X16
| X12 = X13 )
& ( ~ object(X13)
| ~ object(X12)
| ~ property(X11)
| X16 != X13
| ~ exemplifies_property(X11,X16)
| ~ object(X16)
| esk5_4(X11,X12,X13,X16) != X16
| is_the(X12,X11) )
& ( ~ object(X13)
| ~ object(X12)
| ~ property(X11)
| X16 != X13
| ~ exemplifies_property(X11,X16)
| ~ object(X16)
| exemplifies_property(X11,esk5_4(X11,X12,X13,X16))
| X12 = X13 )
& ( ~ object(X13)
| ~ object(X12)
| ~ property(X11)
| X16 != X13
| ~ exemplifies_property(X11,X16)
| ~ object(X16)
| exemplifies_property(X11,esk5_4(X11,X12,X13,X16))
| is_the(X12,X11) )
& ( ~ object(X13)
| ~ object(X12)
| ~ property(X11)
| X16 != X13
| ~ exemplifies_property(X11,X16)
| ~ object(X16)
| object(esk5_4(X11,X12,X13,X16))
| X12 = X13 )
& ( ~ object(X13)
| ~ object(X12)
| ~ property(X11)
| X16 != X13
| ~ exemplifies_property(X11,X16)
| ~ object(X16)
| object(esk5_4(X11,X12,X13,X16))
| is_the(X12,X11) )
& ( ~ object(X13)
| ~ object(X12)
| ~ property(X11)
| X12 != X13
| ~ is_the(X12,X11)
| esk4_3(X11,X12,X13) = X13 )
& ( ~ object(X13)
| ~ object(X12)
| ~ property(X11)
| X12 != X13
| ~ is_the(X12,X11)
| X15 = esk4_3(X11,X12,X13)
| ~ exemplifies_property(X11,X15)
| ~ object(X15) )
& ( ~ object(X13)
| ~ object(X12)
| ~ property(X11)
| X12 != X13
| ~ is_the(X12,X11)
| exemplifies_property(X11,esk4_3(X11,X12,X13)) )
& ( ~ object(X13)
| ~ object(X12)
| ~ property(X11)
| X12 != X13
| ~ is_the(X12,X11)
| object(esk4_3(X11,X12,X13)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[description_axiom_identity_instance])])])])])]) ).
fof(c_0_4,plain,
! [X18,X19] :
( ( ~ is_the(X18,X19)
| object(X18) )
& ( ~ is_the(X18,X19)
| property(X19) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[description_is_property_and_described_is_object])])])]) ).
fof(c_0_5,negated_conjecture,
~ ! [X1,X2,X4] :
( ( object(X4)
& property(X2)
& object(X1) )
=> ( ( X1 = X4
& is_the(X1,X2) )
=> exemplifies_property(X2,X4) ) ),
inference(assume_negation,[status(cth)],[lemma_1]) ).
cnf(c_0_6,plain,
( ~ object(X3)
| ~ object(X2)
| ~ property(X1)
| X2 != X3
| ~ is_the(X2,X1)
| exemplifies_property(X1,esk4_3(X1,X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_7,plain,
( ~ is_the(X1,X2)
| object(X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,plain,
( ~ is_the(X2,X1)
| property(X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_9,plain,
( ~ object(X3)
| ~ object(X2)
| ~ property(X1)
| X2 != X3
| ~ is_the(X2,X1)
| esk4_3(X1,X2,X3) = X3 ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
fof(c_0_10,negated_conjecture,
( ~ exemplifies_property(esk2_0,esk3_0)
& esk1_0 = esk3_0
& is_the(esk1_0,esk2_0)
& object(esk3_0)
& property(esk2_0)
& object(esk1_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])]) ).
cnf(c_0_11,plain,
( ~ is_the(X2,X1)
| exemplifies_property(X1,esk4_3(X1,X2,X2)) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_6,c_0_7]),c_0_8])]),c_0_7]) ).
cnf(c_0_12,plain,
( ~ is_the(X2,X1)
| esk4_3(X1,X2,X2) = X2 ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_9,c_0_7]),c_0_8])]),c_0_7]) ).
cnf(c_0_13,negated_conjecture,
~ exemplifies_property(esk2_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,plain,
( ~ is_the(X2,X1)
| exemplifies_property(X1,X2) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,negated_conjecture,
is_the(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_17,negated_conjecture,
~ exemplifies_property(esk2_0,esk1_0),
inference(rw,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : PHI010+1 : TPTP v9.3.1. Released v7.2.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n015.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Mon Sep 21 03:33:21 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.41 Running first-order theorem proving
% 0.11/0.41 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.11/0.43 % Version: 3.5.1
% 0.11/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.11/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.11/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.11/0.43 % Starting sh5l with 300s (1) cores
% 0.11/0.43 % sh5l with pid 468468 completed with status 0
% 0.11/0.43 % Result found by sh5l
% 0.11/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.11/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.11/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.11/0.43 % Starting sh5l with 300s (1) cores
% 0.11/0.43 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.11/0.43 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.11/0.43 % Search class: FGHSF-FFMS33-SFFFFFNN
% 0.11/0.43 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.11/0.43 % Starting SubtermCWHack with 31s (1) cores
% 0.11/0.43 % SubtermCWHack with pid 468469 completed with status 0
% 0.11/0.43 % Result found by SubtermCWHack
% 0.11/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.11/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.11/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.11/0.43 % Starting sh5l with 300s (1) cores
% 0.11/0.43 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.11/0.43 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.11/0.43 % Search class: FGHSF-FFMS33-SFFFFFNN
% 0.11/0.43 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.11/0.43 % Starting SubtermCWHack with 31s (1) cores
% 0.11/0.43 % Preprocessing time : 0.001 s
% 0.11/0.43
% 0.11/0.43 % Proof found!
% 0.11/0.43 % SZS status Theorem
% 0.11/0.43 % SZS output start CNFRefutation
% See solution above
% 0.11/0.43 % Parsed axioms : 5
% 0.11/0.43 % Removed by relevancy pruning/SinE : 0
% 0.11/0.43 % Initial clauses : 21
% 0.11/0.43 % Removed in clause preprocessing : 0
% 0.11/0.43 % Initial clauses in saturation : 21
% 0.11/0.43 % Processed clauses : 21
% 0.11/0.43 % ...of these trivial : 0
% 0.11/0.43 % ...subsumed : 2
% 0.11/0.43 % ...remaining for further processing : 19
% 0.11/0.43 % Other redundant clauses eliminated : 3
% 0.11/0.43 % Clauses deleted for lack of memory : 0
% 0.11/0.43 % Backward-subsumed : 0
% 0.11/0.43 % Backward-rewritten : 1
% 0.11/0.43 % Generated clauses : 11
% 0.11/0.43 % ...of the previous two non-redundant : 8
% 0.11/0.43 % ...aggressively subsumed : 0
% 0.11/0.43 % Contextual simplify-reflections : 9
% 0.11/0.43 % Paramodulations : 8
% 0.11/0.43 % Factorizations : 0
% 0.11/0.43 % NegExts : 0
% 0.11/0.43 % Equation resolutions : 3
% 0.11/0.43 % Disequality decompositions : 0
% 0.11/0.43 % Total rewrite steps : 5
% 0.11/0.43 % ...of those cached : 2
% 0.11/0.43 % Propositional unsat checks : 0
% 0.11/0.43 % Propositional check models : 0
% 0.11/0.43 % Propositional check unsatisfiable : 0
% 0.11/0.43 % Propositional clauses : 0
% 0.11/0.43 % Propositional clauses after purity: 0
% 0.11/0.43 % Propositional unsat core size : 0
% 0.11/0.43 % Propositional preprocessing time : 0.000
% 0.11/0.43 % Propositional encoding time : 0.000
% 0.11/0.43 % Propositional solver time : 0.000
% 0.11/0.43 % Success case prop preproc time : 0.000
% 0.11/0.43 % Success case prop encoding time : 0.000
% 0.11/0.43 % Success case prop solver time : 0.000
% 0.11/0.43 % Current number of processed clauses : 15
% 0.11/0.43 % Positive orientable unit clauses : 4
% 0.11/0.43 % Positive unorientable unit clauses: 0
% 0.11/0.43 % Negative unit clauses : 2
% 0.11/0.43 % Non-unit-clauses : 9
% 0.11/0.43 % Current number of unprocessed clauses: 8
% 0.11/0.43 % ...number of literals in the above : 58
% 0.11/0.43 % Current number of archived formulas : 0
% 0.11/0.43 % Current number of archived clauses : 1
% 0.11/0.43 % Clause-clause subsumption calls (NU) : 33
% 0.11/0.43 % Rec. Clause-clause subsumption calls : 28
% 0.11/0.43 % Non-unit clause-clause subsumptions : 11
% 0.11/0.43 % Unit Clause-clause subsumption calls : 1
% 0.11/0.43 % Rewrite failures with RHS unbound : 0
% 0.11/0.43 % BW rewrite match attempts : 1
% 0.11/0.43 % BW rewrite match successes : 1
% 0.11/0.43 % Condensation attempts : 0
% 0.11/0.43 % Condensation successes : 0
% 0.11/0.43 % Termbank termtop insertions : 1265
% 0.11/0.43 % Search garbage collected termcells : 334
% 0.11/0.43
% 0.11/0.43 % -------------------------------------------------
% 0.11/0.43 % User time : 0.002 s
% 0.11/0.43 % System time : 0.003 s
% 0.11/0.43 % Total time : 0.006 s
% 0.11/0.43 % Maximum resident set size: 3632 pages
% 0.11/0.43
% 0.11/0.43 % -------------------------------------------------
% 0.11/0.43 % User time : 0.003 s
% 0.11/0.43 % System time : 0.008 s
% 0.11/0.43 % Total time : 0.012 s
% 0.11/0.43 % Maximum resident set size: 4864 pages
% 0.11/0.43 % E exiting
%------------------------------------------------------------------------------