%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SWB030+2 : 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 : n008.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:39:19 PM UTC 2026
% Result : Unsatisfiable 0.10s 0.43s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 4
% Syntax : Number of formulae : 32 ( 7 unt; 0 def)
% Number of atoms : 95 ( 0 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 104 ( 41 ~; 38 |; 18 &)
% ( 4 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 11 ( 11 usr; 10 con; 0-2 aty)
% Number of variables : 52 ( 2 sgn 21 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(owl_bool_complementof_class,axiom,
! [X3,X2] :
( iext(uri_owl_complementOf,X3,X2)
=> ( ! [X1] :
( icext(X3,X1)
<=> ~ icext(X2,X1) )
& ic(X2)
& ic(X3) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',owl_bool_complementof_class) ).
fof(owl_restrict_hasself,axiom,
! [X3,X4,X5] :
( ( iext(uri_owl_onProperty,X3,X4)
& iext(uri_owl_hasSelf,X3,X5) )
=> ! [X1] :
( icext(X3,X1)
<=> iext(X4,X1,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',owl_restrict_hasself) ).
fof(testcase_premise_fullish_030_Bad_Class,axiom,
? [X6] :
( iext(uri_owl_hasSelf,X6,literal_typed(dat_str_true,uri_xsd_boolean))
& iext(uri_owl_onProperty,X6,uri_rdf_type)
& iext(uri_rdf_type,X6,uri_owl_Restriction)
& iext(uri_owl_complementOf,uri_ex_c,X6)
& iext(uri_rdf_type,uri_ex_c,uri_owl_Class) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',testcase_premise_fullish_030_Bad_Class) ).
fof(rdfs_cext_def,axiom,
! [X1,X2] :
( iext(uri_rdf_type,X1,X2)
<=> icext(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rdfs_cext_def) ).
fof(c_0_4,plain,
! [X3,X2] :
( iext(uri_owl_complementOf,X3,X2)
=> ( ! [X1] :
( icext(X3,X1)
<=> ~ icext(X2,X1) )
& ic(X2)
& ic(X3) ) ),
inference(fof_simplification,[status(thm)],[owl_bool_complementof_class]) ).
fof(c_0_5,plain,
! [X9,X10,X11,X12] :
( ( ~ iext(uri_owl_onProperty,X9,X10)
| ~ iext(uri_owl_hasSelf,X9,X11)
| icext(X9,X12)
| ~ iext(X10,X12,X12) )
& ( ~ iext(uri_owl_onProperty,X9,X10)
| ~ iext(uri_owl_hasSelf,X9,X11)
| iext(X10,X12,X12)
| ~ icext(X9,X12) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[owl_restrict_hasself])])])])]) ).
fof(c_0_6,plain,
( iext(uri_owl_hasSelf,esk1_0,literal_typed(dat_str_true,uri_xsd_boolean))
& iext(uri_owl_onProperty,esk1_0,uri_rdf_type)
& iext(uri_rdf_type,esk1_0,uri_owl_Restriction)
& iext(uri_owl_complementOf,uri_ex_c,esk1_0)
& iext(uri_rdf_type,uri_ex_c,uri_owl_Class) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[testcase_premise_fullish_030_Bad_Class])]) ).
fof(c_0_7,plain,
! [X13,X14,X15] :
( ( ~ iext(uri_owl_complementOf,X13,X14)
| icext(X13,X15)
| icext(X14,X15) )
& ( ~ iext(uri_owl_complementOf,X13,X14)
| ~ icext(X14,X15)
| ~ icext(X13,X15) )
& ( ~ iext(uri_owl_complementOf,X13,X14)
| ic(X14) )
& ( ~ iext(uri_owl_complementOf,X13,X14)
| ic(X13) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])])]) ).
cnf(c_0_8,plain,
( ~ iext(uri_owl_onProperty,X1,X3)
| ~ iext(uri_owl_hasSelf,X1,X4)
| ~ icext(X1,X2)
| iext(X3,X2,X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
iext(uri_owl_hasSelf,esk1_0,literal_typed(dat_str_true,uri_xsd_boolean)),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_10,plain,
! [X7,X8] :
( ( iext(uri_rdf_type,X7,X8)
| ~ icext(X8,X7) )
& ( icext(X8,X7)
| ~ iext(uri_rdf_type,X7,X8) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[rdfs_cext_def])])]) ).
cnf(c_0_11,plain,
( ~ iext(uri_owl_complementOf,X3,X1)
| icext(X3,X2)
| icext(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
iext(uri_owl_complementOf,uri_ex_c,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_13,plain,
( ~ iext(uri_owl_onProperty,esk1_0,X1)
| ~ icext(esk1_0,X2)
| iext(X1,X2,X2) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_14,plain,
iext(uri_owl_onProperty,esk1_0,uri_rdf_type),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_15,plain,
( ~ icext(X1,X2)
| iext(uri_rdf_type,X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,plain,
( icext(esk1_0,X1)
| icext(uri_ex_c,X1) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_17,plain,
( ~ iext(uri_owl_complementOf,X1,X3)
| ~ icext(X3,X2)
| ~ icext(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_18,plain,
( ~ iext(uri_owl_onProperty,X3,X1)
| ~ iext(uri_owl_hasSelf,X3,X4)
| ~ iext(X1,X2,X2)
| icext(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_19,plain,
( ~ icext(esk1_0,X1)
| iext(uri_rdf_type,X1,X1) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_20,plain,
( iext(uri_rdf_type,X1,uri_ex_c)
| icext(esk1_0,X1) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_21,plain,
( ~ icext(uri_ex_c,X1)
| ~ icext(esk1_0,X1) ),
inference(spm,[status(thm)],[c_0_17,c_0_12]) ).
cnf(c_0_22,plain,
( ~ iext(uri_rdf_type,X1,X2)
| icext(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_23,plain,
( ~ iext(X2,X1,X1)
| ~ iext(uri_owl_onProperty,esk1_0,X2)
| icext(esk1_0,X1) ),
inference(spm,[status(thm)],[c_0_18,c_0_9]) ).
cnf(c_0_24,plain,
( iext(uri_rdf_type,X1,X1)
| iext(uri_rdf_type,X1,uri_ex_c) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_25,plain,
( ~ iext(uri_rdf_type,X1,uri_ex_c)
| ~ icext(esk1_0,X1) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_26,plain,
( ~ iext(uri_rdf_type,X1,X1)
| icext(esk1_0,X1) ),
inference(spm,[status(thm)],[c_0_23,c_0_14]) ).
cnf(c_0_27,plain,
iext(uri_rdf_type,uri_ex_c,uri_ex_c),
inference(ef,[status(thm)],[c_0_24]) ).
cnf(c_0_28,plain,
( ~ iext(uri_rdf_type,X1,esk1_0)
| ~ iext(uri_rdf_type,X1,uri_ex_c) ),
inference(spm,[status(thm)],[c_0_25,c_0_22]) ).
cnf(c_0_29,plain,
icext(esk1_0,uri_ex_c),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_30,plain,
~ iext(uri_rdf_type,uri_ex_c,esk1_0),
inference(spm,[status(thm)],[c_0_28,c_0_27]) ).
cnf(c_0_31,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_29]),c_0_30]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWB030+2 : TPTP v9.3.1. Released v5.2.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.36 % Computer : n008.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Mon Sep 21 07:43:39 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.41 Running first-order theorem proving
% 0.10/0.41 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.10/0.43 % Version: 3.5.1
% 0.10/0.43 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.10/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.43 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.10/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.10/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.10/0.43 % Starting sh5l with 300s (1) cores
% 0.10/0.43 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 508798 completed with status 0
% 0.10/0.43 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.10/0.43 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.10/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.43 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.10/0.43 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.10/0.43 % No SInE strategy applied
% 0.10/0.43 % Search class: FGHNF-FFSS22-SFFFFFNN
% 0.10/0.43 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.10/0.43 % Starting SubtermCWHack with 136s (1) cores
% 0.10/0.43 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.10/0.43 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.10/0.43 % Starting new_bool_3 with 136s (1) cores
% 0.10/0.43 % Starting new_bool_1 with 136s (1) cores
% 0.10/0.43 % SubtermCWHack with pid 508808 completed with status 0
% 0.10/0.43 % Result found by SubtermCWHack
% 0.10/0.43 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.10/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.43 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.10/0.43 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.10/0.43 % No SInE strategy applied
% 0.10/0.43 % Search class: FGHNF-FFSS22-SFFFFFNN
% 0.10/0.43 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.10/0.43 % Starting SubtermCWHack with 136s (1) cores
% 0.10/0.43 % Preprocessing time : 0.001 s
% 0.10/0.43
% 0.10/0.43 % Proof found!
% 0.10/0.43 % SZS status Unsatisfiable
% 0.10/0.43 % SZS output start CNFRefutation
% See solution above
% 0.10/0.43 % Parsed axioms : 4
% 0.10/0.43 % Removed by relevancy pruning/SinE : 0
% 0.10/0.43 % Initial clauses : 13
% 0.10/0.43 % Removed in clause preprocessing : 0
% 0.10/0.43 % Initial clauses in saturation : 13
% 0.10/0.43 % Processed clauses : 32
% 0.10/0.43 % ...of these trivial : 1
% 0.10/0.43 % ...subsumed : 1
% 0.10/0.43 % ...remaining for further processing : 30
% 0.10/0.43 % Other redundant clauses eliminated : 0
% 0.10/0.43 % Clauses deleted for lack of memory : 0
% 0.10/0.43 % Backward-subsumed : 0
% 0.10/0.43 % Backward-rewritten : 0
% 0.10/0.43 % Generated clauses : 28
% 0.10/0.43 % ...of the previous two non-redundant : 21
% 0.10/0.43 % ...aggressively subsumed : 0
% 0.10/0.43 % Contextual simplify-reflections : 0
% 0.10/0.43 % Paramodulations : 26
% 0.10/0.43 % Factorizations : 2
% 0.10/0.43 % NegExts : 0
% 0.10/0.43 % Equation resolutions : 0
% 0.10/0.43 % Disequality decompositions : 0
% 0.10/0.43 % Total rewrite steps : 1
% 0.10/0.43 % ...of those cached : 0
% 0.10/0.43 % Propositional unsat checks : 0
% 0.10/0.43 % Propositional check models : 0
% 0.10/0.43 % Propositional check unsatisfiable : 0
% 0.10/0.43 % Propositional clauses : 0
% 0.10/0.43 % Propositional clauses after purity: 0
% 0.10/0.43 % Propositional unsat core size : 0
% 0.10/0.43 % Propositional preprocessing time : 0.000
% 0.10/0.43 % Propositional encoding time : 0.000
% 0.10/0.43 % Propositional solver time : 0.000
% 0.10/0.43 % Success case prop preproc time : 0.000
% 0.10/0.43 % Success case prop encoding time : 0.000
% 0.10/0.43 % Success case prop solver time : 0.000
% 0.10/0.43 % Current number of processed clauses : 30
% 0.10/0.43 % Positive orientable unit clauses : 9
% 0.10/0.43 % Positive unorientable unit clauses: 0
% 0.10/0.43 % Negative unit clauses : 1
% 0.10/0.43 % Non-unit-clauses : 20
% 0.10/0.43 % Current number of unprocessed clauses: 2
% 0.10/0.43 % ...number of literals in the above : 3
% 0.10/0.43 % Current number of archived formulas : 0
% 0.10/0.43 % Current number of archived clauses : 0
% 0.10/0.43 % Clause-clause subsumption calls (NU) : 53
% 0.10/0.43 % Rec. Clause-clause subsumption calls : 34
% 0.10/0.43 % Non-unit clause-clause subsumptions : 1
% 0.10/0.43 % Unit Clause-clause subsumption calls : 13
% 0.10/0.43 % Rewrite failures with RHS unbound : 0
% 0.10/0.43 % BW rewrite match attempts : 1
% 0.10/0.43 % BW rewrite match successes : 0
% 0.10/0.43 % Condensation attempts : 0
% 0.10/0.43 % Condensation successes : 0
% 0.10/0.43 % Termbank termtop insertions : 1049
% 0.10/0.43 % Search garbage collected termcells : 128
% 0.10/0.43
% 0.10/0.43 % -------------------------------------------------
% 0.10/0.43 % User time : 0.005 s
% 0.10/0.43 % System time : 0.003 s
% 0.10/0.43 % Total time : 0.008 s
% 0.10/0.43 % Maximum resident set size: 3636 pages
% 0.10/0.43
% 0.10/0.43 % -------------------------------------------------
% 0.10/0.43 % User time : 0.014 s
% 0.10/0.43 % System time : 0.011 s
% 0.10/0.43 % Total time : 0.025 s
% 0.10/0.43 % Maximum resident set size: 4864 pages
% 0.10/0.44 % E exiting
%------------------------------------------------------------------------------