%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SWB009+2 : TPTP v9.3.1. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n012.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 02:38:50 PM UTC 2026
% Result : Theorem 0.07s 0.33s
% Output : CNFRefutation 0.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 22 ( 4 unt; 0 def)
% Number of atoms : 74 ( 0 equ)
% Maximal formula atoms : 13 ( 3 avg)
% Number of connectives : 90 ( 38 ~; 32 |; 17 &)
% ( 2 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 11 ( 11 usr; 10 con; 0-4 aty)
% Number of variables : 40 ( 0 sgn 15 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(testcase_conclusion_fullish_009_Existential_Restriction_Entailments,conjecture,
? [X6] :
( iext(uri_rdf_type,X6,uri_ex_c)
& iext(uri_ex_p,uri_ex_s,X6) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',testcase_conclusion_fullish_009_Existential_Restriction_Entailments) ).
fof(owl_restrict_somevaluesfrom,axiom,
! [X3,X4,X2] :
( ( iext(uri_owl_onProperty,X3,X4)
& iext(uri_owl_someValuesFrom,X3,X2) )
=> ! [X1] :
( icext(X3,X1)
<=> ? [X5] :
( icext(X2,X5)
& iext(X4,X1,X5) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',owl_restrict_somevaluesfrom) ).
fof(rdfs_cext_def,axiom,
! [X1,X2] :
( iext(uri_rdf_type,X1,X2)
<=> icext(X2,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rdfs_cext_def) ).
fof(testcase_premise_fullish_009_Existential_Restriction_Entailments,axiom,
? [X7] :
( iext(uri_owl_someValuesFrom,X7,uri_ex_c)
& iext(uri_owl_onProperty,X7,uri_ex_p)
& iext(uri_rdf_type,X7,uri_owl_Restriction)
& iext(uri_rdf_type,uri_ex_s,X7)
& iext(uri_rdf_type,uri_ex_c,uri_owl_Class)
& iext(uri_rdf_type,uri_ex_p,uri_owl_ObjectProperty) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',testcase_premise_fullish_009_Existential_Restriction_Entailments) ).
fof(c_0_4,negated_conjecture,
~ ? [X6] :
( iext(uri_rdf_type,X6,uri_ex_c)
& iext(uri_ex_p,uri_ex_s,X6) ),
inference(assume_negation,[status(cth)],[testcase_conclusion_fullish_009_Existential_Restriction_Entailments]) ).
fof(c_0_5,negated_conjecture,
! [X8] :
( ~ iext(uri_rdf_type,X8,uri_ex_c)
| ~ iext(uri_ex_p,uri_ex_s,X8) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).
fof(c_0_6,plain,
! [X11,X12,X13,X14,X16,X17] :
( ( ~ iext(uri_owl_onProperty,X11,X12)
| ~ iext(uri_owl_someValuesFrom,X11,X13)
| icext(X11,X16)
| ~ icext(X13,X17)
| ~ iext(X12,X16,X17) )
& ( ~ iext(uri_owl_onProperty,X11,X12)
| ~ iext(uri_owl_someValuesFrom,X11,X13)
| ~ icext(X11,X14)
| icext(X13,esk1_4(X11,X12,X13,X14)) )
& ( ~ iext(uri_owl_onProperty,X11,X12)
| ~ iext(uri_owl_someValuesFrom,X11,X13)
| ~ icext(X11,X14)
| iext(X12,X14,esk1_4(X11,X12,X13,X14)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[owl_restrict_somevaluesfrom])])])])])])]) ).
fof(c_0_7,plain,
! [X9,X10] :
( ( iext(uri_rdf_type,X9,X10)
| ~ icext(X10,X9) )
& ( icext(X10,X9)
| ~ iext(uri_rdf_type,X9,X10) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[rdfs_cext_def])])]) ).
cnf(c_0_8,negated_conjecture,
( ~ iext(uri_rdf_type,X1,uri_ex_c)
| ~ iext(uri_ex_p,uri_ex_s,X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
( ~ iext(uri_owl_onProperty,X3,X1)
| ~ iext(uri_owl_someValuesFrom,X3,X4)
| ~ icext(X3,X2)
| iext(X1,X2,esk1_4(X3,X1,X4,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
( ~ icext(X1,X2)
| iext(uri_rdf_type,X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
( ~ iext(uri_owl_onProperty,X2,X3)
| ~ iext(uri_owl_someValuesFrom,X2,X1)
| ~ icext(X2,X4)
| icext(X1,esk1_4(X2,X3,X1,X4)) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_12,negated_conjecture,
( ~ iext(uri_owl_someValuesFrom,X1,X2)
| ~ iext(uri_owl_onProperty,X1,uri_ex_p)
| ~ iext(uri_rdf_type,esk1_4(X1,uri_ex_p,X2,uri_ex_s),uri_ex_c)
| ~ icext(X1,uri_ex_s) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_13,plain,
( ~ iext(uri_owl_onProperty,X1,X2)
| ~ iext(uri_owl_someValuesFrom,X1,X3)
| ~ icext(X1,X4)
| iext(uri_rdf_type,esk1_4(X1,X2,X3,X4),X3) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_14,negated_conjecture,
( ~ iext(uri_owl_someValuesFrom,X1,uri_ex_c)
| ~ iext(uri_owl_onProperty,X1,uri_ex_p)
| ~ icext(X1,uri_ex_s) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_15,plain,
( ~ iext(uri_rdf_type,X1,X2)
| icext(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_16,plain,
( iext(uri_owl_someValuesFrom,esk2_0,uri_ex_c)
& iext(uri_owl_onProperty,esk2_0,uri_ex_p)
& iext(uri_rdf_type,esk2_0,uri_owl_Restriction)
& iext(uri_rdf_type,uri_ex_s,esk2_0)
& iext(uri_rdf_type,uri_ex_c,uri_owl_Class)
& iext(uri_rdf_type,uri_ex_p,uri_owl_ObjectProperty) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[testcase_premise_fullish_009_Existential_Restriction_Entailments])]) ).
cnf(c_0_17,negated_conjecture,
( ~ iext(uri_rdf_type,uri_ex_s,X1)
| ~ iext(uri_owl_someValuesFrom,X1,uri_ex_c)
| ~ iext(uri_owl_onProperty,X1,uri_ex_p) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,plain,
iext(uri_owl_onProperty,esk2_0,uri_ex_p),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_19,plain,
iext(uri_owl_someValuesFrom,esk2_0,uri_ex_c),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_20,plain,
iext(uri_rdf_type,uri_ex_s,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_21,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]),c_0_20])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : SWB009+2 : TPTP v9.3.1. Released v5.2.0.
% 0.00/0.02 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.04/0.30 % Computer : n012.cluster.edu
% 0.04/0.30 % Model : x86_64 x86_64
% 0.04/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.04/0.30 % Memory : 8046.5625MB
% 0.04/0.30 % OS : Linux 6.8.0-71-generic
% 0.04/0.30 % CPULimit : 300
% 0.04/0.30 % WCLimit : 300
% 0.04/0.30 % DateTime : Mon Sep 21 07:37:51 UTC 2026
% 0.04/0.30 % CPUTime :
% 0.04/0.30 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.04/0.32 Running first-order theorem proving
% 0.04/0.32 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.07/0.33 % Version: 3.5.1
% 0.07/0.33 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.07/0.33 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/0.33 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.07/0.33 % Starting new_bool_3 with 300s (1) cores
% 0.07/0.33 % Starting new_bool_1 with 300s (1) cores
% 0.07/0.33 % Starting sh5l with 300s (1) cores
% 0.07/0.33 % sh5l with pid 1907566 completed with status 0
% 0.07/0.33 % Result found by sh5l
% 0.07/0.33 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.07/0.33 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/0.33 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.07/0.33 % Starting new_bool_3 with 300s (1) cores
% 0.07/0.33 % Starting new_bool_1 with 300s (1) cores
% 0.07/0.33 % Starting sh5l with 300s (1) cores
% 0.07/0.33 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.07/0.33 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.07/0.33 % Search class: FHHNF-FFSM33-SFFFFFNN
% 0.07/0.33 % partial match(2): FGHNF-FFMM33-SFFFFFNN
% 0.07/0.33 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.07/0.33 % Starting SubtermCWHack with 31s (1) cores
% 0.07/0.33 % SubtermCWHack with pid 1907572 completed with status 0
% 0.07/0.33 % Result found by SubtermCWHack
% 0.07/0.33 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.07/0.33 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/0.33 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.07/0.33 % Starting new_bool_3 with 300s (1) cores
% 0.07/0.33 % Starting new_bool_1 with 300s (1) cores
% 0.07/0.33 % Starting sh5l with 300s (1) cores
% 0.07/0.33 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.07/0.33 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.07/0.33 % Search class: FHHNF-FFSM33-SFFFFFNN
% 0.07/0.33 % partial match(2): FGHNF-FFMM33-SFFFFFNN
% 0.07/0.33 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.07/0.33 % Starting SubtermCWHack with 31s (1) cores
% 0.07/0.33 % Preprocessing time : 0.001 s
% 0.07/0.33
% 0.07/0.33 % Proof found!
% 0.07/0.33 % SZS status Theorem
% 0.07/0.33 % SZS output start CNFRefutation
% See solution above
% 0.07/0.33 % Parsed axioms : 4
% 0.07/0.33 % Removed by relevancy pruning/SinE : 0
% 0.07/0.33 % Initial clauses : 12
% 0.07/0.33 % Removed in clause preprocessing : 0
% 0.07/0.33 % Initial clauses in saturation : 12
% 0.07/0.33 % Processed clauses : 18
% 0.07/0.33 % ...of these trivial : 0
% 0.07/0.33 % ...subsumed : 0
% 0.07/0.33 % ...remaining for further processing : 18
% 0.07/0.33 % Other redundant clauses eliminated : 0
% 0.07/0.33 % Clauses deleted for lack of memory : 0
% 0.07/0.33 % Backward-subsumed : 0
% 0.07/0.33 % Backward-rewritten : 0
% 0.07/0.33 % Generated clauses : 11
% 0.07/0.33 % ...of the previous two non-redundant : 9
% 0.07/0.33 % ...aggressively subsumed : 0
% 0.07/0.33 % Contextual simplify-reflections : 0
% 0.07/0.33 % Paramodulations : 11
% 0.07/0.33 % Factorizations : 0
% 0.07/0.33 % NegExts : 0
% 0.07/0.33 % Equation resolutions : 0
% 0.07/0.33 % Disequality decompositions : 0
% 0.07/0.33 % Total rewrite steps : 2
% 0.07/0.33 % ...of those cached : 0
% 0.07/0.33 % Propositional unsat checks : 0
% 0.07/0.33 % Propositional check models : 0
% 0.07/0.33 % Propositional check unsatisfiable : 0
% 0.07/0.33 % Propositional clauses : 0
% 0.07/0.33 % Propositional clauses after purity: 0
% 0.07/0.33 % Propositional unsat core size : 0
% 0.07/0.33 % Propositional preprocessing time : 0.000
% 0.07/0.33 % Propositional encoding time : 0.000
% 0.07/0.33 % Propositional solver time : 0.000
% 0.07/0.33 % Success case prop preproc time : 0.000
% 0.07/0.33 % Success case prop encoding time : 0.000
% 0.07/0.33 % Success case prop solver time : 0.000
% 0.07/0.33 % Current number of processed clauses : 18
% 0.07/0.33 % Positive orientable unit clauses : 6
% 0.07/0.33 % Positive unorientable unit clauses: 0
% 0.07/0.33 % Negative unit clauses : 0
% 0.07/0.33 % Non-unit-clauses : 12
% 0.07/0.33 % Current number of unprocessed clauses: 3
% 0.07/0.33 % ...number of literals in the above : 18
% 0.07/0.33 % Current number of archived formulas : 0
% 0.07/0.33 % Current number of archived clauses : 0
% 0.07/0.33 % Clause-clause subsumption calls (NU) : 23
% 0.07/0.33 % Rec. Clause-clause subsumption calls : 7
% 0.07/0.33 % Non-unit clause-clause subsumptions : 0
% 0.07/0.33 % Unit Clause-clause subsumption calls : 0
% 0.07/0.33 % Rewrite failures with RHS unbound : 0
% 0.07/0.33 % BW rewrite match attempts : 0
% 0.07/0.33 % BW rewrite match successes : 0
% 0.07/0.33 % Condensation attempts : 0
% 0.07/0.33 % Condensation successes : 0
% 0.07/0.33 % Termbank termtop insertions : 962
% 0.07/0.33 % Search garbage collected termcells : 148
% 0.07/0.33
% 0.07/0.33 % -------------------------------------------------
% 0.07/0.33 % User time : 0.002 s
% 0.07/0.33 % System time : 0.002 s
% 0.07/0.33 % Total time : 0.004 s
% 0.07/0.33 % Maximum resident set size: 3636 pages
% 0.07/0.33
% 0.07/0.33 % -------------------------------------------------
% 0.07/0.33 % User time : 0.003 s
% 0.07/0.33 % System time : 0.004 s
% 0.07/0.33 % Total time : 0.007 s
% 0.07/0.33 % Maximum resident set size: 4864 pages
% 0.07/0.33 % E exiting
%------------------------------------------------------------------------------