TSTP Solution File: SWB024+2 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SWB024+2 : TPTP v8.1.2. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n028.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:36:54 EDT 2023
% Result : Theorem 0.20s 0.49s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 6
% Syntax : Number of formulae : 34 ( 12 unt; 0 def)
% Number of atoms : 116 ( 0 equ)
% Maximal formula atoms : 15 ( 3 avg)
% Number of connectives : 127 ( 45 ~; 44 |; 31 &)
% ( 4 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 19 ( 19 usr; 13 con; 0-3 aty)
% Number of variables : 53 ( 0 sgn; 30 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(owl_rdfsext_subclassof,axiom,
! [X6,X7] :
( iext(uri_rdfs_subClassOf,X6,X7)
<=> ( ic(X6)
& ic(X7)
& ! [X1] :
( icext(X6,X1)
=> icext(X7,X1) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.gwa4LApx6r/E---3.1_16212.p',owl_rdfsext_subclassof) ).
fof(testcase_premise_fullish_024_Cardinality_Restrictions_on_Complex_Properties,axiom,
? [X9] :
( iext(uri_rdf_type,uri_ex_hasAncestor,uri_owl_TransitiveProperty)
& iext(uri_rdfs_subClassOf,uri_ex_Person,X9)
& iext(uri_rdf_type,X9,uri_owl_Restriction)
& iext(uri_owl_onProperty,X9,uri_ex_hasAncestor)
& iext(uri_owl_minCardinality,X9,literal_typed(dat_str_1,uri_xsd_nonNegativeInteger))
& iext(uri_rdf_type,uri_ex_alice,uri_ex_Person)
& iext(uri_rdf_type,uri_ex_bob,uri_ex_Person)
& iext(uri_ex_hasAncestor,uri_ex_alice,uri_ex_bob) ),
file('/export/starexec/sandbox2/tmp/tmp.gwa4LApx6r/E---3.1_16212.p',testcase_premise_fullish_024_Cardinality_Restrictions_on_Complex_Properties) ).
fof(rdfs_cext_def,axiom,
! [X1,X2] :
( iext(uri_rdf_type,X1,X2)
<=> icext(X2,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.gwa4LApx6r/E---3.1_16212.p',rdfs_cext_def) ).
fof(owl_restrict_mincard_001,axiom,
! [X3,X4] :
( ( iext(uri_owl_minCardinality,X3,literal_typed(dat_str_1,uri_xsd_nonNegativeInteger))
& iext(uri_owl_onProperty,X3,X4) )
=> ! [X1] :
( icext(X3,X1)
<=> ? [X5] : iext(X4,X1,X5) ) ),
file('/export/starexec/sandbox2/tmp/tmp.gwa4LApx6r/E---3.1_16212.p',owl_restrict_mincard_001) ).
fof(owl_char_transitive,axiom,
! [X4] :
( icext(uri_owl_TransitiveProperty,X4)
<=> ( ip(X4)
& ! [X1,X5,X3] :
( ( iext(X4,X1,X5)
& iext(X4,X5,X3) )
=> iext(X4,X1,X3) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.gwa4LApx6r/E---3.1_16212.p',owl_char_transitive) ).
fof(testcase_conclusion_fullish_024_Cardinality_Restrictions_on_Complex_Properties,conjecture,
? [X8] :
( iext(uri_ex_hasAncestor,uri_ex_bob,X8)
& iext(uri_ex_hasAncestor,uri_ex_alice,X8) ),
file('/export/starexec/sandbox2/tmp/tmp.gwa4LApx6r/E---3.1_16212.p',testcase_conclusion_fullish_024_Cardinality_Restrictions_on_Complex_Properties) ).
fof(c_0_6,plain,
! [X18,X19,X20,X21,X22] :
( ( ic(X18)
| ~ iext(uri_rdfs_subClassOf,X18,X19) )
& ( ic(X19)
| ~ iext(uri_rdfs_subClassOf,X18,X19) )
& ( ~ icext(X18,X20)
| icext(X19,X20)
| ~ iext(uri_rdfs_subClassOf,X18,X19) )
& ( icext(X21,esk2_2(X21,X22))
| ~ ic(X21)
| ~ ic(X22)
| iext(uri_rdfs_subClassOf,X21,X22) )
& ( ~ icext(X22,esk2_2(X21,X22))
| ~ ic(X21)
| ~ ic(X22)
| iext(uri_rdfs_subClassOf,X21,X22) ) ),
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_rdfsext_subclassof])])])])])]) ).
fof(c_0_7,plain,
( iext(uri_rdf_type,uri_ex_hasAncestor,uri_owl_TransitiveProperty)
& iext(uri_rdfs_subClassOf,uri_ex_Person,esk6_0)
& iext(uri_rdf_type,esk6_0,uri_owl_Restriction)
& iext(uri_owl_onProperty,esk6_0,uri_ex_hasAncestor)
& iext(uri_owl_minCardinality,esk6_0,literal_typed(dat_str_1,uri_xsd_nonNegativeInteger))
& iext(uri_rdf_type,uri_ex_alice,uri_ex_Person)
& iext(uri_rdf_type,uri_ex_bob,uri_ex_Person)
& iext(uri_ex_hasAncestor,uri_ex_alice,uri_ex_bob) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[testcase_premise_fullish_024_Cardinality_Restrictions_on_Complex_Properties])]) ).
fof(c_0_8,plain,
! [X10,X11] :
( ( ~ iext(uri_rdf_type,X10,X11)
| icext(X11,X10) )
& ( ~ icext(X11,X10)
| iext(uri_rdf_type,X10,X11) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[rdfs_cext_def])]) ).
fof(c_0_9,plain,
! [X12,X13,X14,X16,X17] :
( ( ~ icext(X12,X14)
| iext(X13,X14,esk1_3(X12,X13,X14))
| ~ iext(uri_owl_minCardinality,X12,literal_typed(dat_str_1,uri_xsd_nonNegativeInteger))
| ~ iext(uri_owl_onProperty,X12,X13) )
& ( ~ iext(X13,X16,X17)
| icext(X12,X16)
| ~ iext(uri_owl_minCardinality,X12,literal_typed(dat_str_1,uri_xsd_nonNegativeInteger))
| ~ iext(uri_owl_onProperty,X12,X13) ) ),
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_restrict_mincard_001])])])])])]) ).
cnf(c_0_10,plain,
( icext(X3,X2)
| ~ icext(X1,X2)
| ~ iext(uri_rdfs_subClassOf,X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,plain,
iext(uri_rdfs_subClassOf,uri_ex_Person,esk6_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
( icext(X2,X1)
| ~ iext(uri_rdf_type,X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
iext(uri_rdf_type,uri_ex_bob,uri_ex_Person),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_14,plain,
! [X24,X25,X26,X27,X28] :
( ( ip(X24)
| ~ icext(uri_owl_TransitiveProperty,X24) )
& ( ~ iext(X24,X25,X26)
| ~ iext(X24,X26,X27)
| iext(X24,X25,X27)
| ~ icext(uri_owl_TransitiveProperty,X24) )
& ( iext(X28,esk3_1(X28),esk4_1(X28))
| ~ ip(X28)
| icext(uri_owl_TransitiveProperty,X28) )
& ( iext(X28,esk4_1(X28),esk5_1(X28))
| ~ ip(X28)
| icext(uri_owl_TransitiveProperty,X28) )
& ( ~ iext(X28,esk3_1(X28),esk5_1(X28))
| ~ ip(X28)
| icext(uri_owl_TransitiveProperty,X28) ) ),
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_transitive])])])])])]) ).
cnf(c_0_15,plain,
iext(uri_rdf_type,uri_ex_hasAncestor,uri_owl_TransitiveProperty),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_16,plain,
( iext(X3,X2,esk1_3(X1,X3,X2))
| ~ icext(X1,X2)
| ~ iext(uri_owl_minCardinality,X1,literal_typed(dat_str_1,uri_xsd_nonNegativeInteger))
| ~ iext(uri_owl_onProperty,X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_17,plain,
iext(uri_owl_onProperty,esk6_0,uri_ex_hasAncestor),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_18,plain,
iext(uri_owl_minCardinality,esk6_0,literal_typed(dat_str_1,uri_xsd_nonNegativeInteger)),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_19,plain,
( icext(esk6_0,X1)
| ~ icext(uri_ex_Person,X1) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_20,plain,
icext(uri_ex_Person,uri_ex_bob),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
fof(c_0_21,negated_conjecture,
~ ? [X8] :
( iext(uri_ex_hasAncestor,uri_ex_bob,X8)
& iext(uri_ex_hasAncestor,uri_ex_alice,X8) ),
inference(assume_negation,[status(cth)],[testcase_conclusion_fullish_024_Cardinality_Restrictions_on_Complex_Properties]) ).
cnf(c_0_22,plain,
( iext(X1,X2,X4)
| ~ iext(X1,X2,X3)
| ~ iext(X1,X3,X4)
| ~ icext(uri_owl_TransitiveProperty,X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_23,plain,
icext(uri_owl_TransitiveProperty,uri_ex_hasAncestor),
inference(spm,[status(thm)],[c_0_12,c_0_15]) ).
cnf(c_0_24,plain,
( iext(uri_ex_hasAncestor,X1,esk1_3(esk6_0,uri_ex_hasAncestor,X1))
| ~ icext(esk6_0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18])]) ).
cnf(c_0_25,plain,
icext(esk6_0,uri_ex_bob),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
fof(c_0_26,negated_conjecture,
! [X32] :
( ~ iext(uri_ex_hasAncestor,uri_ex_bob,X32)
| ~ iext(uri_ex_hasAncestor,uri_ex_alice,X32) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_21])]) ).
cnf(c_0_27,plain,
( iext(uri_ex_hasAncestor,X1,X2)
| ~ iext(uri_ex_hasAncestor,X3,X2)
| ~ iext(uri_ex_hasAncestor,X1,X3) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_28,plain,
iext(uri_ex_hasAncestor,uri_ex_bob,esk1_3(esk6_0,uri_ex_hasAncestor,uri_ex_bob)),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_29,negated_conjecture,
( ~ iext(uri_ex_hasAncestor,uri_ex_bob,X1)
| ~ iext(uri_ex_hasAncestor,uri_ex_alice,X1) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_30,plain,
( iext(uri_ex_hasAncestor,X1,esk1_3(esk6_0,uri_ex_hasAncestor,uri_ex_bob))
| ~ iext(uri_ex_hasAncestor,X1,uri_ex_bob) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_31,plain,
iext(uri_ex_hasAncestor,uri_ex_alice,uri_ex_bob),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_32,negated_conjecture,
~ iext(uri_ex_hasAncestor,uri_ex_alice,esk1_3(esk6_0,uri_ex_hasAncestor,uri_ex_bob)),
inference(spm,[status(thm)],[c_0_29,c_0_28]) ).
cnf(c_0_33,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWB024+2 : TPTP v8.1.2. Released v5.2.0.
% 0.03/0.13 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n028.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 2400
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Mon Oct 2 20:36:07 EDT 2023
% 0.14/0.34 % CPUTime :
% 0.20/0.47 Running first-order theorem proving
% 0.20/0.47 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/tmp/tmp.gwa4LApx6r/E---3.1_16212.p
% 0.20/0.49 # Version: 3.1pre001
% 0.20/0.49 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.20/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.49 # Starting sh5l with 300s (1) cores
% 0.20/0.49 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 16291 completed with status 0
% 0.20/0.49 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.20/0.49 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.20/0.49 # No SInE strategy applied
% 0.20/0.49 # Search class: FGHNF-FFSM31-SFFFFFNN
% 0.20/0.49 # partial match(1): FGHNF-FFSM21-SFFFFFNN
% 0.20/0.49 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.49 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.20/0.49 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.20/0.49 # Starting new_bool_3 with 136s (1) cores
% 0.20/0.49 # Starting new_bool_1 with 136s (1) cores
% 0.20/0.49 # Starting sh5l with 136s (1) cores
% 0.20/0.49 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 16301 completed with status 0
% 0.20/0.49 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.20/0.49 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.20/0.49 # No SInE strategy applied
% 0.20/0.49 # Search class: FGHNF-FFSM31-SFFFFFNN
% 0.20/0.49 # partial match(1): FGHNF-FFSM21-SFFFFFNN
% 0.20/0.49 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.49 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.20/0.49 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.20/0.49 # Preprocessing time : 0.001 s
% 0.20/0.49 # Presaturation interreduction done
% 0.20/0.49
% 0.20/0.49 # Proof found!
% 0.20/0.49 # SZS status Theorem
% 0.20/0.49 # SZS output start CNFRefutation
% See solution above
% 0.20/0.49 # Parsed axioms : 6
% 0.20/0.49 # Removed by relevancy pruning/SinE : 0
% 0.20/0.49 # Initial clauses : 23
% 0.20/0.49 # Removed in clause preprocessing : 0
% 0.20/0.49 # Initial clauses in saturation : 23
% 0.20/0.49 # Processed clauses : 71
% 0.20/0.49 # ...of these trivial : 0
% 0.20/0.49 # ...subsumed : 0
% 0.20/0.49 # ...remaining for further processing : 71
% 0.20/0.49 # Other redundant clauses eliminated : 0
% 0.20/0.49 # Clauses deleted for lack of memory : 0
% 0.20/0.49 # Backward-subsumed : 0
% 0.20/0.49 # Backward-rewritten : 0
% 0.20/0.49 # Generated clauses : 45
% 0.20/0.49 # ...of the previous two non-redundant : 31
% 0.20/0.49 # ...aggressively subsumed : 0
% 0.20/0.49 # Contextual simplify-reflections : 0
% 0.20/0.49 # Paramodulations : 45
% 0.20/0.49 # Factorizations : 0
% 0.20/0.49 # NegExts : 0
% 0.20/0.49 # Equation resolutions : 0
% 0.20/0.49 # Total rewrite steps : 15
% 0.20/0.49 # Propositional unsat checks : 0
% 0.20/0.49 # Propositional check models : 0
% 0.20/0.49 # Propositional check unsatisfiable : 0
% 0.20/0.49 # Propositional clauses : 0
% 0.20/0.49 # Propositional clauses after purity: 0
% 0.20/0.49 # Propositional unsat core size : 0
% 0.20/0.49 # Propositional preprocessing time : 0.000
% 0.20/0.49 # Propositional encoding time : 0.000
% 0.20/0.49 # Propositional solver time : 0.000
% 0.20/0.49 # Success case prop preproc time : 0.000
% 0.20/0.49 # Success case prop encoding time : 0.000
% 0.20/0.49 # Success case prop solver time : 0.000
% 0.20/0.49 # Current number of processed clauses : 48
% 0.20/0.49 # Positive orientable unit clauses : 21
% 0.20/0.49 # Positive unorientable unit clauses: 0
% 0.20/0.49 # Negative unit clauses : 1
% 0.20/0.49 # Non-unit-clauses : 26
% 0.20/0.49 # Current number of unprocessed clauses: 6
% 0.20/0.49 # ...number of literals in the above : 12
% 0.20/0.49 # Current number of archived formulas : 0
% 0.20/0.49 # Current number of archived clauses : 23
% 0.20/0.49 # Clause-clause subsumption calls (NU) : 229
% 0.20/0.49 # Rec. Clause-clause subsumption calls : 186
% 0.20/0.49 # Non-unit clause-clause subsumptions : 0
% 0.20/0.49 # Unit Clause-clause subsumption calls : 4
% 0.20/0.49 # Rewrite failures with RHS unbound : 0
% 0.20/0.49 # BW rewrite match attempts : 5
% 0.20/0.49 # BW rewrite match successes : 0
% 0.20/0.49 # Condensation attempts : 0
% 0.20/0.49 # Condensation successes : 0
% 0.20/0.49 # Termbank termtop insertions : 2059
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.006 s
% 0.20/0.49 # System time : 0.004 s
% 0.20/0.49 # Total time : 0.010 s
% 0.20/0.49 # Maximum resident set size: 1796 pages
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.023 s
% 0.20/0.49 # System time : 0.008 s
% 0.20/0.49 # Total time : 0.031 s
% 0.20/0.49 # Maximum resident set size: 1684 pages
% 0.20/0.49 % E---3.1 exiting
% 0.20/0.49 % E---3.1 exiting
%------------------------------------------------------------------------------