TSTP Solution File: SWB007+2 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SWB007+2 : TPTP v8.1.0. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n024.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:56 EDT 2022
% Result : Theorem 0.23s 1.41s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 3
% Syntax : Number of formulae : 14 ( 6 unt; 0 def)
% Number of atoms : 30 ( 5 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 26 ( 10 ~; 7 |; 8 &)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 9 con; 0-0 aty)
% Number of variables : 8 ( 2 sgn 6 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(testcase_conclusion_fullish_007_Equal_Classes,conjecture,
( iext(uri_rdf_type,uri_ex_w,uri_ex_c2)
& iext(uri_rdfs_subClassOf,uri_ex_c,uri_ex_c2)
& iext(uri_rdfs_range,uri_ex_p,uri_ex_c2) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',testcase_conclusion_fullish_007_Equal_Classes) ).
fof(owl_eqdis_sameas,axiom,
! [X1,X2] :
( iext(uri_owl_sameAs,X1,X2)
<=> X1 = X2 ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',owl_eqdis_sameas) ).
fof(testcase_premise_fullish_007_Equal_Classes,axiom,
( iext(uri_owl_sameAs,uri_ex_c1,uri_ex_c2)
& iext(uri_rdf_type,uri_ex_w,uri_ex_c1)
& iext(uri_rdfs_subClassOf,uri_ex_c,uri_ex_c1)
& iext(uri_rdfs_range,uri_ex_p,uri_ex_c1) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',testcase_premise_fullish_007_Equal_Classes) ).
fof(c_0_3,negated_conjecture,
~ ( iext(uri_rdf_type,uri_ex_w,uri_ex_c2)
& iext(uri_rdfs_subClassOf,uri_ex_c,uri_ex_c2)
& iext(uri_rdfs_range,uri_ex_p,uri_ex_c2) ),
inference(assume_negation,[status(cth)],[testcase_conclusion_fullish_007_Equal_Classes]) ).
fof(c_0_4,plain,
! [X3,X4,X3,X4] :
( ( ~ iext(uri_owl_sameAs,X3,X4)
| X3 = X4 )
& ( X3 != X4
| iext(uri_owl_sameAs,X3,X4) ) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[owl_eqdis_sameas])])])]) ).
fof(c_0_5,negated_conjecture,
( ~ iext(uri_rdf_type,uri_ex_w,uri_ex_c2)
| ~ iext(uri_rdfs_subClassOf,uri_ex_c,uri_ex_c2)
| ~ iext(uri_rdfs_range,uri_ex_p,uri_ex_c2) ),
inference(fof_nnf,[status(thm)],[c_0_3]) ).
cnf(c_0_6,plain,
( X1 = X2
| ~ iext(uri_owl_sameAs,X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,plain,
iext(uri_owl_sameAs,uri_ex_c1,uri_ex_c2),
inference(split_conjunct,[status(thm)],[testcase_premise_fullish_007_Equal_Classes]) ).
cnf(c_0_8,negated_conjecture,
( ~ iext(uri_rdfs_range,uri_ex_p,uri_ex_c2)
| ~ iext(uri_rdfs_subClassOf,uri_ex_c,uri_ex_c2)
| ~ iext(uri_rdf_type,uri_ex_w,uri_ex_c2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
uri_ex_c2 = uri_ex_c1,
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_10,plain,
iext(uri_rdf_type,uri_ex_w,uri_ex_c1),
inference(split_conjunct,[status(thm)],[testcase_premise_fullish_007_Equal_Classes]) ).
cnf(c_0_11,plain,
iext(uri_rdfs_subClassOf,uri_ex_c,uri_ex_c1),
inference(split_conjunct,[status(thm)],[testcase_premise_fullish_007_Equal_Classes]) ).
cnf(c_0_12,plain,
iext(uri_rdfs_range,uri_ex_p,uri_ex_c1),
inference(split_conjunct,[status(thm)],[testcase_premise_fullish_007_Equal_Classes]) ).
cnf(c_0_13,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_9]),c_0_10]),c_0_9]),c_0_11]),c_0_9]),c_0_12])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWB007+2 : TPTP v8.1.0. Released v5.2.0.
% 0.11/0.13 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n024.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Wed Jun 1 03:01:21 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.23/1.41 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.23/1.41 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.23/1.41 # Preprocessing time : 0.013 s
% 0.23/1.41
% 0.23/1.41 # Failure: Out of unprocessed clauses!
% 0.23/1.41 # OLD status GaveUp
% 0.23/1.41 # Parsed axioms : 3
% 0.23/1.41 # Removed by relevancy pruning/SinE : 2
% 0.23/1.41 # Initial clauses : 1
% 0.23/1.41 # Removed in clause preprocessing : 0
% 0.23/1.41 # Initial clauses in saturation : 1
% 0.23/1.41 # Processed clauses : 1
% 0.23/1.41 # ...of these trivial : 0
% 0.23/1.41 # ...subsumed : 0
% 0.23/1.41 # ...remaining for further processing : 1
% 0.23/1.41 # Other redundant clauses eliminated : 0
% 0.23/1.41 # Clauses deleted for lack of memory : 0
% 0.23/1.41 # Backward-subsumed : 0
% 0.23/1.41 # Backward-rewritten : 0
% 0.23/1.41 # Generated clauses : 0
% 0.23/1.41 # ...of the previous two non-trivial : 0
% 0.23/1.41 # Contextual simplify-reflections : 0
% 0.23/1.41 # Paramodulations : 0
% 0.23/1.41 # Factorizations : 0
% 0.23/1.41 # Equation resolutions : 0
% 0.23/1.41 # Current number of processed clauses : 1
% 0.23/1.41 # Positive orientable unit clauses : 0
% 0.23/1.41 # Positive unorientable unit clauses: 0
% 0.23/1.41 # Negative unit clauses : 0
% 0.23/1.41 # Non-unit-clauses : 1
% 0.23/1.41 # Current number of unprocessed clauses: 0
% 0.23/1.41 # ...number of literals in the above : 0
% 0.23/1.41 # Current number of archived formulas : 0
% 0.23/1.41 # Current number of archived clauses : 0
% 0.23/1.41 # Clause-clause subsumption calls (NU) : 0
% 0.23/1.41 # Rec. Clause-clause subsumption calls : 0
% 0.23/1.41 # Non-unit clause-clause subsumptions : 0
% 0.23/1.41 # Unit Clause-clause subsumption calls : 0
% 0.23/1.41 # Rewrite failures with RHS unbound : 0
% 0.23/1.41 # BW rewrite match attempts : 0
% 0.23/1.41 # BW rewrite match successes : 0
% 0.23/1.41 # Condensation attempts : 0
% 0.23/1.41 # Condensation successes : 0
% 0.23/1.41 # Termbank termtop insertions : 114
% 0.23/1.41
% 0.23/1.41 # -------------------------------------------------
% 0.23/1.41 # User time : 0.010 s
% 0.23/1.41 # System time : 0.003 s
% 0.23/1.41 # Total time : 0.013 s
% 0.23/1.41 # Maximum resident set size: 2768 pages
% 0.23/1.41 # Running protocol protocol_eprover_f171197f65f27d1ba69648a20c844832c84a5dd7 for 23 seconds:
% 0.23/1.41 # Preprocessing time : 0.013 s
% 0.23/1.41
% 0.23/1.41 # Proof found!
% 0.23/1.41 # SZS status Theorem
% 0.23/1.41 # SZS output start CNFRefutation
% See solution above
% 0.23/1.41 # Proof object total steps : 14
% 0.23/1.41 # Proof object clause steps : 8
% 0.23/1.41 # Proof object formula steps : 6
% 0.23/1.41 # Proof object conjectures : 5
% 0.23/1.41 # Proof object clause conjectures : 2
% 0.23/1.41 # Proof object formula conjectures : 3
% 0.23/1.41 # Proof object initial clauses used : 6
% 0.23/1.41 # Proof object initial formulas used : 3
% 0.23/1.41 # Proof object generating inferences : 1
% 0.23/1.41 # Proof object simplifying inferences : 7
% 0.23/1.41 # Training examples: 0 positive, 0 negative
% 0.23/1.41 # Parsed axioms : 3
% 0.23/1.41 # Removed by relevancy pruning/SinE : 0
% 0.23/1.41 # Initial clauses : 7
% 0.23/1.41 # Removed in clause preprocessing : 0
% 0.23/1.41 # Initial clauses in saturation : 7
% 0.23/1.41 # Processed clauses : 8
% 0.23/1.41 # ...of these trivial : 0
% 0.23/1.41 # ...subsumed : 0
% 0.23/1.41 # ...remaining for further processing : 8
% 0.23/1.41 # Other redundant clauses eliminated : 1
% 0.23/1.41 # Clauses deleted for lack of memory : 0
% 0.23/1.41 # Backward-subsumed : 0
% 0.23/1.41 # Backward-rewritten : 2
% 0.23/1.41 # Generated clauses : 2
% 0.23/1.41 # ...of the previous two non-trivial : 2
% 0.23/1.41 # Contextual simplify-reflections : 0
% 0.23/1.41 # Paramodulations : 1
% 0.23/1.41 # Factorizations : 0
% 0.23/1.41 # Equation resolutions : 1
% 0.23/1.41 # Current number of processed clauses : 5
% 0.23/1.41 # Positive orientable unit clauses : 4
% 0.23/1.41 # Positive unorientable unit clauses: 0
% 0.23/1.41 # Negative unit clauses : 0
% 0.23/1.41 # Non-unit-clauses : 1
% 0.23/1.41 # Current number of unprocessed clauses: 1
% 0.23/1.41 # ...number of literals in the above : 1
% 0.23/1.41 # Current number of archived formulas : 0
% 0.23/1.41 # Current number of archived clauses : 2
% 0.23/1.41 # Clause-clause subsumption calls (NU) : 0
% 0.23/1.41 # Rec. Clause-clause subsumption calls : 0
% 0.23/1.41 # Non-unit clause-clause subsumptions : 0
% 0.23/1.41 # Unit Clause-clause subsumption calls : 0
% 0.23/1.41 # Rewrite failures with RHS unbound : 0
% 0.23/1.41 # BW rewrite match attempts : 4
% 0.23/1.41 # BW rewrite match successes : 1
% 0.23/1.41 # Condensation attempts : 0
% 0.23/1.41 # Condensation successes : 0
% 0.23/1.41 # Termbank termtop insertions : 269
% 0.23/1.41
% 0.23/1.41 # -------------------------------------------------
% 0.23/1.41 # User time : 0.011 s
% 0.23/1.41 # System time : 0.002 s
% 0.23/1.41 # Total time : 0.013 s
% 0.23/1.41 # Maximum resident set size: 2772 pages
%------------------------------------------------------------------------------