TSTP Solution File: SET690+4 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SET690+4 : TPTP v8.2.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n027.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 : Mon Jun 24 14:35:26 EDT 2024
% Result : Theorem 167.11s 22.24s
% Output : CNFRefutation 167.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 7
% Syntax : Number of formulae : 99 ( 3 unt; 0 def)
% Number of atoms : 279 ( 4 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 308 ( 128 ~; 139 |; 27 &)
% ( 10 <=>; 3 =>; 0 <=; 1 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 166 ( 8 sgn 85 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X0)
=> member(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',subset) ).
fof(f2,axiom,
! [X0,X1] :
( equal_set(X0,X1)
<=> ( subset(X1,X0)
& subset(X0,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',equal_set) ).
fof(f4,axiom,
! [X2,X0,X1] :
( member(X2,intersection(X0,X1))
<=> ( member(X2,X1)
& member(X2,X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',intersection) ).
fof(f5,axiom,
! [X2,X0,X1] :
( member(X2,union(X0,X1))
<=> ( member(X2,X1)
| member(X2,X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',union) ).
fof(f12,conjecture,
! [X0,X1,X5] :
( equal_set(union(intersection(X0,X1),X5),intersection(X0,union(X1,X5)))
<=> subset(X5,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thI12) ).
fof(f13,negated_conjecture,
~ ! [X0,X1,X5] :
( equal_set(union(intersection(X0,X1),X5),intersection(X0,union(X1,X5)))
<=> subset(X5,X0) ),
inference(negated_conjecture,[],[f12]) ).
fof(f15,plain,
! [X0,X1,X2] :
( member(X0,intersection(X1,X2))
<=> ( member(X0,X2)
& member(X0,X1) ) ),
inference(rectify,[],[f4]) ).
fof(f16,plain,
! [X0,X1,X2] :
( member(X0,union(X1,X2))
<=> ( member(X0,X2)
| member(X0,X1) ) ),
inference(rectify,[],[f5]) ).
fof(f23,plain,
~ ! [X0,X1,X2] :
( equal_set(union(intersection(X0,X1),X2),intersection(X0,union(X1,X2)))
<=> subset(X2,X0) ),
inference(rectify,[],[f13]) ).
fof(f24,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X1)
| ~ member(X2,X0) ) ),
inference(ennf_transformation,[],[f1]) ).
fof(f26,plain,
? [X0,X1,X2] :
( equal_set(union(intersection(X0,X1),X2),intersection(X0,union(X1,X2)))
<~> subset(X2,X0) ),
inference(ennf_transformation,[],[f23]) ).
fof(f27,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ? [X2] :
( ~ member(X2,X1)
& member(X2,X0) ) )
& ( ! [X2] :
( member(X2,X1)
| ~ member(X2,X0) )
| ~ subset(X0,X1) ) ),
inference(nnf_transformation,[],[f24]) ).
fof(f28,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ? [X2] :
( ~ member(X2,X1)
& member(X2,X0) ) )
& ( ! [X3] :
( member(X3,X1)
| ~ member(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(rectify,[],[f27]) ).
fof(f29,plain,
! [X0,X1] :
( ? [X2] :
( ~ member(X2,X1)
& member(X2,X0) )
=> ( ~ member(sK0(X0,X1),X1)
& member(sK0(X0,X1),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f30,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ( ~ member(sK0(X0,X1),X1)
& member(sK0(X0,X1),X0) ) )
& ( ! [X3] :
( member(X3,X1)
| ~ member(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f28,f29]) ).
fof(f31,plain,
! [X0,X1] :
( ( equal_set(X0,X1)
| ~ subset(X1,X0)
| ~ subset(X0,X1) )
& ( ( subset(X1,X0)
& subset(X0,X1) )
| ~ equal_set(X0,X1) ) ),
inference(nnf_transformation,[],[f2]) ).
fof(f32,plain,
! [X0,X1] :
( ( equal_set(X0,X1)
| ~ subset(X1,X0)
| ~ subset(X0,X1) )
& ( ( subset(X1,X0)
& subset(X0,X1) )
| ~ equal_set(X0,X1) ) ),
inference(flattening,[],[f31]) ).
fof(f34,plain,
! [X0,X1,X2] :
( ( member(X0,intersection(X1,X2))
| ~ member(X0,X2)
| ~ member(X0,X1) )
& ( ( member(X0,X2)
& member(X0,X1) )
| ~ member(X0,intersection(X1,X2)) ) ),
inference(nnf_transformation,[],[f15]) ).
fof(f35,plain,
! [X0,X1,X2] :
( ( member(X0,intersection(X1,X2))
| ~ member(X0,X2)
| ~ member(X0,X1) )
& ( ( member(X0,X2)
& member(X0,X1) )
| ~ member(X0,intersection(X1,X2)) ) ),
inference(flattening,[],[f34]) ).
fof(f36,plain,
! [X0,X1,X2] :
( ( member(X0,union(X1,X2))
| ( ~ member(X0,X2)
& ~ member(X0,X1) ) )
& ( member(X0,X2)
| member(X0,X1)
| ~ member(X0,union(X1,X2)) ) ),
inference(nnf_transformation,[],[f16]) ).
fof(f37,plain,
! [X0,X1,X2] :
( ( member(X0,union(X1,X2))
| ( ~ member(X0,X2)
& ~ member(X0,X1) ) )
& ( member(X0,X2)
| member(X0,X1)
| ~ member(X0,union(X1,X2)) ) ),
inference(flattening,[],[f36]) ).
fof(f51,plain,
? [X0,X1,X2] :
( ( ~ subset(X2,X0)
| ~ equal_set(union(intersection(X0,X1),X2),intersection(X0,union(X1,X2))) )
& ( subset(X2,X0)
| equal_set(union(intersection(X0,X1),X2),intersection(X0,union(X1,X2))) ) ),
inference(nnf_transformation,[],[f26]) ).
fof(f52,plain,
( ? [X0,X1,X2] :
( ( ~ subset(X2,X0)
| ~ equal_set(union(intersection(X0,X1),X2),intersection(X0,union(X1,X2))) )
& ( subset(X2,X0)
| equal_set(union(intersection(X0,X1),X2),intersection(X0,union(X1,X2))) ) )
=> ( ( ~ subset(sK5,sK3)
| ~ equal_set(union(intersection(sK3,sK4),sK5),intersection(sK3,union(sK4,sK5))) )
& ( subset(sK5,sK3)
| equal_set(union(intersection(sK3,sK4),sK5),intersection(sK3,union(sK4,sK5))) ) ) ),
introduced(choice_axiom,[]) ).
fof(f53,plain,
( ( ~ subset(sK5,sK3)
| ~ equal_set(union(intersection(sK3,sK4),sK5),intersection(sK3,union(sK4,sK5))) )
& ( subset(sK5,sK3)
| equal_set(union(intersection(sK3,sK4),sK5),intersection(sK3,union(sK4,sK5))) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3,sK4,sK5])],[f51,f52]) ).
fof(f54,plain,
! [X3,X0,X1] :
( member(X3,X1)
| ~ member(X3,X0)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f30]) ).
fof(f55,plain,
! [X0,X1] :
( subset(X0,X1)
| member(sK0(X0,X1),X0) ),
inference(cnf_transformation,[],[f30]) ).
fof(f56,plain,
! [X0,X1] :
( subset(X0,X1)
| ~ member(sK0(X0,X1),X1) ),
inference(cnf_transformation,[],[f30]) ).
fof(f57,plain,
! [X0,X1] :
( subset(X0,X1)
| ~ equal_set(X0,X1) ),
inference(cnf_transformation,[],[f32]) ).
fof(f59,plain,
! [X0,X1] :
( equal_set(X0,X1)
| ~ subset(X1,X0)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f32]) ).
fof(f62,plain,
! [X2,X0,X1] :
( member(X0,X1)
| ~ member(X0,intersection(X1,X2)) ),
inference(cnf_transformation,[],[f35]) ).
fof(f63,plain,
! [X2,X0,X1] :
( member(X0,X2)
| ~ member(X0,intersection(X1,X2)) ),
inference(cnf_transformation,[],[f35]) ).
fof(f64,plain,
! [X2,X0,X1] :
( member(X0,intersection(X1,X2))
| ~ member(X0,X2)
| ~ member(X0,X1) ),
inference(cnf_transformation,[],[f35]) ).
fof(f65,plain,
! [X2,X0,X1] :
( member(X0,X2)
| member(X0,X1)
| ~ member(X0,union(X1,X2)) ),
inference(cnf_transformation,[],[f37]) ).
fof(f66,plain,
! [X2,X0,X1] :
( member(X0,union(X1,X2))
| ~ member(X0,X1) ),
inference(cnf_transformation,[],[f37]) ).
fof(f67,plain,
! [X2,X0,X1] :
( member(X0,union(X1,X2))
| ~ member(X0,X2) ),
inference(cnf_transformation,[],[f37]) ).
fof(f83,plain,
( subset(sK5,sK3)
| equal_set(union(intersection(sK3,sK4),sK5),intersection(sK3,union(sK4,sK5))) ),
inference(cnf_transformation,[],[f53]) ).
fof(f84,plain,
( ~ subset(sK5,sK3)
| ~ equal_set(union(intersection(sK3,sK4),sK5),intersection(sK3,union(sK4,sK5))) ),
inference(cnf_transformation,[],[f53]) ).
cnf(c_49,plain,
( ~ member(sK0(X0,X1),X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f56]) ).
cnf(c_50,plain,
( member(sK0(X0,X1),X0)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f55]) ).
cnf(c_51,plain,
( ~ subset(X0,X1)
| ~ member(X2,X0)
| member(X2,X1) ),
inference(cnf_transformation,[],[f54]) ).
cnf(c_52,plain,
( ~ subset(X0,X1)
| ~ subset(X1,X0)
| equal_set(X0,X1) ),
inference(cnf_transformation,[],[f59]) ).
cnf(c_54,plain,
( ~ equal_set(X0,X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f57]) ).
cnf(c_57,plain,
( ~ member(X0,X1)
| ~ member(X0,X2)
| member(X0,intersection(X1,X2)) ),
inference(cnf_transformation,[],[f64]) ).
cnf(c_58,plain,
( ~ member(X0,intersection(X1,X2))
| member(X0,X2) ),
inference(cnf_transformation,[],[f63]) ).
cnf(c_59,plain,
( ~ member(X0,intersection(X1,X2))
| member(X0,X1) ),
inference(cnf_transformation,[],[f62]) ).
cnf(c_60,plain,
( ~ member(X0,X1)
| member(X0,union(X2,X1)) ),
inference(cnf_transformation,[],[f67]) ).
cnf(c_61,plain,
( ~ member(X0,X1)
| member(X0,union(X1,X2)) ),
inference(cnf_transformation,[],[f66]) ).
cnf(c_62,plain,
( ~ member(X0,union(X1,X2))
| member(X0,X1)
| member(X0,X2) ),
inference(cnf_transformation,[],[f65]) ).
cnf(c_78,negated_conjecture,
( ~ equal_set(union(intersection(sK3,sK4),sK5),intersection(sK3,union(sK4,sK5)))
| ~ subset(sK5,sK3) ),
inference(cnf_transformation,[],[f84]) ).
cnf(c_79,negated_conjecture,
( equal_set(union(intersection(sK3,sK4),sK5),intersection(sK3,union(sK4,sK5)))
| subset(sK5,sK3) ),
inference(cnf_transformation,[],[f83]) ).
cnf(c_106,plain,
( ~ subset(sK5,sK3)
| ~ equal_set(union(intersection(sK3,sK4),sK5),intersection(sK3,union(sK4,sK5))) ),
inference(prop_impl_just,[status(thm)],[c_78]) ).
cnf(c_107,plain,
( ~ equal_set(union(intersection(sK3,sK4),sK5),intersection(sK3,union(sK4,sK5)))
| ~ subset(sK5,sK3) ),
inference(renaming,[status(thm)],[c_106]) ).
cnf(c_108,plain,
( subset(sK5,sK3)
| equal_set(union(intersection(sK3,sK4),sK5),intersection(sK3,union(sK4,sK5))) ),
inference(prop_impl_just,[status(thm)],[c_79]) ).
cnf(c_109,plain,
( equal_set(union(intersection(sK3,sK4),sK5),intersection(sK3,union(sK4,sK5)))
| subset(sK5,sK3) ),
inference(renaming,[status(thm)],[c_108]) ).
cnf(c_116,plain,
( subset(X0,X1)
| ~ equal_set(X0,X1) ),
inference(prop_impl_just,[status(thm)],[c_54]) ).
cnf(c_117,plain,
( ~ equal_set(X0,X1)
| subset(X0,X1) ),
inference(renaming,[status(thm)],[c_116]) ).
cnf(c_364,plain,
( intersection(sK3,union(sK4,sK5)) != X1
| union(intersection(sK3,sK4),sK5) != X0
| ~ subset(X0,X1)
| ~ subset(X1,X0)
| ~ subset(sK5,sK3) ),
inference(resolution_lifted,[status(thm)],[c_52,c_107]) ).
cnf(c_365,plain,
( ~ subset(intersection(sK3,union(sK4,sK5)),union(intersection(sK3,sK4),sK5))
| ~ subset(union(intersection(sK3,sK4),sK5),intersection(sK3,union(sK4,sK5)))
| ~ subset(sK5,sK3) ),
inference(unflattening,[status(thm)],[c_364]) ).
cnf(c_375,plain,
( intersection(sK3,union(sK4,sK5)) != X1
| union(intersection(sK3,sK4),sK5) != X0
| subset(X0,X1)
| subset(sK5,sK3) ),
inference(resolution_lifted,[status(thm)],[c_117,c_109]) ).
cnf(c_376,plain,
( subset(union(intersection(sK3,sK4),sK5),intersection(sK3,union(sK4,sK5)))
| subset(sK5,sK3) ),
inference(unflattening,[status(thm)],[c_375]) ).
cnf(c_442,plain,
( subset(sK5,sK3)
| subset(union(intersection(sK3,sK4),sK5),intersection(sK3,union(sK4,sK5))) ),
inference(prop_impl_just,[status(thm)],[c_376]) ).
cnf(c_443,plain,
( subset(union(intersection(sK3,sK4),sK5),intersection(sK3,union(sK4,sK5)))
| subset(sK5,sK3) ),
inference(renaming,[status(thm)],[c_442]) ).
cnf(c_1232,plain,
( ~ subset(union(X0,X1),X2)
| ~ member(X3,X1)
| member(X3,X2) ),
inference(superposition,[status(thm)],[c_60,c_51]) ).
cnf(c_1258,plain,
( member(sK0(union(intersection(sK3,sK4),sK5),intersection(sK3,union(sK4,sK5))),union(intersection(sK3,sK4),sK5))
| subset(union(intersection(sK3,sK4),sK5),intersection(sK3,union(sK4,sK5))) ),
inference(instantiation,[status(thm)],[c_50]) ).
cnf(c_1290,plain,
( member(sK0(intersection(sK3,union(sK4,sK5)),union(intersection(sK3,sK4),sK5)),intersection(sK3,union(sK4,sK5)))
| subset(intersection(sK3,union(sK4,sK5)),union(intersection(sK3,sK4),sK5)) ),
inference(instantiation,[status(thm)],[c_50]) ).
cnf(c_1526,plain,
( ~ member(X0,sK5)
| member(X0,intersection(sK3,union(sK4,sK5)))
| subset(sK5,sK3) ),
inference(superposition,[status(thm)],[c_443,c_1232]) ).
cnf(c_2052,plain,
( ~ member(sK0(union(intersection(sK3,sK4),sK5),intersection(sK3,union(sK4,sK5))),union(intersection(sK3,sK4),sK5))
| member(sK0(union(intersection(sK3,sK4),sK5),intersection(sK3,union(sK4,sK5))),intersection(sK3,sK4))
| member(sK0(union(intersection(sK3,sK4),sK5),intersection(sK3,union(sK4,sK5))),sK5) ),
inference(instantiation,[status(thm)],[c_62]) ).
cnf(c_2500,plain,
( ~ member(sK0(union(intersection(sK3,sK4),sK5),intersection(sK3,union(sK4,sK5))),sK5)
| ~ subset(sK5,X0)
| member(sK0(union(intersection(sK3,sK4),sK5),intersection(sK3,union(sK4,sK5))),X0) ),
inference(instantiation,[status(thm)],[c_51]) ).
cnf(c_2501,plain,
( ~ member(sK0(union(intersection(sK3,sK4),sK5),intersection(sK3,union(sK4,sK5))),sK5)
| ~ subset(sK5,sK3)
| member(sK0(union(intersection(sK3,sK4),sK5),intersection(sK3,union(sK4,sK5))),sK3) ),
inference(instantiation,[status(thm)],[c_2500]) ).
cnf(c_2575,plain,
( ~ member(sK0(intersection(sK3,union(sK4,sK5)),union(intersection(sK3,sK4),sK5)),intersection(sK3,union(sK4,sK5)))
| member(sK0(intersection(sK3,union(sK4,sK5)),union(intersection(sK3,sK4),sK5)),sK3) ),
inference(instantiation,[status(thm)],[c_59]) ).
cnf(c_2576,plain,
( ~ member(sK0(intersection(sK3,union(sK4,sK5)),union(intersection(sK3,sK4),sK5)),intersection(sK3,union(sK4,sK5)))
| member(sK0(intersection(sK3,union(sK4,sK5)),union(intersection(sK3,sK4),sK5)),union(sK4,sK5)) ),
inference(instantiation,[status(thm)],[c_58]) ).
cnf(c_4998,plain,
( ~ member(X0,sK5)
| member(X0,sK3)
| subset(sK5,sK3) ),
inference(superposition,[status(thm)],[c_1526,c_59]) ).
cnf(c_5033,plain,
( member(sK0(sK5,X0),sK3)
| subset(sK5,X0)
| subset(sK5,sK3) ),
inference(superposition,[status(thm)],[c_50,c_4998]) ).
cnf(c_5069,plain,
subset(sK5,sK3),
inference(superposition,[status(thm)],[c_5033,c_49]) ).
cnf(c_6672,plain,
( ~ subset(union(intersection(sK3,sK4),sK5),intersection(sK3,union(sK4,sK5)))
| ~ subset(intersection(sK3,union(sK4,sK5)),union(intersection(sK3,sK4),sK5)) ),
inference(global_subsumption_just,[status(thm)],[c_365,c_365,c_5069]) ).
cnf(c_6673,plain,
( ~ subset(intersection(sK3,union(sK4,sK5)),union(intersection(sK3,sK4),sK5))
| ~ subset(union(intersection(sK3,sK4),sK5),intersection(sK3,union(sK4,sK5))) ),
inference(renaming,[status(thm)],[c_6672]) ).
cnf(c_7547,plain,
( ~ member(sK0(X0,union(X1,X2)),X2)
| member(sK0(X0,union(X1,X2)),union(X1,X2)) ),
inference(instantiation,[status(thm)],[c_60]) ).
cnf(c_7548,plain,
( ~ member(sK0(X0,union(X1,X2)),union(X1,X2))
| subset(X0,union(X1,X2)) ),
inference(instantiation,[status(thm)],[c_49]) ).
cnf(c_7651,plain,
( ~ member(sK0(union(intersection(sK3,sK4),sK5),intersection(sK3,union(sK4,sK5))),intersection(X0,X1))
| member(sK0(union(intersection(sK3,sK4),sK5),intersection(sK3,union(sK4,sK5))),X0) ),
inference(instantiation,[status(thm)],[c_59]) ).
cnf(c_7653,plain,
( ~ member(sK0(union(intersection(sK3,sK4),sK5),intersection(sK3,union(sK4,sK5))),intersection(X0,X1))
| member(sK0(union(intersection(sK3,sK4),sK5),intersection(sK3,union(sK4,sK5))),X1) ),
inference(instantiation,[status(thm)],[c_58]) ).
cnf(c_8421,plain,
( ~ member(sK0(X0,intersection(X1,X2)),X1)
| ~ member(sK0(X0,intersection(X1,X2)),X2)
| member(sK0(X0,intersection(X1,X2)),intersection(X1,X2)) ),
inference(instantiation,[status(thm)],[c_57]) ).
cnf(c_9288,plain,
( ~ member(sK0(intersection(sK3,union(sK4,sK5)),union(intersection(sK3,sK4),sK5)),X0)
| member(sK0(intersection(sK3,union(sK4,sK5)),union(intersection(sK3,sK4),sK5)),union(X0,X1)) ),
inference(instantiation,[status(thm)],[c_61]) ).
cnf(c_10138,plain,
( ~ member(sK0(intersection(sK3,union(sK4,sK5)),union(intersection(sK3,sK4),sK5)),union(X0,X1))
| member(sK0(intersection(sK3,union(sK4,sK5)),union(intersection(sK3,sK4),sK5)),X0)
| member(sK0(intersection(sK3,union(sK4,sK5)),union(intersection(sK3,sK4),sK5)),X1) ),
inference(instantiation,[status(thm)],[c_62]) ).
cnf(c_10479,plain,
( ~ member(sK0(intersection(sK3,union(sK4,sK5)),union(intersection(sK3,sK4),sK5)),X0)
| ~ member(sK0(intersection(sK3,union(sK4,sK5)),union(intersection(sK3,sK4),sK5)),X1)
| member(sK0(intersection(sK3,union(sK4,sK5)),union(intersection(sK3,sK4),sK5)),intersection(X0,X1)) ),
inference(instantiation,[status(thm)],[c_57]) ).
cnf(c_10664,plain,
( ~ member(sK0(union(intersection(sK3,sK4),sK5),intersection(sK3,union(sK4,sK5))),intersection(sK3,sK4))
| member(sK0(union(intersection(sK3,sK4),sK5),intersection(sK3,union(sK4,sK5))),sK3) ),
inference(instantiation,[status(thm)],[c_7651]) ).
cnf(c_10781,plain,
( ~ member(sK0(union(intersection(sK3,sK4),sK5),intersection(sK3,union(sK4,sK5))),intersection(sK3,sK4))
| member(sK0(union(intersection(sK3,sK4),sK5),intersection(sK3,union(sK4,sK5))),sK4) ),
inference(instantiation,[status(thm)],[c_7653]) ).
cnf(c_13889,plain,
( ~ member(sK0(intersection(sK3,union(sK4,sK5)),union(intersection(sK3,sK4),sK5)),union(intersection(sK3,sK4),sK5))
| subset(intersection(sK3,union(sK4,sK5)),union(intersection(sK3,sK4),sK5)) ),
inference(instantiation,[status(thm)],[c_7548]) ).
cnf(c_16201,plain,
( ~ member(sK0(intersection(sK3,union(sK4,sK5)),union(intersection(sK3,sK4),sK5)),sK5)
| member(sK0(intersection(sK3,union(sK4,sK5)),union(intersection(sK3,sK4),sK5)),union(intersection(sK3,sK4),sK5)) ),
inference(instantiation,[status(thm)],[c_7547]) ).
cnf(c_19493,plain,
( ~ member(sK0(X0,intersection(X1,union(X2,X3))),union(X2,X3))
| ~ member(sK0(X0,intersection(X1,union(X2,X3))),X1)
| member(sK0(X0,intersection(X1,union(X2,X3))),intersection(X1,union(X2,X3))) ),
inference(instantiation,[status(thm)],[c_8421]) ).
cnf(c_21487,plain,
( ~ member(sK0(intersection(sK3,union(sK4,sK5)),union(intersection(sK3,sK4),sK5)),intersection(sK3,sK4))
| member(sK0(intersection(sK3,union(sK4,sK5)),union(intersection(sK3,sK4),sK5)),union(intersection(sK3,sK4),sK5)) ),
inference(instantiation,[status(thm)],[c_9288]) ).
cnf(c_25389,plain,
( ~ member(sK0(intersection(sK3,union(sK4,sK5)),union(intersection(sK3,sK4),sK5)),union(X0,sK5))
| member(sK0(intersection(sK3,union(sK4,sK5)),union(intersection(sK3,sK4),sK5)),X0)
| member(sK0(intersection(sK3,union(sK4,sK5)),union(intersection(sK3,sK4),sK5)),sK5) ),
inference(instantiation,[status(thm)],[c_10138]) ).
cnf(c_30952,plain,
( ~ member(sK0(intersection(sK3,union(sK4,sK5)),union(intersection(sK3,sK4),sK5)),sK3)
| ~ member(sK0(intersection(sK3,union(sK4,sK5)),union(intersection(sK3,sK4),sK5)),sK4)
| member(sK0(intersection(sK3,union(sK4,sK5)),union(intersection(sK3,sK4),sK5)),intersection(sK3,sK4)) ),
inference(instantiation,[status(thm)],[c_10479]) ).
cnf(c_34389,plain,
( ~ member(sK0(intersection(sK3,union(sK4,sK5)),union(intersection(sK3,sK4),sK5)),union(sK4,sK5))
| member(sK0(intersection(sK3,union(sK4,sK5)),union(intersection(sK3,sK4),sK5)),sK5)
| member(sK0(intersection(sK3,union(sK4,sK5)),union(intersection(sK3,sK4),sK5)),sK4) ),
inference(instantiation,[status(thm)],[c_25389]) ).
cnf(c_49512,plain,
~ subset(union(intersection(sK3,sK4),sK5),intersection(sK3,union(sK4,sK5))),
inference(global_subsumption_just,[status(thm)],[c_6673,c_365,c_1290,c_2576,c_2575,c_5069,c_13889,c_16201,c_21487,c_30952,c_34389]) ).
cnf(c_75485,plain,
( ~ member(sK0(union(intersection(sK3,sK4),sK5),intersection(sK3,union(sK4,sK5))),union(sK4,sK5))
| ~ member(sK0(union(intersection(sK3,sK4),sK5),intersection(sK3,union(sK4,sK5))),sK3)
| member(sK0(union(intersection(sK3,sK4),sK5),intersection(sK3,union(sK4,sK5))),intersection(sK3,union(sK4,sK5))) ),
inference(instantiation,[status(thm)],[c_19493]) ).
cnf(c_99274,plain,
( ~ member(sK0(union(intersection(sK3,sK4),sK5),intersection(sK3,union(sK4,sK5))),intersection(sK3,union(sK4,sK5)))
| subset(union(intersection(sK3,sK4),sK5),intersection(sK3,union(sK4,sK5))) ),
inference(instantiation,[status(thm)],[c_49]) ).
cnf(c_99349,plain,
( ~ member(sK0(union(intersection(sK3,sK4),sK5),intersection(sK3,union(sK4,sK5))),sK5)
| member(sK0(union(intersection(sK3,sK4),sK5),intersection(sK3,union(sK4,sK5))),union(sK4,sK5)) ),
inference(instantiation,[status(thm)],[c_60]) ).
cnf(c_99350,plain,
( ~ member(sK0(union(intersection(sK3,sK4),sK5),intersection(sK3,union(sK4,sK5))),sK4)
| member(sK0(union(intersection(sK3,sK4),sK5),intersection(sK3,union(sK4,sK5))),union(sK4,sK5)) ),
inference(instantiation,[status(thm)],[c_61]) ).
cnf(c_99351,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_99350,c_99349,c_99274,c_75485,c_49512,c_10781,c_10664,c_5069,c_2501,c_2052,c_1258]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.10 % Problem : SET690+4 : TPTP v8.2.0. Released v2.2.0.
% 0.10/0.10 % Command : run_iprover %s %d THM
% 0.10/0.31 % Computer : n027.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 300
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Sun Jun 23 16:49:09 EDT 2024
% 0.10/0.31 % CPUTime :
% 0.16/0.42 Running first-order theorem proving
% 0.16/0.42 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 167.11/22.24 % SZS status Started for theBenchmark.p
% 167.11/22.24 % SZS status Theorem for theBenchmark.p
% 167.11/22.24
% 167.11/22.24 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 167.11/22.24
% 167.11/22.24 ------ iProver source info
% 167.11/22.24
% 167.11/22.24 git: date: 2024-06-12 09:56:46 +0000
% 167.11/22.24 git: sha1: 4869ab62f0a3398f9d3a35e6db7918ebd3847e49
% 167.11/22.24 git: non_committed_changes: false
% 167.11/22.24
% 167.11/22.24 ------ Parsing...
% 167.11/22.24 ------ Clausification by vclausify_rel & Parsing by iProver...
% 167.11/22.24
% 167.11/22.24 ------ 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
% 167.11/22.24
% 167.11/22.24 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 167.11/22.24
% 167.11/22.24 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 167.11/22.24 ------ Proving...
% 167.11/22.24 ------ Problem Properties
% 167.11/22.24
% 167.11/22.24
% 167.11/22.24 clauses 29
% 167.11/22.24 conjectures 0
% 167.11/22.24 EPR 2
% 167.11/22.24 Horn 22
% 167.11/22.24 unary 4
% 167.11/22.24 binary 17
% 167.11/22.24 lits 62
% 167.11/22.24 lits eq 3
% 167.11/22.24 fd_pure 0
% 167.11/22.24 fd_pseudo 0
% 167.11/22.24 fd_cond 0
% 167.11/22.24 fd_pseudo_cond 2
% 167.11/22.24 AC symbols 0
% 167.11/22.24
% 167.11/22.24 ------ Input Options Time Limit: Unbounded
% 167.11/22.24
% 167.11/22.24
% 167.11/22.24 ------
% 167.11/22.24 Current options:
% 167.11/22.24 ------
% 167.11/22.24
% 167.11/22.24
% 167.11/22.24
% 167.11/22.24
% 167.11/22.24 ------ Proving...
% 167.11/22.24
% 167.11/22.24
% 167.11/22.24 % SZS status Theorem for theBenchmark.p
% 167.11/22.24
% 167.11/22.24 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 167.11/22.24
% 167.11/22.25
%------------------------------------------------------------------------------