TSTP Solution File: SET698+4 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SET698+4 : TPTP v8.1.2. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n010.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:09:11 EDT 2023
% Result : Theorem 204.50s 27.85s
% Output : CNFRefutation 204.50s
% Verified :
% SZS Type : Refutation
% Derivation depth : 23
% Number of leaves : 7
% Syntax : Number of formulae : 99 ( 6 unt; 0 def)
% Number of atoms : 302 ( 4 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 325 ( 122 ~; 140 |; 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 : 174 ( 6 sgn; 85 !; 18 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X0)
=> member(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',subset) ).
fof(f2,axiom,
! [X0,X1] :
( equal_set(X0,X1)
<=> ( subset(X1,X0)
& subset(X0,X1) ) ),
file('/export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p',union) ).
fof(f7,axiom,
! [X1,X0,X3] :
( member(X1,difference(X3,X0))
<=> ( ~ member(X1,X0)
& member(X1,X3) ) ),
file('/export/starexec/sandbox/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/sandbox/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_585083,plain,
( ~ subset(X0,X1)
| member(sK0(X0,X2),X1)
| subset(X0,X2) ),
inference(superposition,[status(thm)],[c_50,c_51]) ).
cnf(c_585118,plain,
( ~ subset(X0,X1)
| ~ subset(X1,X2)
| member(sK0(X0,X3),X2)
| subset(X0,X3) ),
inference(superposition,[status(thm)],[c_585083,c_51]) ).
cnf(c_585144,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_585379,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_585720,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_585721,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_585720]) ).
cnf(c_587871,plain,
( ~ subset(sK5,X0)
| member(sK0(sK3,X1),X0)
| subset(sK3,X1) ),
inference(superposition,[status(thm)],[c_81,c_585118]) ).
cnf(c_588353,plain,
( ~ subset(sK5,union(X0,X1))
| member(sK0(sK3,X2),X0)
| member(sK0(sK3,X2),X1)
| subset(sK3,X2) ),
inference(superposition,[status(thm)],[c_587871,c_62]) ).
cnf(c_588659,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_585144,c_585379,c_585721]) ).
cnf(c_589673,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_588353]) ).
cnf(c_600467,plain,
( ~ member(sK0(sK3,X0),sK3)
| member(sK0(sK3,X0),sK4)
| subset(sK3,X0)
| subset(sK3,sK4) ),
inference(superposition,[status(thm)],[c_589673,c_65]) ).
cnf(c_600722,plain,
( member(sK0(sK3,X0),sK4)
| subset(sK3,X0)
| subset(sK3,sK4) ),
inference(superposition,[status(thm)],[c_50,c_600467]) ).
cnf(c_600788,plain,
subset(sK3,sK4),
inference(superposition,[status(thm)],[c_600722,c_49]) ).
cnf(c_610387,plain,
( ~ member(sK0(X0,X1),X2)
| member(sK0(X0,X1),difference(X2,X3))
| member(sK0(X0,X1),X3) ),
inference(instantiation,[status(thm)],[c_64]) ).
cnf(c_610390,plain,
( ~ member(sK0(X0,X1),X2)
| member(sK0(X0,X1),union(X3,X2)) ),
inference(instantiation,[status(thm)],[c_60]) ).
cnf(c_612051,plain,
( ~ member(sK0(X0,X1),X2)
| member(sK0(X0,X1),union(X2,X3)) ),
inference(instantiation,[status(thm)],[c_61]) ).
cnf(c_640946,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_610387]) ).
cnf(c_659141,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_610390]) ).
cnf(c_659842,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_612051]) ).
cnf(c_674969,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_675018,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_675032,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_674969,c_1411,c_588659,c_600788,c_640946]) ).
cnf(c_677877,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_675018]) ).
cnf(c_682396,plain,
( ~ subset(X0,sK4)
| ~ member(sK0(sK5,union(difference(sK5,sK3),sK4)),X0) ),
inference(global_subsumption_just,[status(thm)],[c_677877,c_80,c_373,c_1441,c_1861,c_6753,c_585144,c_585379,c_585721,c_600788,c_659141,c_677877]) ).
cnf(c_682397,plain,
( ~ member(sK0(sK5,union(difference(sK5,sK3),sK4)),X0)
| ~ subset(X0,sK4) ),
inference(renaming,[status(thm)],[c_682396]) ).
cnf(c_682401,plain,
( ~ member(sK0(sK5,union(difference(sK5,sK3),sK4)),sK3)
| ~ subset(sK3,sK4) ),
inference(instantiation,[status(thm)],[c_682397]) ).
cnf(c_687685,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_675032]) ).
cnf(c_687687,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_687685,c_682401,c_659842,c_600788,c_588659,c_1861]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SET698+4 : TPTP v8.1.2. Released v2.2.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 0.17/0.34 % Computer : n010.cluster.edu
% 0.17/0.34 % Model : x86_64 x86_64
% 0.17/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.34 % Memory : 8042.1875MB
% 0.17/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.34 % CPULimit : 300
% 0.17/0.34 % WCLimit : 300
% 0.17/0.34 % DateTime : Sat Aug 26 11:12:20 EDT 2023
% 0.17/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
% 3.33/1.16 % SZS status Started for theBenchmark.p
% 3.33/1.16 ERROR - "ProverProcess:heur/409474:1.0" ran with exit code 2 and error: iprover.ml: Unexpected exception: Failure("Clausification error: res/vclausify_rel prover was killed by a signal: -10")
% 3.33/1.16 Fatal error: exception Failure("Clausification error: res/vclausify_rel prover was killed by a signal: -10")
% 3.33/1.16 ERROR - cmd was: ulimit -v 4096000; ./res/iproveropt_static_z3 --abstr_ref "[]" --abstr_ref_under "[]" --comb_inst_mult 3 --comb_mode clause_based --comb_res_mult 4 --comb_sup_deep_mult 2 --comb_sup_mult 0 --conj_cone_tolerance 3. --demod_completeness_check fast --demod_use_ground true --eq_ax_congr_red true --extra_neg_conj none --inst_activity_threshold 500 --inst_dismatching true --inst_eager_unprocessed_to_passive true --inst_eq_res_simp false --inst_learning_factor 2 --inst_learning_loop_flag true --inst_learning_start 3000 --inst_lit_activity_flag true --inst_lit_sel "[+prop;+sign;+ground;-num_var;-num_symb]" --inst_lit_sel_side num_symb --inst_orphan_elimination true --inst_passive_queue_type priority_queues --inst_passive_queues "[[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]" --inst_passive_queues_freq "[25;2]" --inst_prop_sim_given true --inst_prop_sim_new false --inst_restr_to_given false --inst_sel_renew solver --inst_solver_calls_frac 1. --inst_solver_per_active 1400 --inst_sos_flag false --inst_start_prop_sim_after_learn 3 --inst_subs_given false --inst_subs_new false --instantiation_flag true --out_options none --pred_elim true --prep_def_merge true --prep_def_merge_mbd true --prep_def_merge_prop_impl false --prep_def_merge_tr_cl false --prep_def_merge_tr_red false --prep_gs_sim true --prep_res_sim true --prep_sem_filter exhaustive --prep_sup_sim_all true --prep_sup_sim_sup false --prep_unflatten true --prep_upred true --preprocessing_flag true --prolific_symb_bound 256 --prop_solver_per_cl 1024 --pure_diseq_elim true --res_backward_subs full --res_backward_subs_resolution false --res_forward_subs subset_subsumption --res_forward_subs_resolution true --res_lit_sel pos_max --res_lit_sel_side num_var --res_ordering kbo_pred --res_passive_queue_type priority_queues --res_passive_queues "[[-num_lits];[-conj_symb;-num_symb;+num_symb]]" --res_passive_queues_freq "[15;3]" --res_prop_simpl_given false --res_prop_simpl_new true --res_sim_input true --res_time_limit 202.80 --res_to_prop_solver passive --resolution_flag true --schedule none --share_sel_clauses true --smt_ac_axioms fast --smt_preprocessing true --splitting_cvd false --splitting_cvd_svl false --splitting_grd true --splitting_mode input --splitting_nvd 32 --stats_out none --sub_typing true --subs_bck_mult 8 --sup_full_bw "[]" --sup_full_fw "[]" --sup_full_triv "[PropSubs]" --sup_fun_splitting false --sup_immed_bw_immed "[]" --sup_immed_bw_main "[]" --sup_immed_fw_immed "[ACNormalisation]" --sup_immed_fw_main "[]" --sup_immed_triv "[]" --sup_indices_passive "[]" --sup_input_bw "[]" --sup_input_fw "[ACNormalisation]" --sup_input_triv "[Unflattening]" --sup_iter_deepening 2 --sup_passive_queue_type priority_queues --sup_passive_queues "[[-conj_dist;-num_symb];[+age;-num_symb];[+score;-num_symb]]" --sup_passive_queues_freq "[8;4;4]" --sup_prop_simpl_given true --sup_prop_simpl_new true --sup_restarts_mult 2 --sup_score sim_d_gen --sup_share_max_num_cl 500 --sup_share_score_frac 0.2 --sup_smt_interval 10000 --sup_symb_ordering invfreq --sup_to_prop_solver passive --superposition_flag true --time_out_prep_mult 0.1 --proof_out true --sat_out_model small --clausifier res/vclausify_rel --clausifier_options "--mode clausify -t 1.00" --time_out_real 1.00 /export/starexec/sandbox/benchmark/theBenchmark.p 1>> /export/starexec/sandbox/tmp/iprover_out_84n61uf3/oyu8ahfg 2>> /export/starexec/sandbox/tmp/iprover_out_84n61uf3/oyu8ahfg_error
% 3.33/1.16 ERROR - "ProverProcess:heur/469571:1.0" ran with exit code 2 and error: iprover.ml: Unexpected exception: Failure("Clausification error: res/vclausify_rel prover was killed by a signal: -10")
% 3.33/1.16 Fatal error: exception Failure("Clausification error: res/vclausify_rel prover was killed by a signal: -10")
% 3.33/1.16 ERROR - cmd was: ulimit -v 4096000; ./res/iproveropt_static_z3 --abstr_ref "[]" --abstr_ref_under "[]" --comb_inst_mult 6 --comb_mode clause_based --comb_res_mult 1 --comb_sup_deep_mult 2 --comb_sup_mult 0 --conj_cone_tolerance 3.0 --demod_completeness_check fast --demod_use_ground true --eq_ax_congr_red true --extra_neg_conj none --inst_activity_threshold 32 --inst_dismatching false --inst_eager_unprocessed_to_passive false --inst_eq_res_simp false --inst_learning_factor 10 --inst_learning_loop_flag true --inst_learning_start 256 --inst_lit_activity_flag true --inst_lit_sel "[+sign;-ground;-non_prol_conj_symb;-num_var]" --inst_lit_sel_side num_lit --inst_orphan_elimination true --inst_passive_queue_type list --inst_passive_queues "[[-ground;-epr]]" --inst_passive_queues_freq "[2]" --inst_prop_sim_given false --inst_prop_sim_new false --inst_restr_to_given true --inst_sel_renew solver --inst_solver_calls_frac 0.6939020527068606 --inst_solver_per_active 8 --inst_sos_flag false --inst_start_prop_sim_after_learn 9 --inst_subs_given false --inst_subs_new false --instantiation_flag true --out_options none --pred_elim true --prep_def_merge true --prep_def_merge_mbd true --prep_def_merge_prop_impl false --prep_def_merge_tr_cl false --prep_def_merge_tr_red false --prep_gs_sim true --prep_res_sim true --prep_sem_filter exhaustive --prep_sup_sim_all true --prep_sup_sim_sup false --prep_unflatten true --prep_upred true --preprocessing_flag true --prolific_symb_bound 2048 --prop_solver_per_cl 128 --pure_diseq_elim true --res_backward_subs full --res_backward_subs_resolution true --res_forward_subs full --res_forward_subs_resolution true --res_lit_sel adaptive --res_lit_sel_side none --res_ordering kbo --res_passive_queue_type priority_queues --res_passive_queues "[[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]" --res_passive_queues_freq "[15;5]" --res_prop_simpl_given true --res_prop_simpl_new false --res_sim_input true --res_time_limit 300.00 --res_to_prop_solver active --resolution_flag true --schedule none --share_sel_clauses true --smt_ac_axioms fast --smt_preprocessing true --splitting_cvd false --splitting_cvd_svl false --splitting_grd true --splitting_mode input --splitting_nvd 32 --stats_out none --sub_typing true --subs_bck_mult 8 --sup_full_bw "[]" --sup_full_fw "[]" --sup_full_triv "[PropSubs]" --sup_fun_splitting false --sup_immed_bw_immed "[]" --sup_immed_bw_main "[]" --sup_immed_fw_immed "[ACNormalisation]" --sup_immed_fw_main "[]" --sup_immed_triv "[]" --sup_indices_passive "[]" --sup_input_bw "[]" --sup_input_fw "[DemodLightNormLoopTriv;ACNormalisation]" --sup_input_triv "[Unflattening]" --sup_iter_deepening 2 --sup_passive_queue_type priority_queues --sup_passive_queues "[[-conj_dist;-num_symb];[+age;-num_symb];[+score;-num_symb]]" --sup_passive_queues_freq "[8;4;4]" --sup_prop_simpl_given true --sup_prop_simpl_new true --sup_restarts_mult 2 --sup_score sim_d_gen --sup_share_max_num_cl 640 --sup_share_score_frac 0.1 --sup_smt_interval 10000 --sup_symb_ordering invfreq --sup_to_prop_solver passive --superposition_flag true --time_out_prep_mult 0.1 --proof_out true --sat_out_model small --clausifier res/vclausify_rel --clausifier_options "--mode clausify -t 1.00" --time_out_real 1.00 /export/starexec/sandbox/benchmark/theBenchmark.p 1>> /export/starexec/sandbox/tmp/iprover_out_84n61uf3/57q7aegr 2>> /export/starexec/sandbox/tmp/iprover_out_84n61uf3/57q7aegr_error
% 204.50/27.85 % SZS status Theorem for theBenchmark.p
% 204.50/27.85
% 204.50/27.85 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 204.50/27.85
% 204.50/27.85 ------ iProver source info
% 204.50/27.85
% 204.50/27.85 git: date: 2023-05-31 18:12:56 +0000
% 204.50/27.85 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 204.50/27.85 git: non_committed_changes: false
% 204.50/27.85 git: last_make_outside_of_git: false
% 204.50/27.85
% 204.50/27.85 ------ Parsing...
% 204.50/27.85 ------ Clausification by vclausify_rel & Parsing by iProver...
% 204.50/27.85
% 204.50/27.85 ------ 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
% 204.50/27.85
% 204.50/27.85 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 204.50/27.85
% 204.50/27.85 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 204.50/27.85 ------ Proving...
% 204.50/27.85 ------ Problem Properties
% 204.50/27.85
% 204.50/27.85
% 204.50/27.85 clauses 31
% 204.50/27.85 conjectures 2
% 204.50/27.85 EPR 4
% 204.50/27.85 Horn 24
% 204.50/27.85 unary 6
% 204.50/27.85 binary 17
% 204.50/27.85 lits 64
% 204.50/27.85 lits eq 3
% 204.50/27.85 fd_pure 0
% 204.50/27.85 fd_pseudo 0
% 204.50/27.85 fd_cond 0
% 204.50/27.85 fd_pseudo_cond 2
% 204.50/27.85 AC symbols 0
% 204.50/27.85
% 204.50/27.85 ------ Input Options Time Limit: Unbounded
% 204.50/27.85
% 204.50/27.85
% 204.50/27.85 ------
% 204.50/27.85 Current options:
% 204.50/27.85 ------
% 204.50/27.85
% 204.50/27.85
% 204.50/27.85
% 204.50/27.85
% 204.50/27.85 ------ Proving...
% 204.50/27.85
% 204.50/27.85
% 204.50/27.85 ------ Proving...
% 204.50/27.85
% 204.50/27.85
% 204.50/27.85 ------ Proving...
% 204.50/27.85
% 204.50/27.85
% 204.50/27.85 ------ Proving...
% 204.50/27.85
% 204.50/27.85
% 204.50/27.85 ------ Proving...
% 204.50/27.85
% 204.50/27.85
% 204.50/27.85 ------ Proving...
% 204.50/27.85
% 204.50/27.85
% 204.50/27.85 ------ Proving...
% 204.50/27.85
% 204.50/27.85
% 204.50/27.85 ------ Proving...
% 204.50/27.85
% 204.50/27.85
% 204.50/27.85 ------ Proving...
% 204.50/27.85
% 204.50/27.85
% 204.50/27.85 ------ Proving...
% 204.50/27.85
% 204.50/27.85
% 204.50/27.85 ------ Proving...
% 204.50/27.85
% 204.50/27.85
% 204.50/27.85 ------ Proving...
% 204.50/27.85
% 204.50/27.85
% 204.50/27.85 ------ Proving...
% 204.50/27.85
% 204.50/27.85
% 204.50/27.85 ------ Proving...
% 204.50/27.85
% 204.50/27.85
% 204.50/27.85 ------ Proving...
% 204.50/27.85
% 204.50/27.85
% 204.50/27.85 ------ Proving...
% 204.50/27.85
% 204.50/27.85
% 204.50/27.85 % SZS status Theorem for theBenchmark.p
% 204.50/27.85
% 204.50/27.85 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 204.50/27.85
% 204.50/27.87
%------------------------------------------------------------------------------