%------------------------------------------------------------------------------
% File : hopCoP---0.1
% Problem : SEU118+1 : TPTP v9.0.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox2/solver/bin/execute.py 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n017.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 03:44:30 PM UTC 2025
% Result : Theorem 0.20s 0.47s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 6
% Syntax : Number of formulae : 24 ( 10 unt; 0 def)
% Number of atoms : 52 ( 3 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 47 ( 19 ~; 16 |; 2 &)
% ( 3 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-1 aty)
% Number of variables : 24 ( 1 sgn 14 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t34_finsub_1,plain,
! [A,B] :
( element(B,powerset(A))
=> ( finite(A)
=> element(B,finite_subsets(A)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t34_finsub_1) ).
fof(t34_finsub_1_negated,plain,
~ ! [A,B] :
( element(B,powerset(A))
=> ( finite(A)
=> element(B,finite_subsets(A)) ) ),
inference(negate_conjecture,[status(cth)],[t34_finsub_1]) ).
cnf(60,plain,
element(sK13,powerset(sK12)),
inference(cnf,[status(esa)],[t34_finsub_1_negated]) ).
cnf(l0,plain,
element(sK13,powerset(sK12)),
inference(instantiation,[status(thm)],[60]) ).
fof(t3_subset,plain,
! [A,B] :
( element(A,powerset(B))
<=> subset(A,B) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t3_subset) ).
cnf(63,plain,
( ~ element(X0,powerset(X1))
| subset(X0,X1) ),
inference(cnf,[status(esa)],[t3_subset]) ).
cnf(l1,plain,
( ~ element(sK13,powerset(sK12))
| subset(sK13,sK12) ),
inference(instantiation,[status(thm)],[63]) ).
fof(d5_finsub_1,plain,
! [A,B] :
( preboolean(B)
=> ( B = finite_subsets(A)
<=> ! [C] :
( in(C,B)
<=> ( subset(C,A)
& finite(C) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d5_finsub_1) ).
cnf(9,plain,
( ~ finite(X0)
| ~ preboolean(X1)
| ~ subset(X0,X2)
| X1 != finite_subsets(X2)
| in(X0,X1) ),
inference(cnf,[status(esa)],[d5_finsub_1]) ).
cnf(l45,plain,
( ~ finite(sK13)
| ~ preboolean(finite_subsets(sK12))
| ~ subset(sK13,sK12)
| finite_subsets(sK12) != finite_subsets(sK12)
| in(sK13,finite_subsets(sK12)) ),
inference(instantiation,[status(thm)],[9]) ).
fof(t13_finset_1,plain,
! [A,B] :
( ( subset(A,B)
& finite(B) )
=> finite(A) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t13_finset_1) ).
cnf(57,plain,
( ~ finite(X0)
| ~ subset(X1,X0)
| finite(X1) ),
inference(cnf,[status(esa)],[t13_finset_1]) ).
cnf(l46,plain,
( ~ finite(sK12)
| ~ subset(sK13,sK12)
| finite(sK13) ),
inference(instantiation,[status(thm)],[57]) ).
cnf(61,plain,
finite(sK12),
inference(cnf,[status(esa)],[t34_finsub_1_negated]) ).
cnf(l56,plain,
finite(sK12),
inference(instantiation,[status(thm)],[61]) ).
fof(t1_subset,plain,
! [A,B] :
( in(A,B)
=> element(A,B) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t1_subset) ).
cnf(58,plain,
( ~ in(X0,X1)
| element(X0,X1) ),
inference(cnf,[status(esa)],[t1_subset]) ).
cnf(l75,plain,
( ~ in(sK13,finite_subsets(sK12))
| element(sK13,finite_subsets(sK12)) ),
inference(instantiation,[status(thm)],[58]) ).
fof(dt_k5_finsub_1,plain,
! [A] : preboolean(finite_subsets(A)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dt_k5_finsub_1) ).
cnf(15,plain,
preboolean(finite_subsets(X0)),
inference(cnf,[status(esa)],[dt_k5_finsub_1]) ).
cnf(l48,plain,
preboolean(finite_subsets(sK12)),
inference(instantiation,[status(thm)],[15]) ).
cnf(62,plain,
~ element(sK13,finite_subsets(sK12)),
inference(cnf,[status(esa)],[t34_finsub_1_negated]) ).
cnf(l96,plain,
~ element(sK13,finite_subsets(sK12)),
inference(instantiation,[status(thm)],[62]) ).
cnf(final,plain,
$false,
inference(ground_refutation,[status(thm)],[l0,l1,l45,l46,l56,l75,l48,l96]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12 % Problem : SEU118+1 : TPTP v9.0.0. Released v3.2.0.
% 0.08/0.13 % Command : /export/starexec/sandbox2/solver/bin/execute.py 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.34 % Computer : n017.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon Jul 21 23:30:49 EDT 2025
% 0.13/0.34 % CPUTime :
% 0.13/0.35 % launching worker at depth: 1
% 0.13/0.35 % launching worker at depth: 6
% 0.13/0.35 % launching worker at depth: 7
% 0.13/0.35 % launching worker at depth: 5
% 0.13/0.35 % launching worker at depth: 3
% 0.13/0.35 % launching worker at depth: 4
% 0.13/0.35 % launching worker at depth: 8
% 0.13/0.35 % launching worker at depth: 2
% 0.13/0.35 % launching worker at depth: 9
% 0.13/0.36 % launching worker at depth: 10
% 0.13/0.39 % launching worker at depth: 11
% 0.20/0.47 % SZS status Theorem for theBenchmark
% 0.20/0.47 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------