TSTP Solution File: SWB023+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SWB023+1 : TPTP v8.1.2. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n016.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 19:38:13 EDT 2023
% Result : Theorem 0.39s 0.59s
% Output : CNFRefutation 0.39s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 6
% Syntax : Number of formulae : 36 ( 13 unt; 0 def)
% Number of atoms : 126 ( 21 equ)
% Maximal formula atoms : 26 ( 3 avg)
% Number of connectives : 145 ( 55 ~; 55 |; 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 : 51 ( 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/tmp/tmp.MRvOTTk453/E---3.1_12862.p',rdfs_cext_def) ).
fof(testcase_premise_fullish_023_Unique_List_Components,axiom,
? [X42,X43] :
( iext(uri_rdf_type,uri_rdf_first,uri_owl_FunctionalProperty)
& iext(uri_rdf_type,uri_ex_w,X42)
& iext(uri_rdf_type,X42,uri_owl_Class)
& iext(uri_owl_oneOf,X42,X43)
& iext(uri_rdf_first,X43,uri_ex_u)
& iext(uri_rdf_first,X43,uri_ex_v)
& iext(uri_rdf_rest,X43,uri_rdf_nil) ),
file('/export/starexec/sandbox/tmp/tmp.MRvOTTk453/E---3.1_12862.p',testcase_premise_fullish_023_Unique_List_Components) ).
fof(owl_char_functional,axiom,
! [X2] :
( icext(uri_owl_FunctionalProperty,X2)
<=> ( ip(X2)
& ! [X4,X27,X28] :
( ( iext(X2,X4,X27)
& iext(X2,X4,X28) )
=> X27 = X28 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.MRvOTTk453/E---3.1_12862.p',owl_char_functional) ).
fof(owl_enum_class_001,axiom,
! [X11,X12,X21] :
( ( iext(uri_rdf_first,X12,X21)
& iext(uri_rdf_rest,X12,uri_rdf_nil) )
=> ( iext(uri_owl_oneOf,X11,X12)
<=> ( ic(X11)
& ! [X4] :
( icext(X11,X4)
<=> X4 = X21 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.MRvOTTk453/E---3.1_12862.p',owl_enum_class_001) ).
fof(testcase_conclusion_fullish_023_Unique_List_Components,conjecture,
( iext(uri_owl_sameAs,uri_ex_w,uri_ex_u)
& iext(uri_owl_sameAs,uri_ex_w,uri_ex_v) ),
file('/export/starexec/sandbox/tmp/tmp.MRvOTTk453/E---3.1_12862.p',testcase_conclusion_fullish_023_Unique_List_Components) ).
fof(owl_eqdis_sameas,axiom,
! [X4,X7] :
( iext(uri_owl_sameAs,X4,X7)
<=> X4 = X7 ),
file('/export/starexec/sandbox/tmp/tmp.MRvOTTk453/E---3.1_12862.p',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(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[rdfs_cext_def])]) ).
fof(c_0_7,plain,
( iext(uri_rdf_type,uri_rdf_first,uri_owl_FunctionalProperty)
& iext(uri_rdf_type,uri_ex_w,esk1_0)
& iext(uri_rdf_type,esk1_0,uri_owl_Class)
& iext(uri_owl_oneOf,esk1_0,esk2_0)
& iext(uri_rdf_first,esk2_0,uri_ex_u)
& iext(uri_rdf_first,esk2_0,uri_ex_v)
& iext(uri_rdf_rest,esk2_0,uri_rdf_nil) ),
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] :
( ( ip(X102)
| ~ icext(uri_owl_FunctionalProperty,X102) )
& ( ~ iext(X102,X103,X104)
| ~ iext(X102,X103,X105)
| X104 = X105
| ~ icext(uri_owl_FunctionalProperty,X102) )
& ( iext(X106,esk7_1(X106),esk8_1(X106))
| ~ ip(X106)
| icext(uri_owl_FunctionalProperty,X106) )
& ( iext(X106,esk7_1(X106),esk9_1(X106))
| ~ ip(X106)
| icext(uri_owl_FunctionalProperty,X106) )
& ( esk8_1(X106) != esk9_1(X106)
| ~ ip(X106)
| icext(uri_owl_FunctionalProperty,X106) ) ),
inference(distribute,[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,
( icext(X2,X1)
| ~ iext(uri_rdf_type,X1,X2) ),
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]) ).
fof(c_0_11,plain,
! [X56,X57,X58,X59,X60] :
( ( ic(X56)
| ~ iext(uri_owl_oneOf,X56,X57)
| ~ iext(uri_rdf_first,X57,X58)
| ~ iext(uri_rdf_rest,X57,uri_rdf_nil) )
& ( ~ icext(X56,X59)
| X59 = X58
| ~ iext(uri_owl_oneOf,X56,X57)
| ~ iext(uri_rdf_first,X57,X58)
| ~ iext(uri_rdf_rest,X57,uri_rdf_nil) )
& ( X60 != X58
| icext(X56,X60)
| ~ iext(uri_owl_oneOf,X56,X57)
| ~ iext(uri_rdf_first,X57,X58)
| ~ iext(uri_rdf_rest,X57,uri_rdf_nil) )
& ( ~ icext(X56,esk4_3(X56,X57,X58))
| esk4_3(X56,X57,X58) != X58
| ~ ic(X56)
| iext(uri_owl_oneOf,X56,X57)
| ~ iext(uri_rdf_first,X57,X58)
| ~ iext(uri_rdf_rest,X57,uri_rdf_nil) )
& ( icext(X56,esk4_3(X56,X57,X58))
| esk4_3(X56,X57,X58) = X58
| ~ ic(X56)
| iext(uri_owl_oneOf,X56,X57)
| ~ iext(uri_rdf_first,X57,X58)
| ~ iext(uri_rdf_rest,X57,uri_rdf_nil) ) ),
inference(distribute,[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_12,plain,
( X3 = X4
| ~ iext(X1,X2,X3)
| ~ iext(X1,X2,X4)
| ~ icext(uri_owl_FunctionalProperty,X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
icext(uri_owl_FunctionalProperty,uri_rdf_first),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,plain,
( X2 = X3
| ~ icext(X1,X2)
| ~ iext(uri_owl_oneOf,X1,X4)
| ~ iext(uri_rdf_first,X4,X3)
| ~ iext(uri_rdf_rest,X4,uri_rdf_nil) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_15,plain,
iext(uri_rdf_rest,esk2_0,uri_rdf_nil),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_16,negated_conjecture,
~ ( iext(uri_owl_sameAs,uri_ex_w,uri_ex_u)
& iext(uri_owl_sameAs,uri_ex_w,uri_ex_v) ),
inference(assume_negation,[status(cth)],[testcase_conclusion_fullish_023_Unique_List_Components]) ).
cnf(c_0_17,plain,
( X1 = X2
| ~ iext(uri_rdf_first,X3,X2)
| ~ iext(uri_rdf_first,X3,X1) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_18,plain,
iext(uri_rdf_first,esk2_0,uri_ex_v),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_19,plain,
( X1 = X2
| ~ icext(X3,X1)
| ~ iext(uri_rdf_first,esk2_0,X2)
| ~ iext(uri_owl_oneOf,X3,esk2_0) ),
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]) ).
fof(c_0_21,negated_conjecture,
( ~ iext(uri_owl_sameAs,uri_ex_w,uri_ex_u)
| ~ iext(uri_owl_sameAs,uri_ex_w,uri_ex_v) ),
inference(fof_nnf,[status(thm)],[c_0_16]) ).
cnf(c_0_22,plain,
( X1 = uri_ex_v
| ~ iext(uri_rdf_first,esk2_0,X1) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_23,plain,
( X1 = uri_ex_u
| ~ icext(X2,X1)
| ~ iext(uri_owl_oneOf,X2,esk2_0) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_24,plain,
iext(uri_owl_oneOf,esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_25,plain,
iext(uri_rdf_type,uri_ex_w,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_26,plain,
! [X48,X49] :
( ( ~ iext(uri_owl_sameAs,X48,X49)
| X48 = X49 )
& ( X48 != X49
| iext(uri_owl_sameAs,X48,X49) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[owl_eqdis_sameas])]) ).
cnf(c_0_27,negated_conjecture,
( ~ iext(uri_owl_sameAs,uri_ex_w,uri_ex_u)
| ~ iext(uri_owl_sameAs,uri_ex_w,uri_ex_v) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_28,plain,
uri_ex_v = uri_ex_u,
inference(spm,[status(thm)],[c_0_22,c_0_20]) ).
cnf(c_0_29,plain,
( X1 = uri_ex_u
| ~ icext(esk1_0,X1) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_30,plain,
icext(esk1_0,uri_ex_w),
inference(spm,[status(thm)],[c_0_9,c_0_25]) ).
cnf(c_0_31,plain,
( iext(uri_owl_sameAs,X1,X2)
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_32,negated_conjecture,
~ iext(uri_owl_sameAs,uri_ex_w,uri_ex_u),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_28])]) ).
cnf(c_0_33,plain,
uri_ex_u = uri_ex_w,
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_34,plain,
iext(uri_owl_sameAs,X1,X1),
inference(er,[status(thm)],[c_0_31]) ).
cnf(c_0_35,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_32,c_0_33]),c_0_34])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SWB023+1 : TPTP v8.1.2. Released v5.2.0.
% 0.08/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n016.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 2400
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Mon Oct 2 20:59:52 EDT 2023
% 0.14/0.36 % CPUTime :
% 0.36/0.54 Running first-order model finding
% 0.36/0.54 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.MRvOTTk453/E---3.1_12862.p
% 0.39/0.59 # Version: 3.1pre001
% 0.39/0.59 # Preprocessing class: FSLMSMSLSSSNFFN.
% 0.39/0.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.39/0.59 # Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 0.39/0.59 # Starting new_bool_3 with 600s (2) cores
% 0.39/0.59 # Starting new_bool_1 with 600s (2) cores
% 0.39/0.59 # Starting sh5l with 300s (1) cores
% 0.39/0.59 # new_bool_3 with pid 12942 completed with status 0
% 0.39/0.59 # Result found by new_bool_3
% 0.39/0.59 # Preprocessing class: FSLMSMSLSSSNFFN.
% 0.39/0.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.39/0.59 # Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 0.39/0.59 # Starting new_bool_3 with 600s (2) cores
% 0.39/0.59 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.39/0.59 # Search class: FGHSF-FFMM32-SFFFFFNN
% 0.39/0.59 # Scheduled 6 strats onto 2 cores with 600 seconds (600 total)
% 0.39/0.59 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SA with 325s (1) cores
% 0.39/0.59 # Starting new_bool_3 with 61s (1) cores
% 0.39/0.59 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SA with pid 12946 completed with status 0
% 0.39/0.59 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SA
% 0.39/0.59 # Preprocessing class: FSLMSMSLSSSNFFN.
% 0.39/0.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.39/0.59 # Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 0.39/0.59 # Starting new_bool_3 with 600s (2) cores
% 0.39/0.59 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.39/0.59 # Search class: FGHSF-FFMM32-SFFFFFNN
% 0.39/0.59 # Scheduled 6 strats onto 2 cores with 600 seconds (600 total)
% 0.39/0.59 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SA with 325s (1) cores
% 0.39/0.59 # Preprocessing time : 0.004 s
% 0.39/0.59 # Presaturation interreduction done
% 0.39/0.59
% 0.39/0.59 # Proof found!
% 0.39/0.59 # SZS status Theorem
% 0.39/0.59 # SZS output start CNFRefutation
% See solution above
% 0.39/0.59 # Parsed axioms : 560
% 0.39/0.59 # Removed by relevancy pruning/SinE : 503
% 0.39/0.59 # Initial clauses : 106
% 0.39/0.59 # Removed in clause preprocessing : 0
% 0.39/0.59 # Initial clauses in saturation : 106
% 0.39/0.59 # Processed clauses : 334
% 0.39/0.59 # ...of these trivial : 45
% 0.39/0.59 # ...subsumed : 9
% 0.39/0.59 # ...remaining for further processing : 280
% 0.39/0.59 # Other redundant clauses eliminated : 7
% 0.39/0.59 # Clauses deleted for lack of memory : 0
% 0.39/0.59 # Backward-subsumed : 5
% 0.39/0.59 # Backward-rewritten : 19
% 0.39/0.59 # Generated clauses : 322
% 0.39/0.59 # ...of the previous two non-redundant : 215
% 0.39/0.59 # ...aggressively subsumed : 0
% 0.39/0.59 # Contextual simplify-reflections : 2
% 0.39/0.59 # Paramodulations : 315
% 0.39/0.59 # Factorizations : 0
% 0.39/0.59 # NegExts : 0
% 0.39/0.59 # Equation resolutions : 7
% 0.39/0.59 # Total rewrite steps : 187
% 0.39/0.59 # Propositional unsat checks : 0
% 0.39/0.59 # Propositional check models : 0
% 0.39/0.59 # Propositional check unsatisfiable : 0
% 0.39/0.59 # Propositional clauses : 0
% 0.39/0.59 # Propositional clauses after purity: 0
% 0.39/0.59 # Propositional unsat core size : 0
% 0.39/0.59 # Propositional preprocessing time : 0.000
% 0.39/0.59 # Propositional encoding time : 0.000
% 0.39/0.59 # Propositional solver time : 0.000
% 0.39/0.59 # Success case prop preproc time : 0.000
% 0.39/0.59 # Success case prop encoding time : 0.000
% 0.39/0.59 # Success case prop solver time : 0.000
% 0.39/0.59 # Current number of processed clauses : 167
% 0.39/0.59 # Positive orientable unit clauses : 73
% 0.39/0.59 # Positive unorientable unit clauses: 0
% 0.39/0.59 # Negative unit clauses : 0
% 0.39/0.59 # Non-unit-clauses : 94
% 0.39/0.59 # Current number of unprocessed clauses: 64
% 0.39/0.59 # ...number of literals in the above : 252
% 0.39/0.59 # Current number of archived formulas : 0
% 0.39/0.59 # Current number of archived clauses : 106
% 0.39/0.59 # Clause-clause subsumption calls (NU) : 6703
% 0.39/0.59 # Rec. Clause-clause subsumption calls : 1514
% 0.39/0.59 # Non-unit clause-clause subsumptions : 14
% 0.39/0.59 # Unit Clause-clause subsumption calls : 458
% 0.39/0.59 # Rewrite failures with RHS unbound : 0
% 0.39/0.59 # BW rewrite match attempts : 35
% 0.39/0.59 # BW rewrite match successes : 5
% 0.39/0.59 # Condensation attempts : 0
% 0.39/0.59 # Condensation successes : 0
% 0.39/0.59 # Termbank termtop insertions : 16826
% 0.39/0.59
% 0.39/0.59 # -------------------------------------------------
% 0.39/0.59 # User time : 0.025 s
% 0.39/0.59 # System time : 0.006 s
% 0.39/0.59 # Total time : 0.031 s
% 0.39/0.59 # Maximum resident set size: 2668 pages
% 0.39/0.59
% 0.39/0.59 # -------------------------------------------------
% 0.39/0.59 # User time : 0.060 s
% 0.39/0.59 # System time : 0.011 s
% 0.39/0.59 # Total time : 0.071 s
% 0.39/0.59 # Maximum resident set size: 2272 pages
% 0.39/0.59 % E---3.1 exiting
%------------------------------------------------------------------------------