%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWB009+3 : TPTP v9.3.1. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n010.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:37:58 PM UTC 2026
% Result : Theorem 1.07s 0.66s
% Output : CNFRefutation 1.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 26 ( 8 unt; 0 def)
% Number of atoms : 74 ( 0 equ)
% Maximal formula atoms : 13 ( 2 avg)
% Number of connectives : 79 ( 31 ~; 28 |; 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 : 38 ( 0 sgn 15 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(owl_restrict_somevaluesfrom,axiom,
! [X1,X11,X2] :
( ( iext(uri_owl_onProperty,X1,X11)
& iext(uri_owl_someValuesFrom,X1,X2) )
=> ! [X3] :
( icext(X1,X3)
<=> ? [X10] :
( icext(X2,X10)
& iext(X11,X3,X10) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWB002+0.ax',owl_restrict_somevaluesfrom) ).
fof(testcase_premise_fullish_009_Existential_Restriction_Entailments,axiom,
? [X22] :
( iext(uri_owl_someValuesFrom,X22,uri_ex_c)
& iext(uri_owl_onProperty,X22,uri_ex_p)
& iext(uri_rdf_type,X22,uri_owl_Restriction)
& iext(uri_rdf_type,uri_ex_s,X22)
& iext(uri_rdf_type,uri_ex_c,uri_owl_Class)
& iext(uri_rdf_type,uri_ex_p,uri_owl_ObjectProperty) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',testcase_premise_fullish_009_Existential_Restriction_Entailments) ).
fof(rdfs_cext_def,axiom,
! [X3,X2] :
( iext(uri_rdf_type,X3,X2)
<=> icext(X2,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWB002+0.ax',rdfs_cext_def) ).
fof(testcase_conclusion_fullish_009_Existential_Restriction_Entailments,conjecture,
? [X21] :
( iext(uri_rdf_type,X21,uri_ex_c)
& iext(uri_ex_p,uri_ex_s,X21) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',testcase_conclusion_fullish_009_Existential_Restriction_Entailments) ).
fof(c_0_4,plain,
! [X174,X175,X176,X177,X179,X180] :
( ( ~ iext(uri_owl_onProperty,X174,X175)
| ~ iext(uri_owl_someValuesFrom,X174,X176)
| icext(X174,X179)
| ~ icext(X176,X180)
| ~ iext(X175,X179,X180) )
& ( ~ iext(uri_owl_onProperty,X174,X175)
| ~ iext(uri_owl_someValuesFrom,X174,X176)
| ~ icext(X174,X177)
| icext(X176,esk18_4(X174,X175,X176,X177)) )
& ( ~ iext(uri_owl_onProperty,X174,X175)
| ~ iext(uri_owl_someValuesFrom,X174,X176)
| ~ icext(X174,X177)
| iext(X175,X177,esk18_4(X174,X175,X176,X177)) ) ),
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_5,plain,
( iext(uri_owl_someValuesFrom,esk19_0,uri_ex_c)
& iext(uri_owl_onProperty,esk19_0,uri_ex_p)
& iext(uri_rdf_type,esk19_0,uri_owl_Restriction)
& iext(uri_rdf_type,uri_ex_s,esk19_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])]) ).
fof(c_0_6,plain,
! [X182,X183] :
( ( iext(uri_rdf_type,X182,X183)
| ~ icext(X183,X182) )
& ( icext(X183,X182)
| ~ iext(uri_rdf_type,X182,X183) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[rdfs_cext_def])])]) ).
cnf(c_0_7,plain,
( ~ iext(uri_owl_onProperty,X2,X3)
| ~ iext(uri_owl_someValuesFrom,X2,X1)
| ~ icext(X2,X4)
| icext(X1,esk18_4(X2,X3,X1,X4)) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,plain,
iext(uri_owl_onProperty,esk19_0,uri_ex_p),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
( ~ iext(uri_rdf_type,X1,X2)
| icext(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
iext(uri_rdf_type,uri_ex_s,esk19_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_11,plain,
( ~ iext(uri_owl_someValuesFrom,esk19_0,X1)
| ~ icext(esk19_0,X2)
| icext(X1,esk18_4(esk19_0,uri_ex_p,X1,X2)) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_12,plain,
icext(esk19_0,uri_ex_s),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_13,plain,
( ~ iext(uri_owl_onProperty,X3,X1)
| ~ iext(uri_owl_someValuesFrom,X3,X4)
| ~ icext(X3,X2)
| iext(X1,X2,esk18_4(X3,X1,X4,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
fof(c_0_14,negated_conjecture,
~ ? [X21] :
( iext(uri_rdf_type,X21,uri_ex_c)
& iext(uri_ex_p,uri_ex_s,X21) ),
inference(assume_negation,[status(cth)],[testcase_conclusion_fullish_009_Existential_Restriction_Entailments]) ).
cnf(c_0_15,plain,
( ~ iext(uri_owl_someValuesFrom,esk19_0,X1)
| icext(X1,esk18_4(esk19_0,uri_ex_p,X1,uri_ex_s)) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,plain,
iext(uri_owl_someValuesFrom,esk19_0,uri_ex_c),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_17,plain,
( ~ iext(uri_owl_someValuesFrom,esk19_0,X2)
| ~ icext(esk19_0,X1)
| iext(uri_ex_p,X1,esk18_4(esk19_0,uri_ex_p,X2,X1)) ),
inference(spm,[status(thm)],[c_0_13,c_0_8]) ).
fof(c_0_18,negated_conjecture,
! [X218] :
( ~ iext(uri_rdf_type,X218,uri_ex_c)
| ~ iext(uri_ex_p,uri_ex_s,X218) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])])]) ).
cnf(c_0_19,plain,
( ~ icext(X1,X2)
| iext(uri_rdf_type,X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_20,plain,
icext(uri_ex_c,esk18_4(esk19_0,uri_ex_p,uri_ex_c,uri_ex_s)),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_21,plain,
( ~ iext(uri_owl_someValuesFrom,esk19_0,X1)
| iext(uri_ex_p,uri_ex_s,esk18_4(esk19_0,uri_ex_p,X1,uri_ex_s)) ),
inference(spm,[status(thm)],[c_0_17,c_0_12]) ).
cnf(c_0_22,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_18]) ).
cnf(c_0_23,plain,
iext(uri_rdf_type,esk18_4(esk19_0,uri_ex_p,uri_ex_c,uri_ex_s),uri_ex_c),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_24,plain,
iext(uri_ex_p,uri_ex_s,esk18_4(esk19_0,uri_ex_p,uri_ex_c,uri_ex_s)),
inference(spm,[status(thm)],[c_0_21,c_0_16]) ).
cnf(c_0_25,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWB009+3 : TPTP v9.3.1. Released v5.2.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n010.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 07:38:25 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.45 Running first-order theorem proving
% 0.11/0.45 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
% 1.07/0.66 % Version: 3.5.1
% 1.07/0.66 % Preprocessing class: FSLSSMSMSSSNFFN.
% 1.07/0.66 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.07/0.66 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.07/0.66 % Starting new_bool_3 with 300s (1) cores
% 1.07/0.66 % Starting new_bool_1 with 300s (1) cores
% 1.07/0.66 % Starting sh5l with 300s (1) cores
% 1.07/0.66 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 386565 completed with status 0
% 1.07/0.66 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 1.07/0.66 % Preprocessing class: FSLSSMSMSSSNFFN.
% 1.07/0.66 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.07/0.66 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.07/0.66 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.07/0.66 % No SInE strategy applied
% 1.07/0.66 % Search class: FGHNS-FSLM33-SFFFFFNN
% 1.07/0.66 % partial match(1): FGHNF-FSLM33-SFFFFFNN
% 1.07/0.66 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 1.07/0.66 % Starting SubtermCWHack with 136s (1) cores
% 1.07/0.66 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 1.07/0.66 % Starting G-E--_107_C41_F1_PI_AE_Q4_CS_SP_PS_S4S with 136s (1) cores
% 1.07/0.66 % Starting new_bool_3 with 136s (1) cores
% 1.07/0.66 % Starting H----_042_B03_F1_AE_Q4_SP_S2S with 136s (1) cores
% 1.07/0.66 % G-E--_107_C41_F1_PI_AE_Q4_CS_SP_PS_S4S with pid 386576 completed with status 0
% 1.07/0.66 % Result found by G-E--_107_C41_F1_PI_AE_Q4_CS_SP_PS_S4S
% 1.07/0.66 % Preprocessing class: FSLSSMSMSSSNFFN.
% 1.07/0.66 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.07/0.66 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.07/0.66 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.07/0.66 % No SInE strategy applied
% 1.07/0.66 % Search class: FGHNS-FSLM33-SFFFFFNN
% 1.07/0.66 % partial match(1): FGHNF-FSLM33-SFFFFFNN
% 1.07/0.66 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 1.07/0.66 % Starting SubtermCWHack with 136s (1) cores
% 1.07/0.66 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 1.07/0.66 % Starting G-E--_107_C41_F1_PI_AE_Q4_CS_SP_PS_S4S with 136s (1) cores
% 1.07/0.66 % Preprocessing time : 0.005 s
% 1.07/0.66 % Presaturation interreduction done
% 1.07/0.66
% 1.07/0.66 % Proof found!
% 1.07/0.66 % SZS status Theorem
% 1.07/0.66 % SZS output start CNFRefutation
% See solution above
% 1.07/0.66 % Parsed axioms : 140
% 1.07/0.66 % Removed by relevancy pruning/SinE : 0
% 1.07/0.66 % Initial clauses : 253
% 1.07/0.66 % Removed in clause preprocessing : 19
% 1.07/0.66 % Initial clauses in saturation : 234
% 1.07/0.66 % Processed clauses : 2163
% 1.07/0.66 % ...of these trivial : 183
% 1.07/0.66 % ...subsumed : 759
% 1.07/0.66 % ...remaining for further processing : 1221
% 1.07/0.66 % Other redundant clauses eliminated : 0
% 1.07/0.66 % Clauses deleted for lack of memory : 0
% 1.07/0.66 % Backward-subsumed : 25
% 1.07/0.66 % Backward-rewritten : 0
% 1.07/0.66 % Generated clauses : 2860
% 1.07/0.66 % ...of the previous two non-redundant : 2027
% 1.07/0.66 % ...aggressively subsumed : 0
% 1.07/0.66 % Contextual simplify-reflections : 18
% 1.07/0.66 % Paramodulations : 2860
% 1.07/0.66 % Factorizations : 0
% 1.07/0.66 % NegExts : 0
% 1.07/0.66 % Equation resolutions : 0
% 1.07/0.66 % Disequality decompositions : 0
% 1.07/0.66 % Total rewrite steps : 1327
% 1.07/0.66 % ...of those cached : 1155
% 1.07/0.66 % Propositional unsat checks : 0
% 1.07/0.66 % Propositional check models : 0
% 1.07/0.66 % Propositional check unsatisfiable : 0
% 1.07/0.66 % Propositional clauses : 0
% 1.07/0.66 % Propositional clauses after purity: 0
% 1.07/0.66 % Propositional unsat core size : 0
% 1.07/0.66 % Propositional preprocessing time : 0.000
% 1.07/0.66 % Propositional encoding time : 0.000
% 1.07/0.66 % Propositional solver time : 0.000
% 1.07/0.66 % Success case prop preproc time : 0.000
% 1.07/0.66 % Success case prop encoding time : 0.000
% 1.07/0.66 % Success case prop solver time : 0.000
% 1.07/0.66 % Current number of processed clauses : 984
% 1.07/0.66 % Positive orientable unit clauses : 271
% 1.07/0.66 % Positive unorientable unit clauses: 0
% 1.07/0.66 % Negative unit clauses : 1
% 1.07/0.66 % Non-unit-clauses : 712
% 1.07/0.66 % Current number of unprocessed clauses: 307
% 1.07/0.66 % ...number of literals in the above : 1234
% 1.07/0.66 % Current number of archived formulas : 0
% 1.07/0.66 % Current number of archived clauses : 238
% 1.07/0.66 % Clause-clause subsumption calls (NU) : 159186
% 1.07/0.66 % Rec. Clause-clause subsumption calls : 81572
% 1.07/0.66 % Non-unit clause-clause subsumptions : 792
% 1.07/0.66 % Unit Clause-clause subsumption calls : 6006
% 1.07/0.66 % Rewrite failures with RHS unbound : 0
% 1.07/0.66 % BW rewrite match attempts : 129
% 1.07/0.66 % BW rewrite match successes : 1
% 1.07/0.66 % Condensation attempts : 0
% 1.07/0.66 % Condensation successes : 0
% 1.07/0.66 % Termbank termtop insertions : 50045
% 1.07/0.66 % Search garbage collected termcells : 3152
% 1.07/0.66
% 1.07/0.66 % -------------------------------------------------
% 1.07/0.66 % User time : 0.166 s
% 1.07/0.66 % System time : 0.013 s
% 1.07/0.66 % Total time : 0.179 s
% 1.07/0.66 % Maximum resident set size: 4280 pages
% 1.07/0.66
% 1.07/0.66 % -------------------------------------------------
% 1.07/0.66 % User time : 0.729 s
% 1.07/0.66 % System time : 0.049 s
% 1.07/0.66 % Total time : 0.778 s
% 1.07/0.66 % Maximum resident set size: 4608 pages
% 1.07/0.66 % E exiting
%------------------------------------------------------------------------------