TSTP Solution File: SWB030+2 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SWB030+2 : TPTP v8.1.2. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n018.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 19:37:08 EDT 2023
% Result : Unsatisfiable 0.23s 0.55s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 4
% Syntax : Number of formulae : 30 ( 7 unt; 0 def)
% Number of atoms : 91 ( 0 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 98 ( 37 ~; 36 |; 18 &)
% ( 4 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 11 ( 11 usr; 10 con; 0-2 aty)
% Number of variables : 50 ( 2 sgn; 21 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
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/sandbox2/tmp/tmp.yKt3fjlk20/E---3.1_2408.p',owl_bool_complementof_class) ).
fof(testcase_premise_fullish_030_Bad_Class,axiom,
? [X6] :
( iext(uri_rdf_type,uri_ex_c,uri_owl_Class)
& iext(uri_owl_complementOf,uri_ex_c,X6)
& iext(uri_rdf_type,X6,uri_owl_Restriction)
& iext(uri_owl_onProperty,X6,uri_rdf_type)
& iext(uri_owl_hasSelf,X6,literal_typed(dat_str_true,uri_xsd_boolean)) ),
file('/export/starexec/sandbox2/tmp/tmp.yKt3fjlk20/E---3.1_2408.p',testcase_premise_fullish_030_Bad_Class) ).
fof(owl_restrict_hasself,axiom,
! [X3,X4,X5] :
( ( iext(uri_owl_hasSelf,X3,X5)
& iext(uri_owl_onProperty,X3,X4) )
=> ! [X1] :
( icext(X3,X1)
<=> iext(X4,X1,X1) ) ),
file('/export/starexec/sandbox2/tmp/tmp.yKt3fjlk20/E---3.1_2408.p',owl_restrict_hasself) ).
fof(rdfs_cext_def,axiom,
! [X1,X2] :
( iext(uri_rdf_type,X1,X2)
<=> icext(X2,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.yKt3fjlk20/E---3.1_2408.p',rdfs_cext_def) ).
fof(c_0_4,plain,
! [X3,X2] :
( iext(uri_owl_complementOf,X3,X2)
=> ( ic(X3)
& ic(X2)
& ! [X1] :
( icext(X3,X1)
<=> ~ icext(X2,X1) ) ) ),
inference(fof_simplification,[status(thm)],[owl_bool_complementof_class]) ).
fof(c_0_5,plain,
! [X13,X14,X15] :
( ( ic(X13)
| ~ iext(uri_owl_complementOf,X13,X14) )
& ( ic(X14)
| ~ iext(uri_owl_complementOf,X13,X14) )
& ( ~ icext(X13,X15)
| ~ icext(X14,X15)
| ~ iext(uri_owl_complementOf,X13,X14) )
& ( icext(X14,X15)
| icext(X13,X15)
| ~ iext(uri_owl_complementOf,X13,X14) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])]) ).
fof(c_0_6,plain,
( iext(uri_rdf_type,uri_ex_c,uri_owl_Class)
& iext(uri_owl_complementOf,uri_ex_c,esk1_0)
& iext(uri_rdf_type,esk1_0,uri_owl_Restriction)
& iext(uri_owl_onProperty,esk1_0,uri_rdf_type)
& iext(uri_owl_hasSelf,esk1_0,literal_typed(dat_str_true,uri_xsd_boolean)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[testcase_premise_fullish_030_Bad_Class])]) ).
fof(c_0_7,plain,
! [X9,X10,X11,X12] :
( ( ~ icext(X9,X12)
| iext(X10,X12,X12)
| ~ iext(uri_owl_hasSelf,X9,X11)
| ~ iext(uri_owl_onProperty,X9,X10) )
& ( ~ iext(X10,X12,X12)
| icext(X9,X12)
| ~ iext(uri_owl_hasSelf,X9,X11)
| ~ iext(uri_owl_onProperty,X9,X10) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[owl_restrict_hasself])])])]) ).
fof(c_0_8,plain,
! [X7,X8] :
( ( ~ iext(uri_rdf_type,X7,X8)
| icext(X8,X7) )
& ( ~ icext(X8,X7)
| iext(uri_rdf_type,X7,X8) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[rdfs_cext_def])]) ).
cnf(c_0_9,plain,
( icext(X1,X2)
| icext(X3,X2)
| ~ iext(uri_owl_complementOf,X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,plain,
iext(uri_owl_complementOf,uri_ex_c,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,plain,
( icext(X3,X2)
| ~ iext(X1,X2,X2)
| ~ iext(uri_owl_hasSelf,X3,X4)
| ~ iext(uri_owl_onProperty,X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
iext(uri_owl_hasSelf,esk1_0,literal_typed(dat_str_true,uri_xsd_boolean)),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_13,plain,
( iext(uri_rdf_type,X2,X1)
| ~ icext(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,plain,
( icext(esk1_0,X1)
| icext(uri_ex_c,X1) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_15,plain,
( icext(esk1_0,X1)
| ~ iext(uri_owl_onProperty,esk1_0,X2)
| ~ iext(X2,X1,X1) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,plain,
iext(uri_owl_onProperty,esk1_0,uri_rdf_type),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_17,plain,
( icext(esk1_0,X1)
| iext(uri_rdf_type,X1,uri_ex_c) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,plain,
( iext(X3,X2,X2)
| ~ icext(X1,X2)
| ~ iext(uri_owl_hasSelf,X1,X4)
| ~ iext(uri_owl_onProperty,X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_19,plain,
( icext(esk1_0,X1)
| ~ iext(uri_rdf_type,X1,X1) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,plain,
( iext(uri_rdf_type,X1,uri_ex_c)
| iext(uri_rdf_type,X1,esk1_0) ),
inference(spm,[status(thm)],[c_0_13,c_0_17]) ).
cnf(c_0_21,plain,
( icext(X2,X1)
| ~ iext(uri_rdf_type,X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_22,plain,
( iext(X1,X2,X2)
| ~ icext(esk1_0,X2)
| ~ iext(uri_owl_onProperty,esk1_0,X1) ),
inference(spm,[status(thm)],[c_0_18,c_0_12]) ).
cnf(c_0_23,plain,
icext(esk1_0,uri_ex_c),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]) ).
cnf(c_0_24,plain,
( ~ icext(X1,X2)
| ~ icext(X3,X2)
| ~ iext(uri_owl_complementOf,X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_25,plain,
( iext(X1,uri_ex_c,uri_ex_c)
| ~ iext(uri_owl_onProperty,esk1_0,X1) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_26,plain,
( ~ icext(esk1_0,X1)
| ~ icext(uri_ex_c,X1) ),
inference(spm,[status(thm)],[c_0_24,c_0_10]) ).
cnf(c_0_27,plain,
iext(uri_rdf_type,uri_ex_c,uri_ex_c),
inference(spm,[status(thm)],[c_0_25,c_0_16]) ).
cnf(c_0_28,plain,
~ icext(uri_ex_c,uri_ex_c),
inference(spm,[status(thm)],[c_0_26,c_0_23]) ).
cnf(c_0_29,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_27]),c_0_28]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : SWB030+2 : TPTP v8.1.2. Released v5.2.0.
% 0.16/0.16 % Command : run_E %s %d THM
% 0.16/0.38 % Computer : n018.cluster.edu
% 0.16/0.38 % Model : x86_64 x86_64
% 0.16/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.38 % Memory : 8042.1875MB
% 0.16/0.38 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.38 % CPULimit : 2400
% 0.16/0.38 % WCLimit : 300
% 0.16/0.38 % DateTime : Mon Oct 2 20:31:24 EDT 2023
% 0.16/0.38 % CPUTime :
% 0.23/0.53 Running first-order theorem proving
% 0.23/0.53 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.yKt3fjlk20/E---3.1_2408.p
% 0.23/0.55 # Version: 3.1pre001
% 0.23/0.55 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.23/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.55 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.23/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.23/0.55 # Starting new_bool_1 with 300s (1) cores
% 0.23/0.55 # Starting sh5l with 300s (1) cores
% 0.23/0.55 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 2490 completed with status 0
% 0.23/0.55 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.23/0.55 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.23/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.55 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.23/0.55 # No SInE strategy applied
% 0.23/0.55 # Search class: FGHNF-FFSS22-SFFFFFNN
% 0.23/0.55 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.23/0.55 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.23/0.55 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.23/0.55 # Starting new_bool_3 with 136s (1) cores
% 0.23/0.55 # Starting new_bool_1 with 136s (1) cores
% 0.23/0.55 # Starting sh5l with 136s (1) cores
% 0.23/0.55 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 2503 completed with status 0
% 0.23/0.55 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.23/0.55 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.23/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.55 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.23/0.55 # No SInE strategy applied
% 0.23/0.55 # Search class: FGHNF-FFSS22-SFFFFFNN
% 0.23/0.55 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.23/0.55 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.23/0.55 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.23/0.55 # Preprocessing time : 0.001 s
% 0.23/0.55 # Presaturation interreduction done
% 0.23/0.55
% 0.23/0.55 # Proof found!
% 0.23/0.55 # SZS status Unsatisfiable
% 0.23/0.55 # SZS output start CNFRefutation
% See solution above
% 0.23/0.55 # Parsed axioms : 4
% 0.23/0.55 # Removed by relevancy pruning/SinE : 0
% 0.23/0.55 # Initial clauses : 13
% 0.23/0.55 # Removed in clause preprocessing : 0
% 0.23/0.55 # Initial clauses in saturation : 13
% 0.23/0.55 # Processed clauses : 47
% 0.23/0.55 # ...of these trivial : 1
% 0.23/0.55 # ...subsumed : 2
% 0.23/0.55 # ...remaining for further processing : 44
% 0.23/0.55 # Other redundant clauses eliminated : 0
% 0.23/0.55 # Clauses deleted for lack of memory : 0
% 0.23/0.55 # Backward-subsumed : 0
% 0.23/0.55 # Backward-rewritten : 0
% 0.23/0.55 # Generated clauses : 28
% 0.23/0.55 # ...of the previous two non-redundant : 22
% 0.23/0.55 # ...aggressively subsumed : 0
% 0.23/0.55 # Contextual simplify-reflections : 1
% 0.23/0.55 # Paramodulations : 28
% 0.23/0.55 # Factorizations : 0
% 0.23/0.55 # NegExts : 0
% 0.23/0.55 # Equation resolutions : 0
% 0.23/0.55 # Total rewrite steps : 5
% 0.23/0.55 # Propositional unsat checks : 0
% 0.23/0.55 # Propositional check models : 0
% 0.23/0.55 # Propositional check unsatisfiable : 0
% 0.23/0.55 # Propositional clauses : 0
% 0.23/0.55 # Propositional clauses after purity: 0
% 0.23/0.55 # Propositional unsat core size : 0
% 0.23/0.55 # Propositional preprocessing time : 0.000
% 0.23/0.55 # Propositional encoding time : 0.000
% 0.23/0.55 # Propositional solver time : 0.000
% 0.23/0.55 # Success case prop preproc time : 0.000
% 0.23/0.55 # Success case prop encoding time : 0.000
% 0.23/0.55 # Success case prop solver time : 0.000
% 0.23/0.55 # Current number of processed clauses : 31
% 0.23/0.55 # Positive orientable unit clauses : 12
% 0.23/0.55 # Positive unorientable unit clauses: 0
% 0.23/0.55 # Negative unit clauses : 1
% 0.23/0.55 # Non-unit-clauses : 18
% 0.23/0.55 # Current number of unprocessed clauses: 1
% 0.23/0.55 # ...number of literals in the above : 2
% 0.23/0.55 # Current number of archived formulas : 0
% 0.23/0.55 # Current number of archived clauses : 13
% 0.23/0.55 # Clause-clause subsumption calls (NU) : 44
% 0.23/0.55 # Rec. Clause-clause subsumption calls : 41
% 0.23/0.55 # Non-unit clause-clause subsumptions : 3
% 0.23/0.55 # Unit Clause-clause subsumption calls : 13
% 0.23/0.55 # Rewrite failures with RHS unbound : 0
% 0.23/0.55 # BW rewrite match attempts : 3
% 0.23/0.55 # BW rewrite match successes : 0
% 0.23/0.55 # Condensation attempts : 0
% 0.23/0.55 # Condensation successes : 0
% 0.23/0.55 # Termbank termtop insertions : 1009
% 0.23/0.55
% 0.23/0.55 # -------------------------------------------------
% 0.23/0.55 # User time : 0.006 s
% 0.23/0.55 # System time : 0.002 s
% 0.23/0.55 # Total time : 0.008 s
% 0.23/0.55 # Maximum resident set size: 1704 pages
% 0.23/0.55
% 0.23/0.55 # -------------------------------------------------
% 0.23/0.55 # User time : 0.023 s
% 0.23/0.55 # System time : 0.004 s
% 0.23/0.55 # Total time : 0.028 s
% 0.23/0.55 # Maximum resident set size: 1680 pages
% 0.23/0.55 % E---3.1 exiting
% 0.23/0.55 % E---3.1 exiting
%------------------------------------------------------------------------------