TSTP Solution File: SWB014+2 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---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 : n027.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:49 EDT 2023
% Result : Theorem 0.20s 0.49s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 4
% Syntax : Number of formulae : 32 ( 13 unt; 0 def)
% Number of atoms : 164 ( 0 equ)
% Maximal formula atoms : 71 ( 5 avg)
% Number of connectives : 222 ( 90 ~; 97 |; 31 &)
% ( 3 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 27 ( 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; 12 con; 0-5 aty)
% Number of variables : 49 ( 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.9YUjGKVBWa/E---3.1_2605.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.9YUjGKVBWa/E---3.1_2605.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.9YUjGKVBWa/E---3.1_2605.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.9YUjGKVBWa/E---3.1_2605.p',testcase_conclusion_fullish_014_Harry_belongs_to_some_Species) ).
fof(c_0_4,plain,
! [X14,X15,X16,X17,X18,X19,X20] :
( ( ic(X14)
| ~ iext(uri_owl_unionOf,X14,X15)
| ~ iext(uri_rdf_first,X15,X16)
| ~ iext(uri_rdf_rest,X15,X17)
| ~ iext(uri_rdf_first,X17,X18)
| ~ iext(uri_rdf_rest,X17,uri_rdf_nil) )
& ( ic(X16)
| ~ iext(uri_owl_unionOf,X14,X15)
| ~ iext(uri_rdf_first,X15,X16)
| ~ iext(uri_rdf_rest,X15,X17)
| ~ iext(uri_rdf_first,X17,X18)
| ~ iext(uri_rdf_rest,X17,uri_rdf_nil) )
& ( ic(X18)
| ~ iext(uri_owl_unionOf,X14,X15)
| ~ iext(uri_rdf_first,X15,X16)
| ~ iext(uri_rdf_rest,X15,X17)
| ~ iext(uri_rdf_first,X17,X18)
| ~ iext(uri_rdf_rest,X17,uri_rdf_nil) )
& ( ~ icext(X14,X19)
| icext(X16,X19)
| icext(X18,X19)
| ~ iext(uri_owl_unionOf,X14,X15)
| ~ iext(uri_rdf_first,X15,X16)
| ~ iext(uri_rdf_rest,X15,X17)
| ~ iext(uri_rdf_first,X17,X18)
| ~ iext(uri_rdf_rest,X17,uri_rdf_nil) )
& ( ~ icext(X16,X20)
| icext(X14,X20)
| ~ iext(uri_owl_unionOf,X14,X15)
| ~ iext(uri_rdf_first,X15,X16)
| ~ iext(uri_rdf_rest,X15,X17)
| ~ iext(uri_rdf_first,X17,X18)
| ~ iext(uri_rdf_rest,X17,uri_rdf_nil) )
& ( ~ icext(X18,X20)
| icext(X14,X20)
| ~ iext(uri_owl_unionOf,X14,X15)
| ~ iext(uri_rdf_first,X15,X16)
| ~ iext(uri_rdf_rest,X15,X17)
| ~ iext(uri_rdf_first,X17,X18)
| ~ iext(uri_rdf_rest,X17,uri_rdf_nil) )
& ( ~ icext(X16,esk1_5(X14,X15,X16,X17,X18))
| ~ icext(X14,esk1_5(X14,X15,X16,X17,X18))
| ~ ic(X14)
| ~ ic(X16)
| ~ ic(X18)
| iext(uri_owl_unionOf,X14,X15)
| ~ iext(uri_rdf_first,X15,X16)
| ~ iext(uri_rdf_rest,X15,X17)
| ~ iext(uri_rdf_first,X17,X18)
| ~ iext(uri_rdf_rest,X17,uri_rdf_nil) )
& ( ~ icext(X18,esk1_5(X14,X15,X16,X17,X18))
| ~ icext(X14,esk1_5(X14,X15,X16,X17,X18))
| ~ ic(X14)
| ~ ic(X16)
| ~ ic(X18)
| iext(uri_owl_unionOf,X14,X15)
| ~ iext(uri_rdf_first,X15,X16)
| ~ iext(uri_rdf_rest,X15,X17)
| ~ iext(uri_rdf_first,X17,X18)
| ~ iext(uri_rdf_rest,X17,uri_rdf_nil) )
& ( icext(X14,esk1_5(X14,X15,X16,X17,X18))
| icext(X16,esk1_5(X14,X15,X16,X17,X18))
| icext(X18,esk1_5(X14,X15,X16,X17,X18))
| ~ ic(X14)
| ~ ic(X16)
| ~ ic(X18)
| iext(uri_owl_unionOf,X14,X15)
| ~ iext(uri_rdf_first,X15,X16)
| ~ iext(uri_rdf_rest,X15,X17)
| ~ iext(uri_rdf_first,X17,X18)
| ~ iext(uri_rdf_rest,X17,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_rest,esk4_0,uri_rdf_nil),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,plain,
( icext(X1,X2)
| icext(X3,X2)
| ~ icext(X4,X2)
| ~ iext(uri_rdf_first,esk4_0,X3)
| ~ iext(uri_rdf_rest,X5,esk4_0)
| ~ iext(uri_rdf_first,X5,X1)
| ~ iext(uri_owl_unionOf,X4,X5) ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_9,plain,
iext(uri_rdf_first,esk4_0,uri_ex_Falcon),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,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(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_11,plain,
iext(uri_rdf_rest,esk3_0,esk4_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_12,plain,
( icext(uri_ex_Falcon,X1)
| icext(X2,X1)
| ~ icext(X3,X1)
| ~ iext(uri_rdf_first,esk3_0,X2)
| ~ iext(uri_owl_unionOf,X3,esk3_0) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_13,plain,
iext(uri_rdf_first,esk3_0,uri_ex_Eagle),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_14,plain,
! [X12,X13] :
( ( ~ iext(uri_rdf_type,X12,X13)
| icext(X13,X12) )
& ( ~ icext(X13,X12)
| iext(uri_rdf_type,X12,X13) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[rdfs_cext_def])]) ).
fof(c_0_15,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_16,plain,
( icext(uri_ex_Eagle,X1)
| icext(uri_ex_Falcon,X1)
| ~ icext(X2,X1)
| ~ iext(uri_owl_unionOf,X2,esk3_0) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,plain,
iext(uri_owl_unionOf,esk2_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_18,plain,
( icext(X2,X1)
| ~ iext(uri_rdf_type,X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_19,plain,
iext(uri_rdf_type,uri_ex_harry,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_20,negated_conjecture,
! [X22] :
( ~ iext(uri_rdf_type,uri_ex_harry,X22)
| ~ iext(uri_rdf_type,X22,uri_ex_Species) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_15])]) ).
cnf(c_0_21,plain,
( icext(uri_ex_Falcon,X1)
| icext(uri_ex_Eagle,X1)
| ~ icext(esk2_0,X1) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_22,plain,
icext(esk2_0,uri_ex_harry),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_23,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_20]) ).
cnf(c_0_24,plain,
iext(uri_rdf_type,uri_ex_Falcon,uri_ex_Species),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_25,plain,
( iext(uri_rdf_type,X2,X1)
| ~ icext(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_26,plain,
( icext(uri_ex_Eagle,uri_ex_harry)
| icext(uri_ex_Falcon,uri_ex_harry) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_27,negated_conjecture,
~ iext(uri_rdf_type,uri_ex_harry,uri_ex_Falcon),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_28,plain,
iext(uri_rdf_type,uri_ex_Eagle,uri_ex_Species),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_29,plain,
icext(uri_ex_Eagle,uri_ex_harry),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]) ).
cnf(c_0_30,negated_conjecture,
~ iext(uri_rdf_type,uri_ex_harry,uri_ex_Eagle),
inference(spm,[status(thm)],[c_0_23,c_0_28]) ).
cnf(c_0_31,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_29]),c_0_30]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWB014+2 : TPTP v8.1.2. Released v5.2.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n027.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 2400
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon Oct 2 20:49:30 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.20/0.48 Running first-order model finding
% 0.20/0.48 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.9YUjGKVBWa/E---3.1_2605.p
% 0.20/0.49 # Version: 3.1pre001
% 0.20/0.49 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.20/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.49 # Starting sh5l with 300s (1) cores
% 0.20/0.49 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 2728 completed with status 0
% 0.20/0.49 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.20/0.49 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.20/0.49 # No SInE strategy applied
% 0.20/0.49 # Search class: FGHNF-FFMM33-SFFFFFNN
% 0.20/0.49 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.49 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with 811s (1) cores
% 0.20/0.49 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.20/0.49 # Starting new_bool_3 with 136s (1) cores
% 0.20/0.49 # Starting new_bool_1 with 136s (1) cores
% 0.20/0.49 # Starting sh5l with 136s (1) cores
% 0.20/0.49 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 2736 completed with status 0
% 0.20/0.49 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.20/0.49 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.20/0.49 # No SInE strategy applied
% 0.20/0.49 # Search class: FGHNF-FFMM33-SFFFFFNN
% 0.20/0.49 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.49 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with 811s (1) cores
% 0.20/0.49 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.20/0.49 # Preprocessing time : 0.001 s
% 0.20/0.49 # Presaturation interreduction done
% 0.20/0.49
% 0.20/0.49 # Proof found!
% 0.20/0.49 # SZS status Theorem
% 0.20/0.49 # SZS output start CNFRefutation
% See solution above
% 0.20/0.49 # Parsed axioms : 4
% 0.20/0.49 # Removed by relevancy pruning/SinE : 0
% 0.20/0.49 # Initial clauses : 20
% 0.20/0.49 # Removed in clause preprocessing : 0
% 0.20/0.49 # Initial clauses in saturation : 20
% 0.20/0.49 # Processed clauses : 74
% 0.20/0.49 # ...of these trivial : 0
% 0.20/0.49 # ...subsumed : 0
% 0.20/0.49 # ...remaining for further processing : 74
% 0.20/0.49 # Other redundant clauses eliminated : 0
% 0.20/0.49 # Clauses deleted for lack of memory : 0
% 0.20/0.49 # Backward-subsumed : 5
% 0.20/0.49 # Backward-rewritten : 4
% 0.20/0.49 # Generated clauses : 43
% 0.20/0.49 # ...of the previous two non-redundant : 38
% 0.20/0.49 # ...aggressively subsumed : 0
% 0.20/0.49 # Contextual simplify-reflections : 0
% 0.20/0.49 # Paramodulations : 43
% 0.20/0.49 # Factorizations : 0
% 0.20/0.49 # NegExts : 0
% 0.20/0.49 # Equation resolutions : 0
% 0.20/0.49 # Total rewrite steps : 8
% 0.20/0.49 # Propositional unsat checks : 0
% 0.20/0.49 # Propositional check models : 0
% 0.20/0.49 # Propositional check unsatisfiable : 0
% 0.20/0.49 # Propositional clauses : 0
% 0.20/0.49 # Propositional clauses after purity: 0
% 0.20/0.49 # Propositional unsat core size : 0
% 0.20/0.49 # Propositional preprocessing time : 0.000
% 0.20/0.49 # Propositional encoding time : 0.000
% 0.20/0.49 # Propositional solver time : 0.000
% 0.20/0.49 # Success case prop preproc time : 0.000
% 0.20/0.49 # Success case prop encoding time : 0.000
% 0.20/0.49 # Success case prop solver time : 0.000
% 0.20/0.49 # Current number of processed clauses : 45
% 0.20/0.49 # Positive orientable unit clauses : 15
% 0.20/0.49 # Positive unorientable unit clauses: 0
% 0.20/0.49 # Negative unit clauses : 2
% 0.20/0.49 # Non-unit-clauses : 28
% 0.20/0.49 # Current number of unprocessed clauses: 4
% 0.20/0.49 # ...number of literals in the above : 31
% 0.20/0.49 # Current number of archived formulas : 0
% 0.20/0.49 # Current number of archived clauses : 29
% 0.20/0.49 # Clause-clause subsumption calls (NU) : 445
% 0.20/0.49 # Rec. Clause-clause subsumption calls : 79
% 0.20/0.49 # Non-unit clause-clause subsumptions : 5
% 0.20/0.49 # Unit Clause-clause subsumption calls : 61
% 0.20/0.49 # Rewrite failures with RHS unbound : 0
% 0.20/0.49 # BW rewrite match attempts : 3
% 0.20/0.49 # BW rewrite match successes : 3
% 0.20/0.49 # Condensation attempts : 0
% 0.20/0.49 # Condensation successes : 0
% 0.20/0.49 # Termbank termtop insertions : 2887
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.006 s
% 0.20/0.49 # System time : 0.002 s
% 0.20/0.49 # Total time : 0.008 s
% 0.20/0.49 # Maximum resident set size: 1768 pages
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.022 s
% 0.20/0.49 # System time : 0.007 s
% 0.20/0.49 # Total time : 0.029 s
% 0.20/0.49 # Maximum resident set size: 1680 pages
% 0.20/0.49 % E---3.1 exiting
%------------------------------------------------------------------------------