TSTP Solution File: SWB009+2 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SWB009+2 : TPTP v8.1.0. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n022.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 : 300s
% WCLimit : 600s
% DateTime : Tue Jul 19 19:01:57 EDT 2022
% Result : Theorem 0.25s 1.42s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 22 ( 4 unt; 0 def)
% Number of atoms : 74 ( 0 equ)
% Maximal formula atoms : 13 ( 3 avg)
% Number of connectives : 90 ( 38 ~; 32 |; 17 &)
% ( 2 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 11 ( 11 usr; 10 con; 0-4 aty)
% Number of variables : 42 ( 3 sgn 17 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(testcase_conclusion_fullish_009_Existential_Restriction_Entailments,conjecture,
? [X6] :
( iext(uri_ex_p,uri_ex_s,X6)
& iext(uri_rdf_type,X6,uri_ex_c) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',testcase_conclusion_fullish_009_Existential_Restriction_Entailments) ).
fof(owl_restrict_somevaluesfrom,axiom,
! [X3,X4,X2] :
( ( iext(uri_owl_someValuesFrom,X3,X2)
& iext(uri_owl_onProperty,X3,X4) )
=> ! [X1] :
( icext(X3,X1)
<=> ? [X5] :
( iext(X4,X1,X5)
& icext(X2,X5) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',owl_restrict_somevaluesfrom) ).
fof(rdfs_cext_def,axiom,
! [X1,X2] :
( iext(uri_rdf_type,X1,X2)
<=> icext(X2,X1) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',rdfs_cext_def) ).
fof(testcase_premise_fullish_009_Existential_Restriction_Entailments,axiom,
? [X7] :
( iext(uri_rdf_type,uri_ex_p,uri_owl_ObjectProperty)
& iext(uri_rdf_type,uri_ex_c,uri_owl_Class)
& iext(uri_rdf_type,uri_ex_s,X7)
& iext(uri_rdf_type,X7,uri_owl_Restriction)
& iext(uri_owl_onProperty,X7,uri_ex_p)
& iext(uri_owl_someValuesFrom,X7,uri_ex_c) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',testcase_premise_fullish_009_Existential_Restriction_Entailments) ).
fof(c_0_4,negated_conjecture,
~ ? [X6] :
( iext(uri_ex_p,uri_ex_s,X6)
& iext(uri_rdf_type,X6,uri_ex_c) ),
inference(assume_negation,[status(cth)],[testcase_conclusion_fullish_009_Existential_Restriction_Entailments]) ).
fof(c_0_5,negated_conjecture,
! [X7] :
( ~ iext(uri_ex_p,uri_ex_s,X7)
| ~ iext(uri_rdf_type,X7,uri_ex_c) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])]) ).
fof(c_0_6,plain,
! [X6,X7,X8,X9,X9,X11] :
( ( iext(X7,X9,esk1_4(X6,X7,X8,X9))
| ~ icext(X6,X9)
| ~ iext(uri_owl_someValuesFrom,X6,X8)
| ~ iext(uri_owl_onProperty,X6,X7) )
& ( icext(X8,esk1_4(X6,X7,X8,X9))
| ~ icext(X6,X9)
| ~ iext(uri_owl_someValuesFrom,X6,X8)
| ~ iext(uri_owl_onProperty,X6,X7) )
& ( ~ iext(X7,X9,X11)
| ~ icext(X8,X11)
| icext(X6,X9)
| ~ iext(uri_owl_someValuesFrom,X6,X8)
| ~ iext(uri_owl_onProperty,X6,X7) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[owl_restrict_somevaluesfrom])])])])])])]) ).
fof(c_0_7,plain,
! [X3,X4,X3,X4] :
( ( ~ iext(uri_rdf_type,X3,X4)
| icext(X4,X3) )
& ( ~ icext(X4,X3)
| iext(uri_rdf_type,X3,X4) ) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[rdfs_cext_def])])])]) ).
cnf(c_0_8,negated_conjecture,
( ~ iext(uri_rdf_type,X1,uri_ex_c)
| ~ iext(uri_ex_p,uri_ex_s,X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
( iext(X2,X4,esk1_4(X1,X2,X3,X4))
| ~ iext(uri_owl_onProperty,X1,X2)
| ~ iext(uri_owl_someValuesFrom,X1,X3)
| ~ icext(X1,X4) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
( iext(uri_rdf_type,X1,X2)
| ~ icext(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
( icext(X3,esk1_4(X1,X2,X3,X4))
| ~ iext(uri_owl_onProperty,X1,X2)
| ~ iext(uri_owl_someValuesFrom,X1,X3)
| ~ icext(X1,X4) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_12,negated_conjecture,
( ~ icext(X1,uri_ex_s)
| ~ iext(uri_rdf_type,esk1_4(X1,uri_ex_p,X2,uri_ex_s),uri_ex_c)
| ~ iext(uri_owl_onProperty,X1,uri_ex_p)
| ~ iext(uri_owl_someValuesFrom,X1,X2) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_13,plain,
( iext(uri_rdf_type,esk1_4(X1,X2,X3,X4),X3)
| ~ icext(X1,X4)
| ~ iext(uri_owl_someValuesFrom,X1,X3)
| ~ iext(uri_owl_onProperty,X1,X2) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_14,negated_conjecture,
( ~ icext(X1,uri_ex_s)
| ~ iext(uri_owl_onProperty,X1,uri_ex_p)
| ~ iext(uri_owl_someValuesFrom,X1,uri_ex_c) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_15,plain,
( icext(X1,X2)
| ~ iext(uri_rdf_type,X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_16,plain,
( iext(uri_rdf_type,uri_ex_p,uri_owl_ObjectProperty)
& iext(uri_rdf_type,uri_ex_c,uri_owl_Class)
& iext(uri_rdf_type,uri_ex_s,esk2_0)
& iext(uri_rdf_type,esk2_0,uri_owl_Restriction)
& iext(uri_owl_onProperty,esk2_0,uri_ex_p)
& iext(uri_owl_someValuesFrom,esk2_0,uri_ex_c) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[testcase_premise_fullish_009_Existential_Restriction_Entailments])]) ).
cnf(c_0_17,negated_conjecture,
( ~ iext(uri_owl_onProperty,X1,uri_ex_p)
| ~ iext(uri_owl_someValuesFrom,X1,uri_ex_c)
| ~ iext(uri_rdf_type,uri_ex_s,X1) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,plain,
iext(uri_owl_onProperty,esk2_0,uri_ex_p),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_19,plain,
iext(uri_owl_someValuesFrom,esk2_0,uri_ex_c),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_20,plain,
iext(uri_rdf_type,uri_ex_s,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_21,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]),c_0_20])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SWB009+2 : TPTP v8.1.0. Released v5.2.0.
% 0.07/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n022.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Wed Jun 1 08:45:52 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.25/1.42 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.25/1.42 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.25/1.42 # Preprocessing time : 0.013 s
% 0.25/1.42
% 0.25/1.42 # Failure: Out of unprocessed clauses!
% 0.25/1.42 # OLD status GaveUp
% 0.25/1.42 # Parsed axioms : 4
% 0.25/1.42 # Removed by relevancy pruning/SinE : 3
% 0.25/1.42 # Initial clauses : 1
% 0.25/1.42 # Removed in clause preprocessing : 0
% 0.25/1.42 # Initial clauses in saturation : 1
% 0.25/1.42 # Processed clauses : 1
% 0.25/1.42 # ...of these trivial : 0
% 0.25/1.42 # ...subsumed : 0
% 0.25/1.42 # ...remaining for further processing : 1
% 0.25/1.42 # Other redundant clauses eliminated : 0
% 0.25/1.42 # Clauses deleted for lack of memory : 0
% 0.25/1.42 # Backward-subsumed : 0
% 0.25/1.42 # Backward-rewritten : 0
% 0.25/1.42 # Generated clauses : 0
% 0.25/1.42 # ...of the previous two non-trivial : 0
% 0.25/1.42 # Contextual simplify-reflections : 0
% 0.25/1.42 # Paramodulations : 0
% 0.25/1.42 # Factorizations : 0
% 0.25/1.42 # Equation resolutions : 0
% 0.25/1.42 # Current number of processed clauses : 1
% 0.25/1.42 # Positive orientable unit clauses : 0
% 0.25/1.42 # Positive unorientable unit clauses: 0
% 0.25/1.42 # Negative unit clauses : 0
% 0.25/1.42 # Non-unit-clauses : 1
% 0.25/1.42 # Current number of unprocessed clauses: 0
% 0.25/1.42 # ...number of literals in the above : 0
% 0.25/1.42 # Current number of archived formulas : 0
% 0.25/1.42 # Current number of archived clauses : 0
% 0.25/1.42 # Clause-clause subsumption calls (NU) : 0
% 0.25/1.42 # Rec. Clause-clause subsumption calls : 0
% 0.25/1.42 # Non-unit clause-clause subsumptions : 0
% 0.25/1.42 # Unit Clause-clause subsumption calls : 0
% 0.25/1.42 # Rewrite failures with RHS unbound : 0
% 0.25/1.42 # BW rewrite match attempts : 0
% 0.25/1.42 # BW rewrite match successes : 0
% 0.25/1.42 # Condensation attempts : 0
% 0.25/1.42 # Condensation successes : 0
% 0.25/1.42 # Termbank termtop insertions : 138
% 0.25/1.42
% 0.25/1.42 # -------------------------------------------------
% 0.25/1.42 # User time : 0.010 s
% 0.25/1.42 # System time : 0.003 s
% 0.25/1.42 # Total time : 0.013 s
% 0.25/1.42 # Maximum resident set size: 2772 pages
% 0.25/1.42 # Running protocol protocol_eprover_f171197f65f27d1ba69648a20c844832c84a5dd7 for 23 seconds:
% 0.25/1.42 # Preprocessing time : 0.014 s
% 0.25/1.42
% 0.25/1.42 # Proof found!
% 0.25/1.42 # SZS status Theorem
% 0.25/1.42 # SZS output start CNFRefutation
% See solution above
% 0.25/1.43 # Proof object total steps : 22
% 0.25/1.43 # Proof object clause steps : 13
% 0.25/1.43 # Proof object formula steps : 9
% 0.25/1.43 # Proof object conjectures : 8
% 0.25/1.43 # Proof object clause conjectures : 5
% 0.25/1.43 # Proof object formula conjectures : 3
% 0.25/1.43 # Proof object initial clauses used : 8
% 0.25/1.43 # Proof object initial formulas used : 4
% 0.25/1.43 # Proof object generating inferences : 5
% 0.25/1.43 # Proof object simplifying inferences : 3
% 0.25/1.43 # Training examples: 0 positive, 0 negative
% 0.25/1.43 # Parsed axioms : 4
% 0.25/1.43 # Removed by relevancy pruning/SinE : 0
% 0.25/1.43 # Initial clauses : 12
% 0.25/1.43 # Removed in clause preprocessing : 0
% 0.25/1.43 # Initial clauses in saturation : 12
% 0.25/1.43 # Processed clauses : 18
% 0.25/1.43 # ...of these trivial : 0
% 0.25/1.43 # ...subsumed : 0
% 0.25/1.43 # ...remaining for further processing : 18
% 0.25/1.43 # Other redundant clauses eliminated : 0
% 0.25/1.43 # Clauses deleted for lack of memory : 0
% 0.25/1.43 # Backward-subsumed : 0
% 0.25/1.43 # Backward-rewritten : 0
% 0.25/1.43 # Generated clauses : 11
% 0.25/1.43 # ...of the previous two non-trivial : 9
% 0.25/1.43 # Contextual simplify-reflections : 0
% 0.25/1.43 # Paramodulations : 11
% 0.25/1.43 # Factorizations : 0
% 0.25/1.43 # Equation resolutions : 0
% 0.25/1.43 # Current number of processed clauses : 18
% 0.25/1.43 # Positive orientable unit clauses : 6
% 0.25/1.43 # Positive unorientable unit clauses: 0
% 0.25/1.43 # Negative unit clauses : 0
% 0.25/1.43 # Non-unit-clauses : 12
% 0.25/1.43 # Current number of unprocessed clauses: 3
% 0.25/1.43 # ...number of literals in the above : 18
% 0.25/1.43 # Current number of archived formulas : 0
% 0.25/1.43 # Current number of archived clauses : 0
% 0.25/1.43 # Clause-clause subsumption calls (NU) : 23
% 0.25/1.43 # Rec. Clause-clause subsumption calls : 7
% 0.25/1.43 # Non-unit clause-clause subsumptions : 0
% 0.25/1.43 # Unit Clause-clause subsumption calls : 0
% 0.25/1.43 # Rewrite failures with RHS unbound : 0
% 0.25/1.43 # BW rewrite match attempts : 0
% 0.25/1.43 # BW rewrite match successes : 0
% 0.25/1.43 # Condensation attempts : 0
% 0.25/1.43 # Condensation successes : 0
% 0.25/1.43 # Termbank termtop insertions : 895
% 0.25/1.43
% 0.25/1.43 # -------------------------------------------------
% 0.25/1.43 # User time : 0.014 s
% 0.25/1.43 # System time : 0.001 s
% 0.25/1.43 # Total time : 0.015 s
% 0.25/1.43 # Maximum resident set size: 2776 pages
%------------------------------------------------------------------------------