TSTP Solution File: SEU235+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SEU235+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n024.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:05:08 EDT 2024
% Result : Theorem 7.93s 1.62s
% Output : CNFRefutation 7.93s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 21
% Syntax : Number of formulae : 132 ( 19 unt; 0 def)
% Number of atoms : 427 ( 25 equ)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 528 ( 233 ~; 204 |; 63 &)
% ( 6 <=>; 22 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-1 aty)
% Number of variables : 239 ( 8 sgn 126 !; 18 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [X0] :
( ordinal(X0)
=> ( epsilon_connected(X0)
& epsilon_transitive(X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cc1_ordinal1) ).
fof(f9,axiom,
! [X0] :
( epsilon_transitive(X0)
<=> ! [X1] :
( in(X1,X0)
=> subset(X1,X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d2_ordinal1) ).
fof(f13,axiom,
! [X0] :
? [X1] : element(X1,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',existence_m1_subset_1) ).
fof(f17,axiom,
( relation(empty_set)
& empty(empty_set) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fc4_relat_1) ).
fof(f30,axiom,
! [X0,X1] :
( ( ordinal(X1)
& ordinal(X0) )
=> ( ordinal_subset(X0,X1)
<=> subset(X0,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',redefinition_r1_ordinal1) ).
fof(f32,axiom,
! [X0,X1] : subset(X0,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',reflexivity_r1_tarski) ).
fof(f34,axiom,
! [X0,X1] :
( ordinal(X1)
=> ( in(X0,X1)
=> ordinal(X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t23_ordinal1) ).
fof(f35,axiom,
! [X0] :
( ordinal(X0)
=> ! [X1] :
( ordinal(X1)
=> ~ ( ~ in(X1,X0)
& X0 != X1
& ~ in(X0,X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t24_ordinal1) ).
fof(f36,axiom,
! [X0,X1] :
( element(X0,X1)
=> ( in(X0,X1)
| empty(X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t2_subset) ).
fof(f37,conjecture,
! [X0,X1] :
( ordinal(X1)
=> ~ ( ! [X2] :
( ordinal(X2)
=> ~ ( ! [X3] :
( ordinal(X3)
=> ( in(X3,X0)
=> ordinal_subset(X2,X3) ) )
& in(X2,X0) ) )
& empty_set != X0
& subset(X0,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t32_ordinal1) ).
fof(f38,negated_conjecture,
~ ! [X0,X1] :
( ordinal(X1)
=> ~ ( ! [X2] :
( ordinal(X2)
=> ~ ( ! [X3] :
( ordinal(X3)
=> ( in(X3,X0)
=> ordinal_subset(X2,X3) ) )
& in(X2,X0) ) )
& empty_set != X0
& subset(X0,X1) ) ),
inference(negated_conjecture,[],[f37]) ).
fof(f39,axiom,
! [X0,X1] :
( element(X0,powerset(X1))
<=> subset(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t3_subset) ).
fof(f40,axiom,
! [X0,X1,X2] :
( ( element(X1,powerset(X2))
& in(X0,X1) )
=> element(X0,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t4_subset) ).
fof(f41,axiom,
! [X0,X1,X2] :
~ ( empty(X2)
& element(X1,powerset(X2))
& in(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t5_subset) ).
fof(f44,axiom,
! [X0,X1] :
~ ( ! [X2] :
~ ( ! [X3] :
~ ( in(X3,X2)
& in(X3,X1) )
& in(X2,X1) )
& in(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t7_tarski) ).
fof(f45,axiom,
! [X0,X1] :
~ ( empty(X1)
& X0 != X1
& empty(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t8_boole) ).
fof(f46,plain,
! [X0] : subset(X0,X0),
inference(rectify,[],[f32]) ).
fof(f57,plain,
! [X0] :
( ( epsilon_connected(X0)
& epsilon_transitive(X0) )
| ~ ordinal(X0) ),
inference(ennf_transformation,[],[f3]) ).
fof(f66,plain,
! [X0] :
( epsilon_transitive(X0)
<=> ! [X1] :
( subset(X1,X0)
| ~ in(X1,X0) ) ),
inference(ennf_transformation,[],[f9]) ).
fof(f67,plain,
! [X0,X1] :
( ( ordinal_subset(X0,X1)
<=> subset(X0,X1) )
| ~ ordinal(X1)
| ~ ordinal(X0) ),
inference(ennf_transformation,[],[f30]) ).
fof(f68,plain,
! [X0,X1] :
( ( ordinal_subset(X0,X1)
<=> subset(X0,X1) )
| ~ ordinal(X1)
| ~ ordinal(X0) ),
inference(flattening,[],[f67]) ).
fof(f72,plain,
! [X0,X1] :
( ordinal(X0)
| ~ in(X0,X1)
| ~ ordinal(X1) ),
inference(ennf_transformation,[],[f34]) ).
fof(f73,plain,
! [X0,X1] :
( ordinal(X0)
| ~ in(X0,X1)
| ~ ordinal(X1) ),
inference(flattening,[],[f72]) ).
fof(f74,plain,
! [X0] :
( ! [X1] :
( in(X1,X0)
| X0 = X1
| in(X0,X1)
| ~ ordinal(X1) )
| ~ ordinal(X0) ),
inference(ennf_transformation,[],[f35]) ).
fof(f75,plain,
! [X0] :
( ! [X1] :
( in(X1,X0)
| X0 = X1
| in(X0,X1)
| ~ ordinal(X1) )
| ~ ordinal(X0) ),
inference(flattening,[],[f74]) ).
fof(f76,plain,
! [X0,X1] :
( in(X0,X1)
| empty(X1)
| ~ element(X0,X1) ),
inference(ennf_transformation,[],[f36]) ).
fof(f77,plain,
! [X0,X1] :
( in(X0,X1)
| empty(X1)
| ~ element(X0,X1) ),
inference(flattening,[],[f76]) ).
fof(f78,plain,
? [X0,X1] :
( ! [X2] :
( ? [X3] :
( ~ ordinal_subset(X2,X3)
& in(X3,X0)
& ordinal(X3) )
| ~ in(X2,X0)
| ~ ordinal(X2) )
& empty_set != X0
& subset(X0,X1)
& ordinal(X1) ),
inference(ennf_transformation,[],[f38]) ).
fof(f79,plain,
? [X0,X1] :
( ! [X2] :
( ? [X3] :
( ~ ordinal_subset(X2,X3)
& in(X3,X0)
& ordinal(X3) )
| ~ in(X2,X0)
| ~ ordinal(X2) )
& empty_set != X0
& subset(X0,X1)
& ordinal(X1) ),
inference(flattening,[],[f78]) ).
fof(f80,plain,
! [X0,X1,X2] :
( element(X0,X2)
| ~ element(X1,powerset(X2))
| ~ in(X0,X1) ),
inference(ennf_transformation,[],[f40]) ).
fof(f81,plain,
! [X0,X1,X2] :
( element(X0,X2)
| ~ element(X1,powerset(X2))
| ~ in(X0,X1) ),
inference(flattening,[],[f80]) ).
fof(f82,plain,
! [X0,X1,X2] :
( ~ empty(X2)
| ~ element(X1,powerset(X2))
| ~ in(X0,X1) ),
inference(ennf_transformation,[],[f41]) ).
fof(f85,plain,
! [X0,X1] :
( ? [X2] :
( ! [X3] :
( ~ in(X3,X2)
| ~ in(X3,X1) )
& in(X2,X1) )
| ~ in(X0,X1) ),
inference(ennf_transformation,[],[f44]) ).
fof(f86,plain,
! [X0,X1] :
( ~ empty(X1)
| X0 = X1
| ~ empty(X0) ),
inference(ennf_transformation,[],[f45]) ).
fof(f87,plain,
! [X0] :
( ( epsilon_transitive(X0)
| ? [X1] :
( ~ subset(X1,X0)
& in(X1,X0) ) )
& ( ! [X1] :
( subset(X1,X0)
| ~ in(X1,X0) )
| ~ epsilon_transitive(X0) ) ),
inference(nnf_transformation,[],[f66]) ).
fof(f88,plain,
! [X0] :
( ( epsilon_transitive(X0)
| ? [X1] :
( ~ subset(X1,X0)
& in(X1,X0) ) )
& ( ! [X2] :
( subset(X2,X0)
| ~ in(X2,X0) )
| ~ epsilon_transitive(X0) ) ),
inference(rectify,[],[f87]) ).
fof(f89,plain,
! [X0] :
( ? [X1] :
( ~ subset(X1,X0)
& in(X1,X0) )
=> ( ~ subset(sK0(X0),X0)
& in(sK0(X0),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f90,plain,
! [X0] :
( ( epsilon_transitive(X0)
| ( ~ subset(sK0(X0),X0)
& in(sK0(X0),X0) ) )
& ( ! [X2] :
( subset(X2,X0)
| ~ in(X2,X0) )
| ~ epsilon_transitive(X0) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f88,f89]) ).
fof(f91,plain,
! [X0] :
( ? [X1] : element(X1,X0)
=> element(sK1(X0),X0) ),
introduced(choice_axiom,[]) ).
fof(f92,plain,
! [X0] : element(sK1(X0),X0),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1])],[f13,f91]) ).
fof(f117,plain,
! [X0,X1] :
( ( ( ordinal_subset(X0,X1)
| ~ subset(X0,X1) )
& ( subset(X0,X1)
| ~ ordinal_subset(X0,X1) ) )
| ~ ordinal(X1)
| ~ ordinal(X0) ),
inference(nnf_transformation,[],[f68]) ).
fof(f118,plain,
( ? [X0,X1] :
( ! [X2] :
( ? [X3] :
( ~ ordinal_subset(X2,X3)
& in(X3,X0)
& ordinal(X3) )
| ~ in(X2,X0)
| ~ ordinal(X2) )
& empty_set != X0
& subset(X0,X1)
& ordinal(X1) )
=> ( ! [X2] :
( ? [X3] :
( ~ ordinal_subset(X2,X3)
& in(X3,sK14)
& ordinal(X3) )
| ~ in(X2,sK14)
| ~ ordinal(X2) )
& empty_set != sK14
& subset(sK14,sK15)
& ordinal(sK15) ) ),
introduced(choice_axiom,[]) ).
fof(f119,plain,
! [X2] :
( ? [X3] :
( ~ ordinal_subset(X2,X3)
& in(X3,sK14)
& ordinal(X3) )
=> ( ~ ordinal_subset(X2,sK16(X2))
& in(sK16(X2),sK14)
& ordinal(sK16(X2)) ) ),
introduced(choice_axiom,[]) ).
fof(f120,plain,
( ! [X2] :
( ( ~ ordinal_subset(X2,sK16(X2))
& in(sK16(X2),sK14)
& ordinal(sK16(X2)) )
| ~ in(X2,sK14)
| ~ ordinal(X2) )
& empty_set != sK14
& subset(sK14,sK15)
& ordinal(sK15) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK14,sK15,sK16])],[f79,f119,f118]) ).
fof(f121,plain,
! [X0,X1] :
( ( element(X0,powerset(X1))
| ~ subset(X0,X1) )
& ( subset(X0,X1)
| ~ element(X0,powerset(X1)) ) ),
inference(nnf_transformation,[],[f39]) ).
fof(f122,plain,
! [X1] :
( ? [X2] :
( ! [X3] :
( ~ in(X3,X2)
| ~ in(X3,X1) )
& in(X2,X1) )
=> ( ! [X3] :
( ~ in(X3,sK17(X1))
| ~ in(X3,X1) )
& in(sK17(X1),X1) ) ),
introduced(choice_axiom,[]) ).
fof(f123,plain,
! [X0,X1] :
( ( ! [X3] :
( ~ in(X3,sK17(X1))
| ~ in(X3,X1) )
& in(sK17(X1),X1) )
| ~ in(X0,X1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK17])],[f85,f122]) ).
fof(f126,plain,
! [X0] :
( epsilon_transitive(X0)
| ~ ordinal(X0) ),
inference(cnf_transformation,[],[f57]) ).
fof(f136,plain,
! [X2,X0] :
( subset(X2,X0)
| ~ in(X2,X0)
| ~ epsilon_transitive(X0) ),
inference(cnf_transformation,[],[f90]) ).
fof(f139,plain,
! [X0] : element(sK1(X0),X0),
inference(cnf_transformation,[],[f92]) ).
fof(f149,plain,
empty(empty_set),
inference(cnf_transformation,[],[f17]) ).
fof(f181,plain,
! [X0,X1] :
( ordinal_subset(X0,X1)
| ~ subset(X0,X1)
| ~ ordinal(X1)
| ~ ordinal(X0) ),
inference(cnf_transformation,[],[f117]) ).
fof(f183,plain,
! [X0] : subset(X0,X0),
inference(cnf_transformation,[],[f46]) ).
fof(f185,plain,
! [X0,X1] :
( ordinal(X0)
| ~ in(X0,X1)
| ~ ordinal(X1) ),
inference(cnf_transformation,[],[f73]) ).
fof(f186,plain,
! [X0,X1] :
( in(X1,X0)
| X0 = X1
| in(X0,X1)
| ~ ordinal(X1)
| ~ ordinal(X0) ),
inference(cnf_transformation,[],[f75]) ).
fof(f187,plain,
! [X0,X1] :
( in(X0,X1)
| empty(X1)
| ~ element(X0,X1) ),
inference(cnf_transformation,[],[f77]) ).
fof(f188,plain,
ordinal(sK15),
inference(cnf_transformation,[],[f120]) ).
fof(f189,plain,
subset(sK14,sK15),
inference(cnf_transformation,[],[f120]) ).
fof(f190,plain,
empty_set != sK14,
inference(cnf_transformation,[],[f120]) ).
fof(f191,plain,
! [X2] :
( ordinal(sK16(X2))
| ~ in(X2,sK14)
| ~ ordinal(X2) ),
inference(cnf_transformation,[],[f120]) ).
fof(f192,plain,
! [X2] :
( in(sK16(X2),sK14)
| ~ in(X2,sK14)
| ~ ordinal(X2) ),
inference(cnf_transformation,[],[f120]) ).
fof(f193,plain,
! [X2] :
( ~ ordinal_subset(X2,sK16(X2))
| ~ in(X2,sK14)
| ~ ordinal(X2) ),
inference(cnf_transformation,[],[f120]) ).
fof(f195,plain,
! [X0,X1] :
( element(X0,powerset(X1))
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f121]) ).
fof(f196,plain,
! [X2,X0,X1] :
( element(X0,X2)
| ~ element(X1,powerset(X2))
| ~ in(X0,X1) ),
inference(cnf_transformation,[],[f81]) ).
fof(f197,plain,
! [X2,X0,X1] :
( ~ empty(X2)
| ~ element(X1,powerset(X2))
| ~ in(X0,X1) ),
inference(cnf_transformation,[],[f82]) ).
fof(f200,plain,
! [X0,X1] :
( in(sK17(X1),X1)
| ~ in(X0,X1) ),
inference(cnf_transformation,[],[f123]) ).
fof(f201,plain,
! [X3,X0,X1] :
( ~ in(X3,sK17(X1))
| ~ in(X3,X1)
| ~ in(X0,X1) ),
inference(cnf_transformation,[],[f123]) ).
fof(f202,plain,
! [X0,X1] :
( ~ empty(X1)
| X0 = X1
| ~ empty(X0) ),
inference(cnf_transformation,[],[f86]) ).
cnf(c_52,plain,
( ~ ordinal(X0)
| epsilon_transitive(X0) ),
inference(cnf_transformation,[],[f126]) ).
cnf(c_61,plain,
( ~ in(X0,X1)
| ~ epsilon_transitive(X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f136]) ).
cnf(c_62,plain,
element(sK1(X0),X0),
inference(cnf_transformation,[],[f139]) ).
cnf(c_73,plain,
empty(empty_set),
inference(cnf_transformation,[],[f149]) ).
cnf(c_103,plain,
( ~ subset(X0,X1)
| ~ ordinal(X0)
| ~ ordinal(X1)
| ordinal_subset(X0,X1) ),
inference(cnf_transformation,[],[f181]) ).
cnf(c_106,plain,
subset(X0,X0),
inference(cnf_transformation,[],[f183]) ).
cnf(c_108,plain,
( ~ in(X0,X1)
| ~ ordinal(X1)
| ordinal(X0) ),
inference(cnf_transformation,[],[f185]) ).
cnf(c_109,plain,
( ~ ordinal(X0)
| ~ ordinal(X1)
| X0 = X1
| in(X0,X1)
| in(X1,X0) ),
inference(cnf_transformation,[],[f186]) ).
cnf(c_110,plain,
( ~ element(X0,X1)
| in(X0,X1)
| empty(X1) ),
inference(cnf_transformation,[],[f187]) ).
cnf(c_111,negated_conjecture,
( ~ ordinal_subset(X0,sK16(X0))
| ~ in(X0,sK14)
| ~ ordinal(X0) ),
inference(cnf_transformation,[],[f193]) ).
cnf(c_112,negated_conjecture,
( ~ in(X0,sK14)
| ~ ordinal(X0)
| in(sK16(X0),sK14) ),
inference(cnf_transformation,[],[f192]) ).
cnf(c_113,negated_conjecture,
( ~ in(X0,sK14)
| ~ ordinal(X0)
| ordinal(sK16(X0)) ),
inference(cnf_transformation,[],[f191]) ).
cnf(c_114,negated_conjecture,
empty_set != sK14,
inference(cnf_transformation,[],[f190]) ).
cnf(c_115,negated_conjecture,
subset(sK14,sK15),
inference(cnf_transformation,[],[f189]) ).
cnf(c_116,negated_conjecture,
ordinal(sK15),
inference(cnf_transformation,[],[f188]) ).
cnf(c_117,plain,
( ~ subset(X0,X1)
| element(X0,powerset(X1)) ),
inference(cnf_transformation,[],[f195]) ).
cnf(c_119,plain,
( ~ element(X0,powerset(X1))
| ~ in(X2,X0)
| element(X2,X1) ),
inference(cnf_transformation,[],[f196]) ).
cnf(c_120,plain,
( ~ element(X0,powerset(X1))
| ~ in(X2,X0)
| ~ empty(X1) ),
inference(cnf_transformation,[],[f197]) ).
cnf(c_123,plain,
( ~ in(X0,sK17(X1))
| ~ in(X0,X1)
| ~ in(X2,X1) ),
inference(cnf_transformation,[],[f201]) ).
cnf(c_124,plain,
( ~ in(X0,X1)
| in(sK17(X1),X1) ),
inference(cnf_transformation,[],[f200]) ).
cnf(c_125,plain,
( ~ empty(X0)
| ~ empty(X1)
| X0 = X1 ),
inference(cnf_transformation,[],[f202]) ).
cnf(c_142,plain,
( ~ subset(X0,X1)
| element(X0,powerset(X1)) ),
inference(prop_impl_just,[status(thm)],[c_117]) ).
cnf(c_170,plain,
( ~ ordinal(X0)
| epsilon_transitive(X0) ),
inference(prop_impl_just,[status(thm)],[c_52]) ).
cnf(c_282,plain,
( ~ in(X0,X1)
| ~ subset(X1,X2)
| element(X0,X2) ),
inference(bin_hyper_res,[status(thm)],[c_119,c_142]) ).
cnf(c_283,plain,
( ~ in(X0,X1)
| ~ subset(X1,X2)
| ~ empty(X2) ),
inference(bin_hyper_res,[status(thm)],[c_120,c_142]) ).
cnf(c_585,plain,
( X0 != X1
| ~ in(X2,X0)
| ~ ordinal(X1)
| subset(X2,X0) ),
inference(resolution_lifted,[status(thm)],[c_61,c_170]) ).
cnf(c_586,plain,
( ~ in(X0,X1)
| ~ ordinal(X1)
| subset(X0,X1) ),
inference(unflattening,[status(thm)],[c_585]) ).
cnf(c_781,plain,
( X0 != X1
| X2 != X3
| ~ in(X0,X2)
| ~ ordinal(X1)
| ~ ordinal(X3)
| ~ epsilon_transitive(X2)
| ordinal_subset(X1,X3) ),
inference(resolution_lifted,[status(thm)],[c_61,c_103]) ).
cnf(c_782,plain,
( ~ in(X0,X1)
| ~ ordinal(X0)
| ~ ordinal(X1)
| ~ epsilon_transitive(X1)
| ordinal_subset(X0,X1) ),
inference(unflattening,[status(thm)],[c_781]) ).
cnf(c_783,plain,
( ~ ordinal(X1)
| ~ in(X0,X1)
| ordinal_subset(X0,X1) ),
inference(global_subsumption_just,[status(thm)],[c_782,c_108,c_103,c_586]) ).
cnf(c_784,plain,
( ~ in(X0,X1)
| ~ ordinal(X1)
| ordinal_subset(X0,X1) ),
inference(renaming,[status(thm)],[c_783]) ).
cnf(c_828,plain,
( X0 != X1
| X1 != X2
| ~ ordinal(X0)
| ~ ordinal(X2)
| ordinal_subset(X0,X2) ),
inference(resolution_lifted,[status(thm)],[c_103,c_106]) ).
cnf(c_829,plain,
( ~ ordinal(X0)
| ordinal_subset(X0,X0) ),
inference(unflattening,[status(thm)],[c_828]) ).
cnf(c_1020,plain,
( ~ ordinal(X0)
| ordinal_subset(X0,X0) ),
inference(prop_impl_just,[status(thm)],[c_829]) ).
cnf(c_1724,plain,
( X0 != X1
| ~ ordinal_subset(X2,X1)
| ordinal_subset(X2,X0) ),
theory(equality) ).
cnf(c_2476,plain,
( ~ empty(empty_set)
| ~ empty(sK14)
| empty_set = sK14 ),
inference(instantiation,[status(thm)],[c_125]) ).
cnf(c_3064,plain,
( in(sK1(X0),X0)
| empty(X0) ),
inference(superposition,[status(thm)],[c_62,c_110]) ).
cnf(c_3196,plain,
( in(sK17(X0),X0)
| empty(X0) ),
inference(superposition,[status(thm)],[c_3064,c_124]) ).
cnf(c_3785,plain,
( in(sK17(sK14),sK14)
| empty(sK14) ),
inference(instantiation,[status(thm)],[c_3196]) ).
cnf(c_3922,plain,
( ~ in(sK17(sK14),sK14)
| ~ subset(sK14,X0)
| ~ empty(X0) ),
inference(instantiation,[status(thm)],[c_283]) ).
cnf(c_4012,plain,
( ~ in(sK17(sK14),sK14)
| ~ subset(sK14,sK15)
| ~ empty(sK15) ),
inference(instantiation,[status(thm)],[c_3922]) ).
cnf(c_4898,plain,
( ~ in(X0,sK14)
| ~ ordinal(X0)
| in(sK17(sK14),sK14) ),
inference(resolution,[status(thm)],[c_124,c_112]) ).
cnf(c_4915,plain,
in(sK17(sK14),sK14),
inference(global_subsumption_just,[status(thm)],[c_4898,c_73,c_114,c_2476,c_3785]) ).
cnf(c_5311,plain,
( ~ in(X0,sK14)
| element(X0,sK15) ),
inference(resolution,[status(thm)],[c_282,c_115]) ).
cnf(c_5374,plain,
( ~ in(X0,sK14)
| in(X0,sK15)
| empty(sK15) ),
inference(resolution,[status(thm)],[c_5311,c_110]) ).
cnf(c_5510,plain,
( ~ in(X0,X1)
| ~ ordinal(X0)
| ~ ordinal(X1)
| ~ epsilon_transitive(X1)
| ordinal_subset(X0,X1) ),
inference(resolution,[status(thm)],[c_103,c_61]) ).
cnf(c_5741,plain,
( in(X0,sK15)
| ~ in(X0,sK14) ),
inference(global_subsumption_just,[status(thm)],[c_5374,c_73,c_115,c_114,c_2476,c_3785,c_4012,c_5374]) ).
cnf(c_5742,plain,
( ~ in(X0,sK14)
| in(X0,sK15) ),
inference(renaming,[status(thm)],[c_5741]) ).
cnf(c_5754,plain,
( ~ in(X0,sK14)
| ~ ordinal(sK15)
| ordinal(X0) ),
inference(resolution,[status(thm)],[c_5742,c_108]) ).
cnf(c_5817,negated_conjecture,
( ~ in(X0,sK14)
| ordinal(sK16(X0)) ),
inference(global_subsumption_just,[status(thm)],[c_113,c_116,c_113,c_5754]) ).
cnf(c_6294,plain,
( ~ in(X0,sK14)
| ordinal(X0) ),
inference(global_subsumption_just,[status(thm)],[c_5754,c_116,c_5754]) ).
cnf(c_6310,plain,
( ~ in(X0,sK14)
| in(sK16(X0),sK14) ),
inference(backward_subsumption_resolution,[status(thm)],[c_112,c_6294]) ).
cnf(c_6312,plain,
( ~ ordinal_subset(X0,sK16(X0))
| ~ in(X0,sK14) ),
inference(backward_subsumption_resolution,[status(thm)],[c_111,c_6294]) ).
cnf(c_6594,plain,
( ~ ordinal_subset(X0,X1)
| ~ ordinal(X1)
| ~ ordinal(X2)
| in(X1,X2)
| in(X2,X1)
| ordinal_subset(X0,X2) ),
inference(resolution,[status(thm)],[c_109,c_1724]) ).
cnf(c_10104,plain,
( ~ ordinal(X1)
| ~ in(X0,X1)
| ordinal_subset(X0,X1) ),
inference(global_subsumption_just,[status(thm)],[c_5510,c_784]) ).
cnf(c_10105,plain,
( ~ in(X0,X1)
| ~ ordinal(X1)
| ordinal_subset(X0,X1) ),
inference(renaming,[status(thm)],[c_10104]) ).
cnf(c_11226,plain,
( ~ ordinal(X0)
| ~ ordinal(X1)
| in(X0,X1)
| in(X1,X0)
| ordinal_subset(X0,X1) ),
inference(resolution,[status(thm)],[c_6594,c_1020]) ).
cnf(c_15073,plain,
( ~ ordinal(X0)
| ~ ordinal(X1)
| in(X1,X0)
| ordinal_subset(X0,X1) ),
inference(backward_subsumption_resolution,[status(thm)],[c_11226,c_10105]) ).
cnf(c_15351,plain,
( ~ in(X0,sK14)
| ~ ordinal(sK16(X0))
| ~ ordinal(X0)
| in(sK16(X0),X0) ),
inference(resolution,[status(thm)],[c_15073,c_6312]) ).
cnf(c_15365,plain,
( ~ in(X0,sK14)
| in(sK16(X0),X0) ),
inference(global_subsumption_just,[status(thm)],[c_15351,c_5817,c_6294,c_15351]) ).
cnf(c_15387,plain,
( ~ in(sK16(sK17(X0)),X0)
| ~ in(sK17(X0),sK14)
| ~ in(X1,X0) ),
inference(resolution,[status(thm)],[c_15365,c_123]) ).
cnf(c_15453,plain,
( ~ in(sK17(sK14),sK14)
| ~ in(X0,sK14) ),
inference(resolution,[status(thm)],[c_15387,c_6310]) ).
cnf(c_15460,plain,
~ in(X0,sK14),
inference(global_subsumption_just,[status(thm)],[c_15453,c_73,c_114,c_2476,c_3785,c_15453]) ).
cnf(c_15466,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_4915,c_15460]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : SEU235+1 : TPTP v8.1.2. Released v3.3.0.
% 0.00/0.11 % Command : run_iprover %s %d THM
% 0.10/0.31 % Computer : n024.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 17:30:36 EDT 2024
% 0.10/0.31 % CPUTime :
% 0.16/0.42 Running first-order theorem proving
% 0.16/0.42 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 7.93/1.62 % SZS status Started for theBenchmark.p
% 7.93/1.62 % SZS status Theorem for theBenchmark.p
% 7.93/1.62
% 7.93/1.62 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 7.93/1.62
% 7.93/1.62 ------ iProver source info
% 7.93/1.62
% 7.93/1.62 git: date: 2024-05-02 19:28:25 +0000
% 7.93/1.62 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 7.93/1.62 git: non_committed_changes: false
% 7.93/1.62
% 7.93/1.62 ------ Parsing...
% 7.93/1.62 ------ Clausification by vclausify_rel & Parsing by iProver...
% 7.93/1.62
% 7.93/1.62 ------ Preprocessing... sup_sim: 0 sf_s rm: 20 0s sf_e pe_s pe:1:0s pe_e sup_sim: 0 sf_s rm: 4 0s sf_e pe_s pe_e
% 7.93/1.62
% 7.93/1.62 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 7.93/1.62
% 7.93/1.62 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 7.93/1.62 ------ Proving...
% 7.93/1.62 ------ Problem Properties
% 7.93/1.62
% 7.93/1.62
% 7.93/1.62 clauses 48
% 7.93/1.62 conjectures 6
% 7.93/1.62 EPR 38
% 7.93/1.62 Horn 44
% 7.93/1.62 unary 21
% 7.93/1.62 binary 13
% 7.93/1.62 lits 94
% 7.93/1.62 lits eq 4
% 7.93/1.62 fd_pure 0
% 7.93/1.62 fd_pseudo 0
% 7.93/1.62 fd_cond 1
% 7.93/1.62 fd_pseudo_cond 2
% 7.93/1.62 AC symbols 0
% 7.93/1.62
% 7.93/1.62 ------ Input Options Time Limit: Unbounded
% 7.93/1.62
% 7.93/1.62
% 7.93/1.62 ------
% 7.93/1.62 Current options:
% 7.93/1.62 ------
% 7.93/1.62
% 7.93/1.62
% 7.93/1.62
% 7.93/1.62
% 7.93/1.62 ------ Proving...
% 7.93/1.62
% 7.93/1.62
% 7.93/1.62 % SZS status Theorem for theBenchmark.p
% 7.93/1.62
% 7.93/1.62 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 7.93/1.62
% 7.93/1.63
%------------------------------------------------------------------------------