%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWB065+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 : n009.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:35 PM UTC 2026
% Result : Theorem 0.24s 0.59s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of formulae : 25 ( 12 unt; 0 def)
% Number of atoms : 79 ( 13 equ)
% Maximal formula atoms : 26 ( 3 avg)
% Number of connectives : 91 ( 37 ~; 35 |; 14 &)
% ( 4 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 11 ( 11 usr; 10 con; 0-3 aty)
% Number of variables : 32 ( 0 sgn 17 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(owl_enum_class_001,axiom,
! [X11,X12,X21] :
( ( iext(uri_rdf_rest,X12,uri_rdf_nil)
& iext(uri_rdf_first,X12,X21) )
=> ( iext(uri_owl_oneOf,X11,X12)
<=> ( ! [X4] :
( icext(X11,X4)
<=> X4 = X21 )
& ic(X11) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWB001+0.ax',owl_enum_class_001) ).
fof(premise_rdfbased_sem_eqdis_sameas_ext,axiom,
? [X42,X37] :
( iext(uri_rdf_type,uri_ex_w,X37)
& iext(uri_owl_oneOf,X37,X42)
& iext(uri_rdf_rest,X42,uri_rdf_nil)
& iext(uri_rdf_first,X42,uri_ex_u) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',premise_rdfbased_sem_eqdis_sameas_ext) ).
fof(conclusion_rdfbased_sem_eqdis_sameas_ext,conjecture,
iext(uri_owl_sameAs,uri_ex_w,uri_ex_u),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conclusion_rdfbased_sem_eqdis_sameas_ext) ).
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(owl_eqdis_sameas,axiom,
! [X4,X7] :
( iext(uri_owl_sameAs,X4,X7)
<=> X4 = X7 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWB001+0.ax',owl_eqdis_sameas) ).
fof(c_0_5,plain,
! [X60,X61,X62,X63,X64] :
( ( ~ iext(uri_rdf_rest,X61,uri_rdf_nil)
| ~ iext(uri_rdf_first,X61,X62)
| iext(uri_owl_oneOf,X60,X61)
| ~ ic(X60)
| esk4_3(X60,X61,X62) = X62
| icext(X60,esk4_3(X60,X61,X62)) )
& ( ~ iext(uri_rdf_rest,X61,uri_rdf_nil)
| ~ iext(uri_rdf_first,X61,X62)
| iext(uri_owl_oneOf,X60,X61)
| ~ ic(X60)
| esk4_3(X60,X61,X62) != X62
| ~ icext(X60,esk4_3(X60,X61,X62)) )
& ( ~ iext(uri_rdf_rest,X61,uri_rdf_nil)
| ~ iext(uri_rdf_first,X61,X62)
| ~ iext(uri_owl_oneOf,X60,X61)
| icext(X60,X64)
| X64 != X62 )
& ( ~ iext(uri_rdf_rest,X61,uri_rdf_nil)
| ~ iext(uri_rdf_first,X61,X62)
| ~ iext(uri_owl_oneOf,X60,X61)
| X63 = X62
| ~ icext(X60,X63) )
& ( ~ iext(uri_rdf_rest,X61,uri_rdf_nil)
| ~ iext(uri_rdf_first,X61,X62)
| ~ iext(uri_owl_oneOf,X60,X61)
| ic(X60) ) ),
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_enum_class_001])])])])])])]) ).
fof(c_0_6,plain,
( iext(uri_rdf_type,uri_ex_w,esk2_0)
& iext(uri_owl_oneOf,esk2_0,esk1_0)
& iext(uri_rdf_rest,esk1_0,uri_rdf_nil)
& iext(uri_rdf_first,esk1_0,uri_ex_u) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[premise_rdfbased_sem_eqdis_sameas_ext])]) ).
fof(c_0_7,negated_conjecture,
~ iext(uri_owl_sameAs,uri_ex_w,uri_ex_u),
inference(assume_negation,[status(cth)],[conclusion_rdfbased_sem_eqdis_sameas_ext]) ).
cnf(c_0_8,plain,
( ~ iext(uri_rdf_rest,X4,uri_rdf_nil)
| ~ iext(uri_rdf_first,X4,X3)
| ~ iext(uri_owl_oneOf,X1,X4)
| ~ icext(X1,X2)
| X2 = X3 ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
iext(uri_rdf_first,esk1_0,uri_ex_u),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
iext(uri_rdf_rest,esk1_0,uri_rdf_nil),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_11,plain,
! [X50,X51] :
( ( iext(uri_rdf_type,X50,X51)
| ~ icext(X51,X50) )
& ( icext(X51,X50)
| ~ iext(uri_rdf_type,X50,X51) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[rdfs_cext_def])])]) ).
fof(c_0_12,negated_conjecture,
~ iext(uri_owl_sameAs,uri_ex_w,uri_ex_u),
inference(fof_simplification,[status(thm)],[c_0_7]) ).
cnf(c_0_13,plain,
( ~ iext(uri_owl_oneOf,X2,esk1_0)
| ~ icext(X2,X1)
| X1 = uri_ex_u ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10])]) ).
cnf(c_0_14,plain,
( ~ iext(uri_rdf_type,X1,X2)
| icext(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_15,plain,
! [X47,X48] :
( ( iext(uri_owl_sameAs,X47,X48)
| X47 != X48 )
& ( X47 = X48
| ~ iext(uri_owl_sameAs,X47,X48) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[owl_eqdis_sameas])])]) ).
fof(c_0_16,negated_conjecture,
~ iext(uri_owl_sameAs,uri_ex_w,uri_ex_u),
inference(fof_nnf,[status(thm)],[c_0_12]) ).
cnf(c_0_17,plain,
( ~ iext(uri_rdf_type,X1,X2)
| ~ iext(uri_owl_oneOf,X2,esk1_0)
| X1 = uri_ex_u ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,plain,
iext(uri_rdf_type,uri_ex_w,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_19,plain,
iext(uri_owl_oneOf,esk2_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_20,plain,
( X1 != X2
| iext(uri_owl_sameAs,X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_21,negated_conjecture,
~ iext(uri_owl_sameAs,uri_ex_w,uri_ex_u),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_22,plain,
uri_ex_u = uri_ex_w,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19])]) ).
cnf(c_0_23,plain,
iext(uri_owl_sameAs,X1,X1),
inference(er,[status(thm)],[c_0_20]) ).
cnf(c_0_24,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_22]),c_0_23])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : SWB065+1 : TPTP v9.3.1. Released v5.2.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.17/0.45 % Computer : n009.cluster.edu
% 0.17/0.45 % Model : x86_64 x86_64
% 0.17/0.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.45 % Memory : 8046.5625MB
% 0.17/0.45 % OS : Linux 6.8.0-71-generic
% 0.17/0.45 % CPULimit : 300
% 0.17/0.45 % WCLimit : 300
% 0.17/0.45 % DateTime : Mon Sep 21 07:45:12 UTC 2026
% 0.17/0.45 % CPUTime :
% 0.17/0.45 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.24/0.52 Running first-order theorem proving
% 0.24/0.52 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.24/0.59 % Version: 3.5.1
% 0.24/0.59 % Preprocessing class: FSLMSMSLSSSNFFN.
% 0.24/0.59 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.59 % Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 0.24/0.59 % Starting new_bool_3 with 600s (2) cores
% 0.24/0.59 % Starting new_bool_1 with 600s (2) cores
% 0.24/0.59 % Starting sh5l with 300s (1) cores
% 0.24/0.59 % new_bool_3 with pid 1235681 completed with status 0
% 0.24/0.59 % Result found by new_bool_3
% 0.24/0.59 % Preprocessing class: FSLMSMSLSSSNFFN.
% 0.24/0.59 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.59 % Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 0.24/0.59 % Starting new_bool_3 with 600s (2) cores
% 0.24/0.59 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.24/0.59 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.24/0.59 % Search class: FGHSF-FFMM33-SFFFFFNN
% 0.24/0.59 % Scheduled 5 strats onto 2 cores with 600 seconds (600 total)
% 0.24/0.59 % Starting SubtermCWHack with 61s (1) cores
% 0.24/0.59 % Starting G-E--_301_C18_F1_URBAN_S0Y with 361s (1) cores
% 0.24/0.59 % SubtermCWHack with pid 1235684 completed with status 0
% 0.24/0.59 % Result found by SubtermCWHack
% 0.24/0.59 % Preprocessing class: FSLMSMSLSSSNFFN.
% 0.24/0.59 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.59 % Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 0.24/0.59 % Starting new_bool_3 with 600s (2) cores
% 0.24/0.59 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.24/0.59 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.24/0.59 % Search class: FGHSF-FFMM33-SFFFFFNN
% 0.24/0.59 % Scheduled 5 strats onto 2 cores with 600 seconds (600 total)
% 0.24/0.59 % Starting SubtermCWHack with 61s (1) cores
% 0.24/0.59 % Preprocessing time : 0.002 s
% 0.24/0.59
% 0.24/0.59 % Proof found!
% 0.24/0.59 % SZS status Theorem
% 0.24/0.59 % SZS output start CNFRefutation
% See solution above
% 0.24/0.59 % Parsed axioms : 560
% 0.24/0.59 % Removed by relevancy pruning/SinE : 508
% 0.24/0.59 % Initial clauses : 93
% 0.24/0.59 % Removed in clause preprocessing : 0
% 0.24/0.59 % Initial clauses in saturation : 93
% 0.24/0.59 % Processed clauses : 230
% 0.24/0.59 % ...of these trivial : 17
% 0.24/0.59 % ...subsumed : 60
% 0.24/0.59 % ...remaining for further processing : 153
% 0.24/0.59 % Other redundant clauses eliminated : 3
% 0.24/0.59 % Clauses deleted for lack of memory : 0
% 0.24/0.59 % Backward-subsumed : 1
% 0.24/0.59 % Backward-rewritten : 32
% 0.24/0.59 % Generated clauses : 316
% 0.24/0.59 % ...of the previous two non-redundant : 234
% 0.24/0.59 % ...aggressively subsumed : 0
% 0.24/0.59 % Contextual simplify-reflections : 1
% 0.24/0.59 % Paramodulations : 313
% 0.24/0.59 % Factorizations : 0
% 0.24/0.59 % NegExts : 0
% 0.24/0.59 % Equation resolutions : 3
% 0.24/0.59 % Disequality decompositions : 0
% 0.24/0.59 % Total rewrite steps : 190
% 0.24/0.59 % ...of those cached : 142
% 0.24/0.59 % Propositional unsat checks : 0
% 0.24/0.59 % Propositional check models : 0
% 0.24/0.59 % Propositional check unsatisfiable : 0
% 0.24/0.59 % Propositional clauses : 0
% 0.24/0.59 % Propositional clauses after purity: 0
% 0.24/0.59 % Propositional unsat core size : 0
% 0.24/0.59 % Propositional preprocessing time : 0.000
% 0.24/0.59 % Propositional encoding time : 0.000
% 0.24/0.59 % Propositional solver time : 0.000
% 0.24/0.59 % Success case prop preproc time : 0.000
% 0.24/0.59 % Success case prop encoding time : 0.000
% 0.24/0.59 % Success case prop solver time : 0.000
% 0.24/0.59 % Current number of processed clauses : 117
% 0.24/0.59 % Positive orientable unit clauses : 55
% 0.24/0.59 % Positive unorientable unit clauses: 0
% 0.24/0.59 % Negative unit clauses : 4
% 0.24/0.59 % Non-unit-clauses : 58
% 0.24/0.59 % Current number of unprocessed clauses: 69
% 0.24/0.59 % ...number of literals in the above : 345
% 0.24/0.59 % Current number of archived formulas : 0
% 0.24/0.59 % Current number of archived clauses : 33
% 0.24/0.59 % Clause-clause subsumption calls (NU) : 1401
% 0.24/0.59 % Rec. Clause-clause subsumption calls : 986
% 0.24/0.59 % Non-unit clause-clause subsumptions : 37
% 0.24/0.59 % Unit Clause-clause subsumption calls : 82
% 0.24/0.59 % Rewrite failures with RHS unbound : 0
% 0.24/0.59 % BW rewrite match attempts : 15
% 0.24/0.59 % BW rewrite match successes : 2
% 0.24/0.59 % Condensation attempts : 0
% 0.24/0.59 % Condensation successes : 0
% 0.24/0.59 % Termbank termtop insertions : 15692
% 0.24/0.59 % Search garbage collected termcells : 3992
% 0.24/0.59
% 0.24/0.59 % -------------------------------------------------
% 0.24/0.59 % User time : 0.017 s
% 0.24/0.59 % System time : 0.007 s
% 0.24/0.59 % Total time : 0.024 s
% 0.24/0.59 % Maximum resident set size: 4436 pages
% 0.24/0.59
% 0.24/0.59 % -------------------------------------------------
% 0.24/0.59 % User time : 0.047 s
% 0.24/0.59 % System time : 0.017 s
% 0.24/0.59 % Total time : 0.063 s
% 0.24/0.59 % Maximum resident set size: 5120 pages
% 0.24/0.59 % E exiting
%------------------------------------------------------------------------------