TSTP Solution File: SWB023+2 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SWB023+2 : TPTP v8.1.0. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n018.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:02:03 EDT 2022
% Result : Theorem 0.24s 1.43s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 5
% Syntax : Number of formulae : 32 ( 10 unt; 0 def)
% Number of atoms : 107 ( 17 equ)
% Maximal formula atoms : 26 ( 3 avg)
% Number of connectives : 125 ( 50 ~; 48 |; 22 &)
% ( 4 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 14 ( 14 usr; 13 con; 0-3 aty)
% Number of variables : 47 ( 6 sgn 21 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(owl_enum_class_001,axiom,
! [X3,X4,X5] :
( ( iext(uri_rdf_first,X4,X5)
& iext(uri_rdf_rest,X4,uri_rdf_nil) )
=> ( iext(uri_owl_oneOf,X3,X4)
<=> ( ic(X3)
& ! [X1] :
( icext(X3,X1)
<=> X1 = X5 ) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',owl_enum_class_001) ).
fof(testcase_premise_fullish_023_Unique_List_Components,axiom,
? [X10,X11] :
( iext(uri_rdf_type,uri_rdf_first,uri_owl_FunctionalProperty)
& iext(uri_rdf_type,uri_ex_w,X10)
& iext(uri_rdf_type,X10,uri_owl_Class)
& iext(uri_owl_oneOf,X10,X11)
& iext(uri_rdf_first,X11,uri_ex_u)
& iext(uri_rdf_first,X11,uri_ex_v)
& iext(uri_rdf_rest,X11,uri_rdf_nil) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',testcase_premise_fullish_023_Unique_List_Components) ).
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/solver/bin/../tmp/theBenchmark.p.mepo_128.in',testcase_conclusion_fullish_023_Unique_List_Components) ).
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(owl_eqdis_sameas,axiom,
! [X1,X9] :
( iext(uri_owl_sameAs,X1,X9)
<=> X1 = X9 ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',owl_eqdis_sameas) ).
fof(c_0_5,plain,
! [X6,X7,X8,X9,X9] :
( ( ic(X6)
| ~ iext(uri_owl_oneOf,X6,X7)
| ~ iext(uri_rdf_first,X7,X8)
| ~ iext(uri_rdf_rest,X7,uri_rdf_nil) )
& ( ~ icext(X6,X9)
| X9 = X8
| ~ iext(uri_owl_oneOf,X6,X7)
| ~ iext(uri_rdf_first,X7,X8)
| ~ iext(uri_rdf_rest,X7,uri_rdf_nil) )
& ( X9 != X8
| icext(X6,X9)
| ~ iext(uri_owl_oneOf,X6,X7)
| ~ iext(uri_rdf_first,X7,X8)
| ~ iext(uri_rdf_rest,X7,uri_rdf_nil) )
& ( ~ icext(X6,esk1_3(X6,X7,X8))
| esk1_3(X6,X7,X8) != X8
| ~ ic(X6)
| iext(uri_owl_oneOf,X6,X7)
| ~ iext(uri_rdf_first,X7,X8)
| ~ iext(uri_rdf_rest,X7,uri_rdf_nil) )
& ( icext(X6,esk1_3(X6,X7,X8))
| esk1_3(X6,X7,X8) = X8
| ~ ic(X6)
| iext(uri_owl_oneOf,X6,X7)
| ~ iext(uri_rdf_first,X7,X8)
| ~ iext(uri_rdf_rest,X7,uri_rdf_nil) ) ),
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_enum_class_001])])])])])])]) ).
fof(c_0_6,plain,
( iext(uri_rdf_type,uri_rdf_first,uri_owl_FunctionalProperty)
& iext(uri_rdf_type,uri_ex_w,esk5_0)
& iext(uri_rdf_type,esk5_0,uri_owl_Class)
& iext(uri_owl_oneOf,esk5_0,esk6_0)
& iext(uri_rdf_first,esk6_0,uri_ex_u)
& iext(uri_rdf_first,esk6_0,uri_ex_v)
& iext(uri_rdf_rest,esk6_0,uri_rdf_nil) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[testcase_premise_fullish_023_Unique_List_Components])]) ).
cnf(c_0_7,plain,
( icext(X3,X4)
| ~ iext(uri_rdf_rest,X1,uri_rdf_nil)
| ~ iext(uri_rdf_first,X1,X2)
| ~ iext(uri_owl_oneOf,X3,X1)
| X4 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,plain,
( X4 = X2
| ~ iext(uri_rdf_rest,X1,uri_rdf_nil)
| ~ iext(uri_rdf_first,X1,X2)
| ~ iext(uri_owl_oneOf,X3,X1)
| ~ icext(X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
iext(uri_rdf_first,esk6_0,uri_ex_v),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
iext(uri_rdf_rest,esk6_0,uri_rdf_nil),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,plain,
( icext(X1,X2)
| ~ iext(uri_rdf_rest,X3,uri_rdf_nil)
| ~ iext(uri_rdf_first,X3,X2)
| ~ iext(uri_owl_oneOf,X1,X3) ),
inference(er,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
iext(uri_rdf_first,esk6_0,uri_ex_u),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_13,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_14,plain,
( uri_ex_v = X1
| ~ icext(X2,X1)
| ~ iext(uri_owl_oneOf,X2,esk6_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10])]) ).
cnf(c_0_15,plain,
( icext(X1,uri_ex_u)
| ~ iext(uri_owl_oneOf,X1,esk6_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_10])]) ).
fof(c_0_16,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])])])]) ).
fof(c_0_17,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_13]) ).
cnf(c_0_18,plain,
( uri_ex_v = uri_ex_u
| ~ iext(uri_owl_oneOf,X1,esk6_0) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,plain,
iext(uri_owl_oneOf,esk5_0,esk6_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_20,plain,
( uri_ex_u = X1
| ~ icext(X2,X1)
| ~ iext(uri_owl_oneOf,X2,esk6_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_12]),c_0_10])]) ).
cnf(c_0_21,plain,
( icext(X1,X2)
| ~ iext(uri_rdf_type,X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_22,plain,
! [X10,X11,X10,X11] :
( ( ~ iext(uri_owl_sameAs,X10,X11)
| X10 = X11 )
& ( X10 != X11
| iext(uri_owl_sameAs,X10,X11) ) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[owl_eqdis_sameas])])])]) ).
cnf(c_0_23,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_17]) ).
cnf(c_0_24,plain,
uri_ex_v = uri_ex_u,
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_25,plain,
( uri_ex_u = X1
| ~ iext(uri_owl_oneOf,X2,esk6_0)
| ~ iext(uri_rdf_type,X1,X2) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_26,plain,
iext(uri_rdf_type,uri_ex_w,esk5_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_27,plain,
( iext(uri_owl_sameAs,X1,X2)
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_28,negated_conjecture,
~ iext(uri_owl_sameAs,uri_ex_w,uri_ex_u),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_24])]) ).
cnf(c_0_29,plain,
uri_ex_u = uri_ex_w,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_19])]) ).
cnf(c_0_30,plain,
iext(uri_owl_sameAs,X1,X1),
inference(er,[status(thm)],[c_0_27]) ).
cnf(c_0_31,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_29]),c_0_30])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SWB023+2 : TPTP v8.1.0. Released v5.2.0.
% 0.03/0.13 % Command : run_ET %s %d
% 0.13/0.35 % Computer : n018.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Wed Jun 1 03:29:29 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.24/1.43 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.24/1.43 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.24/1.43 # Preprocessing time : 0.013 s
% 0.24/1.43
% 0.24/1.43 # Failure: Out of unprocessed clauses!
% 0.24/1.43 # OLD status GaveUp
% 0.24/1.43 # Parsed axioms : 6
% 0.24/1.43 # Removed by relevancy pruning/SinE : 4
% 0.24/1.43 # Initial clauses : 3
% 0.24/1.43 # Removed in clause preprocessing : 0
% 0.24/1.43 # Initial clauses in saturation : 3
% 0.24/1.43 # Processed clauses : 4
% 0.24/1.43 # ...of these trivial : 0
% 0.24/1.43 # ...subsumed : 0
% 0.24/1.43 # ...remaining for further processing : 4
% 0.24/1.43 # Other redundant clauses eliminated : 1
% 0.24/1.43 # Clauses deleted for lack of memory : 0
% 0.24/1.43 # Backward-subsumed : 0
% 0.24/1.43 # Backward-rewritten : 0
% 0.24/1.43 # Generated clauses : 1
% 0.24/1.43 # ...of the previous two non-trivial : 1
% 0.24/1.43 # Contextual simplify-reflections : 0
% 0.24/1.43 # Paramodulations : 0
% 0.24/1.43 # Factorizations : 0
% 0.24/1.43 # Equation resolutions : 1
% 0.24/1.43 # Current number of processed clauses : 3
% 0.24/1.43 # Positive orientable unit clauses : 1
% 0.24/1.43 # Positive unorientable unit clauses: 0
% 0.24/1.43 # Negative unit clauses : 0
% 0.24/1.43 # Non-unit-clauses : 2
% 0.24/1.43 # Current number of unprocessed clauses: 0
% 0.24/1.43 # ...number of literals in the above : 0
% 0.24/1.43 # Current number of archived formulas : 0
% 0.24/1.43 # Current number of archived clauses : 0
% 0.24/1.43 # Clause-clause subsumption calls (NU) : 0
% 0.24/1.43 # Rec. Clause-clause subsumption calls : 0
% 0.24/1.43 # Non-unit clause-clause subsumptions : 0
% 0.24/1.43 # Unit Clause-clause subsumption calls : 0
% 0.24/1.43 # Rewrite failures with RHS unbound : 0
% 0.24/1.43 # BW rewrite match attempts : 3
% 0.24/1.43 # BW rewrite match successes : 0
% 0.24/1.43 # Condensation attempts : 0
% 0.24/1.43 # Condensation successes : 0
% 0.24/1.43 # Termbank termtop insertions : 230
% 0.24/1.43
% 0.24/1.43 # -------------------------------------------------
% 0.24/1.43 # User time : 0.011 s
% 0.24/1.43 # System time : 0.002 s
% 0.24/1.43 # Total time : 0.013 s
% 0.24/1.43 # Maximum resident set size: 2780 pages
% 0.24/1.43 # Running protocol protocol_eprover_f171197f65f27d1ba69648a20c844832c84a5dd7 for 23 seconds:
% 0.24/1.43 # Preprocessing time : 0.016 s
% 0.24/1.43
% 0.24/1.43 # Proof found!
% 0.24/1.43 # SZS status Theorem
% 0.24/1.43 # SZS output start CNFRefutation
% See solution above
% 0.24/1.43 # Proof object total steps : 32
% 0.24/1.43 # Proof object clause steps : 21
% 0.24/1.43 # Proof object formula steps : 11
% 0.24/1.43 # Proof object conjectures : 6
% 0.24/1.43 # Proof object clause conjectures : 3
% 0.24/1.43 # Proof object formula conjectures : 3
% 0.24/1.43 # Proof object initial clauses used : 10
% 0.24/1.43 # Proof object initial formulas used : 5
% 0.24/1.43 # Proof object generating inferences : 7
% 0.24/1.43 # Proof object simplifying inferences : 15
% 0.24/1.43 # Training examples: 0 positive, 0 negative
% 0.24/1.43 # Parsed axioms : 6
% 0.24/1.43 # Removed by relevancy pruning/SinE : 0
% 0.24/1.43 # Initial clauses : 22
% 0.24/1.43 # Removed in clause preprocessing : 0
% 0.24/1.43 # Initial clauses in saturation : 22
% 0.24/1.43 # Processed clauses : 48
% 0.24/1.43 # ...of these trivial : 0
% 0.24/1.43 # ...subsumed : 4
% 0.24/1.43 # ...remaining for further processing : 44
% 0.24/1.43 # Other redundant clauses eliminated : 2
% 0.24/1.43 # Clauses deleted for lack of memory : 0
% 0.24/1.43 # Backward-subsumed : 2
% 0.24/1.43 # Backward-rewritten : 14
% 0.24/1.43 # Generated clauses : 51
% 0.24/1.43 # ...of the previous two non-trivial : 55
% 0.24/1.43 # Contextual simplify-reflections : 1
% 0.24/1.43 # Paramodulations : 49
% 0.24/1.43 # Factorizations : 0
% 0.24/1.43 # Equation resolutions : 2
% 0.24/1.43 # Current number of processed clauses : 26
% 0.24/1.43 # Positive orientable unit clauses : 7
% 0.24/1.43 # Positive unorientable unit clauses: 0
% 0.24/1.43 # Negative unit clauses : 0
% 0.24/1.43 # Non-unit-clauses : 19
% 0.24/1.43 # Current number of unprocessed clauses: 16
% 0.24/1.43 # ...number of literals in the above : 77
% 0.24/1.43 # Current number of archived formulas : 0
% 0.24/1.43 # Current number of archived clauses : 16
% 0.24/1.43 # Clause-clause subsumption calls (NU) : 316
% 0.24/1.43 # Rec. Clause-clause subsumption calls : 59
% 0.24/1.43 # Non-unit clause-clause subsumptions : 7
% 0.24/1.43 # Unit Clause-clause subsumption calls : 40
% 0.24/1.43 # Rewrite failures with RHS unbound : 0
% 0.24/1.43 # BW rewrite match attempts : 6
% 0.24/1.43 # BW rewrite match successes : 2
% 0.24/1.43 # Condensation attempts : 0
% 0.24/1.43 # Condensation successes : 0
% 0.24/1.43 # Termbank termtop insertions : 2185
% 0.24/1.43
% 0.24/1.43 # -------------------------------------------------
% 0.24/1.43 # User time : 0.013 s
% 0.24/1.43 # System time : 0.006 s
% 0.24/1.43 # Total time : 0.019 s
% 0.24/1.43 # Maximum resident set size: 2868 pages
%------------------------------------------------------------------------------