%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : PHI011+1 : TPTP v9.3.1. Released v7.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/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.62s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 3
% Syntax : Number of formulae : 14 ( 3 unt; 0 def)
% Number of atoms : 52 ( 3 equ)
% Maximal formula atoms : 6 ( 3 avg)
% Number of connectives : 56 ( 18 ~; 15 |; 12 &)
% ( 0 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 25 ( 2 sgn 14 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(description_theorem_2,conjecture,
! [X2] :
( property(X2)
=> ( ? [X3] :
( is_the(X3,X2)
& object(X3) )
=> ! [X4] :
( object(X4)
=> ( is_the(X4,X2)
=> exemplifies_property(X2,X4) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',description_theorem_2) ).
fof(lemma_1,axiom,
! [X1,X2,X3] :
( ( object(X3)
& property(X2)
& object(X1) )
=> ( ( X1 = X3
& is_the(X1,X2) )
=> exemplifies_property(X2,X3) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lemma_1) ).
fof(description_is_property_and_described_is_object,axiom,
! [X1,X2] :
( is_the(X1,X2)
=> ( object(X1)
& property(X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',description_is_property_and_described_is_object) ).
fof(c_0_3,negated_conjecture,
~ ! [X2] :
( property(X2)
=> ( ? [X3] :
( is_the(X3,X2)
& object(X3) )
=> ! [X4] :
( object(X4)
=> ( is_the(X4,X2)
=> exemplifies_property(X2,X4) ) ) ) ),
inference(assume_negation,[status(cth)],[description_theorem_2]) ).
fof(c_0_4,plain,
! [X10,X11,X12] :
( exemplifies_property(X11,X12)
| X10 != X12
| ~ is_the(X10,X11)
| ~ object(X12)
| ~ property(X11)
| ~ object(X10) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[lemma_1])])]) ).
fof(c_0_5,plain,
! [X13,X14] :
( ( ~ is_the(X13,X14)
| object(X13) )
& ( ~ is_the(X13,X14)
| property(X14) ) ),
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_6,negated_conjecture,
( ~ exemplifies_property(esk1_0,esk3_0)
& is_the(esk3_0,esk1_0)
& object(esk3_0)
& is_the(esk2_0,esk1_0)
& object(esk2_0)
& property(esk1_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])]) ).
cnf(c_0_7,plain,
( X1 != X3
| ~ is_the(X1,X2)
| ~ object(X3)
| ~ property(X2)
| ~ object(X1)
| exemplifies_property(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,plain,
( ~ is_the(X1,X2)
| object(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
( ~ is_the(X2,X1)
| property(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,negated_conjecture,
~ exemplifies_property(esk1_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,plain,
( ~ is_the(X2,X1)
| exemplifies_property(X1,X2) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_7,c_0_8]),c_0_9])]),c_0_8]) ).
cnf(c_0_12,negated_conjecture,
is_the(esk3_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_13,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : PHI011+1 : TPTP v9.3.1. Released v7.2.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.56 % Computer : n015.cluster.edu
% 0.11/0.56 % Model : x86_64 x86_64
% 0.11/0.56 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.56 % Memory : 8046.5625MB
% 0.11/0.56 % OS : Linux 6.8.0-71-generic
% 0.11/0.56 % CPULimit : 300
% 0.11/0.56 % WCLimit : 300
% 0.11/0.56 % DateTime : Mon Sep 21 03:33:23 UTC 2026
% 0.11/0.56 % CPUTime :
% 0.11/0.56 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.61 Running first-order theorem proving
% 0.11/0.61 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 0.11/0.62 % Version: 3.5.1
% 0.11/0.62 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.11/0.62 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.62 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.11/0.62 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.62 % Starting new_bool_1 with 300s (1) cores
% 0.11/0.62 % Starting sh5l with 300s (1) cores
% 0.11/0.62 % new_bool_1 with pid 468768 completed with status 0
% 0.11/0.62 % Result found by new_bool_1
% 0.11/0.62 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.11/0.62 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.62 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.11/0.62 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.62 % Starting new_bool_1 with 300s (1) cores
% 0.11/0.62 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.11/0.62 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.11/0.62 % Search class: FHHSF-FFSS00-SFFFFFNN
% 0.11/0.62 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.11/0.62 % Starting SubtermCWHack with 31s (1) cores
% 0.11/0.62 % SubtermCWHack with pid 468774 completed with status 0
% 0.11/0.62 % Result found by SubtermCWHack
% 0.11/0.62 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.11/0.62 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.62 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.11/0.62 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.62 % Starting new_bool_1 with 300s (1) cores
% 0.11/0.62 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.11/0.62 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.11/0.62 % Search class: FHHSF-FFSS00-SFFFFFNN
% 0.11/0.62 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.11/0.62 % Starting SubtermCWHack with 31s (1) cores
% 0.11/0.62 % Preprocessing time : 0.001 s
% 0.11/0.62
% 0.11/0.62 % Proof found!
% 0.11/0.62 % SZS status Theorem
% 0.11/0.62 % SZS output start CNFRefutation
% See solution above
% 0.11/0.62 % Parsed axioms : 5
% 0.11/0.62 % Removed by relevancy pruning/SinE : 0
% 0.11/0.62 % Initial clauses : 12
% 0.11/0.62 % Removed in clause preprocessing : 0
% 0.11/0.62 % Initial clauses in saturation : 12
% 0.11/0.62 % Processed clauses : 14
% 0.11/0.62 % ...of these trivial : 0
% 0.11/0.62 % ...subsumed : 0
% 0.11/0.62 % ...remaining for further processing : 14
% 0.11/0.62 % Other redundant clauses eliminated : 1
% 0.11/0.62 % Clauses deleted for lack of memory : 0
% 0.11/0.62 % Backward-subsumed : 0
% 0.11/0.62 % Backward-rewritten : 0
% 0.11/0.62 % Generated clauses : 9
% 0.11/0.62 % ...of the previous two non-redundant : 2
% 0.11/0.62 % ...aggressively subsumed : 0
% 0.11/0.62 % Contextual simplify-reflections : 3
% 0.11/0.62 % Paramodulations : 8
% 0.11/0.62 % Factorizations : 0
% 0.11/0.62 % NegExts : 0
% 0.11/0.62 % Equation resolutions : 1
% 0.11/0.62 % Disequality decompositions : 0
% 0.11/0.62 % Total rewrite steps : 5
% 0.11/0.62 % ...of those cached : 1
% 0.11/0.62 % Propositional unsat checks : 0
% 0.11/0.62 % Propositional check models : 0
% 0.11/0.62 % Propositional check unsatisfiable : 0
% 0.11/0.62 % Propositional clauses : 0
% 0.11/0.62 % Propositional clauses after purity: 0
% 0.11/0.62 % Propositional unsat core size : 0
% 0.11/0.62 % Propositional preprocessing time : 0.000
% 0.11/0.62 % Propositional encoding time : 0.000
% 0.11/0.62 % Propositional solver time : 0.000
% 0.11/0.62 % Success case prop preproc time : 0.000
% 0.11/0.62 % Success case prop encoding time : 0.000
% 0.11/0.62 % Success case prop solver time : 0.000
% 0.11/0.62 % Current number of processed clauses : 13
% 0.11/0.62 % Positive orientable unit clauses : 5
% 0.11/0.62 % Positive unorientable unit clauses: 0
% 0.11/0.62 % Negative unit clauses : 2
% 0.11/0.62 % Non-unit-clauses : 6
% 0.11/0.62 % Current number of unprocessed clauses: 0
% 0.11/0.62 % ...number of literals in the above : 0
% 0.11/0.62 % Current number of archived formulas : 0
% 0.11/0.62 % Current number of archived clauses : 0
% 0.11/0.62 % Clause-clause subsumption calls (NU) : 5
% 0.11/0.62 % Rec. Clause-clause subsumption calls : 5
% 0.11/0.62 % Non-unit clause-clause subsumptions : 3
% 0.11/0.62 % Unit Clause-clause subsumption calls : 0
% 0.11/0.62 % Rewrite failures with RHS unbound : 0
% 0.11/0.62 % BW rewrite match attempts : 0
% 0.11/0.62 % BW rewrite match successes : 0
% 0.11/0.62 % Condensation attempts : 0
% 0.11/0.62 % Condensation successes : 0
% 0.11/0.62 % Termbank termtop insertions : 685
% 0.11/0.62 % Search garbage collected termcells : 165
% 0.11/0.62
% 0.11/0.62 % -------------------------------------------------
% 0.11/0.62 % User time : 0.004 s
% 0.11/0.62 % System time : 0.002 s
% 0.11/0.62 % Total time : 0.005 s
% 0.11/0.62 % Maximum resident set size: 3632 pages
% 0.11/0.62
% 0.11/0.62 % -------------------------------------------------
% 0.11/0.62 % User time : 0.004 s
% 0.11/0.62 % System time : 0.005 s
% 0.11/0.62 % Total time : 0.009 s
% 0.11/0.62 % Maximum resident set size: 4608 pages
% 0.11/0.62 % E exiting
%------------------------------------------------------------------------------