TSTP Solution File: SET936+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SET936+1 : TPTP v8.1.2. Bugfixed v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% 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 : Thu Aug 31 15:10:44 EDT 2023
% Result : Theorem 10.51s 2.19s
% Output : CNFRefutation 10.51s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 13
% Syntax : Number of formulae : 85 ( 23 unt; 0 def)
% Number of atoms : 275 ( 41 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 314 ( 124 ~; 143 |; 38 &)
% ( 4 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-3 aty)
% Number of variables : 153 ( 3 sgn; 96 !; 11 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
! [X0,X1] : set_intersection2(X0,X1) = set_intersection2(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_k3_xboole_0) ).
fof(f3,axiom,
! [X0,X1] :
( powerset(X0) = X1
<=> ! [X2] :
( in(X2,X1)
<=> subset(X2,X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_zfmisc_1) ).
fof(f4,axiom,
! [X0,X1,X2] :
( set_intersection2(X0,X1) = X2
<=> ! [X3] :
( in(X3,X2)
<=> ( in(X3,X1)
& in(X3,X0) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_xboole_0) ).
fof(f8,axiom,
! [X0,X1] : subset(X0,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',reflexivity_r1_tarski) ).
fof(f9,axiom,
! [X0,X1] : subset(set_intersection2(X0,X1),X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t17_xboole_1) ).
fof(f10,axiom,
! [X0,X1,X2] :
( ( subset(X0,X2)
& subset(X0,X1) )
=> subset(X0,set_intersection2(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t19_xboole_1) ).
fof(f11,axiom,
! [X0,X1,X2] :
( ( subset(X1,X2)
& subset(X0,X1) )
=> subset(X0,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t1_xboole_1) ).
fof(f13,conjecture,
! [X0,X1] : powerset(set_intersection2(X0,X1)) = set_intersection2(powerset(X0),powerset(X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t83_zfmisc_1) ).
fof(f14,negated_conjecture,
~ ! [X0,X1] : powerset(set_intersection2(X0,X1)) = set_intersection2(powerset(X0),powerset(X1)),
inference(negated_conjecture,[],[f13]) ).
fof(f16,plain,
! [X0] : subset(X0,X0),
inference(rectify,[],[f8]) ).
fof(f18,plain,
! [X0,X1,X2] :
( subset(X0,set_intersection2(X1,X2))
| ~ subset(X0,X2)
| ~ subset(X0,X1) ),
inference(ennf_transformation,[],[f10]) ).
fof(f19,plain,
! [X0,X1,X2] :
( subset(X0,set_intersection2(X1,X2))
| ~ subset(X0,X2)
| ~ subset(X0,X1) ),
inference(flattening,[],[f18]) ).
fof(f20,plain,
! [X0,X1,X2] :
( subset(X0,X2)
| ~ subset(X1,X2)
| ~ subset(X0,X1) ),
inference(ennf_transformation,[],[f11]) ).
fof(f21,plain,
! [X0,X1,X2] :
( subset(X0,X2)
| ~ subset(X1,X2)
| ~ subset(X0,X1) ),
inference(flattening,[],[f20]) ).
fof(f23,plain,
? [X0,X1] : powerset(set_intersection2(X0,X1)) != set_intersection2(powerset(X0),powerset(X1)),
inference(ennf_transformation,[],[f14]) ).
fof(f24,plain,
! [X0,X1] :
( ( powerset(X0) = X1
| ? [X2] :
( ( ~ subset(X2,X0)
| ~ in(X2,X1) )
& ( subset(X2,X0)
| in(X2,X1) ) ) )
& ( ! [X2] :
( ( in(X2,X1)
| ~ subset(X2,X0) )
& ( subset(X2,X0)
| ~ in(X2,X1) ) )
| powerset(X0) != X1 ) ),
inference(nnf_transformation,[],[f3]) ).
fof(f25,plain,
! [X0,X1] :
( ( powerset(X0) = X1
| ? [X2] :
( ( ~ subset(X2,X0)
| ~ in(X2,X1) )
& ( subset(X2,X0)
| in(X2,X1) ) ) )
& ( ! [X3] :
( ( in(X3,X1)
| ~ subset(X3,X0) )
& ( subset(X3,X0)
| ~ in(X3,X1) ) )
| powerset(X0) != X1 ) ),
inference(rectify,[],[f24]) ).
fof(f26,plain,
! [X0,X1] :
( ? [X2] :
( ( ~ subset(X2,X0)
| ~ in(X2,X1) )
& ( subset(X2,X0)
| in(X2,X1) ) )
=> ( ( ~ subset(sK0(X0,X1),X0)
| ~ in(sK0(X0,X1),X1) )
& ( subset(sK0(X0,X1),X0)
| in(sK0(X0,X1),X1) ) ) ),
introduced(choice_axiom,[]) ).
fof(f27,plain,
! [X0,X1] :
( ( powerset(X0) = X1
| ( ( ~ subset(sK0(X0,X1),X0)
| ~ in(sK0(X0,X1),X1) )
& ( subset(sK0(X0,X1),X0)
| in(sK0(X0,X1),X1) ) ) )
& ( ! [X3] :
( ( in(X3,X1)
| ~ subset(X3,X0) )
& ( subset(X3,X0)
| ~ in(X3,X1) ) )
| powerset(X0) != X1 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f25,f26]) ).
fof(f28,plain,
! [X0,X1,X2] :
( ( set_intersection2(X0,X1) = X2
| ? [X3] :
( ( ~ in(X3,X1)
| ~ in(X3,X0)
| ~ in(X3,X2) )
& ( ( in(X3,X1)
& in(X3,X0) )
| in(X3,X2) ) ) )
& ( ! [X3] :
( ( in(X3,X2)
| ~ in(X3,X1)
| ~ in(X3,X0) )
& ( ( in(X3,X1)
& in(X3,X0) )
| ~ in(X3,X2) ) )
| set_intersection2(X0,X1) != X2 ) ),
inference(nnf_transformation,[],[f4]) ).
fof(f29,plain,
! [X0,X1,X2] :
( ( set_intersection2(X0,X1) = X2
| ? [X3] :
( ( ~ in(X3,X1)
| ~ in(X3,X0)
| ~ in(X3,X2) )
& ( ( in(X3,X1)
& in(X3,X0) )
| in(X3,X2) ) ) )
& ( ! [X3] :
( ( in(X3,X2)
| ~ in(X3,X1)
| ~ in(X3,X0) )
& ( ( in(X3,X1)
& in(X3,X0) )
| ~ in(X3,X2) ) )
| set_intersection2(X0,X1) != X2 ) ),
inference(flattening,[],[f28]) ).
fof(f30,plain,
! [X0,X1,X2] :
( ( set_intersection2(X0,X1) = X2
| ? [X3] :
( ( ~ in(X3,X1)
| ~ in(X3,X0)
| ~ in(X3,X2) )
& ( ( in(X3,X1)
& in(X3,X0) )
| in(X3,X2) ) ) )
& ( ! [X4] :
( ( in(X4,X2)
| ~ in(X4,X1)
| ~ in(X4,X0) )
& ( ( in(X4,X1)
& in(X4,X0) )
| ~ in(X4,X2) ) )
| set_intersection2(X0,X1) != X2 ) ),
inference(rectify,[],[f29]) ).
fof(f31,plain,
! [X0,X1,X2] :
( ? [X3] :
( ( ~ in(X3,X1)
| ~ in(X3,X0)
| ~ in(X3,X2) )
& ( ( in(X3,X1)
& in(X3,X0) )
| in(X3,X2) ) )
=> ( ( ~ in(sK1(X0,X1,X2),X1)
| ~ in(sK1(X0,X1,X2),X0)
| ~ in(sK1(X0,X1,X2),X2) )
& ( ( in(sK1(X0,X1,X2),X1)
& in(sK1(X0,X1,X2),X0) )
| in(sK1(X0,X1,X2),X2) ) ) ),
introduced(choice_axiom,[]) ).
fof(f32,plain,
! [X0,X1,X2] :
( ( set_intersection2(X0,X1) = X2
| ( ( ~ in(sK1(X0,X1,X2),X1)
| ~ in(sK1(X0,X1,X2),X0)
| ~ in(sK1(X0,X1,X2),X2) )
& ( ( in(sK1(X0,X1,X2),X1)
& in(sK1(X0,X1,X2),X0) )
| in(sK1(X0,X1,X2),X2) ) ) )
& ( ! [X4] :
( ( in(X4,X2)
| ~ in(X4,X1)
| ~ in(X4,X0) )
& ( ( in(X4,X1)
& in(X4,X0) )
| ~ in(X4,X2) ) )
| set_intersection2(X0,X1) != X2 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1])],[f30,f31]) ).
fof(f40,plain,
( ? [X0,X1] : powerset(set_intersection2(X0,X1)) != set_intersection2(powerset(X0),powerset(X1))
=> powerset(set_intersection2(sK5,sK6)) != set_intersection2(powerset(sK5),powerset(sK6)) ),
introduced(choice_axiom,[]) ).
fof(f41,plain,
powerset(set_intersection2(sK5,sK6)) != set_intersection2(powerset(sK5),powerset(sK6)),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK5,sK6])],[f23,f40]) ).
fof(f43,plain,
! [X0,X1] : set_intersection2(X0,X1) = set_intersection2(X1,X0),
inference(cnf_transformation,[],[f2]) ).
fof(f44,plain,
! [X3,X0,X1] :
( subset(X3,X0)
| ~ in(X3,X1)
| powerset(X0) != X1 ),
inference(cnf_transformation,[],[f27]) ).
fof(f45,plain,
! [X3,X0,X1] :
( in(X3,X1)
| ~ subset(X3,X0)
| powerset(X0) != X1 ),
inference(cnf_transformation,[],[f27]) ).
fof(f51,plain,
! [X2,X0,X1] :
( set_intersection2(X0,X1) = X2
| in(sK1(X0,X1,X2),X0)
| in(sK1(X0,X1,X2),X2) ),
inference(cnf_transformation,[],[f32]) ).
fof(f52,plain,
! [X2,X0,X1] :
( set_intersection2(X0,X1) = X2
| in(sK1(X0,X1,X2),X1)
| in(sK1(X0,X1,X2),X2) ),
inference(cnf_transformation,[],[f32]) ).
fof(f53,plain,
! [X2,X0,X1] :
( set_intersection2(X0,X1) = X2
| ~ in(sK1(X0,X1,X2),X1)
| ~ in(sK1(X0,X1,X2),X0)
| ~ in(sK1(X0,X1,X2),X2) ),
inference(cnf_transformation,[],[f32]) ).
fof(f57,plain,
! [X0] : subset(X0,X0),
inference(cnf_transformation,[],[f16]) ).
fof(f58,plain,
! [X0,X1] : subset(set_intersection2(X0,X1),X0),
inference(cnf_transformation,[],[f9]) ).
fof(f59,plain,
! [X2,X0,X1] :
( subset(X0,set_intersection2(X1,X2))
| ~ subset(X0,X2)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f19]) ).
fof(f60,plain,
! [X2,X0,X1] :
( subset(X0,X2)
| ~ subset(X1,X2)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f21]) ).
fof(f63,plain,
powerset(set_intersection2(sK5,sK6)) != set_intersection2(powerset(sK5),powerset(sK6)),
inference(cnf_transformation,[],[f41]) ).
fof(f64,plain,
! [X3,X0] :
( in(X3,powerset(X0))
| ~ subset(X3,X0) ),
inference(equality_resolution,[],[f45]) ).
fof(f65,plain,
! [X3,X0] :
( subset(X3,X0)
| ~ in(X3,powerset(X0)) ),
inference(equality_resolution,[],[f44]) ).
cnf(c_50,plain,
set_intersection2(X0,X1) = set_intersection2(X1,X0),
inference(cnf_transformation,[],[f43]) ).
cnf(c_53,plain,
( ~ subset(X0,X1)
| in(X0,powerset(X1)) ),
inference(cnf_transformation,[],[f64]) ).
cnf(c_54,plain,
( ~ in(X0,powerset(X1))
| subset(X0,X1) ),
inference(cnf_transformation,[],[f65]) ).
cnf(c_55,plain,
( ~ in(sK1(X0,X1,X2),X0)
| ~ in(sK1(X0,X1,X2),X1)
| ~ in(sK1(X0,X1,X2),X2)
| set_intersection2(X0,X1) = X2 ),
inference(cnf_transformation,[],[f53]) ).
cnf(c_56,plain,
( set_intersection2(X0,X1) = X2
| in(sK1(X0,X1,X2),X1)
| in(sK1(X0,X1,X2),X2) ),
inference(cnf_transformation,[],[f52]) ).
cnf(c_57,plain,
( set_intersection2(X0,X1) = X2
| in(sK1(X0,X1,X2),X0)
| in(sK1(X0,X1,X2),X2) ),
inference(cnf_transformation,[],[f51]) ).
cnf(c_64,plain,
subset(X0,X0),
inference(cnf_transformation,[],[f57]) ).
cnf(c_65,plain,
subset(set_intersection2(X0,X1),X0),
inference(cnf_transformation,[],[f58]) ).
cnf(c_66,plain,
( ~ subset(X0,X1)
| ~ subset(X0,X2)
| subset(X0,set_intersection2(X1,X2)) ),
inference(cnf_transformation,[],[f59]) ).
cnf(c_67,plain,
( ~ subset(X0,X1)
| ~ subset(X2,X0)
| subset(X2,X1) ),
inference(cnf_transformation,[],[f60]) ).
cnf(c_70,negated_conjecture,
set_intersection2(powerset(sK5),powerset(sK6)) != powerset(set_intersection2(sK5,sK6)),
inference(cnf_transformation,[],[f63]) ).
cnf(c_71,plain,
subset(sK5,sK5),
inference(instantiation,[status(thm)],[c_64]) ).
cnf(c_406,plain,
X0 = X0,
theory(equality) ).
cnf(c_412,plain,
( X0 != X1
| X2 != X3
| ~ subset(X1,X3)
| subset(X0,X2) ),
theory(equality) ).
cnf(c_817,plain,
( ~ in(sK1(powerset(sK5),powerset(sK6),powerset(set_intersection2(sK5,sK6))),powerset(set_intersection2(sK5,sK6)))
| ~ in(sK1(powerset(sK5),powerset(sK6),powerset(set_intersection2(sK5,sK6))),powerset(sK5))
| ~ in(sK1(powerset(sK5),powerset(sK6),powerset(set_intersection2(sK5,sK6))),powerset(sK6))
| set_intersection2(powerset(sK5),powerset(sK6)) = powerset(set_intersection2(sK5,sK6)) ),
inference(instantiation,[status(thm)],[c_55]) ).
cnf(c_844,plain,
( ~ subset(sK1(powerset(sK5),powerset(sK6),powerset(set_intersection2(sK5,sK6))),sK6)
| in(sK1(powerset(sK5),powerset(sK6),powerset(set_intersection2(sK5,sK6))),powerset(sK6)) ),
inference(instantiation,[status(thm)],[c_53]) ).
cnf(c_863,plain,
( ~ subset(sK1(powerset(sK5),powerset(sK6),powerset(set_intersection2(sK5,sK6))),X0)
| ~ subset(X0,sK6)
| subset(sK1(powerset(sK5),powerset(sK6),powerset(set_intersection2(sK5,sK6))),sK6) ),
inference(instantiation,[status(thm)],[c_67]) ).
cnf(c_865,plain,
( ~ in(sK1(powerset(sK5),powerset(sK6),powerset(set_intersection2(sK5,sK6))),powerset(sK6))
| subset(sK1(powerset(sK5),powerset(sK6),powerset(set_intersection2(sK5,sK6))),sK6) ),
inference(instantiation,[status(thm)],[c_54]) ).
cnf(c_1076,plain,
( ~ subset(sK1(powerset(sK5),powerset(sK6),powerset(set_intersection2(sK5,sK6))),set_intersection2(sK6,X0))
| ~ subset(set_intersection2(sK6,X0),sK6)
| subset(sK1(powerset(sK5),powerset(sK6),powerset(set_intersection2(sK5,sK6))),sK6) ),
inference(instantiation,[status(thm)],[c_863]) ).
cnf(c_1077,plain,
( ~ subset(sK1(powerset(sK5),powerset(sK6),powerset(set_intersection2(sK5,sK6))),set_intersection2(sK6,sK5))
| ~ subset(set_intersection2(sK6,sK5),sK6)
| subset(sK1(powerset(sK5),powerset(sK6),powerset(set_intersection2(sK5,sK6))),sK6) ),
inference(instantiation,[status(thm)],[c_1076]) ).
cnf(c_1532,plain,
( ~ subset(X0,set_intersection2(sK5,sK6))
| in(X0,powerset(set_intersection2(sK5,sK6))) ),
inference(instantiation,[status(thm)],[c_53]) ).
cnf(c_1638,plain,
( ~ in(sK1(powerset(sK5),powerset(sK6),powerset(set_intersection2(sK5,sK6))),powerset(X0))
| subset(sK1(powerset(sK5),powerset(sK6),powerset(set_intersection2(sK5,sK6))),X0) ),
inference(instantiation,[status(thm)],[c_54]) ).
cnf(c_1639,plain,
( ~ in(sK1(powerset(sK5),powerset(sK6),powerset(set_intersection2(sK5,sK6))),powerset(sK5))
| subset(sK1(powerset(sK5),powerset(sK6),powerset(set_intersection2(sK5,sK6))),sK5) ),
inference(instantiation,[status(thm)],[c_1638]) ).
cnf(c_1824,plain,
( ~ subset(sK1(powerset(sK5),powerset(sK6),powerset(set_intersection2(sK5,sK6))),X0)
| in(sK1(powerset(sK5),powerset(sK6),powerset(set_intersection2(sK5,sK6))),powerset(X0)) ),
inference(instantiation,[status(thm)],[c_53]) ).
cnf(c_1825,plain,
( ~ subset(sK1(powerset(sK5),powerset(sK6),powerset(set_intersection2(sK5,sK6))),sK5)
| in(sK1(powerset(sK5),powerset(sK6),powerset(set_intersection2(sK5,sK6))),powerset(sK5)) ),
inference(instantiation,[status(thm)],[c_1824]) ).
cnf(c_3973,plain,
( ~ subset(X0,sK5)
| ~ subset(X0,sK6)
| subset(X0,set_intersection2(sK5,sK6)) ),
inference(instantiation,[status(thm)],[c_66]) ).
cnf(c_4217,plain,
( X0 != X1
| ~ subset(X1,set_intersection2(X2,X3))
| subset(X0,set_intersection2(X3,X2)) ),
inference(resolution,[status(thm)],[c_412,c_50]) ).
cnf(c_4683,plain,
( ~ subset(sK1(powerset(sK5),powerset(sK6),powerset(set_intersection2(sK5,sK6))),set_intersection2(sK5,sK6))
| in(sK1(powerset(sK5),powerset(sK6),powerset(set_intersection2(sK5,sK6))),powerset(set_intersection2(sK5,sK6))) ),
inference(instantiation,[status(thm)],[c_1532]) ).
cnf(c_4899,plain,
subset(set_intersection2(sK6,X0),sK6),
inference(instantiation,[status(thm)],[c_65]) ).
cnf(c_4900,plain,
subset(set_intersection2(sK6,sK5),sK6),
inference(instantiation,[status(thm)],[c_4899]) ).
cnf(c_6411,plain,
( in(sK1(powerset(sK5),powerset(sK6),powerset(set_intersection2(sK5,sK6))),powerset(set_intersection2(sK5,sK6)))
| in(sK1(powerset(sK5),powerset(sK6),powerset(set_intersection2(sK5,sK6))),powerset(sK6)) ),
inference(resolution,[status(thm)],[c_56,c_70]) ).
cnf(c_7162,plain,
( in(sK1(powerset(sK5),powerset(sK6),powerset(set_intersection2(sK5,sK6))),powerset(set_intersection2(sK5,sK6)))
| in(sK1(powerset(sK5),powerset(sK6),powerset(set_intersection2(sK5,sK6))),powerset(sK5)) ),
inference(resolution,[status(thm)],[c_57,c_70]) ).
cnf(c_9292,plain,
( subset(sK1(powerset(sK5),powerset(sK6),powerset(set_intersection2(sK5,sK6))),set_intersection2(sK5,sK6))
| in(sK1(powerset(sK5),powerset(sK6),powerset(set_intersection2(sK5,sK6))),powerset(sK6)) ),
inference(resolution,[status(thm)],[c_6411,c_54]) ).
cnf(c_9367,plain,
( subset(sK1(powerset(sK5),powerset(sK6),powerset(set_intersection2(sK5,sK6))),set_intersection2(sK5,sK6))
| in(sK1(powerset(sK5),powerset(sK6),powerset(set_intersection2(sK5,sK6))),powerset(sK5)) ),
inference(resolution,[status(thm)],[c_7162,c_54]) ).
cnf(c_9546,plain,
( ~ subset(set_intersection2(sK5,sK6),X0)
| in(sK1(powerset(sK5),powerset(sK6),powerset(set_intersection2(sK5,sK6))),powerset(sK5))
| subset(sK1(powerset(sK5),powerset(sK6),powerset(set_intersection2(sK5,sK6))),X0) ),
inference(resolution,[status(thm)],[c_9367,c_67]) ).
cnf(c_9647,plain,
( ~ subset(set_intersection2(sK5,sK6),X0)
| ~ subset(X0,X1)
| in(sK1(powerset(sK5),powerset(sK6),powerset(set_intersection2(sK5,sK6))),powerset(sK5))
| subset(sK1(powerset(sK5),powerset(sK6),powerset(set_intersection2(sK5,sK6))),X1) ),
inference(resolution,[status(thm)],[c_9546,c_67]) ).
cnf(c_9650,plain,
( ~ subset(set_intersection2(sK5,sK6),X0)
| subset(sK1(powerset(sK5),powerset(sK6),powerset(set_intersection2(sK5,sK6))),X0)
| subset(sK1(powerset(sK5),powerset(sK6),powerset(set_intersection2(sK5,sK6))),sK5) ),
inference(resolution,[status(thm)],[c_9546,c_54]) ).
cnf(c_10178,plain,
( ~ subset(set_intersection2(sK5,sK6),sK5)
| subset(sK1(powerset(sK5),powerset(sK6),powerset(set_intersection2(sK5,sK6))),sK5) ),
inference(factoring,[status(thm)],[c_9650]) ).
cnf(c_10484,plain,
( ~ subset(sK5,X0)
| in(sK1(powerset(sK5),powerset(sK6),powerset(set_intersection2(sK5,sK6))),powerset(sK5))
| subset(sK1(powerset(sK5),powerset(sK6),powerset(set_intersection2(sK5,sK6))),X0) ),
inference(resolution,[status(thm)],[c_9647,c_65]) ).
cnf(c_10485,plain,
( ~ subset(sK5,sK5)
| in(sK1(powerset(sK5),powerset(sK6),powerset(set_intersection2(sK5,sK6))),powerset(sK5))
| subset(sK1(powerset(sK5),powerset(sK6),powerset(set_intersection2(sK5,sK6))),sK5) ),
inference(instantiation,[status(thm)],[c_10484]) ).
cnf(c_13826,plain,
subset(sK1(powerset(sK5),powerset(sK6),powerset(set_intersection2(sK5,sK6))),sK5),
inference(global_subsumption_just,[status(thm)],[c_10178,c_71,c_1639,c_10485]) ).
cnf(c_17537,plain,
( X0 != sK1(powerset(sK5),powerset(sK6),powerset(set_intersection2(sK5,sK6)))
| in(sK1(powerset(sK5),powerset(sK6),powerset(set_intersection2(sK5,sK6))),powerset(sK6))
| subset(X0,set_intersection2(sK6,sK5)) ),
inference(resolution,[status(thm)],[c_4217,c_9292]) ).
cnf(c_20126,plain,
( subset(sK1(powerset(sK5),powerset(sK6),powerset(set_intersection2(sK5,sK6))),set_intersection2(sK6,sK5))
| in(sK1(powerset(sK5),powerset(sK6),powerset(set_intersection2(sK5,sK6))),powerset(sK6)) ),
inference(resolution,[status(thm)],[c_17537,c_406]) ).
cnf(c_20470,plain,
in(sK1(powerset(sK5),powerset(sK6),powerset(set_intersection2(sK5,sK6))),powerset(sK6)),
inference(global_subsumption_just,[status(thm)],[c_20126,c_844,c_1077,c_4900,c_20126]) ).
cnf(c_30362,plain,
( ~ subset(sK1(powerset(sK5),powerset(sK6),powerset(set_intersection2(sK5,sK6))),sK5)
| ~ subset(sK1(powerset(sK5),powerset(sK6),powerset(set_intersection2(sK5,sK6))),sK6)
| subset(sK1(powerset(sK5),powerset(sK6),powerset(set_intersection2(sK5,sK6))),set_intersection2(sK5,sK6)) ),
inference(instantiation,[status(thm)],[c_3973]) ).
cnf(c_30363,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_30362,c_20470,c_13826,c_4683,c_1825,c_865,c_817,c_70]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SET936+1 : TPTP v8.1.2. Bugfixed v4.0.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n004.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 : Sat Aug 26 10:07:38 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.20/0.47 Running first-order theorem proving
% 0.20/0.47 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 10.51/2.19 % SZS status Started for theBenchmark.p
% 10.51/2.19 % SZS status Theorem for theBenchmark.p
% 10.51/2.19
% 10.51/2.19 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 10.51/2.19
% 10.51/2.19 ------ iProver source info
% 10.51/2.19
% 10.51/2.19 git: date: 2023-05-31 18:12:56 +0000
% 10.51/2.19 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 10.51/2.19 git: non_committed_changes: false
% 10.51/2.19 git: last_make_outside_of_git: false
% 10.51/2.19
% 10.51/2.19 ------ Parsing...
% 10.51/2.19 ------ Clausification by vclausify_rel & Parsing by iProver...
% 10.51/2.19
% 10.51/2.19 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe_e sup_sim: 0 sf_s rm: 2 0s sf_e pe_s pe_e
% 10.51/2.19
% 10.51/2.19 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 10.51/2.19
% 10.51/2.19 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 10.51/2.19 ------ Proving...
% 10.51/2.19 ------ Problem Properties
% 10.51/2.19
% 10.51/2.19
% 10.51/2.19 clauses 21
% 10.51/2.19 conjectures 1
% 10.51/2.19 EPR 4
% 10.51/2.19 Horn 17
% 10.51/2.19 unary 6
% 10.51/2.19 binary 5
% 10.51/2.19 lits 47
% 10.51/2.19 lits eq 11
% 10.51/2.19 fd_pure 0
% 10.51/2.19 fd_pseudo 0
% 10.51/2.19 fd_cond 0
% 10.51/2.19 fd_pseudo_cond 7
% 10.51/2.19 AC symbols 0
% 10.51/2.19
% 10.51/2.19 ------ Input Options Time Limit: Unbounded
% 10.51/2.19
% 10.51/2.19
% 10.51/2.19 ------
% 10.51/2.19 Current options:
% 10.51/2.19 ------
% 10.51/2.19
% 10.51/2.19
% 10.51/2.19
% 10.51/2.19
% 10.51/2.19 ------ Proving...
% 10.51/2.19
% 10.51/2.19
% 10.51/2.19 % SZS status Theorem for theBenchmark.p
% 10.51/2.19
% 10.51/2.19 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 10.51/2.19
% 10.51/2.20
%------------------------------------------------------------------------------