TSTP Solution File: SWB006+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SWB006+1 : TPTP v8.1.0. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n026.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:55 EDT 2022
% Result : Theorem 0.25s 1.44s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 3
% Syntax : Number of formulae : 20 ( 14 unt; 0 def)
% Number of atoms : 30 ( 8 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 18 ( 8 ~; 4 |; 5 &)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-1 aty)
% Number of variables : 12 ( 2 sgn 6 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(owl_eqdis_sameas,axiom,
! [X4,X7] :
( iext(uri_owl_sameAs,X4,X7)
<=> X4 = X7 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWB001+0.ax',owl_eqdis_sameas) ).
fof(testcase_premise_fullish_006_Literal_Values_represented_by_URIs_and_Blank_Nodes,axiom,
? [X42] :
( iext(uri_owl_sameAs,uri_ex_u,literal_plain(dat_str_abc))
& iext(uri_owl_sameAs,X42,literal_plain(dat_str_abc))
& iext(uri_owl_sameAs,X42,uri_ex_w) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',testcase_premise_fullish_006_Literal_Values_represented_by_URIs_and_Blank_Nodes) ).
fof(testcase_conclusion_fullish_006_Literal_Values_represented_by_URIs_and_Blank_Nodes,conjecture,
iext(uri_owl_sameAs,uri_ex_u,uri_ex_w),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',testcase_conclusion_fullish_006_Literal_Values_represented_by_URIs_and_Blank_Nodes) ).
fof(c_0_3,plain,
! [X8,X9,X8,X9] :
( ( ~ iext(uri_owl_sameAs,X8,X9)
| X8 = X9 )
& ( X8 != X9
| iext(uri_owl_sameAs,X8,X9) ) ),
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_4,plain,
( iext(uri_owl_sameAs,uri_ex_u,literal_plain(dat_str_abc))
& iext(uri_owl_sameAs,esk192_0,literal_plain(dat_str_abc))
& iext(uri_owl_sameAs,esk192_0,uri_ex_w) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[testcase_premise_fullish_006_Literal_Values_represented_by_URIs_and_Blank_Nodes])]) ).
fof(c_0_5,negated_conjecture,
~ iext(uri_owl_sameAs,uri_ex_u,uri_ex_w),
inference(assume_negation,[status(cth)],[testcase_conclusion_fullish_006_Literal_Values_represented_by_URIs_and_Blank_Nodes]) ).
cnf(c_0_6,plain,
( X1 = X2
| ~ iext(uri_owl_sameAs,X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_7,plain,
iext(uri_owl_sameAs,uri_ex_u,literal_plain(dat_str_abc)),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
fof(c_0_8,negated_conjecture,
~ iext(uri_owl_sameAs,uri_ex_u,uri_ex_w),
inference(fof_simplification,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
iext(uri_owl_sameAs,esk192_0,uri_ex_w),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_10,plain,
iext(uri_owl_sameAs,esk192_0,literal_plain(dat_str_abc)),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_11,plain,
literal_plain(dat_str_abc) = uri_ex_u,
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_12,negated_conjecture,
~ iext(uri_owl_sameAs,uri_ex_u,uri_ex_w),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
uri_ex_w = esk192_0,
inference(spm,[status(thm)],[c_0_6,c_0_9]) ).
cnf(c_0_14,plain,
iext(uri_owl_sameAs,esk192_0,uri_ex_u),
inference(rw,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_15,plain,
( iext(uri_owl_sameAs,X1,X2)
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_16,negated_conjecture,
~ iext(uri_owl_sameAs,uri_ex_u,esk192_0),
inference(rw,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,plain,
uri_ex_u = esk192_0,
inference(spm,[status(thm)],[c_0_6,c_0_14]) ).
cnf(c_0_18,plain,
iext(uri_owl_sameAs,X1,X1),
inference(er,[status(thm)],[c_0_15]) ).
cnf(c_0_19,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_17]),c_0_18])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWB006+1 : TPTP v8.1.0. Released v5.2.0.
% 0.03/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n026.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 00:11:56 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.25/1.44 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.25/1.44 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.25/1.44 # Preprocessing time : 0.027 s
% 0.25/1.44
% 0.25/1.44 # Failure: Out of unprocessed clauses!
% 0.25/1.44 # OLD status GaveUp
% 0.25/1.44 # Parsed axioms : 560
% 0.25/1.44 # Removed by relevancy pruning/SinE : 544
% 0.25/1.44 # Initial clauses : 19
% 0.25/1.44 # Removed in clause preprocessing : 11
% 0.25/1.44 # Initial clauses in saturation : 8
% 0.25/1.44 # Processed clauses : 9
% 0.25/1.44 # ...of these trivial : 0
% 0.25/1.44 # ...subsumed : 0
% 0.25/1.44 # ...remaining for further processing : 9
% 0.25/1.44 # Other redundant clauses eliminated : 1
% 0.25/1.44 # Clauses deleted for lack of memory : 0
% 0.25/1.44 # Backward-subsumed : 0
% 0.25/1.44 # Backward-rewritten : 0
% 0.25/1.44 # Generated clauses : 2
% 0.25/1.44 # ...of the previous two non-trivial : 1
% 0.25/1.44 # Contextual simplify-reflections : 0
% 0.25/1.44 # Paramodulations : 1
% 0.25/1.44 # Factorizations : 0
% 0.25/1.44 # Equation resolutions : 1
% 0.25/1.44 # Current number of processed clauses : 8
% 0.25/1.44 # Positive orientable unit clauses : 3
% 0.25/1.44 # Positive unorientable unit clauses: 0
% 0.25/1.44 # Negative unit clauses : 1
% 0.25/1.44 # Non-unit-clauses : 4
% 0.25/1.44 # Current number of unprocessed clauses: 0
% 0.25/1.44 # ...number of literals in the above : 0
% 0.25/1.44 # Current number of archived formulas : 0
% 0.25/1.44 # Current number of archived clauses : 1
% 0.25/1.44 # Clause-clause subsumption calls (NU) : 0
% 0.25/1.44 # Rec. Clause-clause subsumption calls : 0
% 0.25/1.44 # Non-unit clause-clause subsumptions : 0
% 0.25/1.44 # Unit Clause-clause subsumption calls : 0
% 0.25/1.44 # Rewrite failures with RHS unbound : 0
% 0.25/1.44 # BW rewrite match attempts : 2
% 0.25/1.44 # BW rewrite match successes : 0
% 0.25/1.44 # Condensation attempts : 0
% 0.25/1.44 # Condensation successes : 0
% 0.25/1.44 # Termbank termtop insertions : 7620
% 0.25/1.44
% 0.25/1.44 # -------------------------------------------------
% 0.25/1.44 # User time : 0.022 s
% 0.25/1.44 # System time : 0.005 s
% 0.25/1.44 # Total time : 0.027 s
% 0.25/1.44 # Maximum resident set size: 3640 pages
% 0.25/1.44 # Running protocol protocol_eprover_f171197f65f27d1ba69648a20c844832c84a5dd7 for 23 seconds:
% 0.25/1.44 # Preprocessing time : 0.092 s
% 0.25/1.44
% 0.25/1.44 # Proof found!
% 0.25/1.44 # SZS status Theorem
% 0.25/1.44 # SZS output start CNFRefutation
% See solution above
% 0.25/1.44 # Proof object total steps : 20
% 0.25/1.44 # Proof object clause steps : 13
% 0.25/1.44 # Proof object formula steps : 7
% 0.25/1.44 # Proof object conjectures : 6
% 0.25/1.44 # Proof object clause conjectures : 3
% 0.25/1.44 # Proof object formula conjectures : 3
% 0.25/1.44 # Proof object initial clauses used : 6
% 0.25/1.44 # Proof object initial formulas used : 3
% 0.25/1.44 # Proof object generating inferences : 3
% 0.25/1.44 # Proof object simplifying inferences : 6
% 0.25/1.44 # Training examples: 0 positive, 0 negative
% 0.25/1.44 # Parsed axioms : 560
% 0.25/1.44 # Removed by relevancy pruning/SinE : 0
% 0.25/1.44 # Initial clauses : 1270
% 0.25/1.44 # Removed in clause preprocessing : 111
% 0.25/1.44 # Initial clauses in saturation : 1159
% 0.25/1.44 # Processed clauses : 1368
% 0.25/1.44 # ...of these trivial : 65
% 0.25/1.44 # ...subsumed : 76
% 0.25/1.44 # ...remaining for further processing : 1227
% 0.25/1.44 # Other redundant clauses eliminated : 16
% 0.25/1.44 # Clauses deleted for lack of memory : 0
% 0.25/1.44 # Backward-subsumed : 7
% 0.25/1.44 # Backward-rewritten : 7
% 0.25/1.44 # Generated clauses : 37583
% 0.25/1.44 # ...of the previous two non-trivial : 37414
% 0.25/1.44 # Contextual simplify-reflections : 150
% 0.25/1.44 # Paramodulations : 37555
% 0.25/1.44 # Factorizations : 12
% 0.25/1.44 # Equation resolutions : 16
% 0.25/1.44 # Current number of processed clauses : 1197
% 0.25/1.44 # Positive orientable unit clauses : 270
% 0.25/1.44 # Positive unorientable unit clauses: 0
% 0.25/1.44 # Negative unit clauses : 23
% 0.25/1.44 # Non-unit-clauses : 904
% 0.25/1.44 # Current number of unprocessed clauses: 36875
% 0.25/1.44 # ...number of literals in the above : 297117
% 0.25/1.44 # Current number of archived formulas : 0
% 0.25/1.44 # Current number of archived clauses : 15
% 0.25/1.44 # Clause-clause subsumption calls (NU) : 591147
% 0.25/1.44 # Rec. Clause-clause subsumption calls : 30572
% 0.25/1.44 # Non-unit clause-clause subsumptions : 230
% 0.25/1.44 # Unit Clause-clause subsumption calls : 17206
% 0.25/1.44 # Rewrite failures with RHS unbound : 0
% 0.25/1.44 # BW rewrite match attempts : 36
% 0.25/1.44 # BW rewrite match successes : 3
% 0.25/1.44 # Condensation attempts : 0
% 0.25/1.44 # Condensation successes : 0
% 0.25/1.44 # Termbank termtop insertions : 833684
% 0.25/1.44
% 0.25/1.44 # -------------------------------------------------
% 0.25/1.44 # User time : 0.741 s
% 0.25/1.44 # System time : 0.028 s
% 0.25/1.44 # Total time : 0.769 s
% 0.25/1.44 # Maximum resident set size: 48020 pages
%------------------------------------------------------------------------------