TSTP Solution File: SWB001+2 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SWB001+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:35:43 EDT 2023
% Result : Theorem 0.21s 0.51s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 2
% Syntax : Number of formulae : 8 ( 3 unt; 0 def)
% Number of atoms : 15 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 12 ( 5 ~; 2 |; 5 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 9 con; 0-0 aty)
% Number of variables : 0 ( 0 sgn; 0 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(testcase_conclusion_fullish_001_Subgraph_Entailment,conjecture,
( iext(uri_rdf_type,uri_ex_r,uri_owl_Restriction)
& iext(uri_owl_onProperty,uri_ex_r,uri_ex_p) ),
file('/export/starexec/sandbox/tmp/tmp.UKkgtzED6Z/E---3.1_2690.p',testcase_conclusion_fullish_001_Subgraph_Entailment) ).
fof(testcase_premise_fullish_001_Subgraph_Entailment,axiom,
( iext(uri_rdfs_subClassOf,uri_ex_c,uri_ex_r)
& iext(uri_rdf_type,uri_ex_r,uri_owl_Restriction)
& iext(uri_owl_onProperty,uri_ex_r,uri_ex_p)
& iext(uri_owl_someValuesFrom,uri_ex_r,uri_ex_d) ),
file('/export/starexec/sandbox/tmp/tmp.UKkgtzED6Z/E---3.1_2690.p',testcase_premise_fullish_001_Subgraph_Entailment) ).
fof(c_0_2,negated_conjecture,
~ ( iext(uri_rdf_type,uri_ex_r,uri_owl_Restriction)
& iext(uri_owl_onProperty,uri_ex_r,uri_ex_p) ),
inference(assume_negation,[status(cth)],[testcase_conclusion_fullish_001_Subgraph_Entailment]) ).
fof(c_0_3,negated_conjecture,
( ~ iext(uri_rdf_type,uri_ex_r,uri_owl_Restriction)
| ~ iext(uri_owl_onProperty,uri_ex_r,uri_ex_p) ),
inference(fof_nnf,[status(thm)],[c_0_2]) ).
cnf(c_0_4,negated_conjecture,
( ~ iext(uri_rdf_type,uri_ex_r,uri_owl_Restriction)
| ~ iext(uri_owl_onProperty,uri_ex_r,uri_ex_p) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_5,plain,
iext(uri_rdf_type,uri_ex_r,uri_owl_Restriction),
inference(split_conjunct,[status(thm)],[testcase_premise_fullish_001_Subgraph_Entailment]) ).
cnf(c_0_6,plain,
iext(uri_owl_onProperty,uri_ex_r,uri_ex_p),
inference(split_conjunct,[status(thm)],[testcase_premise_fullish_001_Subgraph_Entailment]) ).
cnf(c_0_7,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_4,c_0_5]),c_0_6])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : SWB001+2 : TPTP v8.1.2. Released v5.2.0.
% 0.11/0.15 % Command : run_E %s %d THM
% 0.14/0.36 % Computer : n005.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 2400
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Mon Oct 2 20:23:01 EDT 2023
% 0.14/0.36 % CPUTime :
% 0.21/0.50 Running first-order theorem proving
% 0.21/0.50 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.UKkgtzED6Z/E---3.1_2690.p
% 0.21/0.51 # Version: 3.1pre001
% 0.21/0.51 # Preprocessing class: FSSSSMSMSSSNFFN.
% 0.21/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting G----_0031_C18_F1_SE_CS_SP_S0Y with 1500s (5) cores
% 0.21/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.51 # Starting sh5l with 300s (1) cores
% 0.21/0.51 # G----_0031_C18_F1_SE_CS_SP_S0Y with pid 2806 completed with status 0
% 0.21/0.51 # Result found by G----_0031_C18_F1_SE_CS_SP_S0Y
% 0.21/0.51 # Preprocessing class: FSSSSMSMSSSNFFN.
% 0.21/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting G----_0031_C18_F1_SE_CS_SP_S0Y with 1500s (5) cores
% 0.21/0.51 # No SInE strategy applied
% 0.21/0.51 # Search class: FUHNF-FFSS00-SFFFFFNN
% 0.21/0.51 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.51 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.21/0.51 # Starting G----_0031_C18_F1_SE_CS_SP_S0Y with 151s (1) cores
% 0.21/0.51 # Starting new_bool_3 with 136s (1) cores
% 0.21/0.51 # Starting new_bool_1 with 136s (1) cores
% 0.21/0.51 # Starting sh5l with 136s (1) cores
% 0.21/0.51 # SAT001_MinMin_p005000_rr_RG with pid 2813 completed with status 0
% 0.21/0.51 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.21/0.51 # Preprocessing class: FSSSSMSMSSSNFFN.
% 0.21/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting G----_0031_C18_F1_SE_CS_SP_S0Y with 1500s (5) cores
% 0.21/0.51 # No SInE strategy applied
% 0.21/0.51 # Search class: FUHNF-FFSS00-SFFFFFNN
% 0.21/0.51 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.51 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.21/0.51 # Preprocessing time : 0.001 s
% 0.21/0.51 # Presaturation interreduction done
% 0.21/0.51
% 0.21/0.51 # Proof found!
% 0.21/0.51 # SZS status Theorem
% 0.21/0.51 # SZS output start CNFRefutation
% See solution above
% 0.21/0.51 # Parsed axioms : 2
% 0.21/0.51 # Removed by relevancy pruning/SinE : 0
% 0.21/0.51 # Initial clauses : 5
% 0.21/0.51 # Removed in clause preprocessing : 0
% 0.21/0.51 # Initial clauses in saturation : 5
% 0.21/0.51 # Processed clauses : 3
% 0.21/0.51 # ...of these trivial : 0
% 0.21/0.51 # ...subsumed : 0
% 0.21/0.51 # ...remaining for further processing : 2
% 0.21/0.51 # Other redundant clauses eliminated : 0
% 0.21/0.51 # Clauses deleted for lack of memory : 0
% 0.21/0.51 # Backward-subsumed : 0
% 0.21/0.51 # Backward-rewritten : 0
% 0.21/0.51 # Generated clauses : 0
% 0.21/0.51 # ...of the previous two non-redundant : 0
% 0.21/0.51 # ...aggressively subsumed : 0
% 0.21/0.51 # Contextual simplify-reflections : 0
% 0.21/0.51 # Paramodulations : 0
% 0.21/0.51 # Factorizations : 0
% 0.21/0.51 # NegExts : 0
% 0.21/0.51 # Equation resolutions : 0
% 0.21/0.51 # Total rewrite steps : 2
% 0.21/0.51 # Propositional unsat checks : 0
% 0.21/0.51 # Propositional check models : 0
% 0.21/0.51 # Propositional check unsatisfiable : 0
% 0.21/0.51 # Propositional clauses : 0
% 0.21/0.51 # Propositional clauses after purity: 0
% 0.21/0.51 # Propositional unsat core size : 0
% 0.21/0.51 # Propositional preprocessing time : 0.000
% 0.21/0.51 # Propositional encoding time : 0.000
% 0.21/0.51 # Propositional solver time : 0.000
% 0.21/0.51 # Success case prop preproc time : 0.000
% 0.21/0.51 # Success case prop encoding time : 0.000
% 0.21/0.51 # Success case prop solver time : 0.000
% 0.21/0.51 # Current number of processed clauses : 2
% 0.21/0.51 # Positive orientable unit clauses : 2
% 0.21/0.51 # Positive unorientable unit clauses: 0
% 0.21/0.51 # Negative unit clauses : 0
% 0.21/0.51 # Non-unit-clauses : 0
% 0.21/0.51 # Current number of unprocessed clauses: 2
% 0.21/0.51 # ...number of literals in the above : 2
% 0.21/0.51 # Current number of archived formulas : 0
% 0.21/0.51 # Current number of archived clauses : 0
% 0.21/0.51 # Clause-clause subsumption calls (NU) : 0
% 0.21/0.51 # Rec. Clause-clause subsumption calls : 0
% 0.21/0.51 # Non-unit clause-clause subsumptions : 0
% 0.21/0.51 # Unit Clause-clause subsumption calls : 0
% 0.21/0.51 # Rewrite failures with RHS unbound : 0
% 0.21/0.51 # BW rewrite match attempts : 0
% 0.21/0.51 # BW rewrite match successes : 0
% 0.21/0.51 # Condensation attempts : 0
% 0.21/0.51 # Condensation successes : 0
% 0.21/0.51 # Termbank termtop insertions : 148
% 0.21/0.51
% 0.21/0.51 # -------------------------------------------------
% 0.21/0.51 # User time : 0.002 s
% 0.21/0.51 # System time : 0.002 s
% 0.21/0.51 # Total time : 0.004 s
% 0.21/0.51 # Maximum resident set size: 1612 pages
% 0.21/0.51
% 0.21/0.51 # -------------------------------------------------
% 0.21/0.51 # User time : 0.008 s
% 0.21/0.51 # System time : 0.007 s
% 0.21/0.51 # Total time : 0.014 s
% 0.21/0.51 # Maximum resident set size: 1668 pages
% 0.21/0.51 % E---3.1 exiting
% 0.21/0.51 % E---3.1 exiting
%------------------------------------------------------------------------------