TSTP Solution File: SET611+3 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SET611+3 : TPTP v8.1.2. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n013.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:00:57 EDT 2024
% Result : Theorem 4.12s 1.10s
% Output : CNFRefutation 4.12s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named definition)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
! [X0,X1,X2] :
( member(X2,intersection(X0,X1))
<=> ( member(X2,X1)
& member(X2,X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',intersection_defn) ).
fof(f3,axiom,
! [X0,X1,X2] :
( member(X2,difference(X0,X1))
<=> ( ~ member(X2,X1)
& member(X2,X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',difference_defn) ).
fof(f4,axiom,
! [X0] : ~ member(X0,empty_set),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',empty_set_defn) ).
fof(f5,axiom,
! [X0,X1] :
( X0 = X1
<=> ( subset(X1,X0)
& subset(X0,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',equal_defn) ).
fof(f6,axiom,
! [X0,X1] : intersection(X0,X1) = intersection(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_of_intersection) ).
fof(f7,axiom,
! [X0,X1] :
( X0 = X1
<=> ! [X2] :
( member(X2,X0)
<=> member(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',equal_member_defn) ).
fof(f8,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X0)
=> member(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',subset_defn) ).
fof(f11,conjecture,
! [X0,X1] :
( intersection(X0,X1) = empty_set
<=> difference(X0,X1) = X0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_th84) ).
fof(f12,negated_conjecture,
~ ! [X0,X1] :
( intersection(X0,X1) = empty_set
<=> difference(X0,X1) = X0 ),
inference(negated_conjecture,[],[f11]) ).
fof(f14,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X1)
| ~ member(X2,X0) ) ),
inference(ennf_transformation,[],[f8]) ).
fof(f15,plain,
? [X0,X1] :
( intersection(X0,X1) = empty_set
<~> difference(X0,X1) = X0 ),
inference(ennf_transformation,[],[f12]) ).
fof(f19,plain,
! [X0,X1,X2] :
( ( member(X2,intersection(X0,X1))
| ~ member(X2,X1)
| ~ member(X2,X0) )
& ( ( member(X2,X1)
& member(X2,X0) )
| ~ member(X2,intersection(X0,X1)) ) ),
inference(nnf_transformation,[],[f2]) ).
fof(f20,plain,
! [X0,X1,X2] :
( ( member(X2,intersection(X0,X1))
| ~ member(X2,X1)
| ~ member(X2,X0) )
& ( ( member(X2,X1)
& member(X2,X0) )
| ~ member(X2,intersection(X0,X1)) ) ),
inference(flattening,[],[f19]) ).
fof(f21,plain,
! [X0,X1,X2] :
( ( member(X2,difference(X0,X1))
| member(X2,X1)
| ~ member(X2,X0) )
& ( ( ~ member(X2,X1)
& member(X2,X0) )
| ~ member(X2,difference(X0,X1)) ) ),
inference(nnf_transformation,[],[f3]) ).
fof(f22,plain,
! [X0,X1,X2] :
( ( member(X2,difference(X0,X1))
| member(X2,X1)
| ~ member(X2,X0) )
& ( ( ~ member(X2,X1)
& member(X2,X0) )
| ~ member(X2,difference(X0,X1)) ) ),
inference(flattening,[],[f21]) ).
fof(f23,plain,
! [X0,X1] :
( ( X0 = X1
| ~ subset(X1,X0)
| ~ subset(X0,X1) )
& ( ( subset(X1,X0)
& subset(X0,X1) )
| X0 != X1 ) ),
inference(nnf_transformation,[],[f5]) ).
fof(f24,plain,
! [X0,X1] :
( ( X0 = X1
| ~ subset(X1,X0)
| ~ subset(X0,X1) )
& ( ( subset(X1,X0)
& subset(X0,X1) )
| X0 != X1 ) ),
inference(flattening,[],[f23]) ).
fof(f25,plain,
! [X0,X1] :
( ( X0 = X1
| ? [X2] :
( ( ~ member(X2,X1)
| ~ member(X2,X0) )
& ( member(X2,X1)
| member(X2,X0) ) ) )
& ( ! [X2] :
( ( member(X2,X0)
| ~ member(X2,X1) )
& ( member(X2,X1)
| ~ member(X2,X0) ) )
| X0 != X1 ) ),
inference(nnf_transformation,[],[f7]) ).
fof(f26,plain,
! [X0,X1] :
( ( X0 = X1
| ? [X2] :
( ( ~ member(X2,X1)
| ~ member(X2,X0) )
& ( member(X2,X1)
| member(X2,X0) ) ) )
& ( ! [X3] :
( ( member(X3,X0)
| ~ member(X3,X1) )
& ( member(X3,X1)
| ~ member(X3,X0) ) )
| X0 != X1 ) ),
inference(rectify,[],[f25]) ).
fof(f27,plain,
! [X0,X1] :
( ? [X2] :
( ( ~ member(X2,X1)
| ~ member(X2,X0) )
& ( member(X2,X1)
| member(X2,X0) ) )
=> ( ( ~ member(sK1(X0,X1),X1)
| ~ member(sK1(X0,X1),X0) )
& ( member(sK1(X0,X1),X1)
| member(sK1(X0,X1),X0) ) ) ),
introduced(choice_axiom,[]) ).
fof(f28,plain,
! [X0,X1] :
( ( X0 = X1
| ( ( ~ member(sK1(X0,X1),X1)
| ~ member(sK1(X0,X1),X0) )
& ( member(sK1(X0,X1),X1)
| member(sK1(X0,X1),X0) ) ) )
& ( ! [X3] :
( ( member(X3,X0)
| ~ member(X3,X1) )
& ( member(X3,X1)
| ~ member(X3,X0) ) )
| X0 != X1 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1])],[f26,f27]) ).
fof(f29,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,[],[f14]) ).
fof(f30,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,[],[f29]) ).
fof(f31,plain,
! [X0,X1] :
( ? [X2] :
( ~ member(X2,X1)
& member(X2,X0) )
=> ( ~ member(sK2(X0,X1),X1)
& member(sK2(X0,X1),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f32,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ( ~ member(sK2(X0,X1),X1)
& member(sK2(X0,X1),X0) ) )
& ( ! [X3] :
( member(X3,X1)
| ~ member(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2])],[f30,f31]) ).
fof(f33,plain,
? [X0,X1] :
( ( difference(X0,X1) != X0
| intersection(X0,X1) != empty_set )
& ( difference(X0,X1) = X0
| intersection(X0,X1) = empty_set ) ),
inference(nnf_transformation,[],[f15]) ).
fof(f34,plain,
( ? [X0,X1] :
( ( difference(X0,X1) != X0
| intersection(X0,X1) != empty_set )
& ( difference(X0,X1) = X0
| intersection(X0,X1) = empty_set ) )
=> ( ( sK3 != difference(sK3,sK4)
| empty_set != intersection(sK3,sK4) )
& ( sK3 = difference(sK3,sK4)
| empty_set = intersection(sK3,sK4) ) ) ),
introduced(choice_axiom,[]) ).
fof(f35,plain,
( ( sK3 != difference(sK3,sK4)
| empty_set != intersection(sK3,sK4) )
& ( sK3 = difference(sK3,sK4)
| empty_set = intersection(sK3,sK4) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3,sK4])],[f33,f34]) ).
fof(f38,plain,
! [X2,X0,X1] :
( member(X2,X0)
| ~ member(X2,intersection(X0,X1)) ),
inference(cnf_transformation,[],[f20]) ).
fof(f39,plain,
! [X2,X0,X1] :
( member(X2,X1)
| ~ member(X2,intersection(X0,X1)) ),
inference(cnf_transformation,[],[f20]) ).
fof(f40,plain,
! [X2,X0,X1] :
( member(X2,intersection(X0,X1))
| ~ member(X2,X1)
| ~ member(X2,X0) ),
inference(cnf_transformation,[],[f20]) ).
fof(f41,plain,
! [X2,X0,X1] :
( member(X2,X0)
| ~ member(X2,difference(X0,X1)) ),
inference(cnf_transformation,[],[f22]) ).
fof(f42,plain,
! [X2,X0,X1] :
( ~ member(X2,X1)
| ~ member(X2,difference(X0,X1)) ),
inference(cnf_transformation,[],[f22]) ).
fof(f43,plain,
! [X2,X0,X1] :
( member(X2,difference(X0,X1))
| member(X2,X1)
| ~ member(X2,X0) ),
inference(cnf_transformation,[],[f22]) ).
fof(f44,plain,
! [X0] : ~ member(X0,empty_set),
inference(cnf_transformation,[],[f4]) ).
fof(f47,plain,
! [X0,X1] :
( X0 = X1
| ~ subset(X1,X0)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f24]) ).
fof(f48,plain,
! [X0,X1] : intersection(X0,X1) = intersection(X1,X0),
inference(cnf_transformation,[],[f6]) ).
fof(f51,plain,
! [X0,X1] :
( X0 = X1
| member(sK1(X0,X1),X1)
| member(sK1(X0,X1),X0) ),
inference(cnf_transformation,[],[f28]) ).
fof(f53,plain,
! [X3,X0,X1] :
( member(X3,X1)
| ~ member(X3,X0)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f32]) ).
fof(f54,plain,
! [X0,X1] :
( subset(X0,X1)
| member(sK2(X0,X1),X0) ),
inference(cnf_transformation,[],[f32]) ).
fof(f55,plain,
! [X0,X1] :
( subset(X0,X1)
| ~ member(sK2(X0,X1),X1) ),
inference(cnf_transformation,[],[f32]) ).
fof(f57,plain,
( sK3 = difference(sK3,sK4)
| empty_set = intersection(sK3,sK4) ),
inference(cnf_transformation,[],[f35]) ).
fof(f58,plain,
( sK3 != difference(sK3,sK4)
| empty_set != intersection(sK3,sK4) ),
inference(cnf_transformation,[],[f35]) ).
cnf(c_51,plain,
( ~ member(X0,X1)
| ~ member(X0,X2)
| member(X0,intersection(X1,X2)) ),
inference(cnf_transformation,[],[f40]) ).
cnf(c_52,plain,
( ~ member(X0,intersection(X1,X2))
| member(X0,X2) ),
inference(cnf_transformation,[],[f39]) ).
cnf(c_53,plain,
( ~ member(X0,intersection(X1,X2))
| member(X0,X1) ),
inference(cnf_transformation,[],[f38]) ).
cnf(c_54,plain,
( ~ member(X0,X1)
| member(X0,difference(X1,X2))
| member(X0,X2) ),
inference(cnf_transformation,[],[f43]) ).
cnf(c_55,plain,
( ~ member(X0,difference(X1,X2))
| ~ member(X0,X2) ),
inference(cnf_transformation,[],[f42]) ).
cnf(c_56,plain,
( ~ member(X0,difference(X1,X2))
| member(X0,X1) ),
inference(cnf_transformation,[],[f41]) ).
cnf(c_57,plain,
~ member(X0,empty_set),
inference(cnf_transformation,[],[f44]) ).
cnf(c_58,plain,
( ~ subset(X0,X1)
| ~ subset(X1,X0)
| X0 = X1 ),
inference(cnf_transformation,[],[f47]) ).
cnf(c_61,plain,
intersection(X0,X1) = intersection(X1,X0),
inference(cnf_transformation,[],[f48]) ).
cnf(c_63,plain,
( X0 = X1
| member(sK1(X0,X1),X0)
| member(sK1(X0,X1),X1) ),
inference(cnf_transformation,[],[f51]) ).
cnf(c_64,plain,
( ~ member(sK2(X0,X1),X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f55]) ).
cnf(c_65,plain,
( member(sK2(X0,X1),X0)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f54]) ).
cnf(c_66,plain,
( ~ member(X0,X1)
| ~ subset(X1,X2)
| member(X0,X2) ),
inference(cnf_transformation,[],[f53]) ).
cnf(c_68,negated_conjecture,
( intersection(sK3,sK4) != empty_set
| difference(sK3,sK4) != sK3 ),
inference(cnf_transformation,[],[f58]) ).
cnf(c_69,negated_conjecture,
( intersection(sK3,sK4) = empty_set
| difference(sK3,sK4) = sK3 ),
inference(cnf_transformation,[],[f57]) ).
cnf(c_542,plain,
intersection(sK3,sK4) = sP0_iProver_def,
definition ).
cnf(c_543,plain,
difference(sK3,sK4) = sP1_iProver_def,
definition ).
cnf(c_544,negated_conjecture,
( sP0_iProver_def = empty_set
| sP1_iProver_def = sK3 ),
inference(demodulation,[status(thm)],[c_69,c_543,c_542]) ).
cnf(c_545,negated_conjecture,
( sP0_iProver_def != empty_set
| sP1_iProver_def != sK3 ),
inference(demodulation,[status(thm)],[c_68]) ).
cnf(c_546,plain,
X0 = X0,
theory(equality) ).
cnf(c_548,plain,
( X0 != X1
| X2 != X1
| X2 = X0 ),
theory(equality) ).
cnf(c_549,plain,
( X0 != X1
| X2 != X3
| ~ member(X1,X3)
| member(X0,X2) ),
theory(equality) ).
cnf(c_941,plain,
( ~ member(X0,sP0_iProver_def)
| sK3 = sP1_iProver_def ),
inference(superposition,[status(thm)],[c_544,c_57]) ).
cnf(c_955,plain,
( ~ member(X0,X1)
| ~ member(X0,X2)
| member(X0,intersection(X2,X1)) ),
inference(superposition,[status(thm)],[c_61,c_51]) ).
cnf(c_971,plain,
subset(empty_set,X0),
inference(superposition,[status(thm)],[c_65,c_57]) ).
cnf(c_972,plain,
( sK3 = sP1_iProver_def
| subset(sP0_iProver_def,X0) ),
inference(superposition,[status(thm)],[c_65,c_941]) ).
cnf(c_984,plain,
( ~ member(X0,sP0_iProver_def)
| member(X0,sK4) ),
inference(superposition,[status(thm)],[c_542,c_52]) ).
cnf(c_998,plain,
( ~ member(X0,sP0_iProver_def)
| member(X0,sK3) ),
inference(superposition,[status(thm)],[c_542,c_53]) ).
cnf(c_1009,plain,
( ~ member(X0,sP1_iProver_def)
| member(X0,sK3) ),
inference(superposition,[status(thm)],[c_543,c_56]) ).
cnf(c_1025,plain,
( member(sK2(sP0_iProver_def,X0),sK4)
| subset(sP0_iProver_def,X0) ),
inference(superposition,[status(thm)],[c_65,c_984]) ).
cnf(c_1033,plain,
( member(sK2(sP0_iProver_def,X0),sK3)
| subset(sP0_iProver_def,X0) ),
inference(superposition,[status(thm)],[c_65,c_998]) ).
cnf(c_1041,plain,
( member(sK2(sP1_iProver_def,X0),sK3)
| subset(sP1_iProver_def,X0) ),
inference(superposition,[status(thm)],[c_65,c_1009]) ).
cnf(c_1064,plain,
subset(sP1_iProver_def,sK3),
inference(superposition,[status(thm)],[c_1041,c_64]) ).
cnf(c_1071,plain,
( ~ member(X0,sK3)
| member(X0,sK4)
| member(X0,sP1_iProver_def) ),
inference(superposition,[status(thm)],[c_543,c_54]) ).
cnf(c_1087,plain,
( ~ member(X0,sK4)
| ~ member(X0,sP1_iProver_def) ),
inference(superposition,[status(thm)],[c_543,c_55]) ).
cnf(c_1103,plain,
( ~ subset(sK3,X0)
| member(sK2(sP0_iProver_def,X1),X0)
| subset(sP0_iProver_def,X1) ),
inference(superposition,[status(thm)],[c_1033,c_66]) ).
cnf(c_1128,plain,
( ~ subset(X0,empty_set)
| X0 = empty_set ),
inference(superposition,[status(thm)],[c_971,c_58]) ).
cnf(c_1131,plain,
( ~ subset(sK3,sP1_iProver_def)
| sK3 = sP1_iProver_def ),
inference(superposition,[status(thm)],[c_1064,c_58]) ).
cnf(c_1146,plain,
( sK3 != X0
| sP1_iProver_def != X0
| sP1_iProver_def = sK3 ),
inference(instantiation,[status(thm)],[c_548]) ).
cnf(c_1253,plain,
( member(sK2(sK3,sP1_iProver_def),sK3)
| subset(sK3,sP1_iProver_def) ),
inference(instantiation,[status(thm)],[c_65]) ).
cnf(c_1254,plain,
( ~ member(sK2(sK3,sP1_iProver_def),sP1_iProver_def)
| subset(sK3,sP1_iProver_def) ),
inference(instantiation,[status(thm)],[c_64]) ).
cnf(c_1289,plain,
( ~ member(sK2(sP0_iProver_def,X0),sP1_iProver_def)
| subset(sP0_iProver_def,X0) ),
inference(superposition,[status(thm)],[c_1025,c_1087]) ).
cnf(c_1323,plain,
( empty_set = sP0_iProver_def
| sK3 = sP1_iProver_def ),
inference(superposition,[status(thm)],[c_972,c_1128]) ).
cnf(c_1447,plain,
( sK3 != sP1_iProver_def
| sP1_iProver_def != sP1_iProver_def
| sP1_iProver_def = sK3 ),
inference(instantiation,[status(thm)],[c_1146]) ).
cnf(c_1448,plain,
sP1_iProver_def = sP1_iProver_def,
inference(instantiation,[status(thm)],[c_546]) ).
cnf(c_1515,plain,
( ~ member(X0,sK3)
| ~ member(X0,sK4)
| member(X0,sP0_iProver_def) ),
inference(superposition,[status(thm)],[c_542,c_955]) ).
cnf(c_1554,plain,
subset(empty_set,X0),
inference(superposition,[status(thm)],[c_65,c_57]) ).
cnf(c_1580,plain,
( X0 = empty_set
| member(sK1(empty_set,X0),X0) ),
inference(superposition,[status(thm)],[c_63,c_57]) ).
cnf(c_1676,plain,
( X0 != sK2(sK3,sP1_iProver_def)
| X1 != sK3
| ~ member(sK2(sK3,sP1_iProver_def),sK3)
| member(X0,X1) ),
inference(instantiation,[status(thm)],[c_549]) ).
cnf(c_1685,plain,
( ~ member(X0,sP0_iProver_def)
| member(X0,sK4) ),
inference(superposition,[status(thm)],[c_542,c_52]) ).
cnf(c_1724,plain,
( ~ member(X0,sP1_iProver_def)
| member(X0,sK3) ),
inference(superposition,[status(thm)],[c_543,c_56]) ).
cnf(c_1842,plain,
( member(sK2(sP0_iProver_def,X0),sK4)
| subset(sP0_iProver_def,X0) ),
inference(superposition,[status(thm)],[c_65,c_1685]) ).
cnf(c_1868,plain,
( member(sK2(sP1_iProver_def,X0),sK3)
| subset(sP1_iProver_def,X0) ),
inference(superposition,[status(thm)],[c_65,c_1724]) ).
cnf(c_1934,plain,
subset(sP1_iProver_def,sK3),
inference(superposition,[status(thm)],[c_1868,c_64]) ).
cnf(c_2209,plain,
( ~ member(X0,sK4)
| ~ member(X0,sP1_iProver_def) ),
inference(superposition,[status(thm)],[c_543,c_55]) ).
cnf(c_2425,plain,
( ~ subset(X0,empty_set)
| X0 = empty_set ),
inference(superposition,[status(thm)],[c_1554,c_58]) ).
cnf(c_2428,plain,
( ~ subset(sK3,sP1_iProver_def)
| sK3 = sP1_iProver_def ),
inference(superposition,[status(thm)],[c_1934,c_58]) ).
cnf(c_2454,plain,
( empty_set = sP0_iProver_def
| member(sK1(empty_set,sP0_iProver_def),sK3) ),
inference(superposition,[status(thm)],[c_1580,c_998]) ).
cnf(c_3270,plain,
( ~ member(sK2(sP0_iProver_def,X0),sP1_iProver_def)
| subset(sP0_iProver_def,X0) ),
inference(superposition,[status(thm)],[c_1842,c_2209]) ).
cnf(c_3451,plain,
sK2(sK3,sP1_iProver_def) = sK2(sK3,sP1_iProver_def),
inference(instantiation,[status(thm)],[c_546]) ).
cnf(c_5783,plain,
( ~ subset(sK3,sP1_iProver_def)
| subset(sP0_iProver_def,X0) ),
inference(superposition,[status(thm)],[c_1103,c_1289]) ).
cnf(c_5954,plain,
( sK2(X0,sP1_iProver_def) != sK2(sK3,sP1_iProver_def)
| sP1_iProver_def != sK3
| ~ member(sK2(sK3,sP1_iProver_def),sK3)
| member(sK2(X0,sP1_iProver_def),sP1_iProver_def) ),
inference(instantiation,[status(thm)],[c_1676]) ).
cnf(c_5955,plain,
( sK2(sK3,sP1_iProver_def) != sK2(sK3,sP1_iProver_def)
| sP1_iProver_def != sK3
| ~ member(sK2(sK3,sP1_iProver_def),sK3)
| member(sK2(sK3,sP1_iProver_def),sP1_iProver_def) ),
inference(instantiation,[status(thm)],[c_5954]) ).
cnf(c_6513,plain,
subset(sP0_iProver_def,X0),
inference(global_subsumption_just,[status(thm)],[c_3270,c_972,c_1254,c_1253,c_1447,c_1448,c_3451,c_5783,c_5955]) ).
cnf(c_6516,plain,
empty_set = sP0_iProver_def,
inference(superposition,[status(thm)],[c_6513,c_2425]) ).
cnf(c_6527,plain,
( sK3 != sP1_iProver_def
| sP0_iProver_def != sP0_iProver_def ),
inference(demodulation,[status(thm)],[c_545,c_6516]) ).
cnf(c_6529,plain,
sK3 != sP1_iProver_def,
inference(equality_resolution_simp,[status(thm)],[c_6527]) ).
cnf(c_6535,plain,
~ subset(sK3,sP1_iProver_def),
inference(backward_subsumption_resolution,[status(thm)],[c_2428,c_6529]) ).
cnf(c_6893,plain,
empty_set = sP0_iProver_def,
inference(global_subsumption_just,[status(thm)],[c_2454,c_1254,c_1253,c_1323,c_1447,c_1448,c_3451,c_5955,c_6535]) ).
cnf(c_6916,plain,
~ member(X0,sP0_iProver_def),
inference(demodulation,[status(thm)],[c_57,c_6893]) ).
cnf(c_6917,plain,
( sK3 != sP1_iProver_def
| sP0_iProver_def != sP0_iProver_def ),
inference(demodulation,[status(thm)],[c_545,c_6893]) ).
cnf(c_6937,plain,
sK3 != sP1_iProver_def,
inference(equality_resolution_simp,[status(thm)],[c_6917]) ).
cnf(c_6938,plain,
( ~ member(X0,sK3)
| ~ member(X0,sK4) ),
inference(backward_subsumption_resolution,[status(thm)],[c_1515,c_6916]) ).
cnf(c_6989,plain,
~ subset(sK3,sP1_iProver_def),
inference(backward_subsumption_resolution,[status(thm)],[c_1131,c_6937]) ).
cnf(c_7267,plain,
( ~ member(X0,sK3)
| member(X0,sP1_iProver_def) ),
inference(backward_subsumption_resolution,[status(thm)],[c_1071,c_6938]) ).
cnf(c_7325,plain,
( member(sK2(sK3,X0),sP1_iProver_def)
| subset(sK3,X0) ),
inference(superposition,[status(thm)],[c_65,c_7267]) ).
cnf(c_7623,plain,
subset(sK3,sP1_iProver_def),
inference(superposition,[status(thm)],[c_7325,c_64]) ).
cnf(c_7625,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_7623,c_6989]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : SET611+3 : TPTP v8.1.2. Released v2.2.0.
% 0.00/0.10 % Command : run_iprover %s %d THM
% 0.10/0.31 % Computer : n013.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 : Thu May 2 20:23:19 EDT 2024
% 0.10/0.31 % CPUTime :
% 0.15/0.41 Running first-order theorem proving
% 0.15/0.41 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 4.12/1.10 % SZS status Started for theBenchmark.p
% 4.12/1.10 % SZS status Theorem for theBenchmark.p
% 4.12/1.10
% 4.12/1.10 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 4.12/1.10
% 4.12/1.10 ------ iProver source info
% 4.12/1.10
% 4.12/1.10 git: date: 2024-05-02 19:28:25 +0000
% 4.12/1.10 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 4.12/1.10 git: non_committed_changes: false
% 4.12/1.10
% 4.12/1.10 ------ Parsing...
% 4.12/1.10 ------ Clausification by vclausify_rel & Parsing by iProver...
% 4.12/1.10
% 4.12/1.10 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e
% 4.12/1.10
% 4.12/1.10 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 4.12/1.10
% 4.12/1.10 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 4.12/1.10 ------ Proving...
% 4.12/1.10 ------ Problem Properties
% 4.12/1.10
% 4.12/1.10
% 4.12/1.10 clauses 21
% 4.12/1.10 conjectures 2
% 4.12/1.10 EPR 6
% 4.12/1.10 Horn 16
% 4.12/1.10 unary 5
% 4.12/1.10 binary 8
% 4.12/1.10 lits 45
% 4.12/1.10 lits eq 12
% 4.12/1.10 fd_pure 0
% 4.12/1.10 fd_pseudo 0
% 4.12/1.10 fd_cond 0
% 4.12/1.10 fd_pseudo_cond 5
% 4.12/1.10 AC symbols 0
% 4.12/1.10
% 4.12/1.10 ------ Schedule dynamic 5 is on
% 4.12/1.10
% 4.12/1.10 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 4.12/1.10
% 4.12/1.10
% 4.12/1.10 ------
% 4.12/1.10 Current options:
% 4.12/1.10 ------
% 4.12/1.10
% 4.12/1.10
% 4.12/1.10
% 4.12/1.10
% 4.12/1.10 ------ Proving...
% 4.12/1.10
% 4.12/1.10
% 4.12/1.10 % SZS status Theorem for theBenchmark.p
% 4.12/1.10
% 4.12/1.10 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.12/1.10
% 4.12/1.11
%------------------------------------------------------------------------------