TSTP Solution File: SWB043+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SWB043+1 : TPTP v8.1.2. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n005.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:18 EDT 2023
% Result : Theorem 0.45s 0.64s
% Output : CNFRefutation 0.45s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 6
% Syntax : Number of formulae : 30 ( 9 unt; 0 def)
% Number of atoms : 112 ( 0 equ)
% Maximal formula atoms : 25 ( 3 avg)
% Number of connectives : 137 ( 55 ~; 56 |; 19 &)
% ( 2 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 13 ( 13 usr; 9 con; 0-3 aty)
% Number of variables : 57 ( 5 sgn; 30 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(owl_chain_001,axiom,
! [X2,X12,X33] :
( ( iext(uri_rdf_first,X12,X33)
& iext(uri_rdf_rest,X12,uri_rdf_nil) )
=> ( iext(uri_owl_propertyChainAxiom,X2,X12)
<=> ( ip(X2)
& ip(X33)
& ! [X36,X27] :
( iext(X33,X36,X27)
=> iext(X2,X36,X27) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.klVRSVW4n6/E---3.1_31014.p',owl_chain_001) ).
fof(premise_rdfbased_sem_chain_subprop,axiom,
? [X42] :
( iext(uri_owl_propertyChainAxiom,uri_ex_p,X42)
& iext(uri_rdf_first,X42,uri_ex_p1)
& iext(uri_rdf_rest,X42,uri_rdf_nil) ),
file('/export/starexec/sandbox2/tmp/tmp.klVRSVW4n6/E---3.1_31014.p',premise_rdfbased_sem_chain_subprop) ).
fof(owl_rdfsext_subpropertyof,axiom,
! [X33,X34] :
( iext(uri_rdfs_subPropertyOf,X33,X34)
<=> ( ip(X33)
& ip(X34)
& ! [X4,X7] :
( iext(X33,X4,X7)
=> iext(X34,X4,X7) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.klVRSVW4n6/E---3.1_31014.p',owl_rdfsext_subpropertyof) ).
fof(simple_iext_property,axiom,
! [X1,X2,X3] :
( iext(X2,X1,X3)
=> ip(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.klVRSVW4n6/E---3.1_31014.p',simple_iext_property) ).
fof(owl_prop_propertychainaxiom_ext,axiom,
! [X4,X7] :
( iext(uri_owl_propertyChainAxiom,X4,X7)
=> ( ip(X4)
& icext(uri_rdf_List,X7) ) ),
file('/export/starexec/sandbox2/tmp/tmp.klVRSVW4n6/E---3.1_31014.p',owl_prop_propertychainaxiom_ext) ).
fof(conclusion_rdfbased_sem_chain_subprop,conjecture,
iext(uri_rdfs_subPropertyOf,uri_ex_p1,uri_ex_p),
file('/export/starexec/sandbox2/tmp/tmp.klVRSVW4n6/E---3.1_31014.p',conclusion_rdfbased_sem_chain_subprop) ).
fof(c_0_6,plain,
! [X66,X67,X68,X69,X70] :
( ( ip(X66)
| ~ iext(uri_owl_propertyChainAxiom,X66,X67)
| ~ iext(uri_rdf_first,X67,X68)
| ~ iext(uri_rdf_rest,X67,uri_rdf_nil) )
& ( ip(X68)
| ~ iext(uri_owl_propertyChainAxiom,X66,X67)
| ~ iext(uri_rdf_first,X67,X68)
| ~ iext(uri_rdf_rest,X67,uri_rdf_nil) )
& ( ~ iext(X68,X69,X70)
| iext(X66,X69,X70)
| ~ iext(uri_owl_propertyChainAxiom,X66,X67)
| ~ iext(uri_rdf_first,X67,X68)
| ~ iext(uri_rdf_rest,X67,uri_rdf_nil) )
& ( iext(X68,esk5_3(X66,X67,X68),esk6_3(X66,X67,X68))
| ~ ip(X66)
| ~ ip(X68)
| iext(uri_owl_propertyChainAxiom,X66,X67)
| ~ iext(uri_rdf_first,X67,X68)
| ~ iext(uri_rdf_rest,X67,uri_rdf_nil) )
& ( ~ iext(X66,esk5_3(X66,X67,X68),esk6_3(X66,X67,X68))
| ~ ip(X66)
| ~ ip(X68)
| iext(uri_owl_propertyChainAxiom,X66,X67)
| ~ iext(uri_rdf_first,X67,X68)
| ~ iext(uri_rdf_rest,X67,uri_rdf_nil) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[owl_chain_001])])])])]) ).
fof(c_0_7,plain,
( iext(uri_owl_propertyChainAxiom,uri_ex_p,esk1_0)
& iext(uri_rdf_first,esk1_0,uri_ex_p1)
& iext(uri_rdf_rest,esk1_0,uri_rdf_nil) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[premise_rdfbased_sem_chain_subprop])]) ).
fof(c_0_8,plain,
! [X52,X53,X54,X55,X56,X57] :
( ( ip(X52)
| ~ iext(uri_rdfs_subPropertyOf,X52,X53) )
& ( ip(X53)
| ~ iext(uri_rdfs_subPropertyOf,X52,X53) )
& ( ~ iext(X52,X54,X55)
| iext(X53,X54,X55)
| ~ iext(uri_rdfs_subPropertyOf,X52,X53) )
& ( iext(X56,esk2_2(X56,X57),esk3_2(X56,X57))
| ~ ip(X56)
| ~ ip(X57)
| iext(uri_rdfs_subPropertyOf,X56,X57) )
& ( ~ iext(X57,esk2_2(X56,X57),esk3_2(X56,X57))
| ~ ip(X56)
| ~ ip(X57)
| iext(uri_rdfs_subPropertyOf,X56,X57) ) ),
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_subpropertyof])])])])])]) ).
fof(c_0_9,plain,
! [X114,X115,X116] :
( ~ iext(X115,X114,X116)
| ip(X115) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[simple_iext_property])]) ).
cnf(c_0_10,plain,
( iext(X4,X2,X3)
| ~ iext(X1,X2,X3)
| ~ iext(uri_owl_propertyChainAxiom,X4,X5)
| ~ iext(uri_rdf_first,X5,X1)
| ~ iext(uri_rdf_rest,X5,uri_rdf_nil) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,plain,
iext(uri_rdf_first,esk1_0,uri_ex_p1),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
iext(uri_rdf_rest,esk1_0,uri_rdf_nil),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_13,plain,
( iext(uri_rdfs_subPropertyOf,X2,X1)
| ~ iext(X1,esk2_2(X2,X1),esk3_2(X2,X1))
| ~ ip(X2)
| ~ ip(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,plain,
( ip(X1)
| ~ iext(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,plain,
( iext(X1,X2,X3)
| ~ iext(uri_owl_propertyChainAxiom,X1,esk1_0)
| ~ iext(uri_ex_p1,X2,X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12])]) ).
cnf(c_0_16,plain,
iext(uri_owl_propertyChainAxiom,uri_ex_p,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_17,plain,
( ip(X1)
| ~ iext(uri_owl_propertyChainAxiom,X2,X3)
| ~ iext(uri_rdf_first,X3,X1)
| ~ iext(uri_rdf_rest,X3,uri_rdf_nil) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_18,plain,
! [X60,X61] :
( ( ip(X60)
| ~ iext(uri_owl_propertyChainAxiom,X60,X61) )
& ( icext(uri_rdf_List,X61)
| ~ iext(uri_owl_propertyChainAxiom,X60,X61) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[owl_prop_propertychainaxiom_ext])])]) ).
cnf(c_0_19,plain,
( iext(uri_rdfs_subPropertyOf,X1,X2)
| ~ ip(X1)
| ~ iext(X2,esk2_2(X1,X2),esk3_2(X1,X2)) ),
inference(csr,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_20,plain,
( iext(uri_ex_p,X1,X2)
| ~ iext(uri_ex_p1,X1,X2) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_21,plain,
( ip(uri_ex_p1)
| ~ iext(uri_owl_propertyChainAxiom,X1,esk1_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_11]),c_0_12])]) ).
cnf(c_0_22,plain,
( ip(X1)
| ~ iext(uri_owl_propertyChainAxiom,X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
fof(c_0_23,negated_conjecture,
~ iext(uri_rdfs_subPropertyOf,uri_ex_p1,uri_ex_p),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conclusion_rdfbased_sem_chain_subprop])]) ).
cnf(c_0_24,plain,
( iext(uri_rdfs_subPropertyOf,X1,uri_ex_p)
| ~ ip(X1)
| ~ iext(uri_ex_p1,esk2_2(X1,uri_ex_p),esk3_2(X1,uri_ex_p)) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_25,plain,
( iext(X1,esk2_2(X1,X2),esk3_2(X1,X2))
| iext(uri_rdfs_subPropertyOf,X1,X2)
| ~ ip(X1)
| ~ ip(X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_26,plain,
ip(uri_ex_p1),
inference(spm,[status(thm)],[c_0_21,c_0_16]) ).
cnf(c_0_27,plain,
ip(uri_ex_p),
inference(spm,[status(thm)],[c_0_22,c_0_16]) ).
cnf(c_0_28,negated_conjecture,
~ iext(uri_rdfs_subPropertyOf,uri_ex_p1,uri_ex_p),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_29,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]),c_0_27])]),c_0_28]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.17 % Problem : SWB043+1 : TPTP v8.1.2. Released v5.2.0.
% 0.18/0.19 % Command : run_E %s %d THM
% 0.19/0.40 % Computer : n005.cluster.edu
% 0.19/0.40 % Model : x86_64 x86_64
% 0.19/0.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.40 % Memory : 8042.1875MB
% 0.19/0.40 % OS : Linux 3.10.0-693.el7.x86_64
% 0.19/0.40 % CPULimit : 2400
% 0.19/0.40 % WCLimit : 300
% 0.19/0.40 % DateTime : Mon Oct 2 20:22:01 EDT 2023
% 0.19/0.40 % CPUTime :
% 0.45/0.58 Running first-order theorem proving
% 0.45/0.58 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.klVRSVW4n6/E---3.1_31014.p
% 0.45/0.64 # Version: 3.1pre001
% 0.45/0.64 # Preprocessing class: FSLMSMSLSSSNFFN.
% 0.45/0.64 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.45/0.64 # Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 0.45/0.64 # Starting new_bool_3 with 600s (2) cores
% 0.45/0.64 # Starting new_bool_1 with 600s (2) cores
% 0.45/0.64 # Starting sh5l with 300s (1) cores
% 0.45/0.64 # new_bool_3 with pid 31093 completed with status 0
% 0.45/0.64 # Result found by new_bool_3
% 0.45/0.64 # Preprocessing class: FSLMSMSLSSSNFFN.
% 0.45/0.64 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.45/0.64 # Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 0.45/0.64 # Starting new_bool_3 with 600s (2) cores
% 0.45/0.64 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.45/0.64 # Search class: FGUNF-FFMM33-SFFFFFNN
% 0.45/0.64 # Scheduled 5 strats onto 2 cores with 600 seconds (600 total)
% 0.45/0.64 # Starting G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with 125s (1) cores
% 0.45/0.64 # Starting new_bool_3 with 125s (1) cores
% 0.45/0.64 # G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with pid 31097 completed with status 0
% 0.45/0.64 # Result found by G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y
% 0.45/0.64 # Preprocessing class: FSLMSMSLSSSNFFN.
% 0.45/0.64 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.45/0.64 # Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 0.45/0.64 # Starting new_bool_3 with 600s (2) cores
% 0.45/0.64 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.45/0.64 # Search class: FGUNF-FFMM33-SFFFFFNN
% 0.45/0.64 # Scheduled 5 strats onto 2 cores with 600 seconds (600 total)
% 0.45/0.64 # Starting G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with 125s (1) cores
% 0.45/0.64 # Preprocessing time : 0.005 s
% 0.45/0.64
% 0.45/0.64 # Proof found!
% 0.45/0.64 # SZS status Theorem
% 0.45/0.64 # SZS output start CNFRefutation
% See solution above
% 0.45/0.64 # Parsed axioms : 560
% 0.45/0.64 # Removed by relevancy pruning/SinE : 513
% 0.45/0.64 # Initial clauses : 95
% 0.45/0.64 # Removed in clause preprocessing : 0
% 0.45/0.64 # Initial clauses in saturation : 95
% 0.45/0.64 # Processed clauses : 244
% 0.45/0.64 # ...of these trivial : 28
% 0.45/0.64 # ...subsumed : 50
% 0.45/0.64 # ...remaining for further processing : 166
% 0.45/0.64 # Other redundant clauses eliminated : 0
% 0.45/0.64 # Clauses deleted for lack of memory : 0
% 0.45/0.64 # Backward-subsumed : 1
% 0.45/0.64 # Backward-rewritten : 1
% 0.45/0.64 # Generated clauses : 545
% 0.45/0.64 # ...of the previous two non-redundant : 452
% 0.45/0.64 # ...aggressively subsumed : 0
% 0.45/0.64 # Contextual simplify-reflections : 9
% 0.45/0.64 # Paramodulations : 545
% 0.45/0.64 # Factorizations : 0
% 0.45/0.64 # NegExts : 0
% 0.45/0.64 # Equation resolutions : 0
% 0.45/0.64 # Total rewrite steps : 237
% 0.45/0.64 # Propositional unsat checks : 0
% 0.45/0.64 # Propositional check models : 0
% 0.45/0.64 # Propositional check unsatisfiable : 0
% 0.45/0.64 # Propositional clauses : 0
% 0.45/0.64 # Propositional clauses after purity: 0
% 0.45/0.64 # Propositional unsat core size : 0
% 0.45/0.64 # Propositional preprocessing time : 0.000
% 0.45/0.64 # Propositional encoding time : 0.000
% 0.45/0.64 # Propositional solver time : 0.000
% 0.45/0.64 # Success case prop preproc time : 0.000
% 0.45/0.64 # Success case prop encoding time : 0.000
% 0.45/0.64 # Success case prop solver time : 0.000
% 0.45/0.64 # Current number of processed clauses : 164
% 0.45/0.64 # Positive orientable unit clauses : 57
% 0.45/0.64 # Positive unorientable unit clauses: 0
% 0.45/0.64 # Negative unit clauses : 1
% 0.45/0.64 # Non-unit-clauses : 106
% 0.45/0.64 # Current number of unprocessed clauses: 303
% 0.45/0.64 # ...number of literals in the above : 2389
% 0.45/0.64 # Current number of archived formulas : 0
% 0.45/0.64 # Current number of archived clauses : 2
% 0.45/0.64 # Clause-clause subsumption calls (NU) : 3306
% 0.45/0.64 # Rec. Clause-clause subsumption calls : 1114
% 0.45/0.64 # Non-unit clause-clause subsumptions : 60
% 0.45/0.64 # Unit Clause-clause subsumption calls : 98
% 0.45/0.64 # Rewrite failures with RHS unbound : 0
% 0.45/0.64 # BW rewrite match attempts : 1
% 0.45/0.64 # BW rewrite match successes : 1
% 0.45/0.64 # Condensation attempts : 0
% 0.45/0.64 # Condensation successes : 0
% 0.45/0.64 # Termbank termtop insertions : 19336
% 0.45/0.64
% 0.45/0.64 # -------------------------------------------------
% 0.45/0.64 # User time : 0.026 s
% 0.45/0.64 # System time : 0.006 s
% 0.45/0.64 # Total time : 0.032 s
% 0.45/0.64 # Maximum resident set size: 2656 pages
% 0.45/0.64
% 0.45/0.64 # -------------------------------------------------
% 0.45/0.64 # User time : 0.059 s
% 0.45/0.64 # System time : 0.012 s
% 0.45/0.64 # Total time : 0.071 s
% 0.45/0.64 # Maximum resident set size: 2228 pages
% 0.45/0.64 % E---3.1 exiting
% 0.45/0.64 % E---3.1 exiting
%------------------------------------------------------------------------------