%------------------------------------------------------------------------------
% File : hopCoP---0.1
% Problem : SET148+3 : TPTP v9.0.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox2/solver/bin/execute.py 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n018.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:31:40 PM UTC 2025
% Result : Theorem 0.09s 0.30s
% Output : CNFRefutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 3
% Syntax : Number of formulae : 11 ( 5 unt; 0 def)
% Number of atoms : 18 ( 10 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 14 ( 7 ~; 4 |; 1 &)
% ( 1 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 1 con; 0-2 aty)
% Number of variables : 10 ( 0 sgn 6 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(prove_idempotency_of_intersection,plain,
! [B] : intersection(B,B) = B,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_idempotency_of_intersection) ).
fof(prove_idempotency_of_intersection_negated,plain,
~ ! [B] : intersection(B,B) = B,
inference(negate_conjecture,[status(cth)],[prove_idempotency_of_intersection]) ).
cnf(18,plain,
intersection(sK3,sK3) != sK3,
inference(cnf,[status(esa)],[prove_idempotency_of_intersection_negated]) ).
cnf(l0,plain,
intersection(sK3,sK3) != sK3,
inference(instantiation,[status(thm)],[18]) ).
fof(subset_intersection,plain,
! [B,C] :
( subset(B,C)
=> intersection(B,C) = B ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',subset_intersection) ).
cnf(0,plain,
( ~ subset(X0,X1)
| intersection(X0,X1) = X0 ),
inference(cnf,[status(esa)],[subset_intersection]) ).
cnf(l1,plain,
( ~ subset(sK3,sK3)
| intersection(sK3,sK3) = sK3 ),
inference(instantiation,[status(thm)],[0]) ).
fof(equal_defn,plain,
! [B,C] :
( B = C
<=> ( subset(B,C)
& subset(C,B) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',equal_defn) ).
cnf(5,plain,
( X0 != X1
| subset(X1,X0) ),
inference(cnf,[status(esa)],[equal_defn]) ).
cnf(l2,plain,
( sK3 != sK3
| subset(sK3,sK3) ),
inference(instantiation,[status(thm)],[5]) ).
cnf(final,plain,
$false,
inference(ground_refutation,[status(thm)],[l0,l1,l2]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : SET148+3 : TPTP v9.0.0. Released v2.2.0.
% 0.00/0.10 % Command : /export/starexec/sandbox2/solver/bin/execute.py 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.29 % Computer : n018.cluster.edu
% 0.09/0.29 % Model : x86_64 x86_64
% 0.09/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.29 % Memory : 8042.1875MB
% 0.09/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.29 % CPULimit : 300
% 0.09/0.29 % WCLimit : 300
% 0.09/0.29 % DateTime : Mon Jul 21 20:11:49 EDT 2025
% 0.09/0.29 % CPUTime :
% 0.09/0.30 % launching worker at depth: 2
% 0.09/0.30 % launching worker at depth: 3
% 0.09/0.30 % launching worker at depth: 4
% 0.09/0.30 % launching worker at depth: 1
% 0.09/0.30 % launching worker at depth: 6
% 0.09/0.30 % launching worker at depth: 5
% 0.09/0.30 % launching worker at depth: 7
% 0.09/0.30 % launching worker at depth: 8
% 0.09/0.30 % SZS status Theorem for theBenchmark
% 0.09/0.30 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------