TSTP Solution File: SET698+4 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SET698+4 : TPTP v8.1.2. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n032.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 May 3 03:01:17 EDT 2024
% Result : Theorem 235.23s 31.58s
% Output : CNFRefutation 235.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 23
% Number of leaves : 7
% Syntax : Number of formulae : 98 ( 6 unt; 0 def)
% Number of atoms : 299 ( 4 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 322 ( 121 ~; 138 |; 45 &)
% ( 10 <=>; 6 =>; 0 <=; 2 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 4 ( 1 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 : 169 ( 5 sgn 85 !; 18 ?)
% 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(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(f7,axiom,
! [X1,X0,X3] :
( member(X1,difference(X3,X0))
<=> ( ~ member(X1,X0)
& member(X1,X3) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',difference) ).
fof(f12,conjecture,
! [X0,X1,X3] :
( ( subset(X1,X3)
& subset(X0,X3) )
=> ( subset(X0,X1)
<=> equal_set(union(difference(X3,X0),X1),X3) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thI32) ).
fof(f13,negated_conjecture,
~ ! [X0,X1,X3] :
( ( subset(X1,X3)
& subset(X0,X3) )
=> ( subset(X0,X1)
<=> equal_set(union(difference(X3,X0),X1),X3) ) ),
inference(negated_conjecture,[],[f12]) ).
fof(f16,plain,
! [X0,X1,X2] :
( member(X0,union(X1,X2))
<=> ( member(X0,X2)
| member(X0,X1) ) ),
inference(rectify,[],[f5]) ).
fof(f18,plain,
! [X0,X1,X2] :
( member(X0,difference(X2,X1))
<=> ( ~ member(X0,X1)
& member(X0,X2) ) ),
inference(rectify,[],[f7]) ).
fof(f23,plain,
~ ! [X0,X1,X2] :
( ( subset(X1,X2)
& subset(X0,X2) )
=> ( subset(X0,X1)
<=> equal_set(union(difference(X2,X0),X1),X2) ) ),
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] :
( ( subset(X0,X1)
<~> equal_set(union(difference(X2,X0),X1),X2) )
& subset(X1,X2)
& subset(X0,X2) ),
inference(ennf_transformation,[],[f23]) ).
fof(f27,plain,
? [X0,X1,X2] :
( ( subset(X0,X1)
<~> equal_set(union(difference(X2,X0),X1),X2) )
& subset(X1,X2)
& subset(X0,X2) ),
inference(flattening,[],[f26]) ).
fof(f28,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(f29,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,[],[f28]) ).
fof(f30,plain,
! [X0,X1] :
( ? [X2] :
( ~ member(X2,X1)
& member(X2,X0) )
=> ( ~ member(sK0(X0,X1),X1)
& member(sK0(X0,X1),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f31,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])],[f29,f30]) ).
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(nnf_transformation,[],[f2]) ).
fof(f33,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,[],[f32]) ).
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(nnf_transformation,[],[f16]) ).
fof(f38,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,[],[f37]) ).
fof(f39,plain,
! [X0,X1,X2] :
( ( member(X0,difference(X2,X1))
| member(X0,X1)
| ~ member(X0,X2) )
& ( ( ~ member(X0,X1)
& member(X0,X2) )
| ~ member(X0,difference(X2,X1)) ) ),
inference(nnf_transformation,[],[f18]) ).
fof(f40,plain,
! [X0,X1,X2] :
( ( member(X0,difference(X2,X1))
| member(X0,X1)
| ~ member(X0,X2) )
& ( ( ~ member(X0,X1)
& member(X0,X2) )
| ~ member(X0,difference(X2,X1)) ) ),
inference(flattening,[],[f39]) ).
fof(f52,plain,
? [X0,X1,X2] :
( ( ~ equal_set(union(difference(X2,X0),X1),X2)
| ~ subset(X0,X1) )
& ( equal_set(union(difference(X2,X0),X1),X2)
| subset(X0,X1) )
& subset(X1,X2)
& subset(X0,X2) ),
inference(nnf_transformation,[],[f27]) ).
fof(f53,plain,
? [X0,X1,X2] :
( ( ~ equal_set(union(difference(X2,X0),X1),X2)
| ~ subset(X0,X1) )
& ( equal_set(union(difference(X2,X0),X1),X2)
| subset(X0,X1) )
& subset(X1,X2)
& subset(X0,X2) ),
inference(flattening,[],[f52]) ).
fof(f54,plain,
( ? [X0,X1,X2] :
( ( ~ equal_set(union(difference(X2,X0),X1),X2)
| ~ subset(X0,X1) )
& ( equal_set(union(difference(X2,X0),X1),X2)
| subset(X0,X1) )
& subset(X1,X2)
& subset(X0,X2) )
=> ( ( ~ equal_set(union(difference(sK5,sK3),sK4),sK5)
| ~ subset(sK3,sK4) )
& ( equal_set(union(difference(sK5,sK3),sK4),sK5)
| subset(sK3,sK4) )
& subset(sK4,sK5)
& subset(sK3,sK5) ) ),
introduced(choice_axiom,[]) ).
fof(f55,plain,
( ( ~ equal_set(union(difference(sK5,sK3),sK4),sK5)
| ~ subset(sK3,sK4) )
& ( equal_set(union(difference(sK5,sK3),sK4),sK5)
| subset(sK3,sK4) )
& subset(sK4,sK5)
& subset(sK3,sK5) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3,sK4,sK5])],[f53,f54]) ).
fof(f56,plain,
! [X3,X0,X1] :
( member(X3,X1)
| ~ member(X3,X0)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f31]) ).
fof(f57,plain,
! [X0,X1] :
( subset(X0,X1)
| member(sK0(X0,X1),X0) ),
inference(cnf_transformation,[],[f31]) ).
fof(f58,plain,
! [X0,X1] :
( subset(X0,X1)
| ~ member(sK0(X0,X1),X1) ),
inference(cnf_transformation,[],[f31]) ).
fof(f60,plain,
! [X0,X1] :
( subset(X1,X0)
| ~ equal_set(X0,X1) ),
inference(cnf_transformation,[],[f33]) ).
fof(f61,plain,
! [X0,X1] :
( equal_set(X0,X1)
| ~ subset(X1,X0)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f33]) ).
fof(f67,plain,
! [X2,X0,X1] :
( member(X0,X2)
| member(X0,X1)
| ~ member(X0,union(X1,X2)) ),
inference(cnf_transformation,[],[f38]) ).
fof(f68,plain,
! [X2,X0,X1] :
( member(X0,union(X1,X2))
| ~ member(X0,X1) ),
inference(cnf_transformation,[],[f38]) ).
fof(f69,plain,
! [X2,X0,X1] :
( member(X0,union(X1,X2))
| ~ member(X0,X2) ),
inference(cnf_transformation,[],[f38]) ).
fof(f71,plain,
! [X2,X0,X1] :
( member(X0,X2)
| ~ member(X0,difference(X2,X1)) ),
inference(cnf_transformation,[],[f40]) ).
fof(f72,plain,
! [X2,X0,X1] :
( ~ member(X0,X1)
| ~ member(X0,difference(X2,X1)) ),
inference(cnf_transformation,[],[f40]) ).
fof(f73,plain,
! [X2,X0,X1] :
( member(X0,difference(X2,X1))
| member(X0,X1)
| ~ member(X0,X2) ),
inference(cnf_transformation,[],[f40]) ).
fof(f85,plain,
subset(sK3,sK5),
inference(cnf_transformation,[],[f55]) ).
fof(f86,plain,
subset(sK4,sK5),
inference(cnf_transformation,[],[f55]) ).
fof(f87,plain,
( equal_set(union(difference(sK5,sK3),sK4),sK5)
| subset(sK3,sK4) ),
inference(cnf_transformation,[],[f55]) ).
fof(f88,plain,
( ~ equal_set(union(difference(sK5,sK3),sK4),sK5)
| ~ subset(sK3,sK4) ),
inference(cnf_transformation,[],[f55]) ).
cnf(c_49,plain,
( ~ member(sK0(X0,X1),X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f58]) ).
cnf(c_50,plain,
( member(sK0(X0,X1),X0)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f57]) ).
cnf(c_51,plain,
( ~ subset(X0,X1)
| ~ member(X2,X0)
| member(X2,X1) ),
inference(cnf_transformation,[],[f56]) ).
cnf(c_52,plain,
( ~ subset(X0,X1)
| ~ subset(X1,X0)
| equal_set(X0,X1) ),
inference(cnf_transformation,[],[f61]) ).
cnf(c_53,plain,
( ~ equal_set(X0,X1)
| subset(X1,X0) ),
inference(cnf_transformation,[],[f60]) ).
cnf(c_60,plain,
( ~ member(X0,X1)
| member(X0,union(X2,X1)) ),
inference(cnf_transformation,[],[f69]) ).
cnf(c_61,plain,
( ~ member(X0,X1)
| member(X0,union(X1,X2)) ),
inference(cnf_transformation,[],[f68]) ).
cnf(c_62,plain,
( ~ member(X0,union(X1,X2))
| member(X0,X1)
| member(X0,X2) ),
inference(cnf_transformation,[],[f67]) ).
cnf(c_64,plain,
( ~ member(X0,X1)
| member(X0,difference(X1,X2))
| member(X0,X2) ),
inference(cnf_transformation,[],[f73]) ).
cnf(c_65,plain,
( ~ member(X0,difference(X1,X2))
| ~ member(X0,X2) ),
inference(cnf_transformation,[],[f72]) ).
cnf(c_66,plain,
( ~ member(X0,difference(X1,X2))
| member(X0,X1) ),
inference(cnf_transformation,[],[f71]) ).
cnf(c_78,negated_conjecture,
( ~ equal_set(union(difference(sK5,sK3),sK4),sK5)
| ~ subset(sK3,sK4) ),
inference(cnf_transformation,[],[f88]) ).
cnf(c_79,negated_conjecture,
( equal_set(union(difference(sK5,sK3),sK4),sK5)
| subset(sK3,sK4) ),
inference(cnf_transformation,[],[f87]) ).
cnf(c_80,negated_conjecture,
subset(sK4,sK5),
inference(cnf_transformation,[],[f86]) ).
cnf(c_81,negated_conjecture,
subset(sK3,sK5),
inference(cnf_transformation,[],[f85]) ).
cnf(c_108,plain,
( ~ subset(sK3,sK4)
| ~ equal_set(union(difference(sK5,sK3),sK4),sK5) ),
inference(prop_impl_just,[status(thm)],[c_78]) ).
cnf(c_109,plain,
( ~ equal_set(union(difference(sK5,sK3),sK4),sK5)
| ~ subset(sK3,sK4) ),
inference(renaming,[status(thm)],[c_108]) ).
cnf(c_110,plain,
( subset(sK3,sK4)
| equal_set(union(difference(sK5,sK3),sK4),sK5) ),
inference(prop_impl_just,[status(thm)],[c_79]) ).
cnf(c_111,plain,
( equal_set(union(difference(sK5,sK3),sK4),sK5)
| subset(sK3,sK4) ),
inference(renaming,[status(thm)],[c_110]) ).
cnf(c_122,plain,
( ~ equal_set(X0,X1)
| subset(X1,X0) ),
inference(prop_impl_just,[status(thm)],[c_53]) ).
cnf(c_372,plain,
( union(difference(sK5,sK3),sK4) != X0
| X1 != sK5
| ~ subset(X0,X1)
| ~ subset(X1,X0)
| ~ subset(sK3,sK4) ),
inference(resolution_lifted,[status(thm)],[c_52,c_109]) ).
cnf(c_373,plain,
( ~ subset(union(difference(sK5,sK3),sK4),sK5)
| ~ subset(sK5,union(difference(sK5,sK3),sK4))
| ~ subset(sK3,sK4) ),
inference(unflattening,[status(thm)],[c_372]) ).
cnf(c_391,plain,
( union(difference(sK5,sK3),sK4) != X0
| X1 != sK5
| subset(X1,X0)
| subset(sK3,sK4) ),
inference(resolution_lifted,[status(thm)],[c_122,c_111]) ).
cnf(c_392,plain,
( subset(sK5,union(difference(sK5,sK3),sK4))
| subset(sK3,sK4) ),
inference(unflattening,[status(thm)],[c_391]) ).
cnf(c_452,plain,
( subset(sK3,sK4)
| subset(sK5,union(difference(sK5,sK3),sK4)) ),
inference(prop_impl_just,[status(thm)],[c_392]) ).
cnf(c_453,plain,
( subset(sK5,union(difference(sK5,sK3),sK4))
| subset(sK3,sK4) ),
inference(renaming,[status(thm)],[c_452]) ).
cnf(c_1411,plain,
( member(sK0(sK5,union(difference(sK5,sK3),sK4)),sK5)
| subset(sK5,union(difference(sK5,sK3),sK4)) ),
inference(instantiation,[status(thm)],[c_50]) ).
cnf(c_1441,plain,
( member(sK0(union(difference(sK5,sK3),sK4),sK5),union(difference(sK5,sK3),sK4))
| subset(union(difference(sK5,sK3),sK4),sK5) ),
inference(instantiation,[status(thm)],[c_50]) ).
cnf(c_1861,plain,
( ~ member(sK0(sK5,union(difference(sK5,sK3),sK4)),union(difference(sK5,sK3),sK4))
| subset(sK5,union(difference(sK5,sK3),sK4)) ),
inference(instantiation,[status(thm)],[c_49]) ).
cnf(c_6753,plain,
( ~ member(sK0(union(difference(sK5,sK3),sK4),sK5),sK5)
| subset(union(difference(sK5,sK3),sK4),sK5) ),
inference(instantiation,[status(thm)],[c_49]) ).
cnf(c_261443,plain,
( ~ subset(X0,X1)
| member(sK0(X0,X2),X1)
| subset(X0,X2) ),
inference(superposition,[status(thm)],[c_50,c_51]) ).
cnf(c_261478,plain,
( ~ subset(X0,X1)
| ~ subset(X1,X2)
| member(sK0(X0,X3),X2)
| subset(X0,X3) ),
inference(superposition,[status(thm)],[c_261443,c_51]) ).
cnf(c_261504,plain,
( ~ member(sK0(union(difference(sK5,sK3),sK4),sK5),union(difference(sK5,sK3),sK4))
| member(sK0(union(difference(sK5,sK3),sK4),sK5),difference(sK5,sK3))
| member(sK0(union(difference(sK5,sK3),sK4),sK5),sK4) ),
inference(instantiation,[status(thm)],[c_62]) ).
cnf(c_261739,plain,
( ~ member(sK0(union(difference(sK5,sK3),sK4),sK5),difference(sK5,sK3))
| member(sK0(union(difference(sK5,sK3),sK4),sK5),sK5) ),
inference(instantiation,[status(thm)],[c_66]) ).
cnf(c_262080,plain,
( ~ member(sK0(union(difference(sK5,sK3),sK4),sK5),sK4)
| ~ subset(sK4,X0)
| member(sK0(union(difference(sK5,sK3),sK4),sK5),X0) ),
inference(instantiation,[status(thm)],[c_51]) ).
cnf(c_262081,plain,
( ~ member(sK0(union(difference(sK5,sK3),sK4),sK5),sK4)
| ~ subset(sK4,sK5)
| member(sK0(union(difference(sK5,sK3),sK4),sK5),sK5) ),
inference(instantiation,[status(thm)],[c_262080]) ).
cnf(c_264225,plain,
( ~ subset(sK5,X0)
| member(sK0(sK3,X1),X0)
| subset(sK3,X1) ),
inference(superposition,[status(thm)],[c_81,c_261478]) ).
cnf(c_264703,plain,
( ~ subset(sK5,union(X0,X1))
| member(sK0(sK3,X2),X0)
| member(sK0(sK3,X2),X1)
| subset(sK3,X2) ),
inference(superposition,[status(thm)],[c_264225,c_62]) ).
cnf(c_265007,plain,
( ~ subset(sK5,union(difference(sK5,sK3),sK4))
| ~ subset(sK3,sK4) ),
inference(global_subsumption_just,[status(thm)],[c_373,c_80,c_373,c_1441,c_6753,c_261504,c_261739,c_262081]) ).
cnf(c_266021,plain,
( member(sK0(sK3,X0),difference(sK5,sK3))
| member(sK0(sK3,X0),sK4)
| subset(sK3,X0)
| subset(sK3,sK4) ),
inference(superposition,[status(thm)],[c_453,c_264703]) ).
cnf(c_276621,plain,
( ~ member(sK0(sK3,X0),sK3)
| member(sK0(sK3,X0),sK4)
| subset(sK3,X0)
| subset(sK3,sK4) ),
inference(superposition,[status(thm)],[c_266021,c_65]) ).
cnf(c_276733,plain,
( member(sK0(sK3,X0),sK4)
| subset(sK3,X0)
| subset(sK3,sK4) ),
inference(superposition,[status(thm)],[c_50,c_276621]) ).
cnf(c_276803,plain,
subset(sK3,sK4),
inference(superposition,[status(thm)],[c_276733,c_49]) ).
cnf(c_277886,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_287453,plain,
( ~ member(sK0(sK5,union(difference(sK5,sK3),sK4)),sK5)
| member(sK0(sK5,union(difference(sK5,sK3),sK4)),difference(sK5,X0))
| member(sK0(sK5,union(difference(sK5,sK3),sK4)),X0) ),
inference(instantiation,[status(thm)],[c_64]) ).
cnf(c_309441,plain,
( ~ member(sK0(sK5,union(difference(sK5,sK3),sK4)),sK4)
| member(sK0(sK5,union(difference(sK5,sK3),sK4)),union(difference(sK5,sK3),sK4)) ),
inference(instantiation,[status(thm)],[c_277886]) ).
cnf(c_315905,plain,
( ~ member(sK0(X0,X1),X2)
| member(sK0(X0,X1),union(X2,X3)) ),
inference(instantiation,[status(thm)],[c_61]) ).
cnf(c_326675,plain,
( ~ member(sK0(sK5,union(difference(sK5,sK3),sK4)),difference(sK5,sK3))
| member(sK0(sK5,union(difference(sK5,sK3),sK4)),union(difference(sK5,sK3),sK4)) ),
inference(instantiation,[status(thm)],[c_315905]) ).
cnf(c_337993,plain,
( ~ member(sK0(sK5,union(difference(sK5,sK3),sK4)),sK5)
| member(sK0(sK5,union(difference(sK5,sK3),sK4)),difference(sK5,X0))
| member(sK0(sK5,union(difference(sK5,sK3),sK4)),X0) ),
inference(instantiation,[status(thm)],[c_64]) ).
cnf(c_338042,plain,
( ~ member(sK0(sK5,union(difference(sK5,sK3),sK4)),X0)
| ~ subset(X0,X1)
| member(sK0(sK5,union(difference(sK5,sK3),sK4)),X1) ),
inference(instantiation,[status(thm)],[c_51]) ).
cnf(c_338055,plain,
( member(sK0(sK5,union(difference(sK5,sK3),sK4)),difference(sK5,X0))
| member(sK0(sK5,union(difference(sK5,sK3),sK4)),X0) ),
inference(global_subsumption_just,[status(thm)],[c_337993,c_1411,c_265007,c_276803,c_287453]) ).
cnf(c_340834,plain,
( ~ member(sK0(sK5,union(difference(sK5,sK3),sK4)),X0)
| ~ subset(X0,sK4)
| member(sK0(sK5,union(difference(sK5,sK3),sK4)),sK4) ),
inference(instantiation,[status(thm)],[c_338042]) ).
cnf(c_345817,plain,
( ~ subset(X0,sK4)
| ~ member(sK0(sK5,union(difference(sK5,sK3),sK4)),X0) ),
inference(global_subsumption_just,[status(thm)],[c_340834,c_80,c_373,c_1441,c_1861,c_6753,c_261504,c_261739,c_262081,c_276803,c_309441,c_340834]) ).
cnf(c_345818,plain,
( ~ member(sK0(sK5,union(difference(sK5,sK3),sK4)),X0)
| ~ subset(X0,sK4) ),
inference(renaming,[status(thm)],[c_345817]) ).
cnf(c_345822,plain,
( ~ member(sK0(sK5,union(difference(sK5,sK3),sK4)),sK3)
| ~ subset(sK3,sK4) ),
inference(instantiation,[status(thm)],[c_345818]) ).
cnf(c_350592,plain,
( member(sK0(sK5,union(difference(sK5,sK3),sK4)),difference(sK5,sK3))
| member(sK0(sK5,union(difference(sK5,sK3),sK4)),sK3) ),
inference(instantiation,[status(thm)],[c_338055]) ).
cnf(c_350594,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_350592,c_345822,c_326675,c_276803,c_265007,c_1861]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.07 % Problem : SET698+4 : TPTP v8.1.2. Released v2.2.0.
% 0.00/0.08 % Command : run_iprover %s %d THM
% 0.07/0.26 % Computer : n032.cluster.edu
% 0.07/0.26 % Model : x86_64 x86_64
% 0.07/0.26 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.26 % Memory : 8042.1875MB
% 0.07/0.26 % OS : Linux 3.10.0-693.el7.x86_64
% 0.07/0.26 % CPULimit : 300
% 0.07/0.26 % WCLimit : 300
% 0.07/0.26 % DateTime : Thu May 2 20:30:23 EDT 2024
% 0.07/0.27 % CPUTime :
% 0.11/0.34 Running first-order theorem proving
% 0.11/0.34 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
% 235.23/31.58 % SZS status Started for theBenchmark.p
% 235.23/31.58 % SZS status Theorem for theBenchmark.p
% 235.23/31.58
% 235.23/31.58 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 235.23/31.58
% 235.23/31.58 ------ iProver source info
% 235.23/31.58
% 235.23/31.58 git: date: 2024-05-02 19:28:25 +0000
% 235.23/31.58 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 235.23/31.58 git: non_committed_changes: false
% 235.23/31.58
% 235.23/31.58 ------ Parsing...
% 235.23/31.58 ------ Clausification by vclausify_rel & Parsing by iProver...
% 235.23/31.58
% 235.23/31.58 ------ 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
% 235.23/31.58
% 235.23/31.58 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 235.23/31.58
% 235.23/31.58 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 235.23/31.58 ------ Proving...
% 235.23/31.58 ------ Problem Properties
% 235.23/31.58
% 235.23/31.58
% 235.23/31.58 clauses 31
% 235.23/31.58 conjectures 2
% 235.23/31.58 EPR 4
% 235.23/31.58 Horn 24
% 235.23/31.58 unary 6
% 235.23/31.58 binary 17
% 235.23/31.58 lits 64
% 235.23/31.58 lits eq 3
% 235.23/31.58 fd_pure 0
% 235.23/31.58 fd_pseudo 0
% 235.23/31.58 fd_cond 0
% 235.23/31.58 fd_pseudo_cond 2
% 235.23/31.58 AC symbols 0
% 235.23/31.58
% 235.23/31.58 ------ Input Options Time Limit: Unbounded
% 235.23/31.58
% 235.23/31.58
% 235.23/31.58 ------
% 235.23/31.58 Current options:
% 235.23/31.58 ------
% 235.23/31.58
% 235.23/31.58
% 235.23/31.58
% 235.23/31.58
% 235.23/31.58 ------ Proving...
% 235.23/31.58
% 235.23/31.58
% 235.23/31.58 ------ Proving...
% 235.23/31.58
% 235.23/31.58
% 235.23/31.58 ------ Proving...
% 235.23/31.58
% 235.23/31.58
% 235.23/31.58 ------ Proving...
% 235.23/31.58
% 235.23/31.58
% 235.23/31.58 ------ Proving...
% 235.23/31.58
% 235.23/31.58
% 235.23/31.58 ------ Proving...
% 235.23/31.58
% 235.23/31.58
% 235.23/31.58 ------ Proving...
% 235.23/31.58
% 235.23/31.58
% 235.23/31.58 ------ Proving...
% 235.23/31.58
% 235.23/31.58
% 235.23/31.58 ------ Proving...
% 235.23/31.58
% 235.23/31.58
% 235.23/31.58 ------ Proving...
% 235.23/31.58
% 235.23/31.58
% 235.23/31.58 ------ Proving...
% 235.23/31.58
% 235.23/31.58
% 235.23/31.58 ------ Proving...
% 235.23/31.58
% 235.23/31.58
% 235.23/31.58 ------ Proving...
% 235.23/31.58
% 235.23/31.58
% 235.23/31.58 ------ Proving...
% 235.23/31.58
% 235.23/31.58
% 235.23/31.58 ------ Proving...
% 235.23/31.58
% 235.23/31.58
% 235.23/31.58 ------ Proving...
% 235.23/31.58
% 235.23/31.58
% 235.23/31.58 % SZS status Theorem for theBenchmark.p
% 235.23/31.58
% 235.23/31.58 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 235.23/31.58
% 235.23/31.59
%------------------------------------------------------------------------------