%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWB007+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 : n015.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:54 PM UTC 2026
% Result : Theorem 0.24s 0.61s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 3
% Syntax : Number of formulae : 14 ( 6 unt; 0 def)
% Number of atoms : 30 ( 5 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 26 ( 10 ~; 7 |; 8 &)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 9 con; 0-0 aty)
% Number of variables : 6 ( 0 sgn 4 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(testcase_conclusion_fullish_007_Equal_Classes,conjecture,
( iext(uri_rdfs_range,uri_ex_p,uri_ex_c2)
& iext(uri_rdfs_subClassOf,uri_ex_c,uri_ex_c2)
& iext(uri_rdf_type,uri_ex_w,uri_ex_c2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',testcase_conclusion_fullish_007_Equal_Classes) ).
fof(owl_eqdis_sameas,axiom,
! [X1,X2] :
( iext(uri_owl_sameAs,X1,X2)
<=> X1 = X2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',owl_eqdis_sameas) ).
fof(testcase_premise_fullish_007_Equal_Classes,axiom,
( iext(uri_rdfs_range,uri_ex_p,uri_ex_c1)
& iext(uri_rdfs_subClassOf,uri_ex_c,uri_ex_c1)
& iext(uri_rdf_type,uri_ex_w,uri_ex_c1)
& iext(uri_owl_sameAs,uri_ex_c1,uri_ex_c2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',testcase_premise_fullish_007_Equal_Classes) ).
fof(c_0_3,negated_conjecture,
~ ( iext(uri_rdfs_range,uri_ex_p,uri_ex_c2)
& iext(uri_rdfs_subClassOf,uri_ex_c,uri_ex_c2)
& iext(uri_rdf_type,uri_ex_w,uri_ex_c2) ),
inference(assume_negation,[status(cth)],[testcase_conclusion_fullish_007_Equal_Classes]) ).
fof(c_0_4,plain,
! [X3,X4] :
( ( iext(uri_owl_sameAs,X3,X4)
| X3 != X4 )
& ( X3 = X4
| ~ iext(uri_owl_sameAs,X3,X4) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[owl_eqdis_sameas])])]) ).
fof(c_0_5,negated_conjecture,
( ~ iext(uri_rdfs_range,uri_ex_p,uri_ex_c2)
| ~ iext(uri_rdfs_subClassOf,uri_ex_c,uri_ex_c2)
| ~ iext(uri_rdf_type,uri_ex_w,uri_ex_c2) ),
inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])]) ).
cnf(c_0_6,plain,
( ~ iext(uri_owl_sameAs,X1,X2)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,plain,
iext(uri_owl_sameAs,uri_ex_c1,uri_ex_c2),
inference(split_conjunct,[status(thm)],[testcase_premise_fullish_007_Equal_Classes]) ).
cnf(c_0_8,negated_conjecture,
( ~ iext(uri_rdfs_range,uri_ex_p,uri_ex_c2)
| ~ iext(uri_rdfs_subClassOf,uri_ex_c,uri_ex_c2)
| ~ iext(uri_rdf_type,uri_ex_w,uri_ex_c2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
uri_ex_c2 = uri_ex_c1,
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_10,plain,
iext(uri_rdf_type,uri_ex_w,uri_ex_c1),
inference(split_conjunct,[status(thm)],[testcase_premise_fullish_007_Equal_Classes]) ).
cnf(c_0_11,plain,
iext(uri_rdfs_subClassOf,uri_ex_c,uri_ex_c1),
inference(split_conjunct,[status(thm)],[testcase_premise_fullish_007_Equal_Classes]) ).
cnf(c_0_12,plain,
iext(uri_rdfs_range,uri_ex_p,uri_ex_c1),
inference(split_conjunct,[status(thm)],[testcase_premise_fullish_007_Equal_Classes]) ).
cnf(c_0_13,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_9]),c_0_10]),c_0_9]),c_0_11]),c_0_9]),c_0_12])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SWB007+2 : TPTP v9.3.1. Released v5.2.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.18/0.50 % Computer : n015.cluster.edu
% 0.18/0.50 % Model : x86_64 x86_64
% 0.18/0.50 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.50 % Memory : 8046.5625MB
% 0.18/0.50 % OS : Linux 6.8.0-71-generic
% 0.18/0.50 % CPULimit : 300
% 0.18/0.50 % WCLimit : 300
% 0.18/0.50 % DateTime : Mon Sep 21 07:40:51 UTC 2026
% 0.18/0.51 % CPUTime :
% 0.18/0.51 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.24/0.58 Running first-order theorem proving
% 0.24/0.58 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.61 % Version: 3.5.1
% 0.24/0.61 % Preprocessing class: FSSSSMSMSSSNFFN.
% 0.24/0.61 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.61 % Starting G----_0031_C18_F1_SE_CS_SP_S0Y with 1500s (5) cores
% 0.24/0.61 % Starting new_bool_3 with 300s (1) cores
% 0.24/0.61 % Starting new_bool_1 with 300s (1) cores
% 0.24/0.61 % Starting sh5l with 300s (1) cores
% 0.24/0.61 % G----_0031_C18_F1_SE_CS_SP_S0Y with pid 950055 completed with status 0
% 0.24/0.61 % Result found by G----_0031_C18_F1_SE_CS_SP_S0Y
% 0.24/0.61 % Preprocessing class: FSSSSMSMSSSNFFN.
% 0.24/0.61 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.61 % Starting G----_0031_C18_F1_SE_CS_SP_S0Y with 1500s (5) cores
% 0.24/0.61 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.24/0.61 % No SInE strategy applied
% 0.24/0.61 % Search class: FHHSF-FFSS00-SFFFFFNN
% 0.24/0.61 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.24/0.61 % Starting SubtermCWHack with 136s (1) cores
% 0.24/0.61 % Starting G----_0031_C18_F1_SE_CS_SP_S0Y with 151s (1) cores
% 0.24/0.61 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.24/0.61 % Starting new_bool_3 with 136s (1) cores
% 0.24/0.61 % Starting new_bool_1 with 136s (1) cores
% 0.24/0.61 % SubtermCWHack with pid 950061 completed with status 0
% 0.24/0.61 % Result found by SubtermCWHack
% 0.24/0.61 % Preprocessing class: FSSSSMSMSSSNFFN.
% 0.24/0.61 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.61 % Starting G----_0031_C18_F1_SE_CS_SP_S0Y with 1500s (5) cores
% 0.24/0.61 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.24/0.61 % No SInE strategy applied
% 0.24/0.61 % Search class: FHHSF-FFSS00-SFFFFFNN
% 0.24/0.61 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.24/0.61 % Starting SubtermCWHack with 136s (1) cores
% 0.24/0.61 % Preprocessing time : 0.002 s
% 0.24/0.61
% 0.24/0.61 % Proof found!
% 0.24/0.61 % SZS status Theorem
% 0.24/0.61 % SZS output start CNFRefutation
% See solution above
% 0.24/0.61 % Parsed axioms : 3
% 0.24/0.61 % Removed by relevancy pruning/SinE : 0
% 0.24/0.61 % Initial clauses : 7
% 0.24/0.61 % Removed in clause preprocessing : 0
% 0.24/0.61 % Initial clauses in saturation : 7
% 0.24/0.61 % Processed clauses : 9
% 0.24/0.61 % ...of these trivial : 0
% 0.24/0.61 % ...subsumed : 0
% 0.24/0.61 % ...remaining for further processing : 8
% 0.24/0.61 % Other redundant clauses eliminated : 1
% 0.24/0.61 % Clauses deleted for lack of memory : 0
% 0.24/0.61 % Backward-subsumed : 0
% 0.24/0.61 % Backward-rewritten : 1
% 0.24/0.61 % Generated clauses : 2
% 0.24/0.61 % ...of the previous two non-redundant : 2
% 0.24/0.61 % ...aggressively subsumed : 0
% 0.24/0.61 % Contextual simplify-reflections : 0
% 0.24/0.61 % Paramodulations : 1
% 0.24/0.61 % Factorizations : 0
% 0.24/0.61 % NegExts : 0
% 0.24/0.61 % Equation resolutions : 1
% 0.24/0.61 % Disequality decompositions : 0
% 0.24/0.61 % Total rewrite steps : 8
% 0.24/0.61 % ...of those cached : 3
% 0.24/0.61 % Propositional unsat checks : 0
% 0.24/0.61 % Propositional check models : 0
% 0.24/0.61 % Propositional check unsatisfiable : 0
% 0.24/0.61 % Propositional clauses : 0
% 0.24/0.61 % Propositional clauses after purity: 0
% 0.24/0.61 % Propositional unsat core size : 0
% 0.24/0.61 % Propositional preprocessing time : 0.000
% 0.24/0.61 % Propositional encoding time : 0.000
% 0.24/0.61 % Propositional solver time : 0.000
% 0.24/0.61 % Success case prop preproc time : 0.000
% 0.24/0.61 % Success case prop encoding time : 0.000
% 0.24/0.61 % Success case prop solver time : 0.000
% 0.24/0.61 % Current number of processed clauses : 6
% 0.24/0.61 % Positive orientable unit clauses : 5
% 0.24/0.61 % Positive unorientable unit clauses: 0
% 0.24/0.61 % Negative unit clauses : 0
% 0.24/0.61 % Non-unit-clauses : 1
% 0.24/0.61 % Current number of unprocessed clauses: 0
% 0.24/0.61 % ...number of literals in the above : 0
% 0.24/0.61 % Current number of archived formulas : 0
% 0.24/0.61 % Current number of archived clauses : 1
% 0.24/0.61 % Clause-clause subsumption calls (NU) : 0
% 0.24/0.61 % Rec. Clause-clause subsumption calls : 0
% 0.24/0.61 % Non-unit clause-clause subsumptions : 0
% 0.24/0.61 % Unit Clause-clause subsumption calls : 0
% 0.24/0.61 % Rewrite failures with RHS unbound : 0
% 0.24/0.61 % BW rewrite match attempts : 2
% 0.24/0.61 % BW rewrite match successes : 1
% 0.24/0.61 % Condensation attempts : 0
% 0.24/0.61 % Condensation successes : 0
% 0.24/0.61 % Termbank termtop insertions : 310
% 0.24/0.61 % Search garbage collected termcells : 28
% 0.24/0.61
% 0.24/0.61 % -------------------------------------------------
% 0.24/0.61 % User time : 0.003 s
% 0.24/0.61 % System time : 0.005 s
% 0.24/0.61 % Total time : 0.008 s
% 0.24/0.61 % Maximum resident set size: 3628 pages
% 0.24/0.61
% 0.24/0.61 % -------------------------------------------------
% 0.24/0.61 % User time : 0.008 s
% 0.24/0.61 % System time : 0.018 s
% 0.24/0.61 % Total time : 0.027 s
% 0.24/0.61 % Maximum resident set size: 4864 pages
% 0.24/0.61 % E exiting
%------------------------------------------------------------------------------