%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWB009+1 : 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 : n001.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:57 PM UTC 2026
% Result : Theorem 0.16s 5.47s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% 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 : 80 ( 32 ~; 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,
! [X11,X2,X5] :
( ( iext(uri_owl_onProperty,X11,X2)
& iext(uri_owl_someValuesFrom,X11,X5) )
=> ! [X4] :
( icext(X11,X4)
<=> ? [X7] :
( icext(X5,X7)
& iext(X2,X4,X7) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWB001+0.ax',owl_restrict_somevaluesfrom) ).
fof(testcase_premise_fullish_009_Existential_Restriction_Entailments,axiom,
? [X43] :
( iext(uri_owl_someValuesFrom,X43,uri_ex_c)
& iext(uri_owl_onProperty,X43,uri_ex_p)
& iext(uri_rdf_type,X43,uri_owl_Restriction)
& iext(uri_rdf_type,uri_ex_s,X43)
& 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,
! [X4,X5] :
( iext(uri_rdf_type,X4,X5)
<=> icext(X5,X4) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWB001+0.ax',rdfs_cext_def) ).
fof(testcase_conclusion_fullish_009_Existential_Restriction_Entailments,conjecture,
? [X42] :
( iext(uri_rdf_type,X42,uri_ex_c)
& iext(uri_ex_p,uri_ex_s,X42) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',testcase_conclusion_fullish_009_Existential_Restriction_Entailments) ).
fof(c_0_4,plain,
! [X51,X52,X53,X54,X56,X57] :
( ( ~ iext(uri_owl_onProperty,X51,X52)
| ~ iext(uri_owl_someValuesFrom,X51,X53)
| icext(X51,X56)
| ~ icext(X53,X57)
| ~ iext(X52,X56,X57) )
& ( ~ iext(uri_owl_onProperty,X51,X52)
| ~ iext(uri_owl_someValuesFrom,X51,X53)
| ~ icext(X51,X54)
| icext(X53,esk2_4(X51,X52,X53,X54)) )
& ( ~ iext(uri_owl_onProperty,X51,X52)
| ~ iext(uri_owl_someValuesFrom,X51,X53)
| ~ icext(X51,X54)
| iext(X52,X54,esk2_4(X51,X52,X53,X54)) ) ),
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,esk1_0,uri_ex_c)
& iext(uri_owl_onProperty,esk1_0,uri_ex_p)
& iext(uri_rdf_type,esk1_0,uri_owl_Restriction)
& iext(uri_rdf_type,uri_ex_s,esk1_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,
! [X46,X47] :
( ( iext(uri_rdf_type,X46,X47)
| ~ icext(X47,X46) )
& ( icext(X47,X46)
| ~ iext(uri_rdf_type,X46,X47) ) ),
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,esk2_4(X2,X3,X1,X4)) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,plain,
iext(uri_owl_onProperty,esk1_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,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_11,plain,
( ~ iext(uri_owl_someValuesFrom,esk1_0,X1)
| ~ icext(esk1_0,X2)
| icext(X1,esk2_4(esk1_0,uri_ex_p,X1,X2)) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_12,plain,
icext(esk1_0,uri_ex_s),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
fof(c_0_13,negated_conjecture,
~ ? [X42] :
( iext(uri_rdf_type,X42,uri_ex_c)
& iext(uri_ex_p,uri_ex_s,X42) ),
inference(assume_negation,[status(cth)],[testcase_conclusion_fullish_009_Existential_Restriction_Entailments]) ).
cnf(c_0_14,plain,
( ~ iext(uri_owl_someValuesFrom,esk1_0,X1)
| icext(X1,esk2_4(esk1_0,uri_ex_p,X1,uri_ex_s)) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,plain,
iext(uri_owl_someValuesFrom,esk1_0,uri_ex_c),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_16,plain,
( ~ iext(uri_owl_onProperty,X3,X1)
| ~ iext(uri_owl_someValuesFrom,X3,X4)
| ~ icext(X3,X2)
| iext(X1,X2,esk2_4(X3,X1,X4,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
fof(c_0_17,negated_conjecture,
! [X44] :
( ~ iext(uri_rdf_type,X44,uri_ex_c)
| ~ iext(uri_ex_p,uri_ex_s,X44) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])]) ).
cnf(c_0_18,plain,
( ~ icext(X1,X2)
| iext(uri_rdf_type,X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_19,plain,
icext(uri_ex_c,esk2_4(esk1_0,uri_ex_p,uri_ex_c,uri_ex_s)),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_20,plain,
( ~ iext(uri_owl_someValuesFrom,esk1_0,X2)
| ~ icext(esk1_0,X1)
| iext(uri_ex_p,X1,esk2_4(esk1_0,uri_ex_p,X2,X1)) ),
inference(spm,[status(thm)],[c_0_16,c_0_8]) ).
cnf(c_0_21,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_17]) ).
cnf(c_0_22,plain,
iext(uri_rdf_type,esk2_4(esk1_0,uri_ex_p,uri_ex_c,uri_ex_s),uri_ex_c),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_23,plain,
( ~ iext(uri_owl_someValuesFrom,esk1_0,X1)
| iext(uri_ex_p,uri_ex_s,esk2_4(esk1_0,uri_ex_p,X1,uri_ex_s)) ),
inference(spm,[status(thm)],[c_0_20,c_0_12]) ).
cnf(c_0_24,negated_conjecture,
~ iext(uri_ex_p,uri_ex_s,esk2_4(esk1_0,uri_ex_p,uri_ex_c,uri_ex_s)),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_25,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_15]),c_0_24]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWB009+1 : 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/5.37 % Computer : n001.cluster.edu
% 0.11/5.37 % Model : x86_64 x86_64
% 0.11/5.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/5.37 % Memory : 8046.5625MB
% 0.11/5.37 % OS : Linux 6.8.0-71-generic
% 0.11/5.37 % CPULimit : 300
% 0.11/5.37 % WCLimit : 300
% 0.11/5.37 % DateTime : Mon Sep 21 07:43:34 UTC 2026
% 0.11/5.37 % CPUTime :
% 0.11/5.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.16/5.42 Running first-order theorem proving
% 0.16/5.42 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.16/5.47 % Version: 3.5.1
% 0.16/5.47 % Preprocessing class: FSLMSMSLSSSNFFN.
% 0.16/5.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/5.47 % Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 0.16/5.47 % Starting new_bool_3 with 600s (2) cores
% 0.16/5.47 % Starting new_bool_1 with 600s (2) cores
% 0.16/5.47 % Starting sh5l with 300s (1) cores
% 0.16/5.47 % new_bool_3 with pid 2588271 completed with status 0
% 0.16/5.47 % Result found by new_bool_3
% 0.16/5.47 % Preprocessing class: FSLMSMSLSSSNFFN.
% 0.16/5.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/5.47 % Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 0.16/5.47 % Starting new_bool_3 with 600s (2) cores
% 0.16/5.47 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.16/5.47 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/5.47 % Search class: FGHNF-FFMM32-SFFFFFNN
% 0.16/5.47 % Scheduled 5 strats onto 2 cores with 600 seconds (600 total)
% 0.16/5.47 % Starting SubtermCWHack with 61s (1) cores
% 0.16/5.47 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI with 361s (1) cores
% 0.16/5.47 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI with pid 2588276 completed with status 0
% 0.16/5.47 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI
% 0.16/5.47 % Preprocessing class: FSLMSMSLSSSNFFN.
% 0.16/5.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/5.47 % Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 0.16/5.47 % Starting new_bool_3 with 600s (2) cores
% 0.16/5.47 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.16/5.47 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/5.47 % Search class: FGHNF-FFMM32-SFFFFFNN
% 0.16/5.47 % Scheduled 5 strats onto 2 cores with 600 seconds (600 total)
% 0.16/5.47 % Starting SubtermCWHack with 61s (1) cores
% 0.16/5.47 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI with 361s (1) cores
% 0.16/5.47 % Preprocessing time : 0.003 s
% 0.16/5.47 % Presaturation interreduction done
% 0.16/5.47
% 0.16/5.47 % Proof found!
% 0.16/5.47 % SZS status Theorem
% 0.16/5.47 % SZS output start CNFRefutation
% See solution above
% 0.16/5.47 % Parsed axioms : 560
% 0.16/5.47 % Removed by relevancy pruning/SinE : 510
% 0.16/5.47 % Initial clauses : 79
% 0.16/5.47 % Removed in clause preprocessing : 0
% 0.16/5.47 % Initial clauses in saturation : 79
% 0.16/5.47 % Processed clauses : 328
% 0.16/5.47 % ...of these trivial : 43
% 0.16/5.47 % ...subsumed : 7
% 0.16/5.47 % ...remaining for further processing : 278
% 0.16/5.47 % Other redundant clauses eliminated : 0
% 0.16/5.47 % Clauses deleted for lack of memory : 0
% 0.16/5.47 % Backward-subsumed : 0
% 0.16/5.47 % Backward-rewritten : 1
% 0.16/5.47 % Generated clauses : 492
% 0.16/5.47 % ...of the previous two non-redundant : 266
% 0.16/5.47 % ...aggressively subsumed : 0
% 0.16/5.47 % Contextual simplify-reflections : 0
% 0.16/5.47 % Paramodulations : 492
% 0.16/5.47 % Factorizations : 0
% 0.16/5.47 % NegExts : 0
% 0.16/5.47 % Equation resolutions : 0
% 0.16/5.47 % Disequality decompositions : 0
% 0.16/5.47 % Total rewrite steps : 277
% 0.16/5.47 % ...of those cached : 200
% 0.16/5.47 % Propositional unsat checks : 0
% 0.16/5.47 % Propositional check models : 0
% 0.16/5.47 % Propositional check unsatisfiable : 0
% 0.16/5.47 % Propositional clauses : 0
% 0.16/5.47 % Propositional clauses after purity: 0
% 0.16/5.47 % Propositional unsat core size : 0
% 0.16/5.47 % Propositional preprocessing time : 0.000
% 0.16/5.47 % Propositional encoding time : 0.000
% 0.16/5.47 % Propositional solver time : 0.000
% 0.16/5.47 % Success case prop preproc time : 0.000
% 0.16/5.47 % Success case prop encoding time : 0.000
% 0.16/5.47 % Success case prop solver time : 0.000
% 0.16/5.47 % Current number of processed clauses : 215
% 0.16/5.47 % Positive orientable unit clauses : 115
% 0.16/5.47 % Positive unorientable unit clauses: 0
% 0.16/5.47 % Negative unit clauses : 1
% 0.16/5.47 % Non-unit-clauses : 99
% 0.16/5.47 % Current number of unprocessed clauses: 79
% 0.16/5.47 % ...number of literals in the above : 181
% 0.16/5.47 % Current number of archived formulas : 0
% 0.16/5.47 % Current number of archived clauses : 63
% 0.16/5.47 % Clause-clause subsumption calls (NU) : 1056
% 0.16/5.47 % Rec. Clause-clause subsumption calls : 881
% 0.16/5.47 % Non-unit clause-clause subsumptions : 7
% 0.16/5.47 % Unit Clause-clause subsumption calls : 41
% 0.16/5.47 % Rewrite failures with RHS unbound : 0
% 0.16/5.47 % BW rewrite match attempts : 34
% 0.16/5.47 % BW rewrite match successes : 1
% 0.16/5.47 % Condensation attempts : 0
% 0.16/5.47 % Condensation successes : 0
% 0.16/5.47 % Termbank termtop insertions : 15282
% 0.16/5.47 % Search garbage collected termcells : 3476
% 0.16/5.47
% 0.16/5.47 % -------------------------------------------------
% 0.16/5.47 % User time : 0.018 s
% 0.16/5.47 % System time : 0.007 s
% 0.16/5.47 % Total time : 0.025 s
% 0.16/5.47 % Maximum resident set size: 4948 pages
% 0.16/5.47
% 0.16/5.47 % -------------------------------------------------
% 0.16/5.47 % User time : 0.047 s
% 0.16/5.47 % System time : 0.015 s
% 0.16/5.47 % Total time : 0.063 s
% 0.16/5.47 % Maximum resident set size: 5120 pages
% 0.16/5.47 % E exiting
%------------------------------------------------------------------------------