TSTP Solution File: SET711+4 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SET711+4 : TPTP v8.1.2. Bugfixed v2.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n002.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:15 EDT 2023
% Result : Theorem 2.41s 1.14s
% Output : CNFRefutation 2.41s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 7
% Syntax : Number of formulae : 93 ( 18 unt; 0 def)
% Number of atoms : 352 ( 63 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 396 ( 137 ~; 142 |; 80 &)
% ( 13 <=>; 24 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-4 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-4 aty)
% Number of variables : 325 ( 0 sgn; 169 !; 24 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f15,axiom,
! [X5,X9,X0,X1] :
( equal_maps(X5,X9,X0,X1)
<=> ! [X2,X6,X7] :
( ( member(X7,X1)
& member(X6,X1)
& member(X2,X0) )
=> ( ( apply(X9,X2,X7)
& apply(X5,X2,X6) )
=> X6 = X7 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',equal_maps) ).
fof(f17,axiom,
! [X5,X0,X1] :
( injective(X5,X0,X1)
<=> ! [X12,X13,X4] :
( ( member(X4,X1)
& member(X13,X0)
& member(X12,X0) )
=> ( ( apply(X5,X13,X4)
& apply(X5,X12,X4) )
=> X12 = X13 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',injective) ).
fof(f19,axiom,
! [X5,X0,X1] :
( one_to_one(X5,X0,X1)
<=> ( surjective(X5,X0,X1)
& injective(X5,X0,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',one_to_one) ).
fof(f20,axiom,
! [X9,X5,X0,X1] :
( inverse_predicate(X9,X5,X0,X1)
<=> ! [X2,X4] :
( ( member(X4,X1)
& member(X2,X0) )
=> ( apply(X5,X2,X4)
<=> apply(X9,X4,X2) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',inverse_predicate) ).
fof(f29,conjecture,
! [X5,X9,X8,X0,X1] :
( ( inverse_predicate(X8,X5,X0,X1)
& inverse_predicate(X9,X5,X0,X1)
& one_to_one(X5,X0,X1)
& maps(X5,X0,X1) )
=> equal_maps(X9,X8,X1,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',thII03a) ).
fof(f30,negated_conjecture,
~ ! [X5,X9,X8,X0,X1] :
( ( inverse_predicate(X8,X5,X0,X1)
& inverse_predicate(X9,X5,X0,X1)
& one_to_one(X5,X0,X1)
& maps(X5,X0,X1) )
=> equal_maps(X9,X8,X1,X0) ),
inference(negated_conjecture,[],[f29]) ).
fof(f43,plain,
! [X0,X1,X2,X3] :
( equal_maps(X0,X1,X2,X3)
<=> ! [X4,X5,X6] :
( ( member(X6,X3)
& member(X5,X3)
& member(X4,X2) )
=> ( ( apply(X1,X4,X6)
& apply(X0,X4,X5) )
=> X5 = X6 ) ) ),
inference(rectify,[],[f15]) ).
fof(f45,plain,
! [X0,X1,X2] :
( injective(X0,X1,X2)
<=> ! [X3,X4,X5] :
( ( member(X5,X2)
& member(X4,X1)
& member(X3,X1) )
=> ( ( apply(X0,X4,X5)
& apply(X0,X3,X5) )
=> X3 = X4 ) ) ),
inference(rectify,[],[f17]) ).
fof(f47,plain,
! [X0,X1,X2] :
( one_to_one(X0,X1,X2)
<=> ( surjective(X0,X1,X2)
& injective(X0,X1,X2) ) ),
inference(rectify,[],[f19]) ).
fof(f48,plain,
! [X0,X1,X2,X3] :
( inverse_predicate(X0,X1,X2,X3)
<=> ! [X4,X5] :
( ( member(X5,X3)
& member(X4,X2) )
=> ( apply(X1,X4,X5)
<=> apply(X0,X5,X4) ) ) ),
inference(rectify,[],[f20]) ).
fof(f57,plain,
~ ! [X0,X1,X2,X3,X4] :
( ( inverse_predicate(X2,X0,X3,X4)
& inverse_predicate(X1,X0,X3,X4)
& one_to_one(X0,X3,X4)
& maps(X0,X3,X4) )
=> equal_maps(X1,X2,X4,X3) ),
inference(rectify,[],[f30]) ).
fof(f58,plain,
! [X0,X1,X2] :
( one_to_one(X0,X1,X2)
=> ( surjective(X0,X1,X2)
& injective(X0,X1,X2) ) ),
inference(unused_predicate_definition_removal,[],[f47]) ).
fof(f60,plain,
! [X0,X1,X2] :
( injective(X0,X1,X2)
=> ! [X3,X4,X5] :
( ( member(X5,X2)
& member(X4,X1)
& member(X3,X1) )
=> ( ( apply(X0,X4,X5)
& apply(X0,X3,X5) )
=> X3 = X4 ) ) ),
inference(unused_predicate_definition_removal,[],[f45]) ).
fof(f62,plain,
! [X0,X1,X2,X3] :
( inverse_predicate(X0,X1,X2,X3)
=> ! [X4,X5] :
( ( member(X5,X3)
& member(X4,X2) )
=> ( apply(X1,X4,X5)
<=> apply(X0,X5,X4) ) ) ),
inference(unused_predicate_definition_removal,[],[f48]) ).
fof(f63,plain,
! [X0,X1,X2,X3] :
( ! [X4,X5,X6] :
( ( member(X6,X3)
& member(X5,X3)
& member(X4,X2) )
=> ( ( apply(X1,X4,X6)
& apply(X0,X4,X5) )
=> X5 = X6 ) )
=> equal_maps(X0,X1,X2,X3) ),
inference(unused_predicate_definition_removal,[],[f43]) ).
fof(f70,plain,
! [X0,X1,X2,X3] :
( equal_maps(X0,X1,X2,X3)
| ? [X4,X5,X6] :
( X5 != X6
& apply(X1,X4,X6)
& apply(X0,X4,X5)
& member(X6,X3)
& member(X5,X3)
& member(X4,X2) ) ),
inference(ennf_transformation,[],[f63]) ).
fof(f71,plain,
! [X0,X1,X2,X3] :
( equal_maps(X0,X1,X2,X3)
| ? [X4,X5,X6] :
( X5 != X6
& apply(X1,X4,X6)
& apply(X0,X4,X5)
& member(X6,X3)
& member(X5,X3)
& member(X4,X2) ) ),
inference(flattening,[],[f70]) ).
fof(f72,plain,
! [X0,X1,X2] :
( ! [X3,X4,X5] :
( X3 = X4
| ~ apply(X0,X4,X5)
| ~ apply(X0,X3,X5)
| ~ member(X5,X2)
| ~ member(X4,X1)
| ~ member(X3,X1) )
| ~ injective(X0,X1,X2) ),
inference(ennf_transformation,[],[f60]) ).
fof(f73,plain,
! [X0,X1,X2] :
( ! [X3,X4,X5] :
( X3 = X4
| ~ apply(X0,X4,X5)
| ~ apply(X0,X3,X5)
| ~ member(X5,X2)
| ~ member(X4,X1)
| ~ member(X3,X1) )
| ~ injective(X0,X1,X2) ),
inference(flattening,[],[f72]) ).
fof(f75,plain,
! [X0,X1,X2] :
( ( surjective(X0,X1,X2)
& injective(X0,X1,X2) )
| ~ one_to_one(X0,X1,X2) ),
inference(ennf_transformation,[],[f58]) ).
fof(f76,plain,
! [X0,X1,X2,X3] :
( ! [X4,X5] :
( ( apply(X1,X4,X5)
<=> apply(X0,X5,X4) )
| ~ member(X5,X3)
| ~ member(X4,X2) )
| ~ inverse_predicate(X0,X1,X2,X3) ),
inference(ennf_transformation,[],[f62]) ).
fof(f77,plain,
! [X0,X1,X2,X3] :
( ! [X4,X5] :
( ( apply(X1,X4,X5)
<=> apply(X0,X5,X4) )
| ~ member(X5,X3)
| ~ member(X4,X2) )
| ~ inverse_predicate(X0,X1,X2,X3) ),
inference(flattening,[],[f76]) ).
fof(f80,plain,
? [X0,X1,X2,X3,X4] :
( ~ equal_maps(X1,X2,X4,X3)
& inverse_predicate(X2,X0,X3,X4)
& inverse_predicate(X1,X0,X3,X4)
& one_to_one(X0,X3,X4)
& maps(X0,X3,X4) ),
inference(ennf_transformation,[],[f57]) ).
fof(f81,plain,
? [X0,X1,X2,X3,X4] :
( ~ equal_maps(X1,X2,X4,X3)
& inverse_predicate(X2,X0,X3,X4)
& inverse_predicate(X1,X0,X3,X4)
& one_to_one(X0,X3,X4)
& maps(X0,X3,X4) ),
inference(flattening,[],[f80]) ).
fof(f110,plain,
! [X0,X1,X2,X3] :
( ? [X4,X5,X6] :
( X5 != X6
& apply(X1,X4,X6)
& apply(X0,X4,X5)
& member(X6,X3)
& member(X5,X3)
& member(X4,X2) )
=> ( sK6(X0,X1,X2,X3) != sK7(X0,X1,X2,X3)
& apply(X1,sK5(X0,X1,X2,X3),sK7(X0,X1,X2,X3))
& apply(X0,sK5(X0,X1,X2,X3),sK6(X0,X1,X2,X3))
& member(sK7(X0,X1,X2,X3),X3)
& member(sK6(X0,X1,X2,X3),X3)
& member(sK5(X0,X1,X2,X3),X2) ) ),
introduced(choice_axiom,[]) ).
fof(f111,plain,
! [X0,X1,X2,X3] :
( equal_maps(X0,X1,X2,X3)
| ( sK6(X0,X1,X2,X3) != sK7(X0,X1,X2,X3)
& apply(X1,sK5(X0,X1,X2,X3),sK7(X0,X1,X2,X3))
& apply(X0,sK5(X0,X1,X2,X3),sK6(X0,X1,X2,X3))
& member(sK7(X0,X1,X2,X3),X3)
& member(sK6(X0,X1,X2,X3),X3)
& member(sK5(X0,X1,X2,X3),X2) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK5,sK6,sK7])],[f71,f110]) ).
fof(f114,plain,
! [X0,X1,X2,X3] :
( ! [X4,X5] :
( ( ( apply(X1,X4,X5)
| ~ apply(X0,X5,X4) )
& ( apply(X0,X5,X4)
| ~ apply(X1,X4,X5) ) )
| ~ member(X5,X3)
| ~ member(X4,X2) )
| ~ inverse_predicate(X0,X1,X2,X3) ),
inference(nnf_transformation,[],[f77]) ).
fof(f134,plain,
( ? [X0,X1,X2,X3,X4] :
( ~ equal_maps(X1,X2,X4,X3)
& inverse_predicate(X2,X0,X3,X4)
& inverse_predicate(X1,X0,X3,X4)
& one_to_one(X0,X3,X4)
& maps(X0,X3,X4) )
=> ( ~ equal_maps(sK14,sK15,sK17,sK16)
& inverse_predicate(sK15,sK13,sK16,sK17)
& inverse_predicate(sK14,sK13,sK16,sK17)
& one_to_one(sK13,sK16,sK17)
& maps(sK13,sK16,sK17) ) ),
introduced(choice_axiom,[]) ).
fof(f135,plain,
( ~ equal_maps(sK14,sK15,sK17,sK16)
& inverse_predicate(sK15,sK13,sK16,sK17)
& inverse_predicate(sK14,sK13,sK16,sK17)
& one_to_one(sK13,sK16,sK17)
& maps(sK13,sK16,sK17) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK13,sK14,sK15,sK16,sK17])],[f81,f134]) ).
fof(f169,plain,
! [X2,X3,X0,X1] :
( equal_maps(X0,X1,X2,X3)
| member(sK5(X0,X1,X2,X3),X2) ),
inference(cnf_transformation,[],[f111]) ).
fof(f170,plain,
! [X2,X3,X0,X1] :
( equal_maps(X0,X1,X2,X3)
| member(sK6(X0,X1,X2,X3),X3) ),
inference(cnf_transformation,[],[f111]) ).
fof(f171,plain,
! [X2,X3,X0,X1] :
( equal_maps(X0,X1,X2,X3)
| member(sK7(X0,X1,X2,X3),X3) ),
inference(cnf_transformation,[],[f111]) ).
fof(f172,plain,
! [X2,X3,X0,X1] :
( equal_maps(X0,X1,X2,X3)
| apply(X0,sK5(X0,X1,X2,X3),sK6(X0,X1,X2,X3)) ),
inference(cnf_transformation,[],[f111]) ).
fof(f173,plain,
! [X2,X3,X0,X1] :
( equal_maps(X0,X1,X2,X3)
| apply(X1,sK5(X0,X1,X2,X3),sK7(X0,X1,X2,X3)) ),
inference(cnf_transformation,[],[f111]) ).
fof(f174,plain,
! [X2,X3,X0,X1] :
( equal_maps(X0,X1,X2,X3)
| sK6(X0,X1,X2,X3) != sK7(X0,X1,X2,X3) ),
inference(cnf_transformation,[],[f111]) ).
fof(f175,plain,
! [X2,X3,X0,X1,X4,X5] :
( X3 = X4
| ~ apply(X0,X4,X5)
| ~ apply(X0,X3,X5)
| ~ member(X5,X2)
| ~ member(X4,X1)
| ~ member(X3,X1)
| ~ injective(X0,X1,X2) ),
inference(cnf_transformation,[],[f73]) ).
fof(f178,plain,
! [X2,X0,X1] :
( injective(X0,X1,X2)
| ~ one_to_one(X0,X1,X2) ),
inference(cnf_transformation,[],[f75]) ).
fof(f181,plain,
! [X2,X3,X0,X1,X4,X5] :
( apply(X1,X4,X5)
| ~ apply(X0,X5,X4)
| ~ member(X5,X3)
| ~ member(X4,X2)
| ~ inverse_predicate(X0,X1,X2,X3) ),
inference(cnf_transformation,[],[f114]) ).
fof(f199,plain,
one_to_one(sK13,sK16,sK17),
inference(cnf_transformation,[],[f135]) ).
fof(f200,plain,
inverse_predicate(sK14,sK13,sK16,sK17),
inference(cnf_transformation,[],[f135]) ).
fof(f201,plain,
inverse_predicate(sK15,sK13,sK16,sK17),
inference(cnf_transformation,[],[f135]) ).
fof(f202,plain,
~ equal_maps(sK14,sK15,sK17,sK16),
inference(cnf_transformation,[],[f135]) ).
cnf(c_82,plain,
( sK6(X0,X1,X2,X3) != sK7(X0,X1,X2,X3)
| equal_maps(X0,X1,X2,X3) ),
inference(cnf_transformation,[],[f174]) ).
cnf(c_83,plain,
( apply(X0,sK5(X1,X0,X2,X3),sK7(X1,X0,X2,X3))
| equal_maps(X1,X0,X2,X3) ),
inference(cnf_transformation,[],[f173]) ).
cnf(c_84,plain,
( apply(X0,sK5(X0,X1,X2,X3),sK6(X0,X1,X2,X3))
| equal_maps(X0,X1,X2,X3) ),
inference(cnf_transformation,[],[f172]) ).
cnf(c_85,plain,
( member(sK7(X0,X1,X2,X3),X3)
| equal_maps(X0,X1,X2,X3) ),
inference(cnf_transformation,[],[f171]) ).
cnf(c_86,plain,
( member(sK6(X0,X1,X2,X3),X3)
| equal_maps(X0,X1,X2,X3) ),
inference(cnf_transformation,[],[f170]) ).
cnf(c_87,plain,
( member(sK5(X0,X1,X2,X3),X2)
| equal_maps(X0,X1,X2,X3) ),
inference(cnf_transformation,[],[f169]) ).
cnf(c_88,plain,
( ~ apply(X0,X1,X2)
| ~ apply(X0,X3,X2)
| ~ injective(X0,X4,X5)
| ~ member(X1,X4)
| ~ member(X2,X5)
| ~ member(X3,X4)
| X1 = X3 ),
inference(cnf_transformation,[],[f175]) ).
cnf(c_92,plain,
( ~ one_to_one(X0,X1,X2)
| injective(X0,X1,X2) ),
inference(cnf_transformation,[],[f178]) ).
cnf(c_93,plain,
( ~ inverse_predicate(X0,X1,X2,X3)
| ~ apply(X0,X4,X5)
| ~ member(X4,X3)
| ~ member(X5,X2)
| apply(X1,X5,X4) ),
inference(cnf_transformation,[],[f181]) ).
cnf(c_111,negated_conjecture,
~ equal_maps(sK14,sK15,sK17,sK16),
inference(cnf_transformation,[],[f202]) ).
cnf(c_112,negated_conjecture,
inverse_predicate(sK15,sK13,sK16,sK17),
inference(cnf_transformation,[],[f201]) ).
cnf(c_113,negated_conjecture,
inverse_predicate(sK14,sK13,sK16,sK17),
inference(cnf_transformation,[],[f200]) ).
cnf(c_114,negated_conjecture,
one_to_one(sK13,sK16,sK17),
inference(cnf_transformation,[],[f199]) ).
cnf(c_218,plain,
( sK6(X0,X1,X2,X3) != sK7(X0,X1,X2,X3)
| equal_maps(X0,X1,X2,X3) ),
inference(prop_impl_just,[status(thm)],[c_82]) ).
cnf(c_224,plain,
( ~ one_to_one(X0,X1,X2)
| injective(X0,X1,X2) ),
inference(prop_impl_just,[status(thm)],[c_92]) ).
cnf(c_264,plain,
( member(sK5(X0,X1,X2,X3),X2)
| equal_maps(X0,X1,X2,X3) ),
inference(prop_impl_just,[status(thm)],[c_87]) ).
cnf(c_268,plain,
( equal_maps(X0,X1,X2,X3)
| apply(X0,sK5(X0,X1,X2,X3),sK6(X0,X1,X2,X3)) ),
inference(prop_impl_just,[status(thm)],[c_84]) ).
cnf(c_269,plain,
( apply(X0,sK5(X0,X1,X2,X3),sK6(X0,X1,X2,X3))
| equal_maps(X0,X1,X2,X3) ),
inference(renaming,[status(thm)],[c_268]) ).
cnf(c_270,plain,
( equal_maps(X0,X1,X2,X3)
| member(sK7(X0,X1,X2,X3),X3) ),
inference(prop_impl_just,[status(thm)],[c_85]) ).
cnf(c_271,plain,
( member(sK7(X0,X1,X2,X3),X3)
| equal_maps(X0,X1,X2,X3) ),
inference(renaming,[status(thm)],[c_270]) ).
cnf(c_272,plain,
( equal_maps(X0,X1,X2,X3)
| member(sK6(X0,X1,X2,X3),X3) ),
inference(prop_impl_just,[status(thm)],[c_86]) ).
cnf(c_273,plain,
( member(sK6(X0,X1,X2,X3),X3)
| equal_maps(X0,X1,X2,X3) ),
inference(renaming,[status(thm)],[c_272]) ).
cnf(c_294,plain,
( apply(X0,sK5(X1,X0,X2,X3),sK7(X1,X0,X2,X3))
| equal_maps(X1,X0,X2,X3) ),
inference(prop_impl_just,[status(thm)],[c_83]) ).
cnf(c_1092,plain,
( X0 != sK13
| X1 != sK16
| X2 != sK17
| injective(X0,X1,X2) ),
inference(resolution_lifted,[status(thm)],[c_224,c_114]) ).
cnf(c_1093,plain,
injective(sK13,sK16,sK17),
inference(unflattening,[status(thm)],[c_1092]) ).
cnf(c_1126,plain,
( X0 != sK14
| X1 != sK15
| X2 != sK17
| X3 != sK16
| member(sK5(X0,X1,X2,X3),X2) ),
inference(resolution_lifted,[status(thm)],[c_264,c_111]) ).
cnf(c_1127,plain,
member(sK5(sK14,sK15,sK17,sK16),sK17),
inference(unflattening,[status(thm)],[c_1126]) ).
cnf(c_1131,plain,
( X0 != sK14
| X1 != sK15
| X2 != sK17
| X3 != sK16
| member(sK6(X0,X1,X2,X3),X3) ),
inference(resolution_lifted,[status(thm)],[c_273,c_111]) ).
cnf(c_1132,plain,
member(sK6(sK14,sK15,sK17,sK16),sK16),
inference(unflattening,[status(thm)],[c_1131]) ).
cnf(c_1136,plain,
( X0 != sK14
| X1 != sK15
| X2 != sK17
| X3 != sK16
| member(sK7(X0,X1,X2,X3),X3) ),
inference(resolution_lifted,[status(thm)],[c_271,c_111]) ).
cnf(c_1137,plain,
member(sK7(sK14,sK15,sK17,sK16),sK16),
inference(unflattening,[status(thm)],[c_1136]) ).
cnf(c_1141,plain,
( X0 != sK14
| X1 != sK15
| X2 != sK17
| X3 != sK16
| apply(X0,sK5(X0,X1,X2,X3),sK6(X0,X1,X2,X3)) ),
inference(resolution_lifted,[status(thm)],[c_269,c_111]) ).
cnf(c_1142,plain,
apply(sK14,sK5(sK14,sK15,sK17,sK16),sK6(sK14,sK15,sK17,sK16)),
inference(unflattening,[status(thm)],[c_1141]) ).
cnf(c_1146,plain,
( sK6(X0,X1,X2,X3) != sK7(X0,X1,X2,X3)
| X0 != sK14
| X1 != sK15
| X2 != sK17
| X3 != sK16 ),
inference(resolution_lifted,[status(thm)],[c_218,c_111]) ).
cnf(c_1147,plain,
sK6(sK14,sK15,sK17,sK16) != sK7(sK14,sK15,sK17,sK16),
inference(unflattening,[status(thm)],[c_1146]) ).
cnf(c_1151,plain,
( X0 != sK15
| X1 != sK14
| X2 != sK17
| X3 != sK16
| apply(X0,sK5(X1,X0,X2,X3),sK7(X1,X0,X2,X3)) ),
inference(resolution_lifted,[status(thm)],[c_294,c_111]) ).
cnf(c_1152,plain,
apply(sK15,sK5(sK14,sK15,sK17,sK16),sK7(sK14,sK15,sK17,sK16)),
inference(unflattening,[status(thm)],[c_1151]) ).
cnf(c_1162,plain,
( X0 != sK13
| X1 != sK16
| X2 != sK17
| ~ apply(X0,X3,X4)
| ~ apply(X0,X5,X4)
| ~ member(X3,X1)
| ~ member(X4,X2)
| ~ member(X5,X1)
| X3 = X5 ),
inference(resolution_lifted,[status(thm)],[c_88,c_1093]) ).
cnf(c_1163,plain,
( ~ apply(sK13,X0,X1)
| ~ apply(sK13,X2,X1)
| ~ member(X0,sK16)
| ~ member(X1,sK17)
| ~ member(X2,sK16)
| X0 = X2 ),
inference(unflattening,[status(thm)],[c_1162]) ).
cnf(c_1318,plain,
( X0 != sK15
| X1 != sK13
| X2 != sK16
| X3 != sK17
| ~ apply(X0,X4,X5)
| ~ member(X4,X3)
| ~ member(X5,X2)
| apply(X1,X5,X4) ),
inference(resolution_lifted,[status(thm)],[c_93,c_112]) ).
cnf(c_1319,plain,
( ~ apply(sK15,X0,X1)
| ~ member(X0,sK17)
| ~ member(X1,sK16)
| apply(sK13,X1,X0) ),
inference(unflattening,[status(thm)],[c_1318]) ).
cnf(c_1348,plain,
( X0 != sK14
| X1 != sK13
| X2 != sK16
| X3 != sK17
| ~ apply(X0,X4,X5)
| ~ member(X4,X3)
| ~ member(X5,X2)
| apply(X1,X5,X4) ),
inference(resolution_lifted,[status(thm)],[c_93,c_113]) ).
cnf(c_1349,plain,
( ~ apply(sK14,X0,X1)
| ~ member(X0,sK17)
| ~ member(X1,sK16)
| apply(sK13,X1,X0) ),
inference(unflattening,[status(thm)],[c_1348]) ).
cnf(c_3525,plain,
( ~ member(sK7(sK14,sK15,sK17,sK16),sK16)
| ~ member(sK5(sK14,sK15,sK17,sK16),sK17)
| apply(sK13,sK7(sK14,sK15,sK17,sK16),sK5(sK14,sK15,sK17,sK16)) ),
inference(superposition,[status(thm)],[c_1152,c_1319]) ).
cnf(c_3526,plain,
apply(sK13,sK7(sK14,sK15,sK17,sK16),sK5(sK14,sK15,sK17,sK16)),
inference(forward_subsumption_resolution,[status(thm)],[c_3525,c_1127,c_1137]) ).
cnf(c_3574,plain,
( ~ member(sK6(sK14,sK15,sK17,sK16),sK16)
| ~ member(sK5(sK14,sK15,sK17,sK16),sK17)
| apply(sK13,sK6(sK14,sK15,sK17,sK16),sK5(sK14,sK15,sK17,sK16)) ),
inference(superposition,[status(thm)],[c_1142,c_1349]) ).
cnf(c_3575,plain,
apply(sK13,sK6(sK14,sK15,sK17,sK16),sK5(sK14,sK15,sK17,sK16)),
inference(forward_subsumption_resolution,[status(thm)],[c_3574,c_1127,c_1132]) ).
cnf(c_3590,plain,
( ~ apply(sK13,X0,sK5(sK14,sK15,sK17,sK16))
| ~ member(sK7(sK14,sK15,sK17,sK16),sK16)
| ~ member(sK5(sK14,sK15,sK17,sK16),sK17)
| ~ member(X0,sK16)
| sK7(sK14,sK15,sK17,sK16) = X0 ),
inference(superposition,[status(thm)],[c_3526,c_1163]) ).
cnf(c_3593,plain,
( ~ apply(sK13,X0,sK5(sK14,sK15,sK17,sK16))
| ~ member(X0,sK16)
| sK7(sK14,sK15,sK17,sK16) = X0 ),
inference(forward_subsumption_resolution,[status(thm)],[c_3590,c_1127,c_1137]) ).
cnf(c_3627,plain,
( ~ member(sK6(sK14,sK15,sK17,sK16),sK16)
| sK6(sK14,sK15,sK17,sK16) = sK7(sK14,sK15,sK17,sK16) ),
inference(superposition,[status(thm)],[c_3575,c_3593]) ).
cnf(c_3628,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_3627,c_1147,c_1132]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SET711+4 : TPTP v8.1.2. Bugfixed v2.2.1.
% 0.07/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n002.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Sat Aug 26 13:20:48 EDT 2023
% 0.20/0.34 % CPUTime :
% 0.20/0.46 Running first-order theorem proving
% 0.20/0.46 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 2.41/1.14 % SZS status Started for theBenchmark.p
% 2.41/1.14 % SZS status Theorem for theBenchmark.p
% 2.41/1.14
% 2.41/1.14 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 2.41/1.14
% 2.41/1.14 ------ iProver source info
% 2.41/1.14
% 2.41/1.14 git: date: 2023-05-31 18:12:56 +0000
% 2.41/1.14 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 2.41/1.14 git: non_committed_changes: false
% 2.41/1.14 git: last_make_outside_of_git: false
% 2.41/1.14
% 2.41/1.14 ------ Parsing...
% 2.41/1.14 ------ Clausification by vclausify_rel & Parsing by iProver...
% 2.41/1.14
% 2.41/1.14 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe:2:0s pe:4:0s pe_e sup_sim: 0 sf_s rm: 5 0s sf_e pe_s pe_e
% 2.41/1.14
% 2.41/1.14 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 2.41/1.14
% 2.41/1.14 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 2.41/1.14 ------ Proving...
% 2.41/1.14 ------ Problem Properties
% 2.41/1.14
% 2.41/1.14
% 2.41/1.14 clauses 62
% 2.41/1.14 conjectures 0
% 2.41/1.14 EPR 8
% 2.41/1.14 Horn 57
% 2.41/1.14 unary 10
% 2.41/1.14 binary 29
% 2.41/1.14 lits 157
% 2.41/1.14 lits eq 6
% 2.41/1.14 fd_pure 0
% 2.41/1.14 fd_pseudo 0
% 2.41/1.14 fd_cond 0
% 2.41/1.14 fd_pseudo_cond 4
% 2.41/1.14 AC symbols 0
% 2.41/1.14
% 2.41/1.14 ------ Schedule dynamic 5 is on
% 2.41/1.14
% 2.41/1.14 ------ no conjectures: strip conj schedule
% 2.41/1.14
% 2.41/1.14 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" stripped conjectures Time Limit: 10.
% 2.41/1.14
% 2.41/1.14
% 2.41/1.14 ------
% 2.41/1.14 Current options:
% 2.41/1.14 ------
% 2.41/1.14
% 2.41/1.14
% 2.41/1.14
% 2.41/1.14
% 2.41/1.14 ------ Proving...
% 2.41/1.14
% 2.41/1.14
% 2.41/1.14 % SZS status Theorem for theBenchmark.p
% 2.41/1.14
% 2.41/1.14 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.41/1.14
% 2.41/1.15
%------------------------------------------------------------------------------