TSTP Solution File: SWB014+2 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SWB014+2 : TPTP v8.1.0. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n032.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:59 EDT 2022
% Result : Theorem 0.15s 1.35s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 4
% Syntax : Number of formulae : 30 ( 12 unt; 0 def)
% Number of atoms : 158 ( 0 equ)
% Maximal formula atoms : 71 ( 5 avg)
% Number of connectives : 215 ( 87 ~; 93 |; 31 &)
% ( 3 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 27 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 13 ( 13 usr; 12 con; 0-5 aty)
% Number of variables : 48 ( 3 sgn 20 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(owl_bool_unionof_class_002,axiom,
! [X3,X4,X5,X6,X7] :
( ( iext(uri_rdf_first,X4,X5)
& iext(uri_rdf_rest,X4,X6)
& iext(uri_rdf_first,X6,X7)
& iext(uri_rdf_rest,X6,uri_rdf_nil) )
=> ( iext(uri_owl_unionOf,X3,X4)
<=> ( ic(X3)
& ic(X5)
& ic(X7)
& ! [X1] :
( icext(X3,X1)
<=> ( icext(X5,X1)
| icext(X7,X1) ) ) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',owl_bool_unionof_class_002) ).
fof(testcase_premise_fullish_014_Harry_belongs_to_some_Species,axiom,
? [X9,X10,X11] :
( iext(uri_rdf_type,uri_ex_Eagle,uri_ex_Species)
& iext(uri_rdf_type,uri_ex_Falcon,uri_ex_Species)
& iext(uri_rdf_type,uri_ex_harry,X9)
& iext(uri_owl_unionOf,X9,X10)
& iext(uri_rdf_first,X10,uri_ex_Eagle)
& iext(uri_rdf_rest,X10,X11)
& iext(uri_rdf_first,X11,uri_ex_Falcon)
& iext(uri_rdf_rest,X11,uri_rdf_nil) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',testcase_premise_fullish_014_Harry_belongs_to_some_Species) ).
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_conclusion_fullish_014_Harry_belongs_to_some_Species,conjecture,
? [X8] :
( iext(uri_rdf_type,uri_ex_harry,X8)
& iext(uri_rdf_type,X8,uri_ex_Species) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',testcase_conclusion_fullish_014_Harry_belongs_to_some_Species) ).
fof(c_0_4,plain,
! [X8,X9,X10,X11,X12,X13,X13] :
( ( ic(X8)
| ~ iext(uri_owl_unionOf,X8,X9)
| ~ iext(uri_rdf_first,X9,X10)
| ~ iext(uri_rdf_rest,X9,X11)
| ~ iext(uri_rdf_first,X11,X12)
| ~ iext(uri_rdf_rest,X11,uri_rdf_nil) )
& ( ic(X10)
| ~ iext(uri_owl_unionOf,X8,X9)
| ~ iext(uri_rdf_first,X9,X10)
| ~ iext(uri_rdf_rest,X9,X11)
| ~ iext(uri_rdf_first,X11,X12)
| ~ iext(uri_rdf_rest,X11,uri_rdf_nil) )
& ( ic(X12)
| ~ iext(uri_owl_unionOf,X8,X9)
| ~ iext(uri_rdf_first,X9,X10)
| ~ iext(uri_rdf_rest,X9,X11)
| ~ iext(uri_rdf_first,X11,X12)
| ~ iext(uri_rdf_rest,X11,uri_rdf_nil) )
& ( ~ icext(X8,X13)
| icext(X10,X13)
| icext(X12,X13)
| ~ iext(uri_owl_unionOf,X8,X9)
| ~ iext(uri_rdf_first,X9,X10)
| ~ iext(uri_rdf_rest,X9,X11)
| ~ iext(uri_rdf_first,X11,X12)
| ~ iext(uri_rdf_rest,X11,uri_rdf_nil) )
& ( ~ icext(X10,X13)
| icext(X8,X13)
| ~ iext(uri_owl_unionOf,X8,X9)
| ~ iext(uri_rdf_first,X9,X10)
| ~ iext(uri_rdf_rest,X9,X11)
| ~ iext(uri_rdf_first,X11,X12)
| ~ iext(uri_rdf_rest,X11,uri_rdf_nil) )
& ( ~ icext(X12,X13)
| icext(X8,X13)
| ~ iext(uri_owl_unionOf,X8,X9)
| ~ iext(uri_rdf_first,X9,X10)
| ~ iext(uri_rdf_rest,X9,X11)
| ~ iext(uri_rdf_first,X11,X12)
| ~ iext(uri_rdf_rest,X11,uri_rdf_nil) )
& ( ~ icext(X10,esk1_5(X8,X9,X10,X11,X12))
| ~ icext(X8,esk1_5(X8,X9,X10,X11,X12))
| ~ ic(X8)
| ~ ic(X10)
| ~ ic(X12)
| iext(uri_owl_unionOf,X8,X9)
| ~ iext(uri_rdf_first,X9,X10)
| ~ iext(uri_rdf_rest,X9,X11)
| ~ iext(uri_rdf_first,X11,X12)
| ~ iext(uri_rdf_rest,X11,uri_rdf_nil) )
& ( ~ icext(X12,esk1_5(X8,X9,X10,X11,X12))
| ~ icext(X8,esk1_5(X8,X9,X10,X11,X12))
| ~ ic(X8)
| ~ ic(X10)
| ~ ic(X12)
| iext(uri_owl_unionOf,X8,X9)
| ~ iext(uri_rdf_first,X9,X10)
| ~ iext(uri_rdf_rest,X9,X11)
| ~ iext(uri_rdf_first,X11,X12)
| ~ iext(uri_rdf_rest,X11,uri_rdf_nil) )
& ( icext(X8,esk1_5(X8,X9,X10,X11,X12))
| icext(X10,esk1_5(X8,X9,X10,X11,X12))
| icext(X12,esk1_5(X8,X9,X10,X11,X12))
| ~ ic(X8)
| ~ ic(X10)
| ~ ic(X12)
| iext(uri_owl_unionOf,X8,X9)
| ~ iext(uri_rdf_first,X9,X10)
| ~ iext(uri_rdf_rest,X9,X11)
| ~ iext(uri_rdf_first,X11,X12)
| ~ iext(uri_rdf_rest,X11,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_bool_unionof_class_002])])])])])])]) ).
fof(c_0_5,plain,
( iext(uri_rdf_type,uri_ex_Eagle,uri_ex_Species)
& iext(uri_rdf_type,uri_ex_Falcon,uri_ex_Species)
& iext(uri_rdf_type,uri_ex_harry,esk2_0)
& iext(uri_owl_unionOf,esk2_0,esk3_0)
& iext(uri_rdf_first,esk3_0,uri_ex_Eagle)
& iext(uri_rdf_rest,esk3_0,esk4_0)
& iext(uri_rdf_first,esk4_0,uri_ex_Falcon)
& iext(uri_rdf_rest,esk4_0,uri_rdf_nil) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[testcase_premise_fullish_014_Harry_belongs_to_some_Species])]) ).
cnf(c_0_6,plain,
( icext(X2,X6)
| icext(X4,X6)
| ~ iext(uri_rdf_rest,X1,uri_rdf_nil)
| ~ iext(uri_rdf_first,X1,X2)
| ~ iext(uri_rdf_rest,X3,X1)
| ~ iext(uri_rdf_first,X3,X4)
| ~ iext(uri_owl_unionOf,X5,X3)
| ~ icext(X5,X6) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,plain,
iext(uri_rdf_rest,esk4_0,uri_rdf_nil),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,plain,
( icext(X1,X2)
| icext(X3,X2)
| ~ icext(X4,X2)
| ~ iext(uri_rdf_first,esk4_0,X3)
| ~ iext(uri_rdf_rest,X5,esk4_0)
| ~ iext(uri_rdf_first,X5,X1)
| ~ iext(uri_owl_unionOf,X4,X5) ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_9,plain,
iext(uri_rdf_first,esk3_0,uri_ex_Eagle),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,plain,
iext(uri_rdf_rest,esk3_0,esk4_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_11,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_12,plain,
( icext(uri_ex_Eagle,X1)
| icext(X2,X1)
| ~ icext(X3,X1)
| ~ iext(uri_rdf_first,esk4_0,X2)
| ~ iext(uri_owl_unionOf,X3,esk3_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_13,plain,
( icext(X1,X2)
| ~ iext(uri_rdf_type,X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_14,negated_conjecture,
~ ? [X8] :
( iext(uri_rdf_type,uri_ex_harry,X8)
& iext(uri_rdf_type,X8,uri_ex_Species) ),
inference(assume_negation,[status(cth)],[testcase_conclusion_fullish_014_Harry_belongs_to_some_Species]) ).
cnf(c_0_15,plain,
( icext(uri_ex_Eagle,X1)
| icext(X2,X1)
| ~ iext(uri_rdf_first,esk4_0,X2)
| ~ iext(uri_owl_unionOf,X3,esk3_0)
| ~ iext(uri_rdf_type,X1,X3) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,plain,
iext(uri_rdf_type,uri_ex_harry,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_17,plain,
iext(uri_owl_unionOf,esk2_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_18,negated_conjecture,
! [X9] :
( ~ iext(uri_rdf_type,uri_ex_harry,X9)
| ~ iext(uri_rdf_type,X9,uri_ex_Species) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])]) ).
cnf(c_0_19,plain,
( icext(uri_ex_Eagle,uri_ex_harry)
| icext(X1,uri_ex_harry)
| ~ iext(uri_rdf_first,esk4_0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17])]) ).
cnf(c_0_20,plain,
iext(uri_rdf_first,esk4_0,uri_ex_Falcon),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_21,negated_conjecture,
( ~ iext(uri_rdf_type,X1,uri_ex_Species)
| ~ iext(uri_rdf_type,uri_ex_harry,X1) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_22,plain,
iext(uri_rdf_type,uri_ex_Falcon,uri_ex_Species),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_23,plain,
( iext(uri_rdf_type,X1,X2)
| ~ icext(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_24,plain,
( icext(uri_ex_Falcon,uri_ex_harry)
| icext(uri_ex_Eagle,uri_ex_harry) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_25,negated_conjecture,
~ iext(uri_rdf_type,uri_ex_harry,uri_ex_Falcon),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_26,plain,
iext(uri_rdf_type,uri_ex_Eagle,uri_ex_Species),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_27,plain,
icext(uri_ex_Eagle,uri_ex_harry),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]) ).
cnf(c_0_28,negated_conjecture,
~ iext(uri_rdf_type,uri_ex_harry,uri_ex_Eagle),
inference(spm,[status(thm)],[c_0_21,c_0_26]) ).
cnf(c_0_29,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_27]),c_0_28]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : SWB014+2 : TPTP v8.1.0. Released v5.2.0.
% 0.00/0.10 % Command : run_ET %s %d
% 0.09/0.30 % Computer : n032.cluster.edu
% 0.09/0.30 % Model : x86_64 x86_64
% 0.09/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30 % Memory : 8042.1875MB
% 0.09/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30 % CPULimit : 300
% 0.09/0.30 % WCLimit : 600
% 0.09/0.30 % DateTime : Wed Jun 1 08:37:44 EDT 2022
% 0.09/0.30 % CPUTime :
% 0.15/1.35 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.15/1.35 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.15/1.35 # Preprocessing time : 0.007 s
% 0.15/1.35
% 0.15/1.35 # Failure: Out of unprocessed clauses!
% 0.15/1.35 # OLD status GaveUp
% 0.15/1.35 # Parsed axioms : 4
% 0.15/1.35 # Removed by relevancy pruning/SinE : 3
% 0.15/1.35 # Initial clauses : 1
% 0.15/1.35 # Removed in clause preprocessing : 0
% 0.15/1.35 # Initial clauses in saturation : 1
% 0.15/1.35 # Processed clauses : 1
% 0.15/1.35 # ...of these trivial : 0
% 0.15/1.35 # ...subsumed : 0
% 0.15/1.35 # ...remaining for further processing : 1
% 0.15/1.35 # Other redundant clauses eliminated : 0
% 0.15/1.35 # Clauses deleted for lack of memory : 0
% 0.15/1.35 # Backward-subsumed : 0
% 0.15/1.35 # Backward-rewritten : 0
% 0.15/1.35 # Generated clauses : 0
% 0.15/1.35 # ...of the previous two non-trivial : 0
% 0.15/1.35 # Contextual simplify-reflections : 0
% 0.15/1.35 # Paramodulations : 0
% 0.15/1.35 # Factorizations : 0
% 0.15/1.35 # Equation resolutions : 0
% 0.15/1.35 # Current number of processed clauses : 1
% 0.15/1.35 # Positive orientable unit clauses : 0
% 0.15/1.35 # Positive unorientable unit clauses: 0
% 0.15/1.35 # Negative unit clauses : 0
% 0.15/1.35 # Non-unit-clauses : 1
% 0.15/1.35 # Current number of unprocessed clauses: 0
% 0.15/1.35 # ...number of literals in the above : 0
% 0.15/1.35 # Current number of archived formulas : 0
% 0.15/1.35 # Current number of archived clauses : 0
% 0.15/1.35 # Clause-clause subsumption calls (NU) : 0
% 0.15/1.35 # Rec. Clause-clause subsumption calls : 0
% 0.15/1.35 # Non-unit clause-clause subsumptions : 0
% 0.15/1.35 # Unit Clause-clause subsumption calls : 0
% 0.15/1.35 # Rewrite failures with RHS unbound : 0
% 0.15/1.35 # BW rewrite match attempts : 0
% 0.15/1.35 # BW rewrite match successes : 0
% 0.15/1.35 # Condensation attempts : 0
% 0.15/1.35 # Condensation successes : 0
% 0.15/1.35 # Termbank termtop insertions : 171
% 0.15/1.35
% 0.15/1.35 # -------------------------------------------------
% 0.15/1.35 # User time : 0.006 s
% 0.15/1.35 # System time : 0.001 s
% 0.15/1.35 # Total time : 0.007 s
% 0.15/1.35 # Maximum resident set size: 2776 pages
% 0.15/1.35 # Running protocol protocol_eprover_f171197f65f27d1ba69648a20c844832c84a5dd7 for 23 seconds:
% 0.15/1.35 # Preprocessing time : 0.007 s
% 0.15/1.35
% 0.15/1.35 # Proof found!
% 0.15/1.35 # SZS status Theorem
% 0.15/1.35 # SZS output start CNFRefutation
% See solution above
% 0.15/1.35 # Proof object total steps : 30
% 0.15/1.35 # Proof object clause steps : 21
% 0.15/1.35 # Proof object formula steps : 9
% 0.15/1.35 # Proof object conjectures : 6
% 0.15/1.35 # Proof object clause conjectures : 3
% 0.15/1.35 # Proof object formula conjectures : 3
% 0.15/1.35 # Proof object initial clauses used : 12
% 0.15/1.35 # Proof object initial formulas used : 4
% 0.15/1.35 # Proof object generating inferences : 9
% 0.15/1.35 # Proof object simplifying inferences : 6
% 0.15/1.35 # Training examples: 0 positive, 0 negative
% 0.15/1.35 # Parsed axioms : 4
% 0.15/1.35 # Removed by relevancy pruning/SinE : 0
% 0.15/1.35 # Initial clauses : 20
% 0.15/1.35 # Removed in clause preprocessing : 0
% 0.15/1.35 # Initial clauses in saturation : 20
% 0.15/1.35 # Processed clauses : 83
% 0.15/1.35 # ...of these trivial : 0
% 0.15/1.35 # ...subsumed : 15
% 0.15/1.35 # ...remaining for further processing : 68
% 0.15/1.35 # Other redundant clauses eliminated : 0
% 0.15/1.35 # Clauses deleted for lack of memory : 0
% 0.15/1.35 # Backward-subsumed : 5
% 0.15/1.35 # Backward-rewritten : 3
% 0.15/1.35 # Generated clauses : 116
% 0.15/1.35 # ...of the previous two non-trivial : 111
% 0.15/1.35 # Contextual simplify-reflections : 21
% 0.15/1.35 # Paramodulations : 116
% 0.15/1.35 # Factorizations : 0
% 0.15/1.35 # Equation resolutions : 0
% 0.15/1.35 # Current number of processed clauses : 60
% 0.15/1.35 # Positive orientable unit clauses : 10
% 0.15/1.35 # Positive unorientable unit clauses: 0
% 0.15/1.35 # Negative unit clauses : 2
% 0.15/1.35 # Non-unit-clauses : 48
% 0.15/1.35 # Current number of unprocessed clauses: 44
% 0.15/1.35 # ...number of literals in the above : 289
% 0.15/1.35 # Current number of archived formulas : 0
% 0.15/1.35 # Current number of archived clauses : 8
% 0.15/1.35 # Clause-clause subsumption calls (NU) : 616
% 0.15/1.35 # Rec. Clause-clause subsumption calls : 211
% 0.15/1.35 # Non-unit clause-clause subsumptions : 39
% 0.15/1.35 # Unit Clause-clause subsumption calls : 43
% 0.15/1.35 # Rewrite failures with RHS unbound : 0
% 0.15/1.35 # BW rewrite match attempts : 2
% 0.15/1.35 # BW rewrite match successes : 2
% 0.15/1.35 # Condensation attempts : 0
% 0.15/1.35 # Condensation successes : 0
% 0.15/1.35 # Termbank termtop insertions : 4108
% 0.15/1.35
% 0.15/1.35 # -------------------------------------------------
% 0.15/1.35 # User time : 0.009 s
% 0.15/1.35 # System time : 0.001 s
% 0.15/1.35 # Total time : 0.010 s
% 0.15/1.35 # Maximum resident set size: 2780 pages
%------------------------------------------------------------------------------