TSTP Solution File: SWB023+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SWB023+1 : 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:02:03 EDT 2022
% Result : Theorem 0.18s 1.43s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 6
% Syntax : Number of formulae : 35 ( 11 unt; 0 def)
% Number of atoms : 127 ( 22 equ)
% Maximal formula atoms : 26 ( 3 avg)
% Number of connectives : 149 ( 57 ~; 57 |; 28 &)
% ( 5 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 17 ( 17 usr; 13 con; 0-3 aty)
% Number of variables : 58 ( 6 sgn 30 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(owl_char_functional,axiom,
! [X2] :
( icext(uri_owl_FunctionalProperty,X2)
<=> ( ip(X2)
& ! [X4,X27,X28] :
( ( iext(X2,X4,X27)
& iext(X2,X4,X28) )
=> X27 = X28 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWB001+0.ax',owl_char_functional) ).
fof(rdfs_cext_def,axiom,
! [X4,X5] :
( iext(uri_rdf_type,X4,X5)
<=> icext(X5,X4) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWB001+0.ax',rdfs_cext_def) ).
fof(testcase_premise_fullish_023_Unique_List_Components,axiom,
? [X42,X43] :
( iext(uri_rdf_type,uri_rdf_first,uri_owl_FunctionalProperty)
& iext(uri_rdf_type,uri_ex_w,X42)
& iext(uri_rdf_type,X42,uri_owl_Class)
& iext(uri_owl_oneOf,X42,X43)
& iext(uri_rdf_first,X43,uri_ex_u)
& iext(uri_rdf_first,X43,uri_ex_v)
& iext(uri_rdf_rest,X43,uri_rdf_nil) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',testcase_premise_fullish_023_Unique_List_Components) ).
fof(owl_enum_class_001,axiom,
! [X11,X12,X21] :
( ( iext(uri_rdf_first,X12,X21)
& iext(uri_rdf_rest,X12,uri_rdf_nil) )
=> ( iext(uri_owl_oneOf,X11,X12)
<=> ( ic(X11)
& ! [X4] :
( icext(X11,X4)
<=> X4 = X21 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWB001+0.ax',owl_enum_class_001) ).
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/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',testcase_conclusion_fullish_023_Unique_List_Components) ).
fof(owl_eqdis_sameas,axiom,
! [X4,X7] :
( iext(uri_owl_sameAs,X4,X7)
<=> X4 = X7 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWB001+0.ax',owl_eqdis_sameas) ).
fof(c_0_6,plain,
! [X29,X30,X31,X32,X29] :
( ( ip(X29)
| ~ icext(uri_owl_FunctionalProperty,X29) )
& ( ~ iext(X29,X30,X31)
| ~ iext(X29,X30,X32)
| X31 = X32
| ~ icext(uri_owl_FunctionalProperty,X29) )
& ( iext(X29,esk7_1(X29),esk8_1(X29))
| ~ ip(X29)
| icext(uri_owl_FunctionalProperty,X29) )
& ( iext(X29,esk7_1(X29),esk9_1(X29))
| ~ ip(X29)
| icext(uri_owl_FunctionalProperty,X29) )
& ( esk8_1(X29) != esk9_1(X29)
| ~ ip(X29)
| icext(uri_owl_FunctionalProperty,X29) ) ),
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_char_functional])])])])])])]) ).
fof(c_0_7,plain,
! [X6,X7,X6,X7] :
( ( ~ iext(uri_rdf_type,X6,X7)
| icext(X7,X6) )
& ( ~ icext(X7,X6)
| iext(uri_rdf_type,X6,X7) ) ),
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,plain,
( X2 = X3
| ~ icext(uri_owl_FunctionalProperty,X1)
| ~ iext(X1,X4,X3)
| ~ iext(X1,X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,plain,
( icext(X1,X2)
| ~ iext(uri_rdf_type,X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_10,plain,
( iext(uri_rdf_type,uri_rdf_first,uri_owl_FunctionalProperty)
& iext(uri_rdf_type,uri_ex_w,esk1_0)
& iext(uri_rdf_type,esk1_0,uri_owl_Class)
& iext(uri_owl_oneOf,esk1_0,esk2_0)
& iext(uri_rdf_first,esk2_0,uri_ex_u)
& iext(uri_rdf_first,esk2_0,uri_ex_v)
& iext(uri_rdf_rest,esk2_0,uri_rdf_nil) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[testcase_premise_fullish_023_Unique_List_Components])]) ).
fof(c_0_11,plain,
! [X22,X23,X24,X25,X25] :
( ( ic(X22)
| ~ iext(uri_owl_oneOf,X22,X23)
| ~ iext(uri_rdf_first,X23,X24)
| ~ iext(uri_rdf_rest,X23,uri_rdf_nil) )
& ( ~ icext(X22,X25)
| X25 = X24
| ~ iext(uri_owl_oneOf,X22,X23)
| ~ iext(uri_rdf_first,X23,X24)
| ~ iext(uri_rdf_rest,X23,uri_rdf_nil) )
& ( X25 != X24
| icext(X22,X25)
| ~ iext(uri_owl_oneOf,X22,X23)
| ~ iext(uri_rdf_first,X23,X24)
| ~ iext(uri_rdf_rest,X23,uri_rdf_nil) )
& ( ~ icext(X22,esk4_3(X22,X23,X24))
| esk4_3(X22,X23,X24) != X24
| ~ ic(X22)
| iext(uri_owl_oneOf,X22,X23)
| ~ iext(uri_rdf_first,X23,X24)
| ~ iext(uri_rdf_rest,X23,uri_rdf_nil) )
& ( icext(X22,esk4_3(X22,X23,X24))
| esk4_3(X22,X23,X24) = X24
| ~ ic(X22)
| iext(uri_owl_oneOf,X22,X23)
| ~ iext(uri_rdf_first,X23,X24)
| ~ iext(uri_rdf_rest,X23,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])])])])])])]) ).
cnf(c_0_12,plain,
( X1 = X2
| ~ iext(uri_rdf_type,X3,uri_owl_FunctionalProperty)
| ~ iext(X3,X4,X2)
| ~ iext(X3,X4,X1) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_13,plain,
iext(uri_rdf_type,uri_rdf_first,uri_owl_FunctionalProperty),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,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_11]) ).
cnf(c_0_15,plain,
iext(uri_rdf_first,esk2_0,uri_ex_u),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,plain,
iext(uri_rdf_rest,esk2_0,uri_rdf_nil),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
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(assume_negation,[status(cth)],[testcase_conclusion_fullish_023_Unique_List_Components]) ).
cnf(c_0_18,plain,
( X1 = X2
| ~ iext(uri_rdf_first,X3,X2)
| ~ iext(uri_rdf_first,X3,X1) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_19,plain,
( uri_ex_u = X1
| ~ icext(X2,X1)
| ~ iext(uri_owl_oneOf,X2,esk2_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16])]) ).
fof(c_0_20,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_17]) ).
cnf(c_0_21,plain,
( X1 = uri_ex_u
| ~ iext(uri_rdf_first,esk2_0,X1) ),
inference(spm,[status(thm)],[c_0_18,c_0_15]) ).
cnf(c_0_22,plain,
iext(uri_rdf_first,esk2_0,uri_ex_v),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_23,plain,
( uri_ex_u = X1
| ~ iext(uri_owl_oneOf,X2,esk2_0)
| ~ iext(uri_rdf_type,X1,X2) ),
inference(spm,[status(thm)],[c_0_19,c_0_9]) ).
cnf(c_0_24,plain,
iext(uri_owl_oneOf,esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_25,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])])])]) ).
cnf(c_0_26,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_20]) ).
cnf(c_0_27,plain,
uri_ex_v = uri_ex_u,
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_28,plain,
( uri_ex_u = X1
| ~ iext(uri_rdf_type,X1,esk1_0) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_29,plain,
iext(uri_rdf_type,uri_ex_w,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_30,plain,
( iext(uri_owl_sameAs,X1,X2)
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_31,negated_conjecture,
~ iext(uri_owl_sameAs,uri_ex_w,uri_ex_u),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_27])]) ).
cnf(c_0_32,plain,
uri_ex_w = uri_ex_u,
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_33,plain,
iext(uri_owl_sameAs,X1,X1),
inference(er,[status(thm)],[c_0_30]) ).
cnf(c_0_34,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_32]),c_0_33])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.10 % Problem : SWB023+1 : TPTP v8.1.0. Released v5.2.0.
% 0.03/0.11 % Command : run_ET %s %d
% 0.10/0.30 % Computer : n032.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 300
% 0.10/0.30 % WCLimit : 600
% 0.10/0.30 % DateTime : Wed Jun 1 14:58:29 EDT 2022
% 0.10/0.30 % CPUTime :
% 0.18/1.43 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.18/1.43 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.18/1.43 # Preprocessing time : 0.021 s
% 0.18/1.43
% 0.18/1.43 # Proof found!
% 0.18/1.43 # SZS status Theorem
% 0.18/1.43 # SZS output start CNFRefutation
% See solution above
% 0.18/1.43 # Proof object total steps : 35
% 0.18/1.43 # Proof object clause steps : 22
% 0.18/1.43 # Proof object formula steps : 13
% 0.18/1.43 # Proof object conjectures : 6
% 0.18/1.43 # Proof object clause conjectures : 3
% 0.18/1.43 # Proof object formula conjectures : 3
% 0.18/1.43 # Proof object initial clauses used : 11
% 0.18/1.43 # Proof object initial formulas used : 6
% 0.18/1.43 # Proof object generating inferences : 8
% 0.18/1.43 # Proof object simplifying inferences : 8
% 0.18/1.43 # Training examples: 0 positive, 0 negative
% 0.18/1.43 # Parsed axioms : 560
% 0.18/1.43 # Removed by relevancy pruning/SinE : 495
% 0.18/1.43 # Initial clauses : 122
% 0.18/1.43 # Removed in clause preprocessing : 15
% 0.18/1.43 # Initial clauses in saturation : 107
% 0.18/1.43 # Processed clauses : 487
% 0.18/1.43 # ...of these trivial : 29
% 0.18/1.43 # ...subsumed : 103
% 0.18/1.43 # ...remaining for further processing : 355
% 0.18/1.43 # Other redundant clauses eliminated : 11
% 0.18/1.43 # Clauses deleted for lack of memory : 0
% 0.18/1.43 # Backward-subsumed : 0
% 0.18/1.43 # Backward-rewritten : 8
% 0.18/1.43 # Generated clauses : 931
% 0.18/1.43 # ...of the previous two non-trivial : 662
% 0.18/1.43 # Contextual simplify-reflections : 16
% 0.18/1.43 # Paramodulations : 918
% 0.18/1.43 # Factorizations : 0
% 0.18/1.43 # Equation resolutions : 11
% 0.18/1.43 # Current number of processed clauses : 334
% 0.18/1.43 # Positive orientable unit clauses : 108
% 0.18/1.43 # Positive unorientable unit clauses: 0
% 0.18/1.43 # Negative unit clauses : 6
% 0.18/1.43 # Non-unit-clauses : 220
% 0.18/1.43 # Current number of unprocessed clauses: 269
% 0.18/1.43 # ...number of literals in the above : 1457
% 0.18/1.43 # Current number of archived formulas : 0
% 0.18/1.43 # Current number of archived clauses : 11
% 0.18/1.43 # Clause-clause subsumption calls (NU) : 8177
% 0.18/1.43 # Rec. Clause-clause subsumption calls : 3750
% 0.18/1.43 # Non-unit clause-clause subsumptions : 91
% 0.18/1.43 # Unit Clause-clause subsumption calls : 590
% 0.18/1.43 # Rewrite failures with RHS unbound : 0
% 0.18/1.43 # BW rewrite match attempts : 23
% 0.18/1.43 # BW rewrite match successes : 3
% 0.18/1.43 # Condensation attempts : 0
% 0.18/1.43 # Condensation successes : 0
% 0.18/1.43 # Termbank termtop insertions : 24857
% 0.18/1.43
% 0.18/1.43 # -------------------------------------------------
% 0.18/1.43 # User time : 0.037 s
% 0.18/1.43 # System time : 0.004 s
% 0.18/1.43 # Total time : 0.041 s
% 0.18/1.43 # Maximum resident set size: 5212 pages
% 0.18/23.41 eprover: CPU time limit exceeded, terminating
% 0.18/23.43 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.18/23.43 eprover: No such file or directory
% 0.18/23.43 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.18/23.43 eprover: No such file or directory
% 0.18/23.44 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.18/23.44 eprover: No such file or directory
% 0.18/23.44 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.18/23.44 eprover: No such file or directory
% 0.18/23.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.18/23.45 eprover: No such file or directory
% 0.18/23.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.18/23.45 eprover: No such file or directory
% 0.18/23.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.18/23.46 eprover: No such file or directory
% 0.18/23.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.18/23.46 eprover: No such file or directory
% 0.18/23.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.18/23.47 eprover: No such file or directory
% 0.18/23.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.18/23.47 eprover: No such file or directory
% 0.18/23.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.18/23.47 eprover: No such file or directory
%------------------------------------------------------------------------------