TSTP Solution File: SWB029+2 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SWB029+2 : 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:02:06 EDT 2022
% Result : Theorem 0.22s 1.40s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 4
% Syntax : Number of formulae : 30 ( 9 unt; 0 def)
% Number of atoms : 184 ( 0 equ)
% Maximal formula atoms : 71 ( 6 avg)
% Number of connectives : 264 ( 110 ~; 111 |; 37 &)
% ( 4 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 26 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 15 ( 15 usr; 14 con; 0-5 aty)
% Number of variables : 73 ( 8 sgn 26 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(owl_bool_intersectionof_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_intersectionOf,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_intersectionof_class_002) ).
fof(testcase_premise_fullish_029_Ex_Falso_Quodlibet,axiom,
? [X8,X9,X10,X11] :
( iext(uri_rdf_type,uri_ex_A,uri_owl_Class)
& iext(uri_rdf_type,uri_ex_B,uri_owl_Class)
& iext(uri_rdf_type,uri_ex_w,X8)
& iext(uri_owl_intersectionOf,X8,X10)
& iext(uri_rdf_first,X10,uri_ex_A)
& iext(uri_rdf_rest,X10,X11)
& iext(uri_rdf_first,X11,X9)
& iext(uri_rdf_rest,X11,uri_rdf_nil)
& iext(uri_owl_complementOf,X9,uri_ex_A) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',testcase_premise_fullish_029_Ex_Falso_Quodlibet) ).
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_bool_complementof_class,axiom,
! [X3,X2] :
( iext(uri_owl_complementOf,X3,X2)
=> ( ic(X3)
& ic(X2)
& ! [X1] :
( icext(X3,X1)
<=> ~ icext(X2,X1) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',owl_bool_complementof_class) ).
fof(c_0_4,plain,
! [X8,X9,X10,X11,X12,X13,X13] :
( ( ic(X8)
| ~ iext(uri_owl_intersectionOf,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_intersectionOf,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_intersectionOf,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_intersectionOf,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_intersectionOf,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(X12,X13)
| icext(X8,X13)
| ~ iext(uri_owl_intersectionOf,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_intersectionOf,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_intersectionOf,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_intersectionOf,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_intersectionof_class_002])])])])])])]) ).
fof(c_0_5,plain,
( iext(uri_rdf_type,uri_ex_A,uri_owl_Class)
& iext(uri_rdf_type,uri_ex_B,uri_owl_Class)
& iext(uri_rdf_type,uri_ex_w,esk2_0)
& iext(uri_owl_intersectionOf,esk2_0,esk4_0)
& iext(uri_rdf_first,esk4_0,uri_ex_A)
& iext(uri_rdf_rest,esk4_0,esk5_0)
& iext(uri_rdf_first,esk5_0,esk3_0)
& iext(uri_rdf_rest,esk5_0,uri_rdf_nil)
& iext(uri_owl_complementOf,esk3_0,uri_ex_A) ),
inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[testcase_premise_fullish_029_Ex_Falso_Quodlibet])])]) ).
cnf(c_0_6,plain,
( 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_intersectionOf,X5,X3)
| ~ icext(X5,X6) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,plain,
iext(uri_rdf_rest,esk5_0,uri_rdf_nil),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,plain,
( icext(X2,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_intersectionOf,X5,X3)
| ~ icext(X5,X6) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_9,plain,
( icext(X1,X2)
| ~ icext(X3,X2)
| ~ iext(uri_rdf_first,esk5_0,X4)
| ~ iext(uri_rdf_rest,X5,esk5_0)
| ~ iext(uri_rdf_first,X5,X1)
| ~ iext(uri_owl_intersectionOf,X3,X5) ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_10,plain,
iext(uri_rdf_first,esk5_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_11,plain,
( icext(X1,X2)
| ~ icext(X3,X2)
| ~ iext(uri_rdf_first,esk5_0,X1)
| ~ iext(uri_rdf_rest,X4,esk5_0)
| ~ iext(uri_rdf_first,X4,X5)
| ~ iext(uri_owl_intersectionOf,X3,X4) ),
inference(spm,[status(thm)],[c_0_8,c_0_7]) ).
cnf(c_0_12,plain,
iext(uri_rdf_first,esk4_0,uri_ex_A),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_13,plain,
iext(uri_rdf_rest,esk4_0,esk5_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_14,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_15,plain,
( icext(X1,X2)
| ~ icext(X3,X2)
| ~ iext(uri_rdf_rest,X4,esk5_0)
| ~ iext(uri_rdf_first,X4,X1)
| ~ iext(uri_owl_intersectionOf,X3,X4) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
fof(c_0_16,plain,
! [X4,X5,X6,X6] :
( ( ic(X4)
| ~ iext(uri_owl_complementOf,X4,X5) )
& ( ic(X5)
| ~ iext(uri_owl_complementOf,X4,X5) )
& ( ~ icext(X4,X6)
| ~ icext(X5,X6)
| ~ iext(uri_owl_complementOf,X4,X5) )
& ( icext(X5,X6)
| icext(X4,X6)
| ~ iext(uri_owl_complementOf,X4,X5) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[owl_bool_complementof_class])])])])])])]) ).
cnf(c_0_17,plain,
( icext(X1,X2)
| ~ icext(X3,X2)
| ~ iext(uri_rdf_first,esk5_0,X1)
| ~ iext(uri_owl_intersectionOf,X3,esk4_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13])]) ).
cnf(c_0_18,plain,
( icext(X1,X2)
| ~ iext(uri_rdf_type,X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_19,plain,
( icext(uri_ex_A,X1)
| ~ icext(X2,X1)
| ~ iext(uri_owl_intersectionOf,X2,esk4_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_12]),c_0_13])]) ).
cnf(c_0_20,plain,
( ~ iext(uri_owl_complementOf,X1,X2)
| ~ icext(X2,X3)
| ~ icext(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_21,plain,
iext(uri_owl_complementOf,esk3_0,uri_ex_A),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_22,plain,
( icext(X1,X2)
| ~ iext(uri_rdf_first,esk5_0,X1)
| ~ iext(uri_owl_intersectionOf,X3,esk4_0)
| ~ iext(uri_rdf_type,X2,X3) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_23,plain,
iext(uri_rdf_type,uri_ex_w,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_24,plain,
iext(uri_owl_intersectionOf,esk2_0,esk4_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_25,plain,
( icext(uri_ex_A,X1)
| ~ iext(uri_owl_intersectionOf,X2,esk4_0)
| ~ iext(uri_rdf_type,X1,X2) ),
inference(spm,[status(thm)],[c_0_19,c_0_18]) ).
cnf(c_0_26,plain,
( ~ icext(uri_ex_A,X1)
| ~ icext(esk3_0,X1) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_27,plain,
( icext(X1,uri_ex_w)
| ~ iext(uri_rdf_first,esk5_0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24])]) ).
cnf(c_0_28,plain,
icext(uri_ex_A,uri_ex_w),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_23]),c_0_24])]) ).
cnf(c_0_29,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28]),c_0_10])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : SWB029+2 : TPTP v8.1.0. Released v5.2.0.
% 0.07/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 05:24:11 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.22/1.40 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.22/1.40 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.22/1.40 # Preprocessing time : 0.013 s
% 0.22/1.40
% 0.22/1.40 # Failure: Out of unprocessed clauses!
% 0.22/1.40 # OLD status GaveUp
% 0.22/1.40 # Parsed axioms : 5
% 0.22/1.40 # Removed by relevancy pruning/SinE : 3
% 0.22/1.40 # Initial clauses : 3
% 0.22/1.40 # Removed in clause preprocessing : 0
% 0.22/1.40 # Initial clauses in saturation : 3
% 0.22/1.40 # Processed clauses : 3
% 0.22/1.40 # ...of these trivial : 0
% 0.22/1.40 # ...subsumed : 0
% 0.22/1.40 # ...remaining for further processing : 3
% 0.22/1.40 # Other redundant clauses eliminated : 0
% 0.22/1.40 # Clauses deleted for lack of memory : 0
% 0.22/1.40 # Backward-subsumed : 0
% 0.22/1.40 # Backward-rewritten : 0
% 0.22/1.40 # Generated clauses : 1
% 0.22/1.40 # ...of the previous two non-trivial : 0
% 0.22/1.40 # Contextual simplify-reflections : 0
% 0.22/1.40 # Paramodulations : 1
% 0.22/1.40 # Factorizations : 0
% 0.22/1.40 # Equation resolutions : 0
% 0.22/1.40 # Current number of processed clauses : 3
% 0.22/1.40 # Positive orientable unit clauses : 0
% 0.22/1.40 # Positive unorientable unit clauses: 0
% 0.22/1.40 # Negative unit clauses : 1
% 0.22/1.40 # Non-unit-clauses : 2
% 0.22/1.40 # Current number of unprocessed clauses: 0
% 0.22/1.40 # ...number of literals in the above : 0
% 0.22/1.40 # Current number of archived formulas : 0
% 0.22/1.40 # Current number of archived clauses : 0
% 0.22/1.40 # Clause-clause subsumption calls (NU) : 0
% 0.22/1.40 # Rec. Clause-clause subsumption calls : 0
% 0.22/1.40 # Non-unit clause-clause subsumptions : 0
% 0.22/1.40 # Unit Clause-clause subsumption calls : 0
% 0.22/1.40 # Rewrite failures with RHS unbound : 0
% 0.22/1.40 # BW rewrite match attempts : 0
% 0.22/1.40 # BW rewrite match successes : 0
% 0.22/1.40 # Condensation attempts : 0
% 0.22/1.40 # Condensation successes : 0
% 0.22/1.40 # Termbank termtop insertions : 251
% 0.22/1.40
% 0.22/1.40 # -------------------------------------------------
% 0.22/1.40 # User time : 0.012 s
% 0.22/1.40 # System time : 0.001 s
% 0.22/1.40 # Total time : 0.013 s
% 0.22/1.40 # Maximum resident set size: 2780 pages
% 0.22/1.40 # Running protocol protocol_eprover_f171197f65f27d1ba69648a20c844832c84a5dd7 for 23 seconds:
% 0.22/1.40 # Preprocessing time : 0.015 s
% 0.22/1.40
% 0.22/1.40 # Proof found!
% 0.22/1.40 # SZS status Theorem
% 0.22/1.40 # SZS output start CNFRefutation
% See solution above
% 0.22/1.40 # Proof object total steps : 30
% 0.22/1.40 # Proof object clause steps : 22
% 0.22/1.40 # Proof object formula steps : 8
% 0.22/1.40 # Proof object conjectures : 0
% 0.22/1.40 # Proof object clause conjectures : 0
% 0.22/1.40 # Proof object formula conjectures : 0
% 0.22/1.40 # Proof object initial clauses used : 11
% 0.22/1.40 # Proof object initial formulas used : 4
% 0.22/1.40 # Proof object generating inferences : 11
% 0.22/1.40 # Proof object simplifying inferences : 11
% 0.22/1.40 # Training examples: 0 positive, 0 negative
% 0.22/1.40 # Parsed axioms : 5
% 0.22/1.40 # Removed by relevancy pruning/SinE : 0
% 0.22/1.40 # Initial clauses : 25
% 0.22/1.40 # Removed in clause preprocessing : 0
% 0.22/1.40 # Initial clauses in saturation : 25
% 0.22/1.40 # Processed clauses : 59
% 0.22/1.40 # ...of these trivial : 1
% 0.22/1.40 # ...subsumed : 0
% 0.22/1.40 # ...remaining for further processing : 58
% 0.22/1.40 # Other redundant clauses eliminated : 0
% 0.22/1.40 # Clauses deleted for lack of memory : 0
% 0.22/1.40 # Backward-subsumed : 5
% 0.22/1.40 # Backward-rewritten : 0
% 0.22/1.40 # Generated clauses : 75
% 0.22/1.40 # ...of the previous two non-trivial : 62
% 0.22/1.40 # Contextual simplify-reflections : 0
% 0.22/1.40 # Paramodulations : 75
% 0.22/1.41 # Factorizations : 0
% 0.22/1.41 # Equation resolutions : 0
% 0.22/1.41 # Current number of processed clauses : 53
% 0.22/1.41 # Positive orientable unit clauses : 13
% 0.22/1.41 # Positive unorientable unit clauses: 0
% 0.22/1.41 # Negative unit clauses : 2
% 0.22/1.41 # Non-unit-clauses : 38
% 0.22/1.41 # Current number of unprocessed clauses: 27
% 0.22/1.41 # ...number of literals in the above : 123
% 0.22/1.41 # Current number of archived formulas : 0
% 0.22/1.41 # Current number of archived clauses : 5
% 0.22/1.41 # Clause-clause subsumption calls (NU) : 537
% 0.22/1.41 # Rec. Clause-clause subsumption calls : 137
% 0.22/1.41 # Non-unit clause-clause subsumptions : 5
% 0.22/1.41 # Unit Clause-clause subsumption calls : 61
% 0.22/1.41 # Rewrite failures with RHS unbound : 0
% 0.22/1.41 # BW rewrite match attempts : 4
% 0.22/1.41 # BW rewrite match successes : 0
% 0.22/1.41 # Condensation attempts : 0
% 0.22/1.41 # Condensation successes : 0
% 0.22/1.41 # Termbank termtop insertions : 3170
% 0.22/1.41
% 0.22/1.41 # -------------------------------------------------
% 0.22/1.41 # User time : 0.018 s
% 0.22/1.41 # System time : 0.001 s
% 0.22/1.41 # Total time : 0.019 s
% 0.22/1.41 # Maximum resident set size: 2900 pages
%------------------------------------------------------------------------------