TSTP Solution File: SWB009+3 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SWB009+3 : TPTP v8.1.2. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n025.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:35:59 EDT 2023
% Result : Theorem 0.22s 0.59s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 4
% Syntax : Number of formulae : 26 ( 8 unt; 0 def)
% Number of atoms : 74 ( 0 equ)
% Maximal formula atoms : 13 ( 2 avg)
% Number of connectives : 80 ( 32 ~; 28 |; 17 &)
% ( 2 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 11 ( 11 usr; 10 con; 0-4 aty)
% Number of variables : 38 ( 0 sgn; 15 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(owl_restrict_somevaluesfrom,axiom,
! [X1,X11,X2] :
( ( iext(uri_owl_someValuesFrom,X1,X2)
& iext(uri_owl_onProperty,X1,X11) )
=> ! [X3] :
( icext(X1,X3)
<=> ? [X10] :
( iext(X11,X3,X10)
& icext(X2,X10) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.49z21FzxJd/E---3.1_15519.p',owl_restrict_somevaluesfrom) ).
fof(testcase_premise_fullish_009_Existential_Restriction_Entailments,axiom,
? [X22] :
( iext(uri_rdf_type,uri_ex_p,uri_owl_ObjectProperty)
& iext(uri_rdf_type,uri_ex_c,uri_owl_Class)
& iext(uri_rdf_type,uri_ex_s,X22)
& iext(uri_rdf_type,X22,uri_owl_Restriction)
& iext(uri_owl_onProperty,X22,uri_ex_p)
& iext(uri_owl_someValuesFrom,X22,uri_ex_c) ),
file('/export/starexec/sandbox/tmp/tmp.49z21FzxJd/E---3.1_15519.p',testcase_premise_fullish_009_Existential_Restriction_Entailments) ).
fof(rdfs_cext_def,axiom,
! [X3,X2] :
( iext(uri_rdf_type,X3,X2)
<=> icext(X2,X3) ),
file('/export/starexec/sandbox/tmp/tmp.49z21FzxJd/E---3.1_15519.p',rdfs_cext_def) ).
fof(testcase_conclusion_fullish_009_Existential_Restriction_Entailments,conjecture,
? [X21] :
( iext(uri_ex_p,uri_ex_s,X21)
& iext(uri_rdf_type,X21,uri_ex_c) ),
file('/export/starexec/sandbox/tmp/tmp.49z21FzxJd/E---3.1_15519.p',testcase_conclusion_fullish_009_Existential_Restriction_Entailments) ).
fof(c_0_4,plain,
! [X70,X71,X72,X73,X75,X76] :
( ( iext(X71,X73,esk7_4(X70,X71,X72,X73))
| ~ icext(X70,X73)
| ~ iext(uri_owl_someValuesFrom,X70,X72)
| ~ iext(uri_owl_onProperty,X70,X71) )
& ( icext(X72,esk7_4(X70,X71,X72,X73))
| ~ icext(X70,X73)
| ~ iext(uri_owl_someValuesFrom,X70,X72)
| ~ iext(uri_owl_onProperty,X70,X71) )
& ( ~ iext(X71,X75,X76)
| ~ icext(X72,X76)
| icext(X70,X75)
| ~ iext(uri_owl_someValuesFrom,X70,X72)
| ~ iext(uri_owl_onProperty,X70,X71) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[owl_restrict_somevaluesfrom])])])])])]) ).
fof(c_0_5,plain,
( iext(uri_rdf_type,uri_ex_p,uri_owl_ObjectProperty)
& iext(uri_rdf_type,uri_ex_c,uri_owl_Class)
& iext(uri_rdf_type,uri_ex_s,esk1_0)
& iext(uri_rdf_type,esk1_0,uri_owl_Restriction)
& iext(uri_owl_onProperty,esk1_0,uri_ex_p)
& iext(uri_owl_someValuesFrom,esk1_0,uri_ex_c) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[testcase_premise_fullish_009_Existential_Restriction_Entailments])]) ).
fof(c_0_6,plain,
! [X24,X25] :
( ( ~ iext(uri_rdf_type,X24,X25)
| icext(X25,X24) )
& ( ~ icext(X25,X24)
| iext(uri_rdf_type,X24,X25) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[rdfs_cext_def])]) ).
cnf(c_0_7,plain,
( icext(X1,esk7_4(X2,X3,X1,X4))
| ~ icext(X2,X4)
| ~ iext(uri_owl_someValuesFrom,X2,X1)
| ~ iext(uri_owl_onProperty,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,plain,
iext(uri_owl_onProperty,esk1_0,uri_ex_p),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
( icext(X2,X1)
| ~ iext(uri_rdf_type,X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
iext(uri_rdf_type,uri_ex_s,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_11,plain,
( icext(X1,esk7_4(esk1_0,uri_ex_p,X1,X2))
| ~ icext(esk1_0,X2)
| ~ iext(uri_owl_someValuesFrom,esk1_0,X1) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_12,plain,
icext(esk1_0,uri_ex_s),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
fof(c_0_13,negated_conjecture,
~ ? [X21] :
( iext(uri_ex_p,uri_ex_s,X21)
& iext(uri_rdf_type,X21,uri_ex_c) ),
inference(assume_negation,[status(cth)],[testcase_conclusion_fullish_009_Existential_Restriction_Entailments]) ).
cnf(c_0_14,plain,
( icext(X1,esk7_4(esk1_0,uri_ex_p,X1,uri_ex_s))
| ~ iext(uri_owl_someValuesFrom,esk1_0,X1) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,plain,
iext(uri_owl_someValuesFrom,esk1_0,uri_ex_c),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_16,plain,
( iext(X1,X2,esk7_4(X3,X1,X4,X2))
| ~ icext(X3,X2)
| ~ iext(uri_owl_someValuesFrom,X3,X4)
| ~ iext(uri_owl_onProperty,X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
fof(c_0_17,negated_conjecture,
! [X23] :
( ~ iext(uri_ex_p,uri_ex_s,X23)
| ~ iext(uri_rdf_type,X23,uri_ex_c) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])]) ).
cnf(c_0_18,plain,
( iext(uri_rdf_type,X2,X1)
| ~ icext(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_19,plain,
icext(uri_ex_c,esk7_4(esk1_0,uri_ex_p,uri_ex_c,uri_ex_s)),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_20,plain,
( iext(uri_ex_p,X1,esk7_4(esk1_0,uri_ex_p,X2,X1))
| ~ icext(esk1_0,X1)
| ~ iext(uri_owl_someValuesFrom,esk1_0,X2) ),
inference(spm,[status(thm)],[c_0_16,c_0_8]) ).
cnf(c_0_21,negated_conjecture,
( ~ iext(uri_ex_p,uri_ex_s,X1)
| ~ iext(uri_rdf_type,X1,uri_ex_c) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_22,plain,
iext(uri_rdf_type,esk7_4(esk1_0,uri_ex_p,uri_ex_c,uri_ex_s),uri_ex_c),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_23,plain,
( iext(uri_ex_p,uri_ex_s,esk7_4(esk1_0,uri_ex_p,X1,uri_ex_s))
| ~ iext(uri_owl_someValuesFrom,esk1_0,X1) ),
inference(spm,[status(thm)],[c_0_20,c_0_12]) ).
cnf(c_0_24,negated_conjecture,
~ iext(uri_ex_p,uri_ex_s,esk7_4(esk1_0,uri_ex_p,uri_ex_c,uri_ex_s)),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_25,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_15]),c_0_24]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SWB009+3 : TPTP v8.1.2. Released v5.2.0.
% 0.00/0.15 % Command : run_E %s %d THM
% 0.15/0.36 % Computer : n025.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 2400
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Mon Oct 2 20:41:36 EDT 2023
% 0.15/0.36 % CPUTime :
% 0.22/0.50 Running first-order theorem proving
% 0.22/0.50 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.49z21FzxJd/E---3.1_15519.p
% 0.22/0.59 # Version: 3.1pre001
% 0.22/0.59 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.22/0.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.59 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.22/0.59 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.59 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.59 # Starting sh5l with 300s (1) cores
% 0.22/0.59 # sh5l with pid 15600 completed with status 0
% 0.22/0.59 # Result found by sh5l
% 0.22/0.59 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.22/0.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.59 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.22/0.59 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.59 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.59 # Starting sh5l with 300s (1) cores
% 0.22/0.59 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.22/0.59 # Search class: FGHNF-FSLM33-SFFFFFNN
% 0.22/0.59 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.59 # Starting G-E--_207_C41_F1_AE_CS_SP_PI_S4S with 163s (1) cores
% 0.22/0.59 # G-E--_207_C41_F1_AE_CS_SP_PI_S4S with pid 15603 completed with status 0
% 0.22/0.59 # Result found by G-E--_207_C41_F1_AE_CS_SP_PI_S4S
% 0.22/0.59 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.22/0.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.59 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.22/0.59 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.59 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.59 # Starting sh5l with 300s (1) cores
% 0.22/0.59 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.22/0.59 # Search class: FGHNF-FSLM33-SFFFFFNN
% 0.22/0.59 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.59 # Starting G-E--_207_C41_F1_AE_CS_SP_PI_S4S with 163s (1) cores
% 0.22/0.59 # Preprocessing time : 0.004 s
% 0.22/0.59
% 0.22/0.59 # Proof found!
% 0.22/0.59 # SZS status Theorem
% 0.22/0.59 # SZS output start CNFRefutation
% See solution above
% 0.22/0.59 # Parsed axioms : 140
% 0.22/0.59 # Removed by relevancy pruning/SinE : 31
% 0.22/0.59 # Initial clauses : 212
% 0.22/0.59 # Removed in clause preprocessing : 0
% 0.22/0.59 # Initial clauses in saturation : 212
% 0.22/0.59 # Processed clauses : 896
% 0.22/0.59 # ...of these trivial : 125
% 0.22/0.59 # ...subsumed : 181
% 0.22/0.59 # ...remaining for further processing : 590
% 0.22/0.59 # Other redundant clauses eliminated : 0
% 0.22/0.59 # Clauses deleted for lack of memory : 0
% 0.22/0.59 # Backward-subsumed : 4
% 0.22/0.59 # Backward-rewritten : 1
% 0.22/0.59 # Generated clauses : 1303
% 0.22/0.59 # ...of the previous two non-redundant : 867
% 0.22/0.59 # ...aggressively subsumed : 0
% 0.22/0.59 # Contextual simplify-reflections : 5
% 0.22/0.59 # Paramodulations : 1303
% 0.22/0.59 # Factorizations : 0
% 0.22/0.59 # NegExts : 0
% 0.22/0.59 # Equation resolutions : 0
% 0.22/0.59 # Total rewrite steps : 780
% 0.22/0.59 # Propositional unsat checks : 0
% 0.22/0.59 # Propositional check models : 0
% 0.22/0.59 # Propositional check unsatisfiable : 0
% 0.22/0.59 # Propositional clauses : 0
% 0.22/0.59 # Propositional clauses after purity: 0
% 0.22/0.59 # Propositional unsat core size : 0
% 0.22/0.59 # Propositional preprocessing time : 0.000
% 0.22/0.59 # Propositional encoding time : 0.000
% 0.22/0.59 # Propositional solver time : 0.000
% 0.22/0.59 # Success case prop preproc time : 0.000
% 0.22/0.59 # Success case prop encoding time : 0.000
% 0.22/0.59 # Success case prop solver time : 0.000
% 0.22/0.59 # Current number of processed clauses : 585
% 0.22/0.59 # Positive orientable unit clauses : 196
% 0.22/0.59 # Positive unorientable unit clauses: 0
% 0.22/0.59 # Negative unit clauses : 1
% 0.22/0.59 # Non-unit-clauses : 388
% 0.22/0.59 # Current number of unprocessed clauses: 183
% 0.22/0.59 # ...number of literals in the above : 681
% 0.22/0.59 # Current number of archived formulas : 0
% 0.22/0.59 # Current number of archived clauses : 5
% 0.22/0.59 # Clause-clause subsumption calls (NU) : 40847
% 0.22/0.59 # Rec. Clause-clause subsumption calls : 18188
% 0.22/0.59 # Non-unit clause-clause subsumptions : 190
% 0.22/0.59 # Unit Clause-clause subsumption calls : 3916
% 0.22/0.59 # Rewrite failures with RHS unbound : 0
% 0.22/0.59 # BW rewrite match attempts : 50
% 0.22/0.59 # BW rewrite match successes : 1
% 0.22/0.59 # Condensation attempts : 0
% 0.22/0.59 # Condensation successes : 0
% 0.22/0.59 # Termbank termtop insertions : 26936
% 0.22/0.59
% 0.22/0.59 # -------------------------------------------------
% 0.22/0.59 # User time : 0.072 s
% 0.22/0.59 # System time : 0.006 s
% 0.22/0.59 # Total time : 0.078 s
% 0.22/0.59 # Maximum resident set size: 2492 pages
% 0.22/0.59
% 0.22/0.59 # -------------------------------------------------
% 0.22/0.59 # User time : 0.075 s
% 0.22/0.59 # System time : 0.008 s
% 0.22/0.59 # Total time : 0.084 s
% 0.22/0.59 # Maximum resident set size: 1820 pages
% 0.22/0.59 % E---3.1 exiting
% 0.22/0.59 % E---3.1 exiting
%------------------------------------------------------------------------------