TSTP Solution File: SWB014+2 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SWB014+2 : 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:36:07 EDT 2023
% Result : Theorem 0.20s 0.51s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 4
% Syntax : Number of formulae : 30 ( 13 unt; 0 def)
% Number of atoms : 152 ( 0 equ)
% Maximal formula atoms : 71 ( 5 avg)
% Number of connectives : 204 ( 82 ~; 87 |; 31 &)
% ( 3 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 27 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 13 ( 13 usr; 12 con; 0-5 aty)
% Number of variables : 41 ( 0 sgn; 18 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(owl_bool_unionof_class_002,axiom,
! [X3,X4,X5,X6,X7] :
( ( iext(uri_rdf_first,X4,X5)
& iext(uri_rdf_rest,X4,X6)
& iext(uri_rdf_first,X6,X7)
& iext(uri_rdf_rest,X6,uri_rdf_nil) )
=> ( iext(uri_owl_unionOf,X3,X4)
<=> ( ic(X3)
& ic(X5)
& ic(X7)
& ! [X1] :
( icext(X3,X1)
<=> ( icext(X5,X1)
| icext(X7,X1) ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.5uptZF4bpC/E---3.1_4127.p',owl_bool_unionof_class_002) ).
fof(testcase_premise_fullish_014_Harry_belongs_to_some_Species,axiom,
? [X9,X10,X11] :
( iext(uri_rdf_type,uri_ex_Eagle,uri_ex_Species)
& iext(uri_rdf_type,uri_ex_Falcon,uri_ex_Species)
& iext(uri_rdf_type,uri_ex_harry,X9)
& iext(uri_owl_unionOf,X9,X10)
& iext(uri_rdf_first,X10,uri_ex_Eagle)
& iext(uri_rdf_rest,X10,X11)
& iext(uri_rdf_first,X11,uri_ex_Falcon)
& iext(uri_rdf_rest,X11,uri_rdf_nil) ),
file('/export/starexec/sandbox2/tmp/tmp.5uptZF4bpC/E---3.1_4127.p',testcase_premise_fullish_014_Harry_belongs_to_some_Species) ).
fof(rdfs_cext_def,axiom,
! [X1,X2] :
( iext(uri_rdf_type,X1,X2)
<=> icext(X2,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.5uptZF4bpC/E---3.1_4127.p',rdfs_cext_def) ).
fof(testcase_conclusion_fullish_014_Harry_belongs_to_some_Species,conjecture,
? [X8] :
( iext(uri_rdf_type,uri_ex_harry,X8)
& iext(uri_rdf_type,X8,uri_ex_Species) ),
file('/export/starexec/sandbox2/tmp/tmp.5uptZF4bpC/E---3.1_4127.p',testcase_conclusion_fullish_014_Harry_belongs_to_some_Species) ).
fof(c_0_4,plain,
! [X15,X16,X17,X18,X19,X20,X21] :
( ( ic(X15)
| ~ iext(uri_owl_unionOf,X15,X16)
| ~ iext(uri_rdf_first,X16,X17)
| ~ iext(uri_rdf_rest,X16,X18)
| ~ iext(uri_rdf_first,X18,X19)
| ~ iext(uri_rdf_rest,X18,uri_rdf_nil) )
& ( ic(X17)
| ~ iext(uri_owl_unionOf,X15,X16)
| ~ iext(uri_rdf_first,X16,X17)
| ~ iext(uri_rdf_rest,X16,X18)
| ~ iext(uri_rdf_first,X18,X19)
| ~ iext(uri_rdf_rest,X18,uri_rdf_nil) )
& ( ic(X19)
| ~ iext(uri_owl_unionOf,X15,X16)
| ~ iext(uri_rdf_first,X16,X17)
| ~ iext(uri_rdf_rest,X16,X18)
| ~ iext(uri_rdf_first,X18,X19)
| ~ iext(uri_rdf_rest,X18,uri_rdf_nil) )
& ( ~ icext(X15,X20)
| icext(X17,X20)
| icext(X19,X20)
| ~ iext(uri_owl_unionOf,X15,X16)
| ~ iext(uri_rdf_first,X16,X17)
| ~ iext(uri_rdf_rest,X16,X18)
| ~ iext(uri_rdf_first,X18,X19)
| ~ iext(uri_rdf_rest,X18,uri_rdf_nil) )
& ( ~ icext(X17,X21)
| icext(X15,X21)
| ~ iext(uri_owl_unionOf,X15,X16)
| ~ iext(uri_rdf_first,X16,X17)
| ~ iext(uri_rdf_rest,X16,X18)
| ~ iext(uri_rdf_first,X18,X19)
| ~ iext(uri_rdf_rest,X18,uri_rdf_nil) )
& ( ~ icext(X19,X21)
| icext(X15,X21)
| ~ iext(uri_owl_unionOf,X15,X16)
| ~ iext(uri_rdf_first,X16,X17)
| ~ iext(uri_rdf_rest,X16,X18)
| ~ iext(uri_rdf_first,X18,X19)
| ~ iext(uri_rdf_rest,X18,uri_rdf_nil) )
& ( ~ icext(X17,esk1_5(X15,X16,X17,X18,X19))
| ~ icext(X15,esk1_5(X15,X16,X17,X18,X19))
| ~ ic(X15)
| ~ ic(X17)
| ~ ic(X19)
| iext(uri_owl_unionOf,X15,X16)
| ~ iext(uri_rdf_first,X16,X17)
| ~ iext(uri_rdf_rest,X16,X18)
| ~ iext(uri_rdf_first,X18,X19)
| ~ iext(uri_rdf_rest,X18,uri_rdf_nil) )
& ( ~ icext(X19,esk1_5(X15,X16,X17,X18,X19))
| ~ icext(X15,esk1_5(X15,X16,X17,X18,X19))
| ~ ic(X15)
| ~ ic(X17)
| ~ ic(X19)
| iext(uri_owl_unionOf,X15,X16)
| ~ iext(uri_rdf_first,X16,X17)
| ~ iext(uri_rdf_rest,X16,X18)
| ~ iext(uri_rdf_first,X18,X19)
| ~ iext(uri_rdf_rest,X18,uri_rdf_nil) )
& ( icext(X15,esk1_5(X15,X16,X17,X18,X19))
| icext(X17,esk1_5(X15,X16,X17,X18,X19))
| icext(X19,esk1_5(X15,X16,X17,X18,X19))
| ~ ic(X15)
| ~ ic(X17)
| ~ ic(X19)
| iext(uri_owl_unionOf,X15,X16)
| ~ iext(uri_rdf_first,X16,X17)
| ~ iext(uri_rdf_rest,X16,X18)
| ~ iext(uri_rdf_first,X18,X19)
| ~ iext(uri_rdf_rest,X18,uri_rdf_nil) ) ),
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_bool_unionof_class_002])])])])])]) ).
fof(c_0_5,plain,
( iext(uri_rdf_type,uri_ex_Eagle,uri_ex_Species)
& iext(uri_rdf_type,uri_ex_Falcon,uri_ex_Species)
& iext(uri_rdf_type,uri_ex_harry,esk2_0)
& iext(uri_owl_unionOf,esk2_0,esk3_0)
& iext(uri_rdf_first,esk3_0,uri_ex_Eagle)
& iext(uri_rdf_rest,esk3_0,esk4_0)
& iext(uri_rdf_first,esk4_0,uri_ex_Falcon)
& iext(uri_rdf_rest,esk4_0,uri_rdf_nil) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[testcase_premise_fullish_014_Harry_belongs_to_some_Species])]) ).
cnf(c_0_6,plain,
( icext(X3,X2)
| icext(X4,X2)
| ~ icext(X1,X2)
| ~ iext(uri_owl_unionOf,X1,X5)
| ~ iext(uri_rdf_first,X5,X3)
| ~ iext(uri_rdf_rest,X5,X6)
| ~ iext(uri_rdf_first,X6,X4)
| ~ iext(uri_rdf_rest,X6,uri_rdf_nil) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,plain,
iext(uri_rdf_first,esk4_0,uri_ex_Falcon),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,plain,
iext(uri_rdf_rest,esk4_0,uri_rdf_nil),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
( icext(uri_ex_Falcon,X1)
| icext(X2,X1)
| ~ icext(X3,X1)
| ~ iext(uri_rdf_rest,X4,esk4_0)
| ~ iext(uri_rdf_first,X4,X2)
| ~ iext(uri_owl_unionOf,X3,X4) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_8])]) ).
cnf(c_0_10,plain,
iext(uri_rdf_first,esk3_0,uri_ex_Eagle),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_11,plain,
iext(uri_rdf_rest,esk3_0,esk4_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_12,plain,
! [X13,X14] :
( ( ~ iext(uri_rdf_type,X13,X14)
| icext(X14,X13) )
& ( ~ icext(X14,X13)
| iext(uri_rdf_type,X13,X14) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[rdfs_cext_def])]) ).
fof(c_0_13,negated_conjecture,
~ ? [X8] :
( iext(uri_rdf_type,uri_ex_harry,X8)
& iext(uri_rdf_type,X8,uri_ex_Species) ),
inference(assume_negation,[status(cth)],[testcase_conclusion_fullish_014_Harry_belongs_to_some_Species]) ).
cnf(c_0_14,plain,
( icext(uri_ex_Eagle,X1)
| icext(uri_ex_Falcon,X1)
| ~ icext(X2,X1)
| ~ iext(uri_owl_unionOf,X2,esk3_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11])]) ).
cnf(c_0_15,plain,
iext(uri_owl_unionOf,esk2_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_16,plain,
( icext(X2,X1)
| ~ iext(uri_rdf_type,X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,plain,
iext(uri_rdf_type,uri_ex_harry,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_18,negated_conjecture,
! [X12] :
( ~ iext(uri_rdf_type,uri_ex_harry,X12)
| ~ iext(uri_rdf_type,X12,uri_ex_Species) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])]) ).
cnf(c_0_19,plain,
( icext(uri_ex_Falcon,X1)
| icext(uri_ex_Eagle,X1)
| ~ icext(esk2_0,X1) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_20,plain,
icext(esk2_0,uri_ex_harry),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_21,negated_conjecture,
( ~ iext(uri_rdf_type,uri_ex_harry,X1)
| ~ iext(uri_rdf_type,X1,uri_ex_Species) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_22,plain,
iext(uri_rdf_type,uri_ex_Falcon,uri_ex_Species),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_23,plain,
( iext(uri_rdf_type,X2,X1)
| ~ icext(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_24,plain,
( icext(uri_ex_Eagle,uri_ex_harry)
| icext(uri_ex_Falcon,uri_ex_harry) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_25,negated_conjecture,
~ iext(uri_rdf_type,uri_ex_harry,uri_ex_Falcon),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_26,plain,
iext(uri_rdf_type,uri_ex_Eagle,uri_ex_Species),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_27,plain,
icext(uri_ex_Eagle,uri_ex_harry),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]) ).
cnf(c_0_28,negated_conjecture,
~ iext(uri_rdf_type,uri_ex_harry,uri_ex_Eagle),
inference(spm,[status(thm)],[c_0_21,c_0_26]) ).
cnf(c_0_29,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_27]),c_0_28]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : SWB014+2 : TPTP v8.1.2. Released v5.2.0.
% 0.11/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n005.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 2400
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Mon Oct 2 20:23:16 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.20/0.49 Running first-order theorem proving
% 0.20/0.49 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.5uptZF4bpC/E---3.1_4127.p
% 0.20/0.51 # Version: 3.1pre001
% 0.20/0.51 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.20/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.51 # Starting sh5l with 300s (1) cores
% 0.20/0.51 # sh5l with pid 4250 completed with status 0
% 0.20/0.51 # Result found by sh5l
% 0.20/0.51 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.20/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.51 # Starting sh5l with 300s (1) cores
% 0.20/0.51 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.20/0.51 # Search class: FGHNF-FFMM33-SFFFFFNN
% 0.20/0.51 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.51 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with 181s (1) cores
% 0.20/0.51 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with pid 4258 completed with status 0
% 0.20/0.51 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI
% 0.20/0.51 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.20/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.51 # Starting sh5l with 300s (1) cores
% 0.20/0.51 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.20/0.51 # Search class: FGHNF-FFMM33-SFFFFFNN
% 0.20/0.51 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.51 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with 181s (1) cores
% 0.20/0.51 # Preprocessing time : 0.001 s
% 0.20/0.51 # Presaturation interreduction done
% 0.20/0.51
% 0.20/0.51 # Proof found!
% 0.20/0.51 # SZS status Theorem
% 0.20/0.51 # SZS output start CNFRefutation
% See solution above
% 0.20/0.51 # Parsed axioms : 4
% 0.20/0.51 # Removed by relevancy pruning/SinE : 0
% 0.20/0.51 # Initial clauses : 20
% 0.20/0.51 # Removed in clause preprocessing : 0
% 0.20/0.51 # Initial clauses in saturation : 20
% 0.20/0.51 # Processed clauses : 80
% 0.20/0.51 # ...of these trivial : 1
% 0.20/0.51 # ...subsumed : 4
% 0.20/0.51 # ...remaining for further processing : 75
% 0.20/0.51 # Other redundant clauses eliminated : 0
% 0.20/0.51 # Clauses deleted for lack of memory : 0
% 0.20/0.51 # Backward-subsumed : 0
% 0.20/0.51 # Backward-rewritten : 4
% 0.20/0.51 # Generated clauses : 57
% 0.20/0.51 # ...of the previous two non-redundant : 48
% 0.20/0.51 # ...aggressively subsumed : 0
% 0.20/0.51 # Contextual simplify-reflections : 0
% 0.20/0.51 # Paramodulations : 57
% 0.20/0.51 # Factorizations : 0
% 0.20/0.51 # NegExts : 0
% 0.20/0.51 # Equation resolutions : 0
% 0.20/0.51 # Total rewrite steps : 31
% 0.20/0.51 # Propositional unsat checks : 0
% 0.20/0.51 # Propositional check models : 0
% 0.20/0.51 # Propositional check unsatisfiable : 0
% 0.20/0.51 # Propositional clauses : 0
% 0.20/0.51 # Propositional clauses after purity: 0
% 0.20/0.51 # Propositional unsat core size : 0
% 0.20/0.51 # Propositional preprocessing time : 0.000
% 0.20/0.51 # Propositional encoding time : 0.000
% 0.20/0.51 # Propositional solver time : 0.000
% 0.20/0.51 # Success case prop preproc time : 0.000
% 0.20/0.51 # Success case prop encoding time : 0.000
% 0.20/0.51 # Success case prop solver time : 0.000
% 0.20/0.51 # Current number of processed clauses : 51
% 0.20/0.51 # Positive orientable unit clauses : 15
% 0.20/0.51 # Positive unorientable unit clauses: 0
% 0.20/0.51 # Negative unit clauses : 2
% 0.20/0.51 # Non-unit-clauses : 34
% 0.20/0.51 # Current number of unprocessed clauses: 7
% 0.20/0.51 # ...number of literals in the above : 56
% 0.20/0.51 # Current number of archived formulas : 0
% 0.20/0.51 # Current number of archived clauses : 24
% 0.20/0.51 # Clause-clause subsumption calls (NU) : 598
% 0.20/0.51 # Rec. Clause-clause subsumption calls : 84
% 0.20/0.51 # Non-unit clause-clause subsumptions : 4
% 0.20/0.51 # Unit Clause-clause subsumption calls : 55
% 0.20/0.51 # Rewrite failures with RHS unbound : 0
% 0.20/0.51 # BW rewrite match attempts : 3
% 0.20/0.51 # BW rewrite match successes : 3
% 0.20/0.51 # Condensation attempts : 0
% 0.20/0.51 # Condensation successes : 0
% 0.20/0.51 # Termbank termtop insertions : 3224
% 0.20/0.51
% 0.20/0.51 # -------------------------------------------------
% 0.20/0.51 # User time : 0.010 s
% 0.20/0.51 # System time : 0.000 s
% 0.20/0.51 # Total time : 0.011 s
% 0.20/0.51 # Maximum resident set size: 1720 pages
% 0.20/0.51
% 0.20/0.51 # -------------------------------------------------
% 0.20/0.51 # User time : 0.012 s
% 0.20/0.51 # System time : 0.003 s
% 0.20/0.51 # Total time : 0.014 s
% 0.20/0.51 # Maximum resident set size: 1680 pages
% 0.20/0.51 % E---3.1 exiting
% 0.20/0.51 % E---3.1 exiting
%------------------------------------------------------------------------------