TSTP Solution File: SWB018+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SWB018+1 : TPTP v8.1.2. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n029.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:36:15 EDT 2023
% Result : Theorem 3.72s 1.13s
% Output : CNFRefutation 3.72s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of formulae : 23 ( 11 unt; 0 def)
% Number of atoms : 56 ( 6 equ)
% Maximal formula atoms : 15 ( 2 avg)
% Number of connectives : 55 ( 22 ~; 20 |; 9 &)
% ( 3 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 33 ( 4 sgn; 18 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(owl_rdfsext_domain,axiom,
! [X2,X5] :
( iext(uri_rdfs_domain,X2,X5)
<=> ( ip(X2)
& ic(X5)
& ! [X4,X7] :
( iext(X2,X4,X7)
=> icext(X5,X4) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.OnBbcpUHTj/E---3.1_4263.p',owl_rdfsext_domain) ).
fof(owl_eqdis_sameas,axiom,
! [X4,X7] :
( iext(uri_owl_sameAs,X4,X7)
<=> X4 = X7 ),
file('/export/starexec/sandbox/tmp/tmp.OnBbcpUHTj/E---3.1_4263.p',owl_eqdis_sameas) ).
fof(testcase_premise_fullish_018_Modified_Logical_Vocabulary_Semantics,axiom,
( iext(uri_rdfs_domain,uri_owl_sameAs,uri_ex_Person)
& iext(uri_owl_sameAs,uri_ex_w,uri_ex_u) ),
file('/export/starexec/sandbox/tmp/tmp.OnBbcpUHTj/E---3.1_4263.p',testcase_premise_fullish_018_Modified_Logical_Vocabulary_Semantics) ).
fof(testcase_conclusion_fullish_018_Modified_Logical_Vocabulary_Semantics,conjecture,
iext(uri_rdf_type,uri_ex_u,uri_ex_Person),
file('/export/starexec/sandbox/tmp/tmp.OnBbcpUHTj/E---3.1_4263.p',testcase_conclusion_fullish_018_Modified_Logical_Vocabulary_Semantics) ).
fof(rdfs_cext_def,axiom,
! [X4,X5] :
( iext(uri_rdf_type,X4,X5)
<=> icext(X5,X4) ),
file('/export/starexec/sandbox/tmp/tmp.OnBbcpUHTj/E---3.1_4263.p',rdfs_cext_def) ).
fof(c_0_5,plain,
! [X751,X752,X753,X754,X755,X756] :
( ( ip(X751)
| ~ iext(uri_rdfs_domain,X751,X752) )
& ( ic(X752)
| ~ iext(uri_rdfs_domain,X751,X752) )
& ( ~ iext(X751,X753,X754)
| icext(X752,X753)
| ~ iext(uri_rdfs_domain,X751,X752) )
& ( iext(X755,esk105_2(X755,X756),esk106_2(X755,X756))
| ~ ip(X755)
| ~ ic(X756)
| iext(uri_rdfs_domain,X755,X756) )
& ( ~ icext(X756,esk105_2(X755,X756))
| ~ ip(X755)
| ~ ic(X756)
| iext(uri_rdfs_domain,X755,X756) ) ),
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_rdfsext_domain])])])])])]) ).
fof(c_0_6,plain,
! [X839,X840] :
( ( ~ iext(uri_owl_sameAs,X839,X840)
| X839 = X840 )
& ( X839 != X840
| iext(uri_owl_sameAs,X839,X840) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[owl_eqdis_sameas])]) ).
cnf(c_0_7,plain,
( icext(X4,X2)
| ~ iext(X1,X2,X3)
| ~ iext(uri_rdfs_domain,X1,X4) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,plain,
iext(uri_rdfs_domain,uri_owl_sameAs,uri_ex_Person),
inference(split_conjunct,[status(thm)],[testcase_premise_fullish_018_Modified_Logical_Vocabulary_Semantics]) ).
cnf(c_0_9,plain,
( iext(uri_owl_sameAs,X1,X2)
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_10,negated_conjecture,
~ iext(uri_rdf_type,uri_ex_u,uri_ex_Person),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[testcase_conclusion_fullish_018_Modified_Logical_Vocabulary_Semantics])]) ).
cnf(c_0_11,plain,
( X1 = X2
| ~ iext(uri_owl_sameAs,X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_12,plain,
iext(uri_owl_sameAs,uri_ex_w,uri_ex_u),
inference(split_conjunct,[status(thm)],[testcase_premise_fullish_018_Modified_Logical_Vocabulary_Semantics]) ).
fof(c_0_13,plain,
! [X48,X49] :
( ( ~ iext(uri_rdf_type,X48,X49)
| icext(X49,X48) )
& ( ~ icext(X49,X48)
| iext(uri_rdf_type,X48,X49) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[rdfs_cext_def])]) ).
cnf(c_0_14,plain,
( icext(uri_ex_Person,X1)
| ~ iext(uri_owl_sameAs,X1,X2) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_15,plain,
iext(uri_owl_sameAs,X1,X1),
inference(er,[status(thm)],[c_0_9]) ).
cnf(c_0_16,negated_conjecture,
~ iext(uri_rdf_type,uri_ex_u,uri_ex_Person),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_17,plain,
uri_ex_u = uri_ex_w,
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_18,plain,
( iext(uri_rdf_type,X2,X1)
| ~ icext(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,plain,
icext(uri_ex_Person,X1),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_20,negated_conjecture,
~ iext(uri_rdf_type,uri_ex_w,uri_ex_Person),
inference(rw,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_21,plain,
iext(uri_rdf_type,X1,uri_ex_Person),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_21])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.18 % Problem : SWB018+1 : TPTP v8.1.2. Released v5.2.0.
% 0.13/0.19 % Command : run_E %s %d THM
% 0.19/0.41 % Computer : n029.cluster.edu
% 0.19/0.41 % Model : x86_64 x86_64
% 0.19/0.41 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.41 % Memory : 8042.1875MB
% 0.19/0.41 % OS : Linux 3.10.0-693.el7.x86_64
% 0.19/0.41 % CPULimit : 2400
% 0.19/0.41 % WCLimit : 300
% 0.19/0.41 % DateTime : Mon Oct 2 20:43:22 EDT 2023
% 0.19/0.42 % CPUTime :
% 0.38/0.59 Running first-order theorem proving
% 0.38/0.59 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.OnBbcpUHTj/E---3.1_4263.p
% 3.72/1.13 # Version: 3.1pre001
% 3.72/1.13 # Preprocessing class: FSLMSMSLSSSNFFN.
% 3.72/1.13 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.72/1.13 # Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 3.72/1.13 # Starting new_bool_3 with 600s (2) cores
% 3.72/1.13 # Starting new_bool_1 with 600s (2) cores
% 3.72/1.13 # Starting sh5l with 300s (1) cores
% 3.72/1.13 # G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with pid 4341 completed with status 0
% 3.72/1.13 # Result found by G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI
% 3.72/1.13 # Preprocessing class: FSLMSMSLSSSNFFN.
% 3.72/1.13 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.72/1.13 # Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 3.72/1.13 # No SInE strategy applied
% 3.72/1.13 # Search class: FGHSM-SMLM33-SFFFFFNN
% 3.72/1.13 # partial match(1): FGHSM-SMLM33-DFFFFFNN
% 3.72/1.13 # Scheduled 6 strats onto 3 cores with 900 seconds (900 total)
% 3.72/1.13 # Starting SAT001_MinMin_p005000_rr with 487s (1) cores
% 3.72/1.13 # Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 91s (1) cores
% 3.72/1.13 # Starting SAT001_CA_MinMin_p005000_rr with 82s (1) cores
% 3.72/1.13 # G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with pid 4355 completed with status 0
% 3.72/1.13 # Result found by G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI
% 3.72/1.13 # Preprocessing class: FSLMSMSLSSSNFFN.
% 3.72/1.13 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.72/1.13 # Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 3.72/1.13 # No SInE strategy applied
% 3.72/1.13 # Search class: FGHSM-SMLM33-SFFFFFNN
% 3.72/1.13 # partial match(1): FGHSM-SMLM33-DFFFFFNN
% 3.72/1.13 # Scheduled 6 strats onto 3 cores with 900 seconds (900 total)
% 3.72/1.13 # Starting SAT001_MinMin_p005000_rr with 487s (1) cores
% 3.72/1.13 # Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 91s (1) cores
% 3.72/1.13 # Preprocessing time : 0.010 s
% 3.72/1.13
% 3.72/1.13 # Proof found!
% 3.72/1.13 # SZS status Theorem
% 3.72/1.13 # SZS output start CNFRefutation
% See solution above
% 3.72/1.13 # Parsed axioms : 560
% 3.72/1.13 # Removed by relevancy pruning/SinE : 0
% 3.72/1.13 # Initial clauses : 1269
% 3.72/1.13 # Removed in clause preprocessing : 111
% 3.72/1.13 # Initial clauses in saturation : 1158
% 3.72/1.13 # Processed clauses : 3797
% 3.72/1.13 # ...of these trivial : 144
% 3.72/1.13 # ...subsumed : 1217
% 3.72/1.13 # ...remaining for further processing : 2436
% 3.72/1.13 # Other redundant clauses eliminated : 16
% 3.72/1.13 # Clauses deleted for lack of memory : 0
% 3.72/1.13 # Backward-subsumed : 24
% 3.72/1.13 # Backward-rewritten : 4
% 3.72/1.13 # Generated clauses : 12630
% 3.72/1.13 # ...of the previous two non-redundant : 10805
% 3.72/1.13 # ...aggressively subsumed : 0
% 3.72/1.13 # Contextual simplify-reflections : 16
% 3.72/1.13 # Paramodulations : 12612
% 3.72/1.13 # Factorizations : 2
% 3.72/1.13 # NegExts : 0
% 3.72/1.13 # Equation resolutions : 16
% 3.72/1.13 # Total rewrite steps : 8975
% 3.72/1.13 # Propositional unsat checks : 0
% 3.72/1.13 # Propositional check models : 0
% 3.72/1.13 # Propositional check unsatisfiable : 0
% 3.72/1.13 # Propositional clauses : 0
% 3.72/1.13 # Propositional clauses after purity: 0
% 3.72/1.13 # Propositional unsat core size : 0
% 3.72/1.13 # Propositional preprocessing time : 0.000
% 3.72/1.13 # Propositional encoding time : 0.000
% 3.72/1.13 # Propositional solver time : 0.000
% 3.72/1.13 # Success case prop preproc time : 0.000
% 3.72/1.13 # Success case prop encoding time : 0.000
% 3.72/1.13 # Success case prop solver time : 0.000
% 3.72/1.13 # Current number of processed clauses : 2392
% 3.72/1.13 # Positive orientable unit clauses : 1005
% 3.72/1.13 # Positive unorientable unit clauses: 0
% 3.72/1.13 # Negative unit clauses : 4
% 3.72/1.13 # Non-unit-clauses : 1383
% 3.72/1.13 # Current number of unprocessed clauses: 8163
% 3.72/1.13 # ...number of literals in the above : 44649
% 3.72/1.13 # Current number of archived formulas : 0
% 3.72/1.13 # Current number of archived clauses : 29
% 3.72/1.13 # Clause-clause subsumption calls (NU) : 921322
% 3.72/1.13 # Rec. Clause-clause subsumption calls : 184444
% 3.72/1.13 # Non-unit clause-clause subsumptions : 1255
% 3.72/1.13 # Unit Clause-clause subsumption calls : 179285
% 3.72/1.13 # Rewrite failures with RHS unbound : 0
% 3.72/1.13 # BW rewrite match attempts : 790
% 3.72/1.13 # BW rewrite match successes : 3
% 3.72/1.13 # Condensation attempts : 0
% 3.72/1.13 # Condensation successes : 0
% 3.72/1.13 # Termbank termtop insertions : 317263
% 3.72/1.13
% 3.72/1.13 # -------------------------------------------------
% 3.72/1.13 # User time : 0.487 s
% 3.72/1.13 # System time : 0.015 s
% 3.72/1.13 # Total time : 0.502 s
% 3.72/1.13 # Maximum resident set size: 5740 pages
% 3.72/1.13
% 3.72/1.13 # -------------------------------------------------
% 3.72/1.13 # User time : 1.323 s
% 3.72/1.13 # System time : 0.037 s
% 3.72/1.13 # Total time : 1.360 s
% 3.72/1.13 # Maximum resident set size: 2232 pages
% 3.72/1.13 % E---3.1 exiting
% 3.72/1.13 % E---3.1 exiting
%------------------------------------------------------------------------------