TSTP Solution File: SWB006+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SWB006+1 : TPTP v8.1.2. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n007.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 : 300s
% WCLimit : 300s
% DateTime : Thu Aug 31 20:09:00 EDT 2023
% Result : Theorem 12.09s 2.69s
% Output : CNFRefutation 12.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 4
% Syntax : Number of formulae : 29 ( 20 unt; 0 def)
% Number of atoms : 47 ( 11 equ)
% Maximal formula atoms : 6 ( 1 avg)
% Number of connectives : 27 ( 9 ~; 4 |; 11 &)
% ( 2 <=>; 1 =>; 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 : 13 ( 0 sgn; 8 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f354,axiom,
! [X3,X6] :
( iext(uri_owl_sameAs,X3,X6)
<=> X3 = X6 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',owl_eqdis_sameas) ).
fof(f559,conjecture,
iext(uri_owl_sameAs,uri_ex_u,uri_ex_w),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',testcase_conclusion_fullish_006_Literal_Values_represented_by_URIs_and_Blank_Nodes) ).
fof(f560,negated_conjecture,
~ iext(uri_owl_sameAs,uri_ex_u,uri_ex_w),
inference(negated_conjecture,[],[f559]) ).
fof(f561,axiom,
? [X41] :
( iext(uri_owl_sameAs,X41,uri_ex_w)
& iext(uri_owl_sameAs,X41,literal_plain(dat_str_abc))
& iext(uri_owl_sameAs,uri_ex_u,literal_plain(dat_str_abc)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',testcase_premise_fullish_006_Literal_Values_represented_by_URIs_and_Blank_Nodes) ).
fof(f765,plain,
! [X0,X1] :
( iext(uri_owl_sameAs,X0,X1)
<=> X0 = X1 ),
inference(rectify,[],[f354]) ).
fof(f920,plain,
~ iext(uri_owl_sameAs,uri_ex_u,uri_ex_w),
inference(flattening,[],[f560]) ).
fof(f921,plain,
? [X0] :
( iext(uri_owl_sameAs,X0,uri_ex_w)
& iext(uri_owl_sameAs,X0,literal_plain(dat_str_abc))
& iext(uri_owl_sameAs,uri_ex_u,literal_plain(dat_str_abc)) ),
inference(rectify,[],[f561]) ).
fof(f1780,plain,
! [X0,X1] :
( ( iext(uri_owl_sameAs,X0,X1)
| X0 != X1 )
& ( X0 = X1
| ~ iext(uri_owl_sameAs,X0,X1) ) ),
inference(nnf_transformation,[],[f765]) ).
fof(f1920,plain,
( ? [X0] :
( iext(uri_owl_sameAs,X0,uri_ex_w)
& iext(uri_owl_sameAs,X0,literal_plain(dat_str_abc))
& iext(uri_owl_sameAs,uri_ex_u,literal_plain(dat_str_abc)) )
=> ( iext(uri_owl_sameAs,sK251,uri_ex_w)
& iext(uri_owl_sameAs,sK251,literal_plain(dat_str_abc))
& iext(uri_owl_sameAs,uri_ex_u,literal_plain(dat_str_abc)) ) ),
introduced(choice_axiom,[]) ).
fof(f1921,plain,
( iext(uri_owl_sameAs,sK251,uri_ex_w)
& iext(uri_owl_sameAs,sK251,literal_plain(dat_str_abc))
& iext(uri_owl_sameAs,uri_ex_u,literal_plain(dat_str_abc)) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK251])],[f921,f1920]) ).
fof(f2858,plain,
! [X0,X1] :
( X0 = X1
| ~ iext(uri_owl_sameAs,X0,X1) ),
inference(cnf_transformation,[],[f1780]) ).
fof(f3211,plain,
~ iext(uri_owl_sameAs,uri_ex_u,uri_ex_w),
inference(cnf_transformation,[],[f920]) ).
fof(f3212,plain,
iext(uri_owl_sameAs,uri_ex_u,literal_plain(dat_str_abc)),
inference(cnf_transformation,[],[f1921]) ).
fof(f3213,plain,
iext(uri_owl_sameAs,sK251,literal_plain(dat_str_abc)),
inference(cnf_transformation,[],[f1921]) ).
fof(f3214,plain,
iext(uri_owl_sameAs,sK251,uri_ex_w),
inference(cnf_transformation,[],[f1921]) ).
cnf(c_982,plain,
( ~ iext(uri_owl_sameAs,X0,X1)
| X0 = X1 ),
inference(cnf_transformation,[],[f2858]) ).
cnf(c_1326,negated_conjecture,
~ iext(uri_owl_sameAs,uri_ex_u,uri_ex_w),
inference(cnf_transformation,[],[f3211]) ).
cnf(c_1327,plain,
iext(uri_owl_sameAs,sK251,uri_ex_w),
inference(cnf_transformation,[],[f3214]) ).
cnf(c_1328,plain,
iext(uri_owl_sameAs,sK251,literal_plain(dat_str_abc)),
inference(cnf_transformation,[],[f3213]) ).
cnf(c_1329,plain,
iext(uri_owl_sameAs,uri_ex_u,literal_plain(dat_str_abc)),
inference(cnf_transformation,[],[f3212]) ).
cnf(c_41971,plain,
uri_ex_w = sK251,
inference(superposition,[status(thm)],[c_1327,c_982]) ).
cnf(c_41972,plain,
literal_plain(dat_str_abc) = sK251,
inference(superposition,[status(thm)],[c_1328,c_982]) ).
cnf(c_41973,plain,
literal_plain(dat_str_abc) = uri_ex_u,
inference(superposition,[status(thm)],[c_1329,c_982]) ).
cnf(c_41976,plain,
iext(uri_owl_sameAs,uri_ex_u,sK251),
inference(demodulation,[status(thm)],[c_1329,c_41972]) ).
cnf(c_41977,plain,
uri_ex_u = sK251,
inference(superposition,[status(thm)],[c_41976,c_982]) ).
cnf(c_41978,plain,
iext(uri_owl_sameAs,uri_ex_u,uri_ex_u),
inference(demodulation,[status(thm)],[c_41976,c_41977]) ).
cnf(c_41981,plain,
uri_ex_u = uri_ex_w,
inference(light_normalisation,[status(thm)],[c_41972,c_41971,c_41973]) ).
cnf(c_41982,plain,
~ iext(uri_owl_sameAs,uri_ex_u,uri_ex_u),
inference(superposition,[status(thm)],[c_41981,c_1326]) ).
cnf(c_41983,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_41982,c_41978]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.11 % Problem : SWB006+1 : TPTP v8.1.2. Released v5.2.0.
% 0.09/0.12 % Command : run_iprover %s %d THM
% 0.12/0.33 % Computer : n007.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Sun Aug 27 06:02:42 EDT 2023
% 0.12/0.33 % CPUTime :
% 0.17/0.44 Running first-order theorem proving
% 0.17/0.44 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 12.09/2.69 % SZS status Started for theBenchmark.p
% 12.09/2.69 % SZS status Theorem for theBenchmark.p
% 12.09/2.69
% 12.09/2.69 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 12.09/2.69
% 12.09/2.69 ------ iProver source info
% 12.09/2.69
% 12.09/2.69 git: date: 2023-05-31 18:12:56 +0000
% 12.09/2.69 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 12.09/2.69 git: non_committed_changes: false
% 12.09/2.69 git: last_make_outside_of_git: false
% 12.09/2.69
% 12.09/2.69 ------ Parsing...
% 12.09/2.69 ------ Clausification by vclausify_rel & Parsing by iProver...
% 12.09/2.69
% 12.09/2.69 ------ Preprocessing... sup_sim: 0 sf_s rm: 2 0s sf_e pe_s pe:1:0s pe:2:0s pe_e
% 12.09/2.69
% 12.09/2.69 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 12.09/2.69
% 12.09/2.69 ------ Preprocessing... sf_s rm: 1 0s sf_e
% 12.09/2.69 ------ Proving...
% 12.09/2.69 ------ Problem Properties
% 12.09/2.69
% 12.09/2.69
% 12.09/2.69 clauses 1172
% 12.09/2.69 conjectures 1
% 12.09/2.69 EPR 710
% 12.09/2.69 Horn 903
% 12.09/2.69 unary 228
% 12.09/2.69 binary 455
% 12.09/2.69 lits 3736
% 12.09/2.69 lits eq 197
% 12.09/2.69 fd_pure 0
% 12.09/2.69 fd_pseudo 0
% 12.09/2.69 fd_cond 0
% 12.09/2.69 fd_pseudo_cond 66
% 12.09/2.69 AC symbols 0
% 12.09/2.69
% 12.09/2.69 ------ Input Options Time Limit: Unbounded
% 12.09/2.69
% 12.09/2.69
% 12.09/2.69 ------
% 12.09/2.69 Current options:
% 12.09/2.69 ------
% 12.09/2.69
% 12.09/2.69
% 12.09/2.69
% 12.09/2.69
% 12.09/2.69 ------ Proving...
% 12.09/2.69
% 12.09/2.69
% 12.09/2.69 ------ Proving...
% 12.09/2.69
% 12.09/2.69
% 12.09/2.69 ------ Proving...
% 12.09/2.69
% 12.09/2.69
% 12.09/2.69 ------ Proving...
% 12.09/2.69
% 12.09/2.69
% 12.09/2.69 % SZS status Theorem for theBenchmark.p
% 12.09/2.69
% 12.09/2.69 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 12.09/2.69
% 12.09/2.69
%------------------------------------------------------------------------------