%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SEV538+1 : TPTP v9.3.1. Released v9.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n018.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Fri Sep 25 03:02:31 PM UTC 2026
% Result : Theorem 2.22s 1.75s
% Output : CNFRefutation 2.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 24
% Syntax : Number of formulae : 131 ( 50 unt; 13 def)
% Number of atoms : 400 ( 35 equ)
% Maximal formula atoms : 6 ( 3 avg)
% Number of connectives : 241 ( 102 ~; 109 |; 18 &)
% ( 7 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 10 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 19 ( 17 usr; 14 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 1 con; 0-2 aty)
% Number of variables : 152 ( 0 sgn 146 !; 6 ?; 60 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( subq(X0,X1)
<=> ! [X2] :
( mem(X2,X0)
=> mem(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET010+0.ax',subq_def) ).
fof(f2,axiom,
! [X0,X1] :
( subq(X0,X1)
=> ( subq(X1,X0)
=> X0 = X1 ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET010+0.ax',setext) ).
fof(f4,axiom,
! [X0] : ~ mem(X0,e),
file('/export/starexec/sandbox2/benchmark/Axioms/SET010+0.ax',e_ax) ).
fof(f5,axiom,
! [X0,X1] :
( mem(X0,s(X1))
<=> X0 = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET010+0.ax',s_ax) ).
fof(f6,axiom,
! [X0,X1,X2] :
( mem(X0,u(X1,X2))
<=> ( mem(X0,X2)
| mem(X0,X1) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET010+0.ax',u_ax) ).
fof(f8,axiom,
! [X0,X1] : a(X0,X1) = u(X0,s(X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/SET010+0.ax',a_def) ).
fof(f9,axiom,
! [X0] : n(X0) = a(X0,X0),
file('/export/starexec/sandbox2/benchmark/Axioms/SET010+0.ax',n_def) ).
fof(f10,axiom,
! [X0,X1] :
( mem(X0,p(X1))
<=> subq(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET010+0.ax',p_ax) ).
fof(f11,axiom,
! [X0] :
( atleast2p(X0)
<=> ? [X1] :
( ~ subq(X0,p(X1))
& mem(X1,X0) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET010+0.ax',atleast2p_def) ).
fof(f12,axiom,
! [X0] :
( atleast3p(X0)
<=> ? [X1] :
( ~ subq(X0,X1)
& atleast2p(X1)
& subq(X1,X0) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET010+0.ax',atleast3p_def) ).
fof(f26,conjecture,
atleast3p(u(a(s(n(e)),s(s(n(e)))),a(p(s(n(n(e)))),n(n(n(e)))))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',atleast3_2323) ).
fof(f27,negated_conjecture,
~ atleast3p(u(a(s(n(e)),s(s(n(e)))),a(p(s(n(n(e)))),n(n(n(e)))))),
inference(negated_conjecture,[status(cth)],[f26]) ).
fof(f28,plain,
~ atleast3p(u(a(s(n(e)),s(s(n(e)))),a(p(s(n(n(e)))),n(n(n(e)))))),
inference(flattening,[],[f27]) ).
fof(f29,plain,
! [X0] :
( ? [X1] :
( ~ subq(X0,X1)
& atleast2p(X1)
& subq(X1,X0) )
=> atleast3p(X0) ),
inference(unused_predicate_definition_removal,[],[f12]) ).
fof(f30,plain,
! [X0] :
( ? [X1] :
( ~ subq(X0,p(X1))
& mem(X1,X0) )
=> atleast2p(X0) ),
inference(unused_predicate_definition_removal,[],[f11]) ).
fof(f31,plain,
! [X0,X1] :
( subq(X0,X1)
<=> ! [X2] :
( ~ mem(X2,X0)
| mem(X2,X1) ) ),
inference(ennf_transformation,[],[f1]) ).
fof(f32,plain,
! [X0,X1] :
( ~ subq(X0,X1)
| ~ subq(X1,X0)
| X0 = X1 ),
inference(ennf_transformation,[],[f2]) ).
fof(f33,plain,
! [X0,X1] :
( ~ subq(X0,X1)
| ~ subq(X1,X0)
| X0 = X1 ),
inference(flattening,[],[f32]) ).
fof(f34,plain,
! [X0] :
( ! [X1] :
( subq(X0,p(X1))
| ~ mem(X1,X0) )
| atleast2p(X0) ),
inference(ennf_transformation,[],[f30]) ).
fof(f35,plain,
! [X0] :
( ! [X1] :
( subq(X0,X1)
| ~ atleast2p(X1)
| ~ subq(X1,X0) )
| atleast3p(X0) ),
inference(ennf_transformation,[],[f29]) ).
fof(f36,plain,
! [X0,X1] :
( ( ~ subq(X0,X1)
| ! [X2] :
( ~ mem(X2,X0)
| mem(X2,X1) ) )
& ( ? [X2] :
( mem(X2,X0)
& ~ mem(X2,X1) )
| subq(X0,X1) ) ),
inference(nnf_transformation,[],[f31]) ).
fof(f37,plain,
! [X0,X1] :
( ( ~ subq(X0,X1)
| ! [X3] :
( ~ mem(X3,X0)
| mem(X3,X1) ) )
& ( ? [X2] :
( mem(X2,X0)
& ~ mem(X2,X1) )
| subq(X0,X1) ) ),
inference(rectify,[],[f36]) ).
fof(f38,plain,
! [X0,X1] :
( ( ~ subq(X0,X1)
| ! [X3] :
( ~ mem(X3,X0)
| mem(X3,X1) ) )
& ( ( mem(sK0(X0,X1),X0)
& ~ mem(sK0(X0,X1),X1) )
| subq(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X2,sK0(X0,X1))],[f37]) ).
fof(f39,plain,
! [X0,X1] :
( ( ~ mem(X0,s(X1))
| X0 = X1 )
& ( X0 != X1
| mem(X0,s(X1)) ) ),
inference(nnf_transformation,[],[f5]) ).
fof(f40,plain,
! [X0,X1,X2] :
( ( ~ mem(X0,u(X1,X2))
| mem(X0,X2)
| mem(X0,X1) )
& ( ( ~ mem(X0,X2)
& ~ mem(X0,X1) )
| mem(X0,u(X1,X2)) ) ),
inference(nnf_transformation,[],[f6]) ).
fof(f41,plain,
! [X0,X1,X2] :
( ( ~ mem(X0,u(X1,X2))
| mem(X0,X2)
| mem(X0,X1) )
& ( ( ~ mem(X0,X2)
& ~ mem(X0,X1) )
| mem(X0,u(X1,X2)) ) ),
inference(flattening,[],[f40]) ).
fof(f44,plain,
! [X0,X1] :
( ( ~ mem(X0,p(X1))
| subq(X0,X1) )
& ( ~ subq(X0,X1)
| mem(X0,p(X1)) ) ),
inference(nnf_transformation,[],[f10]) ).
fof(f45,plain,
! [X3,X0,X1] :
( ~ subq(X0,X1)
| ~ mem(X3,X0)
| mem(X3,X1) ),
inference(cnf_transformation,[],[f38]) ).
fof(f46,plain,
! [X0,X1] :
( mem(sK0(X0,X1),X0)
| subq(X0,X1) ),
inference(cnf_transformation,[],[f38]) ).
fof(f47,plain,
! [X0,X1] :
( ~ mem(sK0(X0,X1),X1)
| subq(X0,X1) ),
inference(cnf_transformation,[],[f38]) ).
fof(f48,plain,
! [X0,X1] :
( ~ subq(X0,X1)
| ~ subq(X1,X0)
| X0 = X1 ),
inference(cnf_transformation,[],[f33]) ).
fof(f49,plain,
! [X0] : ~ mem(X0,e),
inference(cnf_transformation,[],[f4]) ).
fof(f50,plain,
! [X0,X1] :
( ~ mem(X0,s(X1))
| X0 = X1 ),
inference(cnf_transformation,[],[f39]) ).
fof(f51,plain,
! [X0,X1] :
( X0 != X1
| mem(X0,s(X1)) ),
inference(cnf_transformation,[],[f39]) ).
fof(f52,plain,
! [X2,X0,X1] :
( ~ mem(X0,u(X1,X2))
| mem(X0,X2)
| mem(X0,X1) ),
inference(cnf_transformation,[],[f41]) ).
fof(f53,plain,
! [X2,X0,X1] :
( ~ mem(X0,X2)
| mem(X0,u(X1,X2)) ),
inference(cnf_transformation,[],[f41]) ).
fof(f54,plain,
! [X2,X0,X1] :
( ~ mem(X0,X1)
| mem(X0,u(X1,X2)) ),
inference(cnf_transformation,[],[f41]) ).
fof(f58,plain,
! [X0,X1] : a(X0,X1) = u(X0,s(X1)),
inference(cnf_transformation,[],[f8]) ).
fof(f59,plain,
! [X0] : n(X0) = a(X0,X0),
inference(cnf_transformation,[],[f9]) ).
fof(f60,plain,
! [X0,X1] :
( ~ mem(X0,p(X1))
| subq(X0,X1) ),
inference(cnf_transformation,[],[f44]) ).
fof(f61,plain,
! [X0,X1] :
( ~ subq(X0,X1)
| mem(X0,p(X1)) ),
inference(cnf_transformation,[],[f44]) ).
fof(f62,plain,
! [X0,X1] :
( subq(X0,p(X1))
| ~ mem(X1,X0)
| atleast2p(X0) ),
inference(cnf_transformation,[],[f34]) ).
fof(f63,plain,
! [X0,X1] :
( subq(X0,X1)
| ~ atleast2p(X1)
| ~ subq(X1,X0)
| atleast3p(X0) ),
inference(cnf_transformation,[],[f35]) ).
fof(f64,plain,
~ atleast3p(u(a(s(n(e)),s(s(n(e)))),a(p(s(n(n(e)))),n(n(n(e)))))),
inference(cnf_transformation,[],[f28]) ).
fof(f65,plain,
! [X0] : n(X0) = u(X0,s(X0)),
inference(definition_unfolding,[],[f59,f58]) ).
fof(f66,plain,
~ atleast3p(u(u(s(u(e,s(e))),s(s(s(u(e,s(e)))))),u(p(s(u(u(e,s(e)),s(u(e,s(e)))))),s(u(u(u(e,s(e)),s(u(e,s(e)))),s(u(u(e,s(e)),s(u(e,s(e)))))))))),
inference(definition_unfolding,[],[f64,f58,f65,f65,f58,f65,f65,f65,f65,f65]) ).
fof(f67,plain,
! [X1] : mem(X1,s(X1)),
inference(equality_resolution,[],[f51]) ).
tcf(c_49,plain,
! [X0: $i,X1: $i] :
( subq(X0,X1)
| ~ mem(sK0(X0,X1),X1) ),
inference(cnf_transformation,[],[f47]) ).
tcf(c_50,plain,
! [X0: $i,X1: $i] :
( subq(X0,X1)
| mem(sK0(X0,X1),X0) ),
inference(cnf_transformation,[],[f46]) ).
tcf(c_51,plain,
! [X0: $i,X1: $i,X2: $i] :
( mem(X2,X1)
| ~ mem(X2,X0)
| ~ subq(X0,X1) ),
inference(cnf_transformation,[],[f45]) ).
tcf(c_52,plain,
! [X0: $i,X1: $i] :
( ( X0 = X1 )
| ~ subq(X1,X0)
| ~ subq(X0,X1) ),
inference(cnf_transformation,[],[f48]) ).
tcf(c_53,plain,
! [X0: $i] : ~ mem(X0,e),
inference(cnf_transformation,[],[f49]) ).
tcf(c_54,plain,
! [X0: $i] : mem(X0,s(X0)),
inference(cnf_transformation,[],[f67]) ).
tcf(c_55,plain,
! [X0: $i,X1: $i] :
( ( X0 = X1 )
| ~ mem(X0,s(X1)) ),
inference(cnf_transformation,[],[f50]) ).
tcf(c_56,plain,
! [X0: $i,X1: $i,X2: $i] :
( mem(X0,u(X1,X2))
| ~ mem(X0,X1) ),
inference(cnf_transformation,[],[f54]) ).
tcf(c_57,plain,
! [X0: $i,X1: $i,X2: $i] :
( mem(X0,u(X2,X1))
| ~ mem(X0,X1) ),
inference(cnf_transformation,[],[f53]) ).
tcf(c_58,plain,
! [X0: $i,X1: $i,X2: $i] :
( mem(X0,X2)
| mem(X0,X1)
| ~ mem(X0,u(X1,X2)) ),
inference(cnf_transformation,[],[f52]) ).
tcf(c_62,plain,
! [X0: $i,X1: $i] :
( mem(X0,p(X1))
| ~ subq(X0,X1) ),
inference(cnf_transformation,[],[f61]) ).
tcf(c_63,plain,
! [X0: $i,X1: $i] :
( subq(X0,X1)
| ~ mem(X0,p(X1)) ),
inference(cnf_transformation,[],[f60]) ).
tcf(c_64,plain,
! [X0: $i,X1: $i] :
( atleast2p(X1)
| subq(X1,p(X0))
| ~ mem(X0,X1) ),
inference(cnf_transformation,[],[f62]) ).
tcf(c_65,plain,
! [X0: $i,X1: $i] :
( atleast3p(X1)
| subq(X1,X0)
| ~ atleast2p(X0)
| ~ subq(X0,X1) ),
inference(cnf_transformation,[],[f63]) ).
tcf(c_66,negated_conjecture,
~ atleast3p(u(u(s(u(e,s(e))),s(s(s(u(e,s(e)))))),u(p(s(u(u(e,s(e)),s(u(e,s(e)))))),s(u(u(u(e,s(e)),s(u(e,s(e)))),s(u(u(e,s(e)),s(u(e,s(e)))))))))),
inference(cnf_transformation,[],[f66]) ).
tcf(c_68,plain,
~ mem(e,e),
inference(instantiation,[status(thm)],[c_53]) ).
tcf(c_300,plain,
! [X0: $i,X1: $i] :
( subq(X0,X1)
| ~ atleast2p(X1)
| ~ subq(X1,X0)
| ( u(u(s(u(e,s(e))),s(s(s(u(e,s(e)))))),u(p(s(u(u(e,s(e)),s(u(e,s(e)))))),s(u(u(u(e,s(e)),s(u(e,s(e)))),s(u(u(e,s(e)),s(u(e,s(e))))))))) != X0 ) ),
inference(resolution_lifted,[status(thm)],[c_65,c_66]) ).
tcf(c_301,plain,
! [X0: $i] :
( subq(u(u(s(u(e,s(e))),s(s(s(u(e,s(e)))))),u(p(s(u(u(e,s(e)),s(u(e,s(e)))))),s(u(u(u(e,s(e)),s(u(e,s(e)))),s(u(u(e,s(e)),s(u(e,s(e))))))))),X0)
| ~ atleast2p(X0)
| ~ subq(X0,u(u(s(u(e,s(e))),s(s(s(u(e,s(e)))))),u(p(s(u(u(e,s(e)),s(u(e,s(e)))))),s(u(u(u(e,s(e)),s(u(e,s(e)))),s(u(u(e,s(e)),s(u(e,s(e)))))))))) ),
inference(unflattening,[status(thm)],[c_300]) ).
tcf(c_566,definition,
iPr_def_10 = s(e),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_567,definition,
iPr_def_11 = u(e,iPr_def_10),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_568,definition,
iPr_def_12 = s(iPr_def_11),
introduced(definition,[new_symbols(definition,[iPr_def_12])],[]) ).
tcf(c_569,definition,
iPr_def_13 = s(iPr_def_12),
introduced(definition,[new_symbols(definition,[iPr_def_13])],[]) ).
tcf(c_570,definition,
iPr_def_14 = s(iPr_def_13),
introduced(definition,[new_symbols(definition,[iPr_def_14])],[]) ).
tcf(c_571,definition,
iPr_def_15 = u(iPr_def_12,iPr_def_14),
introduced(definition,[new_symbols(definition,[iPr_def_15])],[]) ).
tcf(c_572,definition,
iPr_def_16 = u(iPr_def_11,iPr_def_12),
introduced(definition,[new_symbols(definition,[iPr_def_16])],[]) ).
tcf(c_573,definition,
iPr_def_17 = s(iPr_def_16),
introduced(definition,[new_symbols(definition,[iPr_def_17])],[]) ).
tcf(c_574,definition,
iPr_def_18 = p(iPr_def_17),
introduced(definition,[new_symbols(definition,[iPr_def_18])],[]) ).
tcf(c_575,definition,
iPr_def_19 = u(iPr_def_16,iPr_def_17),
introduced(definition,[new_symbols(definition,[iPr_def_19])],[]) ).
tcf(c_576,definition,
iPr_def_20 = s(iPr_def_19),
introduced(definition,[new_symbols(definition,[iPr_def_20])],[]) ).
tcf(c_577,definition,
iPr_def_21 = u(iPr_def_18,iPr_def_20),
introduced(definition,[new_symbols(definition,[iPr_def_21])],[]) ).
tcf(c_578,definition,
iPr_def_22 = u(iPr_def_15,iPr_def_21),
introduced(definition,[new_symbols(definition,[iPr_def_22])],[]) ).
tcf(c_579,plain,
! [X0: $i] :
( subq(iPr_def_22,X0)
| ~ atleast2p(X0)
| ~ subq(X0,iPr_def_22) ),
inference(demodulation,[status(thm)],[c_301,c_575,c_576,c_572,c_573,c_574,c_577,c_569,c_570,c_566,c_567,c_568,c_571,c_578]) ).
tcf(c_1066,plain,
mem(e,iPr_def_10),
inference(superposition,[status(thm)],[c_566,c_54]) ).
tcf(c_1067,plain,
mem(iPr_def_11,iPr_def_12),
inference(superposition,[status(thm)],[c_568,c_54]) ).
tcf(c_1070,plain,
mem(iPr_def_16,iPr_def_17),
inference(superposition,[status(thm)],[c_573,c_54]) ).
tcf(c_1076,plain,
! [X0: $i] : subq(e,X0),
inference(superposition,[status(thm)],[c_50,c_53]) ).
tcf(c_1102,plain,
! [X0: $i] :
( mem(X0,iPr_def_18)
| ~ subq(X0,iPr_def_17) ),
inference(superposition,[status(thm)],[c_574,c_62]) ).
tcf(c_1112,plain,
! [X0: $i] :
( subq(X0,iPr_def_17)
| ~ mem(X0,iPr_def_18) ),
inference(superposition,[status(thm)],[c_574,c_63]) ).
tcf(c_1123,plain,
! [X0: $i] : subq(X0,X0),
inference(superposition,[status(thm)],[c_50,c_49]) ).
tcf(c_1138,plain,
! [X0: $i] :
( ( X0 = iPr_def_16 )
| ~ mem(X0,iPr_def_17) ),
inference(superposition,[status(thm)],[c_573,c_55]) ).
tcf(c_1170,plain,
mem(e,iPr_def_18),
inference(superposition,[status(thm)],[c_1076,c_1102]) ).
tcf(c_1171,plain,
mem(iPr_def_17,iPr_def_18),
inference(superposition,[status(thm)],[c_1123,c_1102]) ).
tcf(c_1267,plain,
! [X0: $i] :
( mem(X0,iPr_def_15)
| ~ mem(X0,iPr_def_12) ),
inference(superposition,[status(thm)],[c_571,c_56]) ).
tcf(c_1268,plain,
! [X0: $i] :
( mem(X0,iPr_def_16)
| ~ mem(X0,iPr_def_11) ),
inference(superposition,[status(thm)],[c_572,c_56]) ).
tcf(c_1270,plain,
! [X0: $i] :
( mem(X0,iPr_def_21)
| ~ mem(X0,iPr_def_18) ),
inference(superposition,[status(thm)],[c_577,c_56]) ).
tcf(c_1271,plain,
! [X0: $i] :
( mem(X0,iPr_def_22)
| ~ mem(X0,iPr_def_15) ),
inference(superposition,[status(thm)],[c_578,c_56]) ).
tcf(c_1303,plain,
! [X0: $i] :
( mem(X0,iPr_def_11)
| ~ mem(X0,iPr_def_10) ),
inference(superposition,[status(thm)],[c_567,c_57]) ).
tcf(c_1308,plain,
! [X0: $i] :
( mem(X0,iPr_def_22)
| ~ mem(X0,iPr_def_21) ),
inference(superposition,[status(thm)],[c_578,c_57]) ).
tcf(c_1363,plain,
mem(iPr_def_11,iPr_def_15),
inference(superposition,[status(thm)],[c_1067,c_1267]) ).
tcf(c_1417,plain,
! [X0: $i] :
( subq(iPr_def_18,X0)
| mem(sK0(iPr_def_18,X0),iPr_def_21) ),
inference(superposition,[status(thm)],[c_50,c_1270]) ).
tcf(c_1443,plain,
mem(iPr_def_11,iPr_def_22),
inference(superposition,[status(thm)],[c_1363,c_1271]) ).
tcf(c_1451,plain,
! [X0: $i] :
( subq(iPr_def_10,X0)
| mem(sK0(iPr_def_10,X0),iPr_def_11) ),
inference(superposition,[status(thm)],[c_50,c_1303]) ).
tcf(c_1452,plain,
mem(e,iPr_def_11),
inference(superposition,[status(thm)],[c_1066,c_1303]) ).
tcf(c_1514,plain,
! [X0: $i] :
( mem(e,X0)
| ~ subq(iPr_def_10,X0) ),
inference(superposition,[status(thm)],[c_1066,c_51]) ).
tcf(c_1518,plain,
! [X0: $i] :
( mem(iPr_def_16,X0)
| ~ subq(iPr_def_17,X0) ),
inference(superposition,[status(thm)],[c_1070,c_51]) ).
tcf(c_1521,plain,
! [X0: $i] :
( mem(iPr_def_17,X0)
| ~ subq(iPr_def_18,X0) ),
inference(superposition,[status(thm)],[c_1171,c_51]) ).
tcf(c_1525,plain,
! [X0: $i] :
( mem(iPr_def_11,X0)
| ~ subq(iPr_def_22,X0) ),
inference(superposition,[status(thm)],[c_1443,c_51]) ).
tcf(c_1602,plain,
! [X0: $i] :
( mem(X0,iPr_def_10)
| mem(X0,e)
| ~ mem(X0,iPr_def_11) ),
inference(superposition,[status(thm)],[c_567,c_58]) ).
tcf(c_1623,plain,
! [X0: $i] :
( mem(X0,iPr_def_10)
| ~ mem(X0,iPr_def_11) ),
inference(forward_subsumption_resolution,[status(thm)],[c_1602,c_53]) ).
tcf(c_1666,plain,
mem(e,iPr_def_16),
inference(superposition,[status(thm)],[c_1452,c_1268]) ).
tcf(c_1673,plain,
! [X0: $i] :
( mem(e,X0)
| ~ subq(iPr_def_16,X0) ),
inference(superposition,[status(thm)],[c_1666,c_51]) ).
tcf(c_1677,plain,
( mem(e,e)
| ~ subq(iPr_def_16,e) ),
inference(instantiation,[status(thm)],[c_1673]) ).
tcf(c_2196,plain,
! [X0: $i] :
( atleast2p(iPr_def_18)
| mem(iPr_def_17,p(X0))
| ~ mem(X0,iPr_def_18) ),
inference(superposition,[status(thm)],[c_64,c_1521]) ).
tcf(c_2365,plain,
! [X0: $i] :
( subq(iPr_def_11,X0)
| mem(sK0(iPr_def_11,X0),iPr_def_10) ),
inference(superposition,[status(thm)],[c_50,c_1623]) ).
tcf(c_3766,plain,
! [X0: $i] :
( subq(iPr_def_18,X0)
| mem(sK0(iPr_def_18,X0),iPr_def_22) ),
inference(superposition,[status(thm)],[c_1417,c_1308]) ).
tcf(c_4001,plain,
subq(iPr_def_10,iPr_def_11),
inference(superposition,[status(thm)],[c_1451,c_49]) ).
tcf(c_4521,plain,
subq(iPr_def_11,iPr_def_10),
inference(superposition,[status(thm)],[c_2365,c_49]) ).
tcf(c_4535,plain,
( ( iPr_def_10 = iPr_def_11 )
| ~ subq(iPr_def_10,iPr_def_11) ),
inference(superposition,[status(thm)],[c_4521,c_52]) ).
tcf(c_4537,plain,
iPr_def_10 = iPr_def_11,
inference(forward_subsumption_resolution,[status(thm)],[c_4535,c_4001]) ).
tcf(c_4563,plain,
! [X0: $i] :
( mem(iPr_def_10,X0)
| ~ subq(iPr_def_22,X0) ),
inference(demodulation,[status(thm)],[c_1525,c_4537]) ).
tcf(c_5219,plain,
subq(iPr_def_18,iPr_def_22),
inference(superposition,[status(thm)],[c_3766,c_49]) ).
tcf(c_5226,plain,
( subq(iPr_def_22,iPr_def_18)
| ~ atleast2p(iPr_def_18) ),
inference(superposition,[status(thm)],[c_5219,c_579]) ).
tcf(c_5238,plain,
( mem(iPr_def_10,iPr_def_18)
| ~ atleast2p(iPr_def_18) ),
inference(superposition,[status(thm)],[c_5226,c_4563]) ).
tcf(c_5289,plain,
( subq(iPr_def_10,iPr_def_17)
| ~ atleast2p(iPr_def_18) ),
inference(superposition,[status(thm)],[c_5238,c_1112]) ).
tcf(c_5411,plain,
( mem(e,iPr_def_17)
| ~ atleast2p(iPr_def_18) ),
inference(superposition,[status(thm)],[c_5289,c_1514]) ).
tcf(c_5577,plain,
( ( e = iPr_def_16 )
| ~ atleast2p(iPr_def_18) ),
inference(superposition,[status(thm)],[c_5411,c_1138]) ).
tcf(c_11497,plain,
! [X0: $i] :
( atleast2p(iPr_def_18)
| subq(iPr_def_17,X0)
| ~ mem(X0,iPr_def_18) ),
inference(superposition,[status(thm)],[c_2196,c_63]) ).
tcf(c_11520,plain,
( atleast2p(iPr_def_18)
| subq(iPr_def_17,e) ),
inference(superposition,[status(thm)],[c_1170,c_11497]) ).
tcf(c_11619,plain,
( atleast2p(iPr_def_18)
| mem(iPr_def_16,e) ),
inference(superposition,[status(thm)],[c_11520,c_1518]) ).
tcf(c_11620,plain,
atleast2p(iPr_def_18),
inference(forward_subsumption_resolution,[status(thm)],[c_11619,c_53]) ).
tcf(c_11627,plain,
e = iPr_def_16,
inference(backward_subsumption_resolution,[status(thm)],[c_5577,c_11620]) ).
tcf(c_11982,plain,
! [X0: $i] : subq(iPr_def_16,X0),
inference(demodulation,[status(thm)],[c_1076,c_11627]) ).
tcf(c_12289,plain,
subq(iPr_def_16,e),
inference(instantiation,[status(thm)],[c_11982]) ).
tcf(c_12290,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_12289,c_1677,c_68]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEV538+1 : TPTP v9.3.1. Released v9.1.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/0.35 % Computer : n018.cluster.edu
% 0.10/0.35 % Model : x86_64 x86_64
% 0.10/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.35 % Memory : 8046.5625MB
% 0.10/0.35 % OS : Linux 6.8.0-71-generic
% 0.10/0.35 % CPULimit : 300
% 0.10/0.35 % WCLimit : 300
% 0.10/0.35 % DateTime : Thu Sep 24 15:00:18 UTC 2026
% 0.10/0.35 % CPUTime :
% 0.10/0.35 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.12/0.39 Running first-order theorem proving
% 0.12/0.39 Running: /export/starexec/sandbox2/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/0.41
% 0.12/0.41 % ======== iProver multi-core TPTP/SMT =========
% 0.12/0.41
% 0.12/0.41 % Detected problem language: tptp
% 0.12/0.42 % Proving...
% 2.22/1.75 % SZS status Started for theBenchmark.p
% 2.22/1.75 % SZS status Theorem for theBenchmark.p
% 2.22/1.75
% 2.22/1.75 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.22/1.75
% 2.22/1.75 % ------ iProver source info
% 2.22/1.75
% 2.22/1.75 % git: date: 2026-07-19 20:42:38 +0200
% 2.22/1.75 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.22/1.75 % git: non_committed_changes: false
% 2.22/1.75
% 2.22/1.75 % ------ Parsing...
% 2.22/1.75 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 2.22/1.75
% 2.22/1.75 % ------ 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 %
% 2.22/1.75
% 2.22/1.75 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 2.22/1.75
% 2.22/1.75 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 2.22/1.75 % ------ Proving...
% 2.22/1.75 % ------ Problem Properties
% 2.22/1.75
% 2.22/1.75 %
% 2.22/1.75 % clauses 30
% 2.22/1.75 % conjectures 0
% 2.22/1.75 % EPR 4
% 2.22/1.75 % Horn 26
% 2.22/1.75 % unary 15
% 2.22/1.75 % binary 9
% 2.22/1.75 % lits 51
% 2.22/1.75 % lits eq 15
% 2.22/1.75 % fd_pure 0
% 2.22/1.75 % fd_pseudo 0
% 2.22/1.75 % fd_cond 0
% 2.22/1.75 % fd_pseudo_cond 2
% 2.22/1.75 % AC symbols 0
% 2.22/1.75
% 2.22/1.75 % ------ Schedule dynamic 5 is on
% 2.22/1.75
% 2.22/1.75 % ------ no conjectures: strip conj schedule
% 2.22/1.75
% 2.22/1.75 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" stripped conjectures Time Limit: 10.
% 2.22/1.75
% 2.22/1.75
% 2.22/1.75 % ------
% 2.22/1.75 % Current options:
% 2.22/1.75 % ------
% 2.22/1.75
% 2.22/1.75
% 2.22/1.75 %
% 2.22/1.75
% 2.22/1.75 % ------ Proving...
% 2.22/1.75 %
% 2.22/1.75
% 2.22/1.75 % SZS status Theorem for theBenchmark.p
% 2.22/1.75
% 2.22/1.75 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.22/1.75
% 2.22/1.75
%------------------------------------------------------------------------------