TSTP Solution File: SET720+4 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SET720+4 : TPTP v8.1.2. Bugfixed v2.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n028.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:17 EDT 2023
% Result : Theorem 3.32s 1.09s
% Output : CNFRefutation 3.32s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 7
% Syntax : Number of formulae : 77 ( 13 unt; 0 def)
% Number of atoms : 302 ( 53 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 339 ( 114 ~; 119 |; 73 &)
% ( 8 <=>; 25 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-4 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-4 aty)
% Number of variables : 281 ( 0 sgn; 151 !; 24 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f12,axiom,
! [X5,X0,X1] :
( maps(X5,X0,X1)
<=> ( ! [X2,X6,X7] :
( ( member(X7,X1)
& member(X6,X1)
& member(X2,X0) )
=> ( ( apply(X5,X2,X7)
& apply(X5,X2,X6) )
=> X6 = X7 ) )
& ! [X2] :
( member(X2,X0)
=> ? [X4] :
( apply(X5,X2,X4)
& member(X4,X1) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',maps) ).
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(f21,axiom,
! [X5,X0,X1,X2,X4] :
( ( member(X4,X1)
& member(X2,X0) )
=> ( apply(X5,X2,X4)
<=> apply(inverse_function(X5,X0,X1),X4,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',inverse_function) ).
fof(f29,conjecture,
! [X5,X0,X1] :
( ( one_to_one(X5,X0,X1)
& maps(X5,X0,X1) )
=> equal_maps(inverse_function(inverse_function(X5,X0,X1),X1,X0),X5,X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',thII11) ).
fof(f30,negated_conjecture,
~ ! [X5,X0,X1] :
( ( one_to_one(X5,X0,X1)
& maps(X5,X0,X1) )
=> equal_maps(inverse_function(inverse_function(X5,X0,X1),X1,X0),X5,X0,X1) ),
inference(negated_conjecture,[],[f29]) ).
fof(f40,plain,
! [X0,X1,X2] :
( maps(X0,X1,X2)
<=> ( ! [X3,X4,X5] :
( ( member(X5,X2)
& member(X4,X2)
& member(X3,X1) )
=> ( ( apply(X0,X3,X5)
& apply(X0,X3,X4) )
=> X4 = X5 ) )
& ! [X6] :
( member(X6,X1)
=> ? [X7] :
( apply(X0,X6,X7)
& member(X7,X2) ) ) ) ),
inference(rectify,[],[f12]) ).
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(f49,plain,
! [X0,X1,X2,X3,X4] :
( ( member(X4,X2)
& member(X3,X1) )
=> ( apply(X0,X3,X4)
<=> apply(inverse_function(X0,X1,X2),X4,X3) ) ),
inference(rectify,[],[f21]) ).
fof(f57,plain,
~ ! [X0,X1,X2] :
( ( one_to_one(X0,X1,X2)
& maps(X0,X1,X2) )
=> equal_maps(inverse_function(inverse_function(X0,X1,X2),X2,X1),X0,X1,X2) ),
inference(rectify,[],[f30]) ).
fof(f61,plain,
! [X0,X1,X2] :
( maps(X0,X1,X2)
=> ( ! [X3,X4,X5] :
( ( member(X5,X2)
& member(X4,X2)
& member(X3,X1) )
=> ( ( apply(X0,X3,X5)
& apply(X0,X3,X4) )
=> X4 = X5 ) )
& ! [X6] :
( member(X6,X1)
=> ? [X7] :
( apply(X0,X6,X7)
& member(X7,X2) ) ) ) ),
inference(unused_predicate_definition_removal,[],[f40]) ).
fof(f62,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(f65,plain,
! [X0,X1,X2] :
( ( ! [X3,X4,X5] :
( X4 = X5
| ~ apply(X0,X3,X5)
| ~ apply(X0,X3,X4)
| ~ member(X5,X2)
| ~ member(X4,X2)
| ~ member(X3,X1) )
& ! [X6] :
( ? [X7] :
( apply(X0,X6,X7)
& member(X7,X2) )
| ~ member(X6,X1) ) )
| ~ maps(X0,X1,X2) ),
inference(ennf_transformation,[],[f61]) ).
fof(f66,plain,
! [X0,X1,X2] :
( ( ! [X3,X4,X5] :
( X4 = X5
| ~ apply(X0,X3,X5)
| ~ apply(X0,X3,X4)
| ~ member(X5,X2)
| ~ member(X4,X2)
| ~ member(X3,X1) )
& ! [X6] :
( ? [X7] :
( apply(X0,X6,X7)
& member(X7,X2) )
| ~ member(X6,X1) ) )
| ~ maps(X0,X1,X2) ),
inference(flattening,[],[f65]) ).
fof(f69,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,[],[f62]) ).
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(flattening,[],[f69]) ).
fof(f75,plain,
! [X0,X1,X2,X3,X4] :
( ( apply(X0,X3,X4)
<=> apply(inverse_function(X0,X1,X2),X4,X3) )
| ~ member(X4,X2)
| ~ member(X3,X1) ),
inference(ennf_transformation,[],[f49]) ).
fof(f76,plain,
! [X0,X1,X2,X3,X4] :
( ( apply(X0,X3,X4)
<=> apply(inverse_function(X0,X1,X2),X4,X3) )
| ~ member(X4,X2)
| ~ member(X3,X1) ),
inference(flattening,[],[f75]) ).
fof(f77,plain,
? [X0,X1,X2] :
( ~ equal_maps(inverse_function(inverse_function(X0,X1,X2),X2,X1),X0,X1,X2)
& one_to_one(X0,X1,X2)
& maps(X0,X1,X2) ),
inference(ennf_transformation,[],[f57]) ).
fof(f78,plain,
? [X0,X1,X2] :
( ~ equal_maps(inverse_function(inverse_function(X0,X1,X2),X2,X1),X0,X1,X2)
& one_to_one(X0,X1,X2)
& maps(X0,X1,X2) ),
inference(flattening,[],[f77]) ).
fof(f101,plain,
! [X0,X2,X6] :
( ? [X7] :
( apply(X0,X6,X7)
& member(X7,X2) )
=> ( apply(X0,X6,sK3(X0,X2,X6))
& member(sK3(X0,X2,X6),X2) ) ),
introduced(choice_axiom,[]) ).
fof(f102,plain,
! [X0,X1,X2] :
( ( ! [X3,X4,X5] :
( X4 = X5
| ~ apply(X0,X3,X5)
| ~ apply(X0,X3,X4)
| ~ member(X5,X2)
| ~ member(X4,X2)
| ~ member(X3,X1) )
& ! [X6] :
( ( apply(X0,X6,sK3(X0,X2,X6))
& member(sK3(X0,X2,X6),X2) )
| ~ member(X6,X1) ) )
| ~ maps(X0,X1,X2) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3])],[f66,f101]) ).
fof(f107,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(f108,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])],[f70,f107]) ).
fof(f111,plain,
! [X0,X1,X2,X3,X4] :
( ( ( apply(X0,X3,X4)
| ~ apply(inverse_function(X0,X1,X2),X4,X3) )
& ( apply(inverse_function(X0,X1,X2),X4,X3)
| ~ apply(X0,X3,X4) ) )
| ~ member(X4,X2)
| ~ member(X3,X1) ),
inference(nnf_transformation,[],[f76]) ).
fof(f130,plain,
( ? [X0,X1,X2] :
( ~ equal_maps(inverse_function(inverse_function(X0,X1,X2),X2,X1),X0,X1,X2)
& one_to_one(X0,X1,X2)
& maps(X0,X1,X2) )
=> ( ~ equal_maps(inverse_function(inverse_function(sK13,sK14,sK15),sK15,sK14),sK13,sK14,sK15)
& one_to_one(sK13,sK14,sK15)
& maps(sK13,sK14,sK15) ) ),
introduced(choice_axiom,[]) ).
fof(f131,plain,
( ~ equal_maps(inverse_function(inverse_function(sK13,sK14,sK15),sK15,sK14),sK13,sK14,sK15)
& one_to_one(sK13,sK14,sK15)
& maps(sK13,sK14,sK15) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK13,sK14,sK15])],[f78,f130]) ).
fof(f160,plain,
! [X2,X3,X0,X1,X4,X5] :
( X4 = X5
| ~ apply(X0,X3,X5)
| ~ apply(X0,X3,X4)
| ~ member(X5,X2)
| ~ member(X4,X2)
| ~ member(X3,X1)
| ~ maps(X0,X1,X2) ),
inference(cnf_transformation,[],[f102]) ).
fof(f165,plain,
! [X2,X3,X0,X1] :
( equal_maps(X0,X1,X2,X3)
| member(sK5(X0,X1,X2,X3),X2) ),
inference(cnf_transformation,[],[f108]) ).
fof(f166,plain,
! [X2,X3,X0,X1] :
( equal_maps(X0,X1,X2,X3)
| member(sK6(X0,X1,X2,X3),X3) ),
inference(cnf_transformation,[],[f108]) ).
fof(f167,plain,
! [X2,X3,X0,X1] :
( equal_maps(X0,X1,X2,X3)
| member(sK7(X0,X1,X2,X3),X3) ),
inference(cnf_transformation,[],[f108]) ).
fof(f168,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,[],[f108]) ).
fof(f169,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,[],[f108]) ).
fof(f170,plain,
! [X2,X3,X0,X1] :
( equal_maps(X0,X1,X2,X3)
| sK6(X0,X1,X2,X3) != sK7(X0,X1,X2,X3) ),
inference(cnf_transformation,[],[f108]) ).
fof(f177,plain,
! [X2,X3,X0,X1,X4] :
( apply(X0,X3,X4)
| ~ apply(inverse_function(X0,X1,X2),X4,X3)
| ~ member(X4,X2)
| ~ member(X3,X1) ),
inference(cnf_transformation,[],[f111]) ).
fof(f192,plain,
maps(sK13,sK14,sK15),
inference(cnf_transformation,[],[f131]) ).
fof(f194,plain,
~ equal_maps(inverse_function(inverse_function(sK13,sK14,sK15),sK15,sK14),sK13,sK14,sK15),
inference(cnf_transformation,[],[f131]) ).
cnf(c_75,plain,
( ~ apply(X0,X1,X2)
| ~ apply(X0,X1,X3)
| ~ maps(X0,X4,X5)
| ~ member(X1,X4)
| ~ member(X2,X5)
| ~ member(X3,X5)
| X2 = X3 ),
inference(cnf_transformation,[],[f160]) ).
cnf(c_82,plain,
( sK6(X0,X1,X2,X3) != sK7(X0,X1,X2,X3)
| equal_maps(X0,X1,X2,X3) ),
inference(cnf_transformation,[],[f170]) ).
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,[],[f169]) ).
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,[],[f168]) ).
cnf(c_85,plain,
( member(sK7(X0,X1,X2,X3),X3)
| equal_maps(X0,X1,X2,X3) ),
inference(cnf_transformation,[],[f167]) ).
cnf(c_86,plain,
( member(sK6(X0,X1,X2,X3),X3)
| equal_maps(X0,X1,X2,X3) ),
inference(cnf_transformation,[],[f166]) ).
cnf(c_87,plain,
( member(sK5(X0,X1,X2,X3),X2)
| equal_maps(X0,X1,X2,X3) ),
inference(cnf_transformation,[],[f165]) ).
cnf(c_93,plain,
( ~ apply(inverse_function(X0,X1,X2),X3,X4)
| ~ member(X3,X2)
| ~ member(X4,X1)
| apply(X0,X4,X3) ),
inference(cnf_transformation,[],[f177]) ).
cnf(c_109,negated_conjecture,
~ equal_maps(inverse_function(inverse_function(sK13,sK14,sK15),sK15,sK14),sK13,sK14,sK15),
inference(cnf_transformation,[],[f194]) ).
cnf(c_111,negated_conjecture,
maps(sK13,sK14,sK15),
inference(cnf_transformation,[],[f192]) ).
cnf(c_214,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_260,plain,
( member(sK5(X0,X1,X2,X3),X2)
| equal_maps(X0,X1,X2,X3) ),
inference(prop_impl_just,[status(thm)],[c_87]) ).
cnf(c_264,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_265,plain,
( apply(X0,sK5(X0,X1,X2,X3),sK6(X0,X1,X2,X3))
| equal_maps(X0,X1,X2,X3) ),
inference(renaming,[status(thm)],[c_264]) ).
cnf(c_266,plain,
( equal_maps(X0,X1,X2,X3)
| member(sK7(X0,X1,X2,X3),X3) ),
inference(prop_impl_just,[status(thm)],[c_85]) ).
cnf(c_267,plain,
( member(sK7(X0,X1,X2,X3),X3)
| equal_maps(X0,X1,X2,X3) ),
inference(renaming,[status(thm)],[c_266]) ).
cnf(c_268,plain,
( equal_maps(X0,X1,X2,X3)
| member(sK6(X0,X1,X2,X3),X3) ),
inference(prop_impl_just,[status(thm)],[c_86]) ).
cnf(c_269,plain,
( member(sK6(X0,X1,X2,X3),X3)
| equal_maps(X0,X1,X2,X3) ),
inference(renaming,[status(thm)],[c_268]) ).
cnf(c_290,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_1068,plain,
( inverse_function(inverse_function(sK13,sK14,sK15),sK15,sK14) != X0
| X1 != sK13
| X2 != sK14
| X3 != sK15
| member(sK5(X0,X1,X2,X3),X2) ),
inference(resolution_lifted,[status(thm)],[c_260,c_109]) ).
cnf(c_1069,plain,
member(sK5(inverse_function(inverse_function(sK13,sK14,sK15),sK15,sK14),sK13,sK14,sK15),sK14),
inference(unflattening,[status(thm)],[c_1068]) ).
cnf(c_1073,plain,
( inverse_function(inverse_function(sK13,sK14,sK15),sK15,sK14) != X0
| X1 != sK13
| X2 != sK14
| X3 != sK15
| member(sK6(X0,X1,X2,X3),X3) ),
inference(resolution_lifted,[status(thm)],[c_269,c_109]) ).
cnf(c_1074,plain,
member(sK6(inverse_function(inverse_function(sK13,sK14,sK15),sK15,sK14),sK13,sK14,sK15),sK15),
inference(unflattening,[status(thm)],[c_1073]) ).
cnf(c_1078,plain,
( inverse_function(inverse_function(sK13,sK14,sK15),sK15,sK14) != X0
| X1 != sK13
| X2 != sK14
| X3 != sK15
| member(sK7(X0,X1,X2,X3),X3) ),
inference(resolution_lifted,[status(thm)],[c_267,c_109]) ).
cnf(c_1079,plain,
member(sK7(inverse_function(inverse_function(sK13,sK14,sK15),sK15,sK14),sK13,sK14,sK15),sK15),
inference(unflattening,[status(thm)],[c_1078]) ).
cnf(c_1083,plain,
( inverse_function(inverse_function(sK13,sK14,sK15),sK15,sK14) != X0
| X1 != sK13
| X2 != sK14
| X3 != sK15
| apply(X0,sK5(X0,X1,X2,X3),sK6(X0,X1,X2,X3)) ),
inference(resolution_lifted,[status(thm)],[c_265,c_109]) ).
cnf(c_1084,plain,
apply(inverse_function(inverse_function(sK13,sK14,sK15),sK15,sK14),sK5(inverse_function(inverse_function(sK13,sK14,sK15),sK15,sK14),sK13,sK14,sK15),sK6(inverse_function(inverse_function(sK13,sK14,sK15),sK15,sK14),sK13,sK14,sK15)),
inference(unflattening,[status(thm)],[c_1083]) ).
cnf(c_1088,plain,
( inverse_function(inverse_function(sK13,sK14,sK15),sK15,sK14) != X0
| sK6(X0,X1,X2,X3) != sK7(X0,X1,X2,X3)
| X1 != sK13
| X2 != sK14
| X3 != sK15 ),
inference(resolution_lifted,[status(thm)],[c_214,c_109]) ).
cnf(c_1089,plain,
sK6(inverse_function(inverse_function(sK13,sK14,sK15),sK15,sK14),sK13,sK14,sK15) != sK7(inverse_function(inverse_function(sK13,sK14,sK15),sK15,sK14),sK13,sK14,sK15),
inference(unflattening,[status(thm)],[c_1088]) ).
cnf(c_1093,plain,
( inverse_function(inverse_function(sK13,sK14,sK15),sK15,sK14) != X1
| X0 != sK13
| X2 != sK14
| X3 != sK15
| apply(X0,sK5(X1,X0,X2,X3),sK7(X1,X0,X2,X3)) ),
inference(resolution_lifted,[status(thm)],[c_290,c_109]) ).
cnf(c_1094,plain,
apply(sK13,sK5(inverse_function(inverse_function(sK13,sK14,sK15),sK15,sK14),sK13,sK14,sK15),sK7(inverse_function(inverse_function(sK13,sK14,sK15),sK15,sK14),sK13,sK14,sK15)),
inference(unflattening,[status(thm)],[c_1093]) ).
cnf(c_1131,plain,
( X0 != sK13
| X1 != sK14
| X2 != sK15
| ~ apply(X0,X3,X4)
| ~ apply(X0,X3,X5)
| ~ member(X3,X1)
| ~ member(X4,X2)
| ~ member(X5,X2)
| X4 = X5 ),
inference(resolution_lifted,[status(thm)],[c_75,c_111]) ).
cnf(c_1132,plain,
( ~ apply(sK13,X0,X1)
| ~ apply(sK13,X0,X2)
| ~ member(X0,sK14)
| ~ member(X1,sK15)
| ~ member(X2,sK15)
| X1 = X2 ),
inference(unflattening,[status(thm)],[c_1131]) ).
cnf(c_3260,plain,
( ~ apply(sK13,sK5(inverse_function(inverse_function(sK13,sK14,sK15),sK15,sK14),sK13,sK14,sK15),X0)
| ~ member(sK7(inverse_function(inverse_function(sK13,sK14,sK15),sK15,sK14),sK13,sK14,sK15),sK15)
| ~ member(sK5(inverse_function(inverse_function(sK13,sK14,sK15),sK15,sK14),sK13,sK14,sK15),sK14)
| ~ member(X0,sK15)
| sK7(inverse_function(inverse_function(sK13,sK14,sK15),sK15,sK14),sK13,sK14,sK15) = X0 ),
inference(superposition,[status(thm)],[c_1094,c_1132]) ).
cnf(c_3261,plain,
( ~ apply(sK13,sK5(inverse_function(inverse_function(sK13,sK14,sK15),sK15,sK14),sK13,sK14,sK15),X0)
| ~ member(X0,sK15)
| sK7(inverse_function(inverse_function(sK13,sK14,sK15),sK15,sK14),sK13,sK14,sK15) = X0 ),
inference(forward_subsumption_resolution,[status(thm)],[c_3260,c_1069,c_1079]) ).
cnf(c_3292,plain,
( ~ member(sK6(inverse_function(inverse_function(sK13,sK14,sK15),sK15,sK14),sK13,sK14,sK15),sK15)
| ~ member(sK5(inverse_function(inverse_function(sK13,sK14,sK15),sK15,sK14),sK13,sK14,sK15),sK14)
| apply(inverse_function(sK13,sK14,sK15),sK6(inverse_function(inverse_function(sK13,sK14,sK15),sK15,sK14),sK13,sK14,sK15),sK5(inverse_function(inverse_function(sK13,sK14,sK15),sK15,sK14),sK13,sK14,sK15)) ),
inference(superposition,[status(thm)],[c_1084,c_93]) ).
cnf(c_3293,plain,
apply(inverse_function(sK13,sK14,sK15),sK6(inverse_function(inverse_function(sK13,sK14,sK15),sK15,sK14),sK13,sK14,sK15),sK5(inverse_function(inverse_function(sK13,sK14,sK15),sK15,sK14),sK13,sK14,sK15)),
inference(forward_subsumption_resolution,[status(thm)],[c_3292,c_1069,c_1074]) ).
cnf(c_3313,plain,
( ~ member(sK6(inverse_function(inverse_function(sK13,sK14,sK15),sK15,sK14),sK13,sK14,sK15),sK15)
| ~ member(sK5(inverse_function(inverse_function(sK13,sK14,sK15),sK15,sK14),sK13,sK14,sK15),sK14)
| apply(sK13,sK5(inverse_function(inverse_function(sK13,sK14,sK15),sK15,sK14),sK13,sK14,sK15),sK6(inverse_function(inverse_function(sK13,sK14,sK15),sK15,sK14),sK13,sK14,sK15)) ),
inference(superposition,[status(thm)],[c_3293,c_93]) ).
cnf(c_3314,plain,
apply(sK13,sK5(inverse_function(inverse_function(sK13,sK14,sK15),sK15,sK14),sK13,sK14,sK15),sK6(inverse_function(inverse_function(sK13,sK14,sK15),sK15,sK14),sK13,sK14,sK15)),
inference(forward_subsumption_resolution,[status(thm)],[c_3313,c_1069,c_1074]) ).
cnf(c_3334,plain,
( ~ member(sK6(inverse_function(inverse_function(sK13,sK14,sK15),sK15,sK14),sK13,sK14,sK15),sK15)
| sK6(inverse_function(inverse_function(sK13,sK14,sK15),sK15,sK14),sK13,sK14,sK15) = sK7(inverse_function(inverse_function(sK13,sK14,sK15),sK15,sK14),sK13,sK14,sK15) ),
inference(superposition,[status(thm)],[c_3314,c_3261]) ).
cnf(c_3335,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_3334,c_1089,c_1074]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SET720+4 : TPTP v8.1.2. Bugfixed v2.2.1.
% 0.00/0.12 % Command : run_iprover %s %d THM
% 0.10/0.31 % Computer : n028.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 : Sat Aug 26 13:32:22 EDT 2023
% 0.10/0.32 % CPUTime :
% 0.16/0.41 Running first-order theorem proving
% 0.16/0.41 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 3.32/1.09 % SZS status Started for theBenchmark.p
% 3.32/1.09 % SZS status Theorem for theBenchmark.p
% 3.32/1.09
% 3.32/1.09 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 3.32/1.09
% 3.32/1.09 ------ iProver source info
% 3.32/1.09
% 3.32/1.09 git: date: 2023-05-31 18:12:56 +0000
% 3.32/1.09 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 3.32/1.09 git: non_committed_changes: false
% 3.32/1.09 git: last_make_outside_of_git: false
% 3.32/1.09
% 3.32/1.09 ------ Parsing...
% 3.32/1.09 ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.32/1.09
% 3.32/1.09 ------ 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: 4 0s sf_e pe_s pe_e
% 3.32/1.09
% 3.32/1.09 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.32/1.09
% 3.32/1.09 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.32/1.09 ------ Proving...
% 3.32/1.09 ------ Problem Properties
% 3.32/1.09
% 3.32/1.09
% 3.32/1.09 clauses 58
% 3.32/1.09 conjectures 0
% 3.32/1.09 EPR 4
% 3.32/1.09 Horn 53
% 3.32/1.09 unary 10
% 3.32/1.09 binary 29
% 3.32/1.09 lits 141
% 3.32/1.09 lits eq 6
% 3.32/1.09 fd_pure 0
% 3.32/1.09 fd_pseudo 0
% 3.32/1.09 fd_cond 0
% 3.32/1.09 fd_pseudo_cond 4
% 3.32/1.09 AC symbols 0
% 3.32/1.09
% 3.32/1.09 ------ Schedule dynamic 5 is on
% 3.32/1.09
% 3.32/1.09 ------ no conjectures: strip conj schedule
% 3.32/1.09
% 3.32/1.09 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" stripped conjectures Time Limit: 10.
% 3.32/1.09
% 3.32/1.09
% 3.32/1.09 ------
% 3.32/1.09 Current options:
% 3.32/1.09 ------
% 3.32/1.09
% 3.32/1.09
% 3.32/1.09
% 3.32/1.09
% 3.32/1.09 ------ Proving...
% 3.32/1.09
% 3.32/1.09
% 3.32/1.09 % SZS status Theorem for theBenchmark.p
% 3.32/1.09
% 3.32/1.09 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.32/1.09
% 3.32/1.09
%------------------------------------------------------------------------------