TSTP Solution File: SWB006+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SWB006+1 : TPTP v8.1.2. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n011.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:50 EDT 2023
% Result : Theorem 0.43s 0.89s
% Output : CNFRefutation 0.43s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 3
% Syntax : Number of formulae : 19 ( 13 unt; 0 def)
% Number of atoms : 29 ( 8 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 17 ( 7 ~; 4 |; 5 &)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-1 aty)
% Number of variables : 10 ( 0 sgn; 4 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(owl_eqdis_sameas,axiom,
! [X4,X7] :
( iext(uri_owl_sameAs,X4,X7)
<=> X4 = X7 ),
file('/export/starexec/sandbox/tmp/tmp.X9vgFkEgTg/E---3.1_26816.p',owl_eqdis_sameas) ).
fof(testcase_premise_fullish_006_Literal_Values_represented_by_URIs_and_Blank_Nodes,axiom,
? [X42] :
( iext(uri_owl_sameAs,uri_ex_u,literal_plain(dat_str_abc))
& iext(uri_owl_sameAs,X42,literal_plain(dat_str_abc))
& iext(uri_owl_sameAs,X42,uri_ex_w) ),
file('/export/starexec/sandbox/tmp/tmp.X9vgFkEgTg/E---3.1_26816.p',testcase_premise_fullish_006_Literal_Values_represented_by_URIs_and_Blank_Nodes) ).
fof(testcase_conclusion_fullish_006_Literal_Values_represented_by_URIs_and_Blank_Nodes,conjecture,
iext(uri_owl_sameAs,uri_ex_u,uri_ex_w),
file('/export/starexec/sandbox/tmp/tmp.X9vgFkEgTg/E---3.1_26816.p',testcase_conclusion_fullish_006_Literal_Values_represented_by_URIs_and_Blank_Nodes) ).
fof(c_0_3,plain,
! [X49,X50] :
( ( ~ iext(uri_owl_sameAs,X49,X50)
| X49 = X50 )
& ( X49 != X50
| iext(uri_owl_sameAs,X49,X50) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[owl_eqdis_sameas])]) ).
fof(c_0_4,plain,
( iext(uri_owl_sameAs,uri_ex_u,literal_plain(dat_str_abc))
& iext(uri_owl_sameAs,esk1_0,literal_plain(dat_str_abc))
& iext(uri_owl_sameAs,esk1_0,uri_ex_w) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[testcase_premise_fullish_006_Literal_Values_represented_by_URIs_and_Blank_Nodes])]) ).
cnf(c_0_5,plain,
( X1 = X2
| ~ iext(uri_owl_sameAs,X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_6,plain,
iext(uri_owl_sameAs,uri_ex_u,literal_plain(dat_str_abc)),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
fof(c_0_7,negated_conjecture,
~ iext(uri_owl_sameAs,uri_ex_u,uri_ex_w),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[testcase_conclusion_fullish_006_Literal_Values_represented_by_URIs_and_Blank_Nodes])]) ).
cnf(c_0_8,plain,
iext(uri_owl_sameAs,esk1_0,uri_ex_w),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_9,plain,
iext(uri_owl_sameAs,esk1_0,literal_plain(dat_str_abc)),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_10,plain,
literal_plain(dat_str_abc) = uri_ex_u,
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_11,negated_conjecture,
~ iext(uri_owl_sameAs,uri_ex_u,uri_ex_w),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
uri_ex_w = esk1_0,
inference(spm,[status(thm)],[c_0_5,c_0_8]) ).
cnf(c_0_13,plain,
iext(uri_owl_sameAs,esk1_0,uri_ex_u),
inference(rw,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,plain,
( iext(uri_owl_sameAs,X1,X2)
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_15,negated_conjecture,
~ iext(uri_owl_sameAs,uri_ex_u,esk1_0),
inference(rw,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,plain,
uri_ex_u = esk1_0,
inference(spm,[status(thm)],[c_0_5,c_0_13]) ).
cnf(c_0_17,plain,
iext(uri_owl_sameAs,X1,X1),
inference(er,[status(thm)],[c_0_14]) ).
cnf(c_0_18,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_16]),c_0_17])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.16/0.18 % Problem : SWB006+1 : TPTP v8.1.2. Released v5.2.0.
% 0.16/0.19 % Command : run_E %s %d THM
% 0.18/0.40 % Computer : n011.cluster.edu
% 0.18/0.40 % Model : x86_64 x86_64
% 0.18/0.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.40 % Memory : 8042.1875MB
% 0.18/0.40 % OS : Linux 3.10.0-693.el7.x86_64
% 0.18/0.40 % CPULimit : 2400
% 0.18/0.40 % WCLimit : 300
% 0.18/0.40 % DateTime : Mon Oct 2 20:20:23 EDT 2023
% 0.18/0.40 % 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.X9vgFkEgTg/E---3.1_26816.p
% 0.43/0.89 # Version: 3.1pre001
% 0.43/0.89 # Preprocessing class: FSLMSMSLSSSNFFN.
% 0.43/0.89 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.43/0.89 # Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 0.43/0.89 # Starting new_bool_3 with 600s (2) cores
% 0.43/0.89 # Starting new_bool_1 with 600s (2) cores
% 0.43/0.89 # Starting sh5l with 300s (1) cores
% 0.43/0.89 # sh5l with pid 26953 completed with status 0
% 0.43/0.89 # Result found by sh5l
% 0.43/0.89 # Preprocessing class: FSLMSMSLSSSNFFN.
% 0.43/0.89 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.43/0.89 # Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 0.43/0.89 # Starting new_bool_3 with 600s (2) cores
% 0.43/0.89 # Starting new_bool_1 with 600s (2) cores
% 0.43/0.89 # Starting sh5l with 300s (1) cores
% 0.43/0.89 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.43/0.89 # Search class: FGHSF-FMLM33-SFFFFFNN
% 0.43/0.89 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.43/0.89 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 181s (1) cores
% 0.43/0.89 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with pid 26981 completed with status 0
% 0.43/0.89 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d
% 0.43/0.89 # Preprocessing class: FSLMSMSLSSSNFFN.
% 0.43/0.89 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.43/0.89 # Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 0.43/0.89 # Starting new_bool_3 with 600s (2) cores
% 0.43/0.89 # Starting new_bool_1 with 600s (2) cores
% 0.43/0.89 # Starting sh5l with 300s (1) cores
% 0.43/0.89 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.43/0.89 # Search class: FGHSF-FMLM33-SFFFFFNN
% 0.43/0.89 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.43/0.89 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 181s (1) cores
% 0.43/0.89 # Preprocessing time : 0.019 s
% 0.43/0.89 # Presaturation interreduction done
% 0.43/0.89
% 0.43/0.89 # Proof found!
% 0.43/0.89 # SZS status Theorem
% 0.43/0.89 # SZS output start CNFRefutation
% See solution above
% 0.43/0.89 # Parsed axioms : 560
% 0.43/0.89 # Removed by relevancy pruning/SinE : 282
% 0.43/0.89 # Initial clauses : 881
% 0.43/0.89 # Removed in clause preprocessing : 40
% 0.43/0.89 # Initial clauses in saturation : 841
% 0.43/0.89 # Processed clauses : 1135
% 0.43/0.89 # ...of these trivial : 59
% 0.43/0.89 # ...subsumed : 62
% 0.43/0.89 # ...remaining for further processing : 1014
% 0.43/0.89 # Other redundant clauses eliminated : 15
% 0.43/0.89 # Clauses deleted for lack of memory : 0
% 0.43/0.89 # Backward-subsumed : 6
% 0.43/0.89 # Backward-rewritten : 6
% 0.43/0.89 # Generated clauses : 379
% 0.43/0.89 # ...of the previous two non-redundant : 295
% 0.43/0.89 # ...aggressively subsumed : 0
% 0.43/0.89 # Contextual simplify-reflections : 9
% 0.43/0.89 # Paramodulations : 364
% 0.43/0.89 # Factorizations : 0
% 0.43/0.89 # NegExts : 0
% 0.43/0.89 # Equation resolutions : 15
% 0.43/0.89 # Total rewrite steps : 159
% 0.43/0.89 # Propositional unsat checks : 0
% 0.43/0.89 # Propositional check models : 0
% 0.43/0.89 # Propositional check unsatisfiable : 0
% 0.43/0.89 # Propositional clauses : 0
% 0.43/0.89 # Propositional clauses after purity: 0
% 0.43/0.89 # Propositional unsat core size : 0
% 0.43/0.89 # Propositional preprocessing time : 0.000
% 0.43/0.89 # Propositional encoding time : 0.000
% 0.43/0.89 # Propositional solver time : 0.000
% 0.43/0.89 # Success case prop preproc time : 0.000
% 0.43/0.89 # Success case prop encoding time : 0.000
% 0.43/0.89 # Success case prop solver time : 0.000
% 0.43/0.89 # Current number of processed clauses : 222
% 0.43/0.89 # Positive orientable unit clauses : 144
% 0.43/0.89 # Positive unorientable unit clauses: 0
% 0.43/0.89 # Negative unit clauses : 15
% 0.43/0.89 # Non-unit-clauses : 63
% 0.43/0.89 # Current number of unprocessed clauses: 766
% 0.43/0.89 # ...number of literals in the above : 4229
% 0.43/0.89 # Current number of archived formulas : 0
% 0.43/0.89 # Current number of archived clauses : 777
% 0.43/0.89 # Clause-clause subsumption calls (NU) : 318818
% 0.43/0.89 # Rec. Clause-clause subsumption calls : 11904
% 0.43/0.89 # Non-unit clause-clause subsumptions : 53
% 0.43/0.89 # Unit Clause-clause subsumption calls : 615
% 0.43/0.89 # Rewrite failures with RHS unbound : 0
% 0.43/0.89 # BW rewrite match attempts : 36
% 0.43/0.89 # BW rewrite match successes : 3
% 0.43/0.89 # Condensation attempts : 0
% 0.43/0.89 # Condensation successes : 0
% 0.43/0.89 # Termbank termtop insertions : 85218
% 0.43/0.89
% 0.43/0.89 # -------------------------------------------------
% 0.43/0.89 # User time : 0.235 s
% 0.43/0.89 # System time : 0.011 s
% 0.43/0.89 # Total time : 0.247 s
% 0.43/0.89 # Maximum resident set size: 5228 pages
% 0.43/0.89
% 0.43/0.89 # -------------------------------------------------
% 0.43/0.89 # User time : 0.246 s
% 0.43/0.89 # System time : 0.016 s
% 0.43/0.89 # Total time : 0.262 s
% 0.43/0.89 # Maximum resident set size: 2236 pages
% 0.43/0.89 % E---3.1 exiting
% 0.43/0.89 % E---3.1 exiting
%------------------------------------------------------------------------------