TSTP Solution File: SWB030+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SWB030+1 : TPTP v8.1.2. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n022.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:38:29 EDT 2023
% Result : Unsatisfiable 14.89s 5.47s
% Output : CNFRefutation 14.89s
% 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,
! [X11,X5] :
( iext(uri_owl_complementOf,X11,X5)
=> ( ic(X11)
& ic(X5)
& ! [X4] :
( icext(X11,X4)
<=> ~ icext(X5,X4) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.Gr2hgF1NBF/E---3.1_3246.p',owl_bool_complementof_class) ).
fof(testcase_premise_fullish_030_Bad_Class,axiom,
? [X42] :
( iext(uri_rdf_type,uri_ex_c,uri_owl_Class)
& iext(uri_owl_complementOf,uri_ex_c,X42)
& iext(uri_rdf_type,X42,uri_owl_Restriction)
& iext(uri_owl_onProperty,X42,uri_rdf_type)
& iext(uri_owl_hasSelf,X42,literal_typed(dat_str_true,uri_xsd_boolean)) ),
file('/export/starexec/sandbox/tmp/tmp.Gr2hgF1NBF/E---3.1_3246.p',testcase_premise_fullish_030_Bad_Class) ).
fof(owl_restrict_hasself,axiom,
! [X11,X2,X31] :
( ( iext(uri_owl_hasSelf,X11,X31)
& iext(uri_owl_onProperty,X11,X2) )
=> ! [X4] :
( icext(X11,X4)
<=> iext(X2,X4,X4) ) ),
file('/export/starexec/sandbox/tmp/tmp.Gr2hgF1NBF/E---3.1_3246.p',owl_restrict_hasself) ).
fof(rdfs_cext_def,axiom,
! [X4,X5] :
( iext(uri_rdf_type,X4,X5)
<=> icext(X5,X4) ),
file('/export/starexec/sandbox/tmp/tmp.Gr2hgF1NBF/E---3.1_3246.p',rdfs_cext_def) ).
fof(c_0_4,plain,
! [X11,X5] :
( iext(uri_owl_complementOf,X11,X5)
=> ( ic(X11)
& ic(X5)
& ! [X4] :
( icext(X11,X4)
<=> ~ icext(X5,X4) ) ) ),
inference(fof_simplification,[status(thm)],[owl_bool_complementof_class]) ).
fof(c_0_5,plain,
! [X253,X254,X255] :
( ( ic(X253)
| ~ iext(uri_owl_complementOf,X253,X254) )
& ( ic(X254)
| ~ iext(uri_owl_complementOf,X253,X254) )
& ( ~ icext(X253,X255)
| ~ icext(X254,X255)
| ~ iext(uri_owl_complementOf,X253,X254) )
& ( icext(X254,X255)
| icext(X253,X255)
| ~ iext(uri_owl_complementOf,X253,X254) ) ),
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,esk192_0)
& iext(uri_rdf_type,esk192_0,uri_owl_Restriction)
& iext(uri_owl_onProperty,esk192_0,uri_rdf_type)
& iext(uri_owl_hasSelf,esk192_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,
! [X532,X533,X534,X535] :
( ( ~ icext(X532,X535)
| iext(X533,X535,X535)
| ~ iext(uri_owl_hasSelf,X532,X534)
| ~ iext(uri_owl_onProperty,X532,X533) )
& ( ~ iext(X533,X535,X535)
| icext(X532,X535)
| ~ iext(uri_owl_hasSelf,X532,X534)
| ~ iext(uri_owl_onProperty,X532,X533) ) ),
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,
! [X49,X50] :
( ( ~ iext(uri_rdf_type,X49,X50)
| icext(X50,X49) )
& ( ~ icext(X50,X49)
| iext(uri_rdf_type,X49,X50) ) ),
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,esk192_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,esk192_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(uri_ex_c,X1)
| icext(esk192_0,X1) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_15,plain,
( icext(esk192_0,X1)
| ~ iext(uri_owl_onProperty,esk192_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,esk192_0,uri_rdf_type),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_17,plain,
( icext(esk192_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(esk192_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,esk192_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(esk192_0,X2)
| ~ iext(uri_owl_onProperty,esk192_0,X1) ),
inference(spm,[status(thm)],[c_0_18,c_0_12]) ).
cnf(c_0_23,plain,
icext(esk192_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,esk192_0,X1) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_26,plain,
( ~ icext(esk192_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.04/0.15 % Problem : SWB030+1 : TPTP v8.1.2. Released v5.2.0.
% 0.13/0.16 % Command : run_E %s %d THM
% 0.15/0.38 % Computer : n022.cluster.edu
% 0.15/0.38 % Model : x86_64 x86_64
% 0.15/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.38 % Memory : 8042.1875MB
% 0.15/0.38 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.38 % CPULimit : 2400
% 0.15/0.38 % WCLimit : 300
% 0.15/0.38 % DateTime : Mon Oct 2 20:24:54 EDT 2023
% 0.15/0.38 % CPUTime :
% 0.35/0.58 Running first-order model finding
% 0.35/0.58 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.Gr2hgF1NBF/E---3.1_3246.p
% 14.89/5.47 # Version: 3.1pre001
% 14.89/5.47 # Preprocessing class: FSLMSMSLSSSNFFN.
% 14.89/5.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 14.89/5.47 # Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 14.89/5.47 # Starting new_bool_3 with 600s (2) cores
% 14.89/5.47 # Starting new_bool_1 with 600s (2) cores
% 14.89/5.47 # Starting sh5l with 300s (1) cores
% 14.89/5.47 # new_bool_1 with pid 3325 completed with status 8
% 14.89/5.47 # new_bool_3 with pid 3324 completed with status 8
% 14.89/5.47 # sh5l with pid 3326 completed with status 8
% 14.89/5.47 # G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with pid 3323 completed with status 0
% 14.89/5.47 # Result found by G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI
% 14.89/5.47 # Preprocessing class: FSLMSMSLSSSNFFN.
% 14.89/5.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 14.89/5.47 # Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 14.89/5.47 # No SInE strategy applied
% 14.89/5.47 # Search class: FGHSM-SMLM33-SFFFFFNN
% 14.89/5.47 # partial match(1): FGHSM-SMLM33-DFFFFFNN
% 14.89/5.47 # Scheduled 6 strats onto 3 cores with 900 seconds (900 total)
% 14.89/5.47 # Starting SAT001_MinMin_p005000_rr with 487s (1) cores
% 14.89/5.47 # Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 91s (1) cores
% 14.89/5.47 # Starting SAT001_CA_MinMin_p005000_rr with 82s (1) cores
% 14.89/5.47 # G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with pid 3367 completed with status 0
% 14.89/5.47 # Result found by G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI
% 14.89/5.47 # Preprocessing class: FSLMSMSLSSSNFFN.
% 14.89/5.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 14.89/5.47 # Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 14.89/5.47 # No SInE strategy applied
% 14.89/5.47 # Search class: FGHSM-SMLM33-SFFFFFNN
% 14.89/5.47 # partial match(1): FGHSM-SMLM33-DFFFFFNN
% 14.89/5.47 # Scheduled 6 strats onto 3 cores with 900 seconds (900 total)
% 14.89/5.47 # Starting SAT001_MinMin_p005000_rr with 487s (1) cores
% 14.89/5.47 # Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 91s (1) cores
% 14.89/5.47 # Preprocessing time : 0.010 s
% 14.89/5.47
% 14.89/5.47 # Proof found!
% 14.89/5.47 # SZS status Unsatisfiable
% 14.89/5.47 # SZS output start CNFRefutation
% See solution above
% 14.89/5.47 # Parsed axioms : 559
% 14.89/5.47 # Removed by relevancy pruning/SinE : 0
% 14.89/5.47 # Initial clauses : 1271
% 14.89/5.47 # Removed in clause preprocessing : 111
% 14.89/5.47 # Initial clauses in saturation : 1160
% 14.89/5.47 # Processed clauses : 25424
% 14.89/5.47 # ...of these trivial : 732
% 14.89/5.47 # ...subsumed : 11916
% 14.89/5.47 # ...remaining for further processing : 12776
% 14.89/5.47 # Other redundant clauses eliminated : 16
% 14.89/5.47 # Clauses deleted for lack of memory : 0
% 14.89/5.47 # Backward-subsumed : 27
% 14.89/5.47 # Backward-rewritten : 10
% 14.89/5.47 # Generated clauses : 231330
% 14.89/5.47 # ...of the previous two non-redundant : 209283
% 14.89/5.47 # ...aggressively subsumed : 0
% 14.89/5.47 # Contextual simplify-reflections : 17
% 14.89/5.47 # Paramodulations : 231314
% 14.89/5.47 # Factorizations : 0
% 14.89/5.47 # NegExts : 0
% 14.89/5.47 # Equation resolutions : 16
% 14.89/5.47 # Total rewrite steps : 22531
% 14.89/5.47 # Propositional unsat checks : 0
% 14.89/5.47 # Propositional check models : 0
% 14.89/5.47 # Propositional check unsatisfiable : 0
% 14.89/5.47 # Propositional clauses : 0
% 14.89/5.47 # Propositional clauses after purity: 0
% 14.89/5.47 # Propositional unsat core size : 0
% 14.89/5.47 # Propositional preprocessing time : 0.000
% 14.89/5.47 # Propositional encoding time : 0.000
% 14.89/5.47 # Propositional solver time : 0.000
% 14.89/5.47 # Success case prop preproc time : 0.000
% 14.89/5.47 # Success case prop encoding time : 0.000
% 14.89/5.47 # Success case prop solver time : 0.000
% 14.89/5.47 # Current number of processed clauses : 12723
% 14.89/5.47 # Positive orientable unit clauses : 4526
% 14.89/5.47 # Positive unorientable unit clauses: 0
% 14.89/5.47 # Negative unit clauses : 12
% 14.89/5.47 # Non-unit-clauses : 8185
% 14.89/5.47 # Current number of unprocessed clauses: 185013
% 14.89/5.47 # ...number of literals in the above : 557863
% 14.89/5.47 # Current number of archived formulas : 0
% 14.89/5.47 # Current number of archived clauses : 38
% 14.89/5.47 # Clause-clause subsumption calls (NU) : 10818685
% 14.89/5.47 # Rec. Clause-clause subsumption calls : 8317611
% 14.89/5.47 # Non-unit clause-clause subsumptions : 9934
% 14.89/5.47 # Unit Clause-clause subsumption calls : 2311096
% 14.89/5.47 # Rewrite failures with RHS unbound : 0
% 14.89/5.47 # BW rewrite match attempts : 99613
% 14.89/5.47 # BW rewrite match successes : 5
% 14.89/5.47 # Condensation attempts : 0
% 14.89/5.47 # Condensation successes : 0
% 14.89/5.47 # Termbank termtop insertions : 4062583
% 14.89/5.47
% 14.89/5.47 # -------------------------------------------------
% 14.89/5.47 # User time : 4.685 s
% 14.89/5.47 # System time : 0.153 s
% 14.89/5.47 # Total time : 4.838 s
% 14.89/5.47 # Maximum resident set size: 5740 pages
% 14.89/5.47
% 14.89/5.47 # -------------------------------------------------
% 14.89/5.47 # User time : 14.099 s
% 14.89/5.47 # System time : 0.458 s
% 14.89/5.47 # Total time : 14.557 s
% 14.89/5.47 # Maximum resident set size: 2232 pages
% 14.89/5.47 % E---3.1 exiting
%------------------------------------------------------------------------------