%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SWB023+1 : TPTP v9.3.1. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n020.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:09 PM UTC 2026
% Result : Theorem 0.25s 0.48s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 6
% Syntax : Number of formulae : 34 ( 13 unt; 0 def)
% Number of atoms : 121 ( 19 equ)
% Maximal formula atoms : 26 ( 3 avg)
% Number of connectives : 139 ( 52 ~; 52 |; 28 &)
% ( 5 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 17 ( 17 usr; 13 con; 0-3 aty)
% Number of variables : 47 ( 0 sgn 26 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(rdfs_cext_def,axiom,
! [X4,X5] :
( iext(uri_rdf_type,X4,X5)
<=> icext(X5,X4) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWB001+0.ax',rdfs_cext_def) ).
fof(testcase_premise_fullish_023_Unique_List_Components,axiom,
? [X42,X43] :
( iext(uri_rdf_rest,X43,uri_rdf_nil)
& iext(uri_rdf_first,X43,uri_ex_v)
& iext(uri_rdf_first,X43,uri_ex_u)
& iext(uri_owl_oneOf,X42,X43)
& iext(uri_rdf_type,X42,uri_owl_Class)
& iext(uri_rdf_type,uri_ex_w,X42)
& iext(uri_rdf_type,uri_rdf_first,uri_owl_FunctionalProperty) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',testcase_premise_fullish_023_Unique_List_Components) ).
fof(owl_char_functional,axiom,
! [X2] :
( icext(uri_owl_FunctionalProperty,X2)
<=> ( ! [X4,X27,X28] :
( ( iext(X2,X4,X28)
& iext(X2,X4,X27) )
=> X27 = X28 )
& ip(X2) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWB001+0.ax',owl_char_functional) ).
fof(testcase_conclusion_fullish_023_Unique_List_Components,conjecture,
( iext(uri_owl_sameAs,uri_ex_w,uri_ex_v)
& iext(uri_owl_sameAs,uri_ex_w,uri_ex_u) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',testcase_conclusion_fullish_023_Unique_List_Components) ).
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/sandbox/benchmark/Axioms/SWB001+0.ax',owl_enum_class_001) ).
fof(owl_eqdis_sameas,axiom,
! [X4,X7] :
( iext(uri_owl_sameAs,X4,X7)
<=> X4 = X7 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWB001+0.ax',owl_eqdis_sameas) ).
fof(c_0_6,plain,
! [X97,X98] :
( ( iext(uri_rdf_type,X97,X98)
| ~ icext(X98,X97) )
& ( icext(X98,X97)
| ~ iext(uri_rdf_type,X97,X98) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[rdfs_cext_def])])]) ).
fof(c_0_7,plain,
( iext(uri_rdf_rest,esk2_0,uri_rdf_nil)
& iext(uri_rdf_first,esk2_0,uri_ex_v)
& iext(uri_rdf_first,esk2_0,uri_ex_u)
& iext(uri_owl_oneOf,esk1_0,esk2_0)
& iext(uri_rdf_type,esk1_0,uri_owl_Class)
& iext(uri_rdf_type,uri_ex_w,esk1_0)
& iext(uri_rdf_type,uri_rdf_first,uri_owl_FunctionalProperty) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[testcase_premise_fullish_023_Unique_List_Components])]) ).
fof(c_0_8,plain,
! [X102,X103,X104,X105,X106] :
( ( icext(uri_owl_FunctionalProperty,X106)
| ~ ip(X106)
| esk8_1(X106) != esk9_1(X106) )
& ( icext(uri_owl_FunctionalProperty,X106)
| ~ ip(X106)
| iext(X106,esk7_1(X106),esk9_1(X106)) )
& ( icext(uri_owl_FunctionalProperty,X106)
| ~ ip(X106)
| iext(X106,esk7_1(X106),esk8_1(X106)) )
& ( ~ icext(uri_owl_FunctionalProperty,X102)
| X104 = X105
| ~ iext(X102,X103,X105)
| ~ iext(X102,X103,X104) )
& ( ~ icext(uri_owl_FunctionalProperty,X102)
| ip(X102) ) ),
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_char_functional])])])])])])]) ).
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_rdf_first,uri_owl_FunctionalProperty),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
( ~ icext(uri_owl_FunctionalProperty,X1)
| ~ iext(X1,X2,X4)
| ~ iext(X1,X2,X3)
| X3 = X4 ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,plain,
icext(uri_owl_FunctionalProperty,uri_rdf_first),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
fof(c_0_13,negated_conjecture,
~ ( iext(uri_owl_sameAs,uri_ex_w,uri_ex_v)
& iext(uri_owl_sameAs,uri_ex_w,uri_ex_u) ),
inference(assume_negation,[status(cth)],[testcase_conclusion_fullish_023_Unique_List_Components]) ).
cnf(c_0_14,plain,
( ~ iext(uri_rdf_first,X3,X1)
| ~ iext(uri_rdf_first,X3,X2)
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,plain,
iext(uri_rdf_first,esk2_0,uri_ex_v),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_16,plain,
! [X56,X57,X58,X59,X60] :
( ( ~ iext(uri_rdf_rest,X57,uri_rdf_nil)
| ~ iext(uri_rdf_first,X57,X58)
| iext(uri_owl_oneOf,X56,X57)
| ~ ic(X56)
| esk4_3(X56,X57,X58) = X58
| icext(X56,esk4_3(X56,X57,X58)) )
& ( ~ iext(uri_rdf_rest,X57,uri_rdf_nil)
| ~ iext(uri_rdf_first,X57,X58)
| iext(uri_owl_oneOf,X56,X57)
| ~ ic(X56)
| esk4_3(X56,X57,X58) != X58
| ~ icext(X56,esk4_3(X56,X57,X58)) )
& ( ~ iext(uri_rdf_rest,X57,uri_rdf_nil)
| ~ iext(uri_rdf_first,X57,X58)
| ~ iext(uri_owl_oneOf,X56,X57)
| icext(X56,X60)
| X60 != X58 )
& ( ~ iext(uri_rdf_rest,X57,uri_rdf_nil)
| ~ iext(uri_rdf_first,X57,X58)
| ~ iext(uri_owl_oneOf,X56,X57)
| X59 = X58
| ~ icext(X56,X59) )
& ( ~ iext(uri_rdf_rest,X57,uri_rdf_nil)
| ~ iext(uri_rdf_first,X57,X58)
| ~ iext(uri_owl_oneOf,X56,X57)
| ic(X56) ) ),
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])])])])])])]) ).
cnf(c_0_17,plain,
iext(uri_rdf_type,uri_ex_w,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_18,negated_conjecture,
( ~ iext(uri_owl_sameAs,uri_ex_w,uri_ex_v)
| ~ iext(uri_owl_sameAs,uri_ex_w,uri_ex_u) ),
inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])]) ).
cnf(c_0_19,plain,
( ~ iext(uri_rdf_first,esk2_0,X1)
| X1 = uri_ex_v ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_20,plain,
iext(uri_rdf_first,esk2_0,uri_ex_u),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_21,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_16]) ).
cnf(c_0_22,plain,
icext(esk1_0,uri_ex_w),
inference(spm,[status(thm)],[c_0_9,c_0_17]) ).
fof(c_0_23,plain,
! [X48,X49] :
( ( iext(uri_owl_sameAs,X48,X49)
| X48 != X49 )
& ( X48 = X49
| ~ iext(uri_owl_sameAs,X48,X49) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[owl_eqdis_sameas])])]) ).
cnf(c_0_24,negated_conjecture,
( ~ iext(uri_owl_sameAs,uri_ex_w,uri_ex_v)
| ~ iext(uri_owl_sameAs,uri_ex_w,uri_ex_u) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_25,plain,
uri_ex_v = uri_ex_u,
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_26,plain,
( ~ iext(uri_rdf_first,X2,X1)
| ~ iext(uri_owl_oneOf,esk1_0,X2)
| ~ iext(uri_rdf_rest,X2,uri_rdf_nil)
| uri_ex_w = X1 ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_27,plain,
iext(uri_rdf_rest,esk2_0,uri_rdf_nil),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_28,plain,
iext(uri_owl_oneOf,esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_29,plain,
( X1 != X2
| iext(uri_owl_sameAs,X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_30,negated_conjecture,
~ iext(uri_owl_sameAs,uri_ex_w,uri_ex_u),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_25])]) ).
cnf(c_0_31,plain,
uri_ex_u = uri_ex_w,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_20]),c_0_27]),c_0_28])]) ).
cnf(c_0_32,plain,
iext(uri_owl_sameAs,X1,X1),
inference(er,[status(thm)],[c_0_29]) ).
cnf(c_0_33,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_31]),c_0_32])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWB023+1 : TPTP v9.3.1. Released v5.2.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.36 % Computer : n020.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:41:50 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.41 Running first-order theorem proving
% 0.10/0.41 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 0.25/0.48 % Version: 3.5.1
% 0.25/0.48 % Preprocessing class: FSLMSMSLSSSNFFN.
% 0.25/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/0.48 % Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 0.25/0.48 % Starting new_bool_3 with 600s (2) cores
% 0.25/0.48 % Starting new_bool_1 with 600s (2) cores
% 0.25/0.48 % Starting sh5l with 300s (1) cores
% 0.25/0.48 % new_bool_1 with pid 2401426 completed with status 0
% 0.25/0.48 % Result found by new_bool_1
% 0.25/0.48 % Preprocessing class: FSLMSMSLSSSNFFN.
% 0.25/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/0.48 % Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 0.25/0.48 % Starting new_bool_3 with 600s (2) cores
% 0.25/0.48 % Starting new_bool_1 with 600s (2) cores
% 0.25/0.48 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.25/0.48 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.25/0.48 % Search class: FGHSF-FFMM32-SFFFFFNN
% 0.25/0.48 % Scheduled 7 strats onto 2 cores with 600 seconds (600 total)
% 0.25/0.48 % Starting SubtermCWHack with 55s (1) cores
% 0.25/0.48 % Starting new_bool_1 with 61s (1) cores
% 0.25/0.48 % new_bool_1 with pid 2401432 completed with status 0
% 0.25/0.48 % Result found by new_bool_1
% 0.25/0.48 % Preprocessing class: FSLMSMSLSSSNFFN.
% 0.25/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/0.48 % Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 0.25/0.48 % Starting new_bool_3 with 600s (2) cores
% 0.25/0.48 % Starting new_bool_1 with 600s (2) cores
% 0.25/0.48 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.25/0.48 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.25/0.48 % Search class: FGHSF-FFMM32-SFFFFFNN
% 0.25/0.48 % Scheduled 7 strats onto 2 cores with 600 seconds (600 total)
% 0.25/0.48 % Starting SubtermCWHack with 55s (1) cores
% 0.25/0.48 % Starting new_bool_1 with 61s (1) cores
% 0.25/0.48 % Preprocessing time : 0.002 s
% 0.25/0.48 % Presaturation interreduction done
% 0.25/0.48
% 0.25/0.48 % Proof found!
% 0.25/0.48 % SZS status Theorem
% 0.25/0.48 % SZS output start CNFRefutation
% See solution above
% 0.25/0.48 % Parsed axioms : 560
% 0.25/0.48 % Removed by relevancy pruning/SinE : 503
% 0.25/0.48 % Initial clauses : 106
% 0.25/0.48 % Removed in clause preprocessing : 0
% 0.25/0.48 % Initial clauses in saturation : 106
% 0.25/0.48 % Processed clauses : 513
% 0.25/0.48 % ...of these trivial : 38
% 0.25/0.48 % ...subsumed : 105
% 0.25/0.48 % ...remaining for further processing : 370
% 0.25/0.48 % Other redundant clauses eliminated : 7
% 0.25/0.48 % Clauses deleted for lack of memory : 0
% 0.25/0.48 % Backward-subsumed : 13
% 0.25/0.48 % Backward-rewritten : 50
% 0.25/0.48 % Generated clauses : 708
% 0.25/0.48 % ...of the previous two non-redundant : 490
% 0.25/0.48 % ...aggressively subsumed : 0
% 0.25/0.48 % Contextual simplify-reflections : 2
% 0.25/0.48 % Paramodulations : 701
% 0.25/0.48 % Factorizations : 0
% 0.25/0.48 % NegExts : 0
% 0.25/0.48 % Equation resolutions : 7
% 0.25/0.48 % Disequality decompositions : 0
% 0.25/0.48 % Total rewrite steps : 509
% 0.25/0.48 % ...of those cached : 427
% 0.25/0.48 % Propositional unsat checks : 0
% 0.25/0.48 % Propositional check models : 0
% 0.25/0.48 % Propositional check unsatisfiable : 0
% 0.25/0.48 % Propositional clauses : 0
% 0.25/0.48 % Propositional clauses after purity: 0
% 0.25/0.48 % Propositional unsat core size : 0
% 0.25/0.48 % Propositional preprocessing time : 0.000
% 0.25/0.48 % Propositional encoding time : 0.000
% 0.25/0.48 % Propositional solver time : 0.000
% 0.25/0.48 % Success case prop preproc time : 0.000
% 0.25/0.48 % Success case prop encoding time : 0.000
% 0.25/0.48 % Success case prop solver time : 0.000
% 0.25/0.48 % Current number of processed clauses : 218
% 0.25/0.48 % Positive orientable unit clauses : 84
% 0.25/0.48 % Positive unorientable unit clauses: 0
% 0.25/0.48 % Negative unit clauses : 6
% 0.25/0.48 % Non-unit-clauses : 128
% 0.25/0.48 % Current number of unprocessed clauses: 164
% 0.25/0.48 % ...number of literals in the above : 1062
% 0.25/0.48 % Current number of archived formulas : 0
% 0.25/0.48 % Current number of archived clauses : 145
% 0.25/0.48 % Clause-clause subsumption calls (NU) : 14396
% 0.25/0.48 % Rec. Clause-clause subsumption calls : 2583
% 0.25/0.48 % Non-unit clause-clause subsumptions : 98
% 0.25/0.48 % Unit Clause-clause subsumption calls : 366
% 0.25/0.48 % Rewrite failures with RHS unbound : 0
% 0.25/0.48 % BW rewrite match attempts : 42
% 0.25/0.48 % BW rewrite match successes : 5
% 0.25/0.48 % Condensation attempts : 0
% 0.25/0.48 % Condensation successes : 0
% 0.25/0.48 % Termbank termtop insertions : 27387
% 0.25/0.48 % Search garbage collected termcells : 4112
% 0.25/0.48
% 0.25/0.48 % -------------------------------------------------
% 0.25/0.48 % User time : 0.039 s
% 0.25/0.48 % System time : 0.003 s
% 0.25/0.48 % Total time : 0.043 s
% 0.25/0.48 % Maximum resident set size: 4436 pages
% 0.25/0.48
% 0.25/0.48 % -------------------------------------------------
% 0.25/0.48 % User time : 0.080 s
% 0.25/0.48 % System time : 0.016 s
% 0.25/0.48 % Total time : 0.096 s
% 0.25/0.48 % Maximum resident set size: 5120 pages
% 0.25/0.48 % E exiting
%------------------------------------------------------------------------------