%------------------------------------------------------------------------------
% File : hopCoP---0.1
% Problem : NUM393+1 : TPTP v9.0.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox/solver/bin/execute.py 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n025.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 : Fri Jul 25 12:28:04 PM UTC 2025
% Result : Theorem 0.18s 0.41s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 4
% Syntax : Number of formulae : 24 ( 10 unt; 0 def)
% Number of atoms : 55 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 52 ( 21 ~; 21 |; 2 &)
% ( 2 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 18 ( 0 sgn 10 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t25_ordinal1,plain,
! [A] :
( ordinal(A)
=> ! [B] :
( ordinal(B)
=> inclusion_comparable(A,B) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t25_ordinal1) ).
fof(t25_ordinal1_negated,plain,
~ ! [A] :
( ordinal(A)
=> ! [B] :
( ordinal(B)
=> inclusion_comparable(A,B) ) ),
inference(negate_conjecture,[status(cth)],[t25_ordinal1]) ).
cnf(50,plain,
ordinal(sK13),
inference(cnf,[status(esa)],[t25_ordinal1_negated]) ).
cnf(l0,plain,
ordinal(sK13),
inference(instantiation,[status(thm)],[50]) ).
fof(connectedness_r1_ordinal1,plain,
! [A,B] :
( ( ordinal(A)
& ordinal(B) )
=> ( ordinal_subset(A,B)
| ordinal_subset(B,A) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',connectedness_r1_ordinal1) ).
cnf(7,plain,
( ~ ordinal(X0)
| ~ ordinal(X1)
| ordinal_subset(X0,X1)
| ordinal_subset(X1,X0) ),
inference(cnf,[status(esa)],[connectedness_r1_ordinal1]) ).
cnf(l1,plain,
( ~ ordinal(sK14)
| ~ ordinal(sK13)
| ordinal_subset(sK14,sK13)
| ordinal_subset(sK13,sK14) ),
inference(instantiation,[status(thm)],[7]) ).
fof(redefinition_r1_ordinal1,plain,
! [A,B] :
( ( ordinal(A)
& ordinal(B) )
=> ( ordinal_subset(A,B)
<=> subset(A,B) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',redefinition_r1_ordinal1) ).
cnf(43,plain,
( ~ ordinal(X0)
| ~ ordinal(X1)
| ~ ordinal_subset(X0,X1)
| subset(X0,X1) ),
inference(cnf,[status(esa)],[redefinition_r1_ordinal1]) ).
cnf(l27,plain,
( ~ ordinal(sK13)
| ~ ordinal(sK14)
| ~ ordinal_subset(sK13,sK14)
| subset(sK13,sK14) ),
inference(instantiation,[status(thm)],[43]) ).
fof(d9_xboole_0,plain,
! [A,B] :
( inclusion_comparable(A,B)
<=> ( subset(A,B)
| subset(B,A) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d9_xboole_0) ).
cnf(9,plain,
( ~ subset(X0,X1)
| inclusion_comparable(X0,X1) ),
inference(cnf,[status(esa)],[d9_xboole_0]) ).
cnf(l32,plain,
( ~ subset(sK13,sK14)
| inclusion_comparable(sK13,sK14) ),
inference(instantiation,[status(thm)],[9]) ).
cnf(52,plain,
~ inclusion_comparable(sK13,sK14),
inference(cnf,[status(esa)],[t25_ordinal1_negated]) ).
cnf(l36,plain,
~ inclusion_comparable(sK13,sK14),
inference(instantiation,[status(thm)],[52]) ).
cnf(l2,plain,
( ~ ordinal(sK14)
| ~ ordinal(sK13)
| ~ ordinal_subset(sK14,sK13)
| subset(sK14,sK13) ),
inference(instantiation,[status(thm)],[43]) ).
cnf(51,plain,
ordinal(sK14),
inference(cnf,[status(esa)],[t25_ordinal1_negated]) ).
cnf(l3,plain,
ordinal(sK14),
inference(instantiation,[status(thm)],[51]) ).
cnf(10,plain,
( ~ subset(X0,X1)
| inclusion_comparable(X1,X0) ),
inference(cnf,[status(esa)],[d9_xboole_0]) ).
cnf(l4,plain,
( ~ subset(sK14,sK13)
| inclusion_comparable(sK13,sK14) ),
inference(instantiation,[status(thm)],[10]) ).
cnf(l10,plain,
~ inclusion_comparable(sK13,sK14),
inference(instantiation,[status(thm)],[52]) ).
cnf(l13,plain,
ordinal(sK14),
inference(instantiation,[status(thm)],[51]) ).
cnf(l28,plain,
ordinal(sK14),
inference(instantiation,[status(thm)],[51]) ).
cnf(final,plain,
$false,
inference(ground_refutation,[status(thm)],[l0,l1,l27,l32,l36,l2,l3,l4,l10,l13,l28]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12 % Problem : NUM393+1 : TPTP v9.0.0. Released v3.2.0.
% 0.08/0.12 % Command : /export/starexec/sandbox/solver/bin/execute.py 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.13/0.32 % Computer : n025.cluster.edu
% 0.13/0.32 % Model : x86_64 x86_64
% 0.13/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.32 % Memory : 8042.1875MB
% 0.13/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.32 % CPULimit : 300
% 0.13/0.32 % WCLimit : 300
% 0.13/0.32 % DateTime : Mon Jul 21 11:54:19 EDT 2025
% 0.13/0.32 % CPUTime :
% 0.13/0.33 % launching worker at depth: 6
% 0.13/0.33 % launching worker at depth: 8
% 0.13/0.33 % launching worker at depth: 1
% 0.13/0.33 % launching worker at depth: 3
% 0.13/0.33 % launching worker at depth: 4
% 0.13/0.33 % launching worker at depth: 5
% 0.13/0.33 % launching worker at depth: 7
% 0.13/0.33 % launching worker at depth: 2
% 0.13/0.33 % launching worker at depth: 9
% 0.13/0.33 % launching worker at depth: 10
% 0.13/0.34 % launching worker at depth: 11
% 0.18/0.41 % SZS status Theorem for theBenchmark
% 0.18/0.41 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------