%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SWB007+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 : n004.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:38 PM UTC 2026
% Result : Theorem 1.89s 1.92s
% Output : CNFRefutation 1.89s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 3
% Syntax : Number of formulae : 14 ( 6 unt; 0 def)
% Number of atoms : 30 ( 5 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 26 ( 10 ~; 7 |; 8 &)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 9 con; 0-0 aty)
% Number of variables : 6 ( 0 sgn 4 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(testcase_conclusion_fullish_007_Equal_Classes,conjecture,
( iext(uri_rdf_type,uri_ex_w,uri_ex_c2)
& iext(uri_rdfs_subClassOf,uri_ex_c,uri_ex_c2)
& iext(uri_rdfs_range,uri_ex_p,uri_ex_c2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',testcase_conclusion_fullish_007_Equal_Classes) ).
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_007_Equal_Classes,axiom,
( iext(uri_owl_sameAs,uri_ex_c1,uri_ex_c2)
& iext(uri_rdf_type,uri_ex_w,uri_ex_c1)
& iext(uri_rdfs_subClassOf,uri_ex_c,uri_ex_c1)
& iext(uri_rdfs_range,uri_ex_p,uri_ex_c1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',testcase_premise_fullish_007_Equal_Classes) ).
fof(c_0_3,negated_conjecture,
~ ( iext(uri_rdf_type,uri_ex_w,uri_ex_c2)
& iext(uri_rdfs_subClassOf,uri_ex_c,uri_ex_c2)
& iext(uri_rdfs_range,uri_ex_p,uri_ex_c2) ),
inference(assume_negation,[status(cth)],[testcase_conclusion_fullish_007_Equal_Classes]) ).
fof(c_0_4,plain,
! [X1812,X1813] :
( ( ~ iext(uri_owl_sameAs,X1812,X1813)
| X1812 = X1813 )
& ( X1812 != X1813
| iext(uri_owl_sameAs,X1812,X1813) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[owl_eqdis_sameas])]) ).
fof(c_0_5,negated_conjecture,
( ~ iext(uri_rdf_type,uri_ex_w,uri_ex_c2)
| ~ iext(uri_rdfs_subClassOf,uri_ex_c,uri_ex_c2)
| ~ iext(uri_rdfs_range,uri_ex_p,uri_ex_c2) ),
inference(fof_nnf,[status(thm)],[c_0_3]) ).
cnf(c_0_6,plain,
( X1 = X2
| ~ iext(uri_owl_sameAs,X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,plain,
iext(uri_owl_sameAs,uri_ex_c1,uri_ex_c2),
inference(split_conjunct,[status(thm)],[testcase_premise_fullish_007_Equal_Classes]) ).
cnf(c_0_8,negated_conjecture,
( ~ iext(uri_rdf_type,uri_ex_w,uri_ex_c2)
| ~ iext(uri_rdfs_subClassOf,uri_ex_c,uri_ex_c2)
| ~ iext(uri_rdfs_range,uri_ex_p,uri_ex_c2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
uri_ex_c2 = uri_ex_c1,
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_10,plain,
iext(uri_rdf_type,uri_ex_w,uri_ex_c1),
inference(split_conjunct,[status(thm)],[testcase_premise_fullish_007_Equal_Classes]) ).
cnf(c_0_11,plain,
iext(uri_rdfs_range,uri_ex_p,uri_ex_c1),
inference(split_conjunct,[status(thm)],[testcase_premise_fullish_007_Equal_Classes]) ).
cnf(c_0_12,plain,
iext(uri_rdfs_subClassOf,uri_ex_c,uri_ex_c1),
inference(split_conjunct,[status(thm)],[testcase_premise_fullish_007_Equal_Classes]) ).
cnf(c_0_13,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_9]),c_0_10]),c_0_9]),c_0_11]),c_0_9]),c_0_12])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWB007+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.15/0.33 % Computer : n004.cluster.edu
% 0.15/0.33 % Model : x86_64 x86_64
% 0.15/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.33 % Memory : 8042.1875MB
% 0.15/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.33 % CPULimit : 300
% 0.15/0.33 % WCLimit : 300
% 0.15/0.33 % DateTime : Tue May 5 04:06:47 EDT 2026
% 0.15/0.33 % CPUTime :
% 0.15/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.92 % Total time : 1.479s
%------------------------------------------------------------------------------