%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : CSR099+3 : TPTP v9.2.1. Bugfixed v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n020.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 04:15:16 PM UTC 2026
% Result : Theorem 79.91s 78.89s
% Output : CNFRefutation 79.91s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 5
% Syntax : Number of formulae : 15 ( 8 unt; 0 def)
% Number of atoms : 35 ( 7 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 35 ( 15 ~; 13 |; 4 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 14 ( 1 sgn 8 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(kb_SUMO_28267,axiom,
! [X1034,X1035] :
( ( s__instance(X1035,s__SetOrClass)
& s__instance(X1034,s__SetOrClass) )
=> ( ( s__subclass(X1034,X1035)
& s__subclass(X1035,X1034) )
=> X1034 = X1035 ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR003+2.ax',kb_SUMO_28267) ).
fof(kb_SUMO_26635,axiom,
! [X1,X15] :
( s__subclass(X1,X15)
=> ( s__instance(X1,s__SetOrClass)
& s__instance(X15,s__SetOrClass) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR003+2.ax',kb_SUMO_26635) ).
fof(prove_from_ALL,conjecture,
s__Class30_1 = s__Reptile,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_from_ALL) ).
fof(local_2,axiom,
s__subclass(s__Class30_1,s__Reptile),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',local_2) ).
fof(local_3,axiom,
s__subclass(s__Reptile,s__Class30_1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',local_3) ).
fof(c_0_5,plain,
! [X2949,X2950] :
( ~ s__instance(X2950,s__SetOrClass)
| ~ s__instance(X2949,s__SetOrClass)
| ~ s__subclass(X2949,X2950)
| ~ s__subclass(X2950,X2949)
| X2949 = X2950 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_28267])]) ).
fof(c_0_6,plain,
! [X2937,X2938] :
( ( s__instance(X2937,s__SetOrClass)
| ~ s__subclass(X2937,X2938) )
& ( s__instance(X2938,s__SetOrClass)
| ~ s__subclass(X2937,X2938) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_26635])])]) ).
cnf(c_0_7,plain,
( X2 = X1
| ~ s__instance(X1,s__SetOrClass)
| ~ s__instance(X2,s__SetOrClass)
| ~ s__subclass(X2,X1)
| ~ s__subclass(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,plain,
( s__instance(X1,s__SetOrClass)
| ~ s__subclass(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_9,negated_conjecture,
s__Class30_1 != s__Reptile,
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[prove_from_ALL])]) ).
cnf(c_0_10,plain,
( X1 = X2
| ~ s__subclass(X2,X1)
| ~ s__subclass(X1,X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_7,c_0_8]),c_0_8]) ).
cnf(c_0_11,plain,
s__subclass(s__Class30_1,s__Reptile),
inference(split_conjunct,[status(thm)],[local_2]) ).
cnf(c_0_12,plain,
s__subclass(s__Reptile,s__Class30_1),
inference(split_conjunct,[status(thm)],[local_3]) ).
cnf(c_0_13,negated_conjecture,
s__Class30_1 != s__Reptile,
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12])]),c_0_13]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : CSR099+3 : TPTP v9.2.1. Bugfixed v7.3.0.
% 0.00/0.12 % Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.16/0.33 % Computer : n020.cluster.edu
% 0.16/0.33 % Model : x86_64 x86_64
% 0.16/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.33 % Memory : 8042.1875MB
% 0.16/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.33 % CPULimit : 300
% 0.16/0.33 % WCLimit : 300
% 0.16/0.33 % DateTime : Mon May 4 16:57:05 EDT 2026
% 0.16/0.33 % CPUTime :
% 0.16/0.34 % start to proof: theBenchmark
% 79.91/78.89 % Version : CSE_E---1.7
% 79.91/78.89 % Problem : theBenchmark.p
% 79.91/78.89 % SZS status Theorem for theBenchmark.p
% 79.91/78.89 % SZS output start CNFRefutation
% See solution above
% 79.91/78.89 % Total time : 78.431s
%------------------------------------------------------------------------------