%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SWB006+1 : TPTP v9.2.1. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n023.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 : Tue May 5 05:16:36 PM UTC 2026
% Result : Theorem 1.89s 1.92s
% Output : CNFRefutation 1.89s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 3
% Syntax : Number of formulae : 18 ( 12 unt; 0 def)
% Number of atoms : 28 ( 8 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 16 ( 6 ~; 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/benchmark/Axioms/SWB001+0.ax',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/benchmark/theBenchmark.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/benchmark/theBenchmark.p',testcase_conclusion_fullish_006_Literal_Values_represented_by_URIs_and_Blank_Nodes) ).
fof(c_0_3,plain,
! [X1814,X1815] :
( ( ~ iext(uri_owl_sameAs,X1814,X1815)
| X1814 = X1815 )
& ( X1814 != X1815
| iext(uri_owl_sameAs,X1814,X1815) ) ),
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,esk192_0,literal_plain(dat_str_abc))
& iext(uri_owl_sameAs,esk192_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,esk192_0,uri_ex_w),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,plain,
iext(uri_owl_sameAs,uri_ex_u,literal_plain(dat_str_abc)),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,plain,
iext(uri_owl_sameAs,esk192_0,literal_plain(dat_str_abc)),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_9,plain,
esk192_0 = uri_ex_w,
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_10,plain,
literal_plain(dat_str_abc) = uri_ex_u,
inference(spm,[status(thm)],[c_0_5,c_0_7]) ).
fof(c_0_11,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_12,plain,
iext(uri_owl_sameAs,uri_ex_w,uri_ex_u),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_9]),c_0_10]) ).
cnf(c_0_13,plain,
( iext(uri_owl_sameAs,X1,X2)
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_14,negated_conjecture,
~ iext(uri_owl_sameAs,uri_ex_u,uri_ex_w),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_15,plain,
uri_ex_u = uri_ex_w,
inference(spm,[status(thm)],[c_0_5,c_0_12]) ).
cnf(c_0_16,plain,
iext(uri_owl_sameAs,X1,X1),
inference(er,[status(thm)],[c_0_13]) ).
cnf(c_0_17,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_15]),c_0_16])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWB006+1 : TPTP v9.2.1. Released v5.2.0.
% 0.00/0.12 % Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.14/0.33 % Computer : n023.cluster.edu
% 0.14/0.33 % Model : x86_64 x86_64
% 0.14/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33 % Memory : 8042.1875MB
% 0.14/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.33 % CPULimit : 300
% 0.14/0.33 % WCLimit : 300
% 0.14/0.33 % DateTime : Tue May 5 04:07:23 EDT 2026
% 0.14/0.33 % CPUTime :
% 0.14/0.34 % start to proof: theBenchmark
% 1.89/1.92 % Version : CSE_E---1.7
% 1.89/1.92 % Problem : theBenchmark.p
% 1.89/1.92 % SZS status Theorem for theBenchmark.p
% 1.89/1.92 % SZS output start CNFRefutation
% See solution above
% 1.89/1.93 % Total time : 1.480s
%------------------------------------------------------------------------------