TSTP Solution File: SEU242+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SEU242+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n025.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:11 EDT 2024
% Result : Theorem 3.46s 1.10s
% Output : CNFRefutation 3.46s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named definition)
% Comments :
%------------------------------------------------------------------------------
fof(f4,axiom,
! [X0,X1] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_k2_tarski) ).
fof(f6,axiom,
! [X0] :
( relation(X0)
=> ( connected(X0)
<=> is_connected_in(X0,relation_field(X0)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d14_relat_2) ).
fof(f7,axiom,
! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(unordered_pair(X0,X1),singleton(X0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d5_tarski) ).
fof(f9,axiom,
! [X0] :
( relation(X0)
=> ! [X1] :
( is_connected_in(X0,X1)
<=> ! [X2,X3] :
~ ( ~ in(ordered_pair(X3,X2),X0)
& ~ in(ordered_pair(X2,X3),X0)
& X2 != X3
& in(X3,X1)
& in(X2,X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d6_relat_2) ).
fof(f25,conjecture,
! [X0] :
( relation(X0)
=> ( connected(X0)
<=> ! [X1,X2] :
~ ( ~ in(ordered_pair(X2,X1),X0)
& ~ in(ordered_pair(X1,X2),X0)
& X1 != X2
& in(X2,relation_field(X0))
& in(X1,relation_field(X0)) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l4_wellord1) ).
fof(f26,negated_conjecture,
~ ! [X0] :
( relation(X0)
=> ( connected(X0)
<=> ! [X1,X2] :
~ ( ~ in(ordered_pair(X2,X1),X0)
& ~ in(ordered_pair(X1,X2),X0)
& X1 != X2
& in(X2,relation_field(X0))
& in(X1,relation_field(X0)) ) ) ),
inference(negated_conjecture,[],[f25]) ).
fof(f45,plain,
! [X0] :
( ( connected(X0)
<=> is_connected_in(X0,relation_field(X0)) )
| ~ relation(X0) ),
inference(ennf_transformation,[],[f6]) ).
fof(f47,plain,
! [X0] :
( ! [X1] :
( is_connected_in(X0,X1)
<=> ! [X2,X3] :
( in(ordered_pair(X3,X2),X0)
| in(ordered_pair(X2,X3),X0)
| X2 = X3
| ~ in(X3,X1)
| ~ in(X2,X1) ) )
| ~ relation(X0) ),
inference(ennf_transformation,[],[f9]) ).
fof(f50,plain,
? [X0] :
( ( connected(X0)
<~> ! [X1,X2] :
( in(ordered_pair(X2,X1),X0)
| in(ordered_pair(X1,X2),X0)
| X1 = X2
| ~ in(X2,relation_field(X0))
| ~ in(X1,relation_field(X0)) ) )
& relation(X0) ),
inference(ennf_transformation,[],[f26]) ).
fof(f57,plain,
! [X0] :
( ( ( connected(X0)
| ~ is_connected_in(X0,relation_field(X0)) )
& ( is_connected_in(X0,relation_field(X0))
| ~ connected(X0) ) )
| ~ relation(X0) ),
inference(nnf_transformation,[],[f45]) ).
fof(f58,plain,
! [X0] :
( ! [X1] :
( ( is_connected_in(X0,X1)
| ? [X2,X3] :
( ~ in(ordered_pair(X3,X2),X0)
& ~ in(ordered_pair(X2,X3),X0)
& X2 != X3
& in(X3,X1)
& in(X2,X1) ) )
& ( ! [X2,X3] :
( in(ordered_pair(X3,X2),X0)
| in(ordered_pair(X2,X3),X0)
| X2 = X3
| ~ in(X3,X1)
| ~ in(X2,X1) )
| ~ is_connected_in(X0,X1) ) )
| ~ relation(X0) ),
inference(nnf_transformation,[],[f47]) ).
fof(f59,plain,
! [X0] :
( ! [X1] :
( ( is_connected_in(X0,X1)
| ? [X2,X3] :
( ~ in(ordered_pair(X3,X2),X0)
& ~ in(ordered_pair(X2,X3),X0)
& X2 != X3
& in(X3,X1)
& in(X2,X1) ) )
& ( ! [X4,X5] :
( in(ordered_pair(X5,X4),X0)
| in(ordered_pair(X4,X5),X0)
| X4 = X5
| ~ in(X5,X1)
| ~ in(X4,X1) )
| ~ is_connected_in(X0,X1) ) )
| ~ relation(X0) ),
inference(rectify,[],[f58]) ).
fof(f60,plain,
! [X0,X1] :
( ? [X2,X3] :
( ~ in(ordered_pair(X3,X2),X0)
& ~ in(ordered_pair(X2,X3),X0)
& X2 != X3
& in(X3,X1)
& in(X2,X1) )
=> ( ~ in(ordered_pair(sK1(X0,X1),sK0(X0,X1)),X0)
& ~ in(ordered_pair(sK0(X0,X1),sK1(X0,X1)),X0)
& sK0(X0,X1) != sK1(X0,X1)
& in(sK1(X0,X1),X1)
& in(sK0(X0,X1),X1) ) ),
introduced(choice_axiom,[]) ).
fof(f61,plain,
! [X0] :
( ! [X1] :
( ( is_connected_in(X0,X1)
| ( ~ in(ordered_pair(sK1(X0,X1),sK0(X0,X1)),X0)
& ~ in(ordered_pair(sK0(X0,X1),sK1(X0,X1)),X0)
& sK0(X0,X1) != sK1(X0,X1)
& in(sK1(X0,X1),X1)
& in(sK0(X0,X1),X1) ) )
& ( ! [X4,X5] :
( in(ordered_pair(X5,X4),X0)
| in(ordered_pair(X4,X5),X0)
| X4 = X5
| ~ in(X5,X1)
| ~ in(X4,X1) )
| ~ is_connected_in(X0,X1) ) )
| ~ relation(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f59,f60]) ).
fof(f64,plain,
? [X0] :
( ( ? [X1,X2] :
( ~ in(ordered_pair(X2,X1),X0)
& ~ in(ordered_pair(X1,X2),X0)
& X1 != X2
& in(X2,relation_field(X0))
& in(X1,relation_field(X0)) )
| ~ connected(X0) )
& ( ! [X1,X2] :
( in(ordered_pair(X2,X1),X0)
| in(ordered_pair(X1,X2),X0)
| X1 = X2
| ~ in(X2,relation_field(X0))
| ~ in(X1,relation_field(X0)) )
| connected(X0) )
& relation(X0) ),
inference(nnf_transformation,[],[f50]) ).
fof(f65,plain,
? [X0] :
( ( ? [X1,X2] :
( ~ in(ordered_pair(X2,X1),X0)
& ~ in(ordered_pair(X1,X2),X0)
& X1 != X2
& in(X2,relation_field(X0))
& in(X1,relation_field(X0)) )
| ~ connected(X0) )
& ( ! [X1,X2] :
( in(ordered_pair(X2,X1),X0)
| in(ordered_pair(X1,X2),X0)
| X1 = X2
| ~ in(X2,relation_field(X0))
| ~ in(X1,relation_field(X0)) )
| connected(X0) )
& relation(X0) ),
inference(flattening,[],[f64]) ).
fof(f66,plain,
? [X0] :
( ( ? [X1,X2] :
( ~ in(ordered_pair(X2,X1),X0)
& ~ in(ordered_pair(X1,X2),X0)
& X1 != X2
& in(X2,relation_field(X0))
& in(X1,relation_field(X0)) )
| ~ connected(X0) )
& ( ! [X3,X4] :
( in(ordered_pair(X4,X3),X0)
| in(ordered_pair(X3,X4),X0)
| X3 = X4
| ~ in(X4,relation_field(X0))
| ~ in(X3,relation_field(X0)) )
| connected(X0) )
& relation(X0) ),
inference(rectify,[],[f65]) ).
fof(f67,plain,
( ? [X0] :
( ( ? [X1,X2] :
( ~ in(ordered_pair(X2,X1),X0)
& ~ in(ordered_pair(X1,X2),X0)
& X1 != X2
& in(X2,relation_field(X0))
& in(X1,relation_field(X0)) )
| ~ connected(X0) )
& ( ! [X3,X4] :
( in(ordered_pair(X4,X3),X0)
| in(ordered_pair(X3,X4),X0)
| X3 = X4
| ~ in(X4,relation_field(X0))
| ~ in(X3,relation_field(X0)) )
| connected(X0) )
& relation(X0) )
=> ( ( ? [X2,X1] :
( ~ in(ordered_pair(X2,X1),sK3)
& ~ in(ordered_pair(X1,X2),sK3)
& X1 != X2
& in(X2,relation_field(sK3))
& in(X1,relation_field(sK3)) )
| ~ connected(sK3) )
& ( ! [X4,X3] :
( in(ordered_pair(X4,X3),sK3)
| in(ordered_pair(X3,X4),sK3)
| X3 = X4
| ~ in(X4,relation_field(sK3))
| ~ in(X3,relation_field(sK3)) )
| connected(sK3) )
& relation(sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f68,plain,
( ? [X2,X1] :
( ~ in(ordered_pair(X2,X1),sK3)
& ~ in(ordered_pair(X1,X2),sK3)
& X1 != X2
& in(X2,relation_field(sK3))
& in(X1,relation_field(sK3)) )
=> ( ~ in(ordered_pair(sK5,sK4),sK3)
& ~ in(ordered_pair(sK4,sK5),sK3)
& sK4 != sK5
& in(sK5,relation_field(sK3))
& in(sK4,relation_field(sK3)) ) ),
introduced(choice_axiom,[]) ).
fof(f69,plain,
( ( ( ~ in(ordered_pair(sK5,sK4),sK3)
& ~ in(ordered_pair(sK4,sK5),sK3)
& sK4 != sK5
& in(sK5,relation_field(sK3))
& in(sK4,relation_field(sK3)) )
| ~ connected(sK3) )
& ( ! [X3,X4] :
( in(ordered_pair(X4,X3),sK3)
| in(ordered_pair(X3,X4),sK3)
| X3 = X4
| ~ in(X4,relation_field(sK3))
| ~ in(X3,relation_field(sK3)) )
| connected(sK3) )
& relation(sK3) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3,sK4,sK5])],[f66,f68,f67]) ).
fof(f84,plain,
! [X0,X1] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
inference(cnf_transformation,[],[f4]) ).
fof(f86,plain,
! [X0] :
( is_connected_in(X0,relation_field(X0))
| ~ connected(X0)
| ~ relation(X0) ),
inference(cnf_transformation,[],[f57]) ).
fof(f87,plain,
! [X0] :
( connected(X0)
| ~ is_connected_in(X0,relation_field(X0))
| ~ relation(X0) ),
inference(cnf_transformation,[],[f57]) ).
fof(f88,plain,
! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(unordered_pair(X0,X1),singleton(X0)),
inference(cnf_transformation,[],[f7]) ).
fof(f90,plain,
! [X0,X1,X4,X5] :
( in(ordered_pair(X5,X4),X0)
| in(ordered_pair(X4,X5),X0)
| X4 = X5
| ~ in(X5,X1)
| ~ in(X4,X1)
| ~ is_connected_in(X0,X1)
| ~ relation(X0) ),
inference(cnf_transformation,[],[f61]) ).
fof(f91,plain,
! [X0,X1] :
( is_connected_in(X0,X1)
| in(sK0(X0,X1),X1)
| ~ relation(X0) ),
inference(cnf_transformation,[],[f61]) ).
fof(f92,plain,
! [X0,X1] :
( is_connected_in(X0,X1)
| in(sK1(X0,X1),X1)
| ~ relation(X0) ),
inference(cnf_transformation,[],[f61]) ).
fof(f93,plain,
! [X0,X1] :
( is_connected_in(X0,X1)
| sK0(X0,X1) != sK1(X0,X1)
| ~ relation(X0) ),
inference(cnf_transformation,[],[f61]) ).
fof(f94,plain,
! [X0,X1] :
( is_connected_in(X0,X1)
| ~ in(ordered_pair(sK0(X0,X1),sK1(X0,X1)),X0)
| ~ relation(X0) ),
inference(cnf_transformation,[],[f61]) ).
fof(f95,plain,
! [X0,X1] :
( is_connected_in(X0,X1)
| ~ in(ordered_pair(sK1(X0,X1),sK0(X0,X1)),X0)
| ~ relation(X0) ),
inference(cnf_transformation,[],[f61]) ).
fof(f102,plain,
relation(sK3),
inference(cnf_transformation,[],[f69]) ).
fof(f103,plain,
! [X3,X4] :
( in(ordered_pair(X4,X3),sK3)
| in(ordered_pair(X3,X4),sK3)
| X3 = X4
| ~ in(X4,relation_field(sK3))
| ~ in(X3,relation_field(sK3))
| connected(sK3) ),
inference(cnf_transformation,[],[f69]) ).
fof(f104,plain,
( in(sK4,relation_field(sK3))
| ~ connected(sK3) ),
inference(cnf_transformation,[],[f69]) ).
fof(f105,plain,
( in(sK5,relation_field(sK3))
| ~ connected(sK3) ),
inference(cnf_transformation,[],[f69]) ).
fof(f106,plain,
( sK4 != sK5
| ~ connected(sK3) ),
inference(cnf_transformation,[],[f69]) ).
fof(f107,plain,
( ~ in(ordered_pair(sK4,sK5),sK3)
| ~ connected(sK3) ),
inference(cnf_transformation,[],[f69]) ).
fof(f108,plain,
( ~ in(ordered_pair(sK5,sK4),sK3)
| ~ connected(sK3) ),
inference(cnf_transformation,[],[f69]) ).
fof(f124,plain,
! [X0,X1] :
( is_connected_in(X0,X1)
| ~ in(unordered_pair(unordered_pair(sK1(X0,X1),sK0(X0,X1)),singleton(sK1(X0,X1))),X0)
| ~ relation(X0) ),
inference(definition_unfolding,[],[f95,f88]) ).
fof(f125,plain,
! [X0,X1] :
( is_connected_in(X0,X1)
| ~ in(unordered_pair(unordered_pair(sK0(X0,X1),sK1(X0,X1)),singleton(sK0(X0,X1))),X0)
| ~ relation(X0) ),
inference(definition_unfolding,[],[f94,f88]) ).
fof(f126,plain,
! [X0,X1,X4,X5] :
( in(unordered_pair(unordered_pair(X5,X4),singleton(X5)),X0)
| in(unordered_pair(unordered_pair(X4,X5),singleton(X4)),X0)
| X4 = X5
| ~ in(X5,X1)
| ~ in(X4,X1)
| ~ is_connected_in(X0,X1)
| ~ relation(X0) ),
inference(definition_unfolding,[],[f90,f88,f88]) ).
fof(f128,plain,
( ~ in(unordered_pair(unordered_pair(sK5,sK4),singleton(sK5)),sK3)
| ~ connected(sK3) ),
inference(definition_unfolding,[],[f108,f88]) ).
fof(f129,plain,
( ~ in(unordered_pair(unordered_pair(sK4,sK5),singleton(sK4)),sK3)
| ~ connected(sK3) ),
inference(definition_unfolding,[],[f107,f88]) ).
fof(f130,plain,
! [X3,X4] :
( in(unordered_pair(unordered_pair(X4,X3),singleton(X4)),sK3)
| in(unordered_pair(unordered_pair(X3,X4),singleton(X3)),sK3)
| X3 = X4
| ~ in(X4,relation_field(sK3))
| ~ in(X3,relation_field(sK3))
| connected(sK3) ),
inference(definition_unfolding,[],[f103,f88,f88]) ).
cnf(c_51,plain,
unordered_pair(X0,X1) = unordered_pair(X1,X0),
inference(cnf_transformation,[],[f84]) ).
cnf(c_53,plain,
( ~ is_connected_in(X0,relation_field(X0))
| ~ relation(X0)
| connected(X0) ),
inference(cnf_transformation,[],[f87]) ).
cnf(c_54,plain,
( ~ connected(X0)
| ~ relation(X0)
| is_connected_in(X0,relation_field(X0)) ),
inference(cnf_transformation,[],[f86]) ).
cnf(c_56,plain,
( ~ in(unordered_pair(unordered_pair(sK1(X0,X1),sK0(X0,X1)),singleton(sK1(X0,X1))),X0)
| ~ relation(X0)
| is_connected_in(X0,X1) ),
inference(cnf_transformation,[],[f124]) ).
cnf(c_57,plain,
( ~ in(unordered_pair(unordered_pair(sK0(X0,X1),sK1(X0,X1)),singleton(sK0(X0,X1))),X0)
| ~ relation(X0)
| is_connected_in(X0,X1) ),
inference(cnf_transformation,[],[f125]) ).
cnf(c_58,plain,
( sK1(X0,X1) != sK0(X0,X1)
| ~ relation(X0)
| is_connected_in(X0,X1) ),
inference(cnf_transformation,[],[f93]) ).
cnf(c_59,plain,
( ~ relation(X0)
| in(sK1(X0,X1),X1)
| is_connected_in(X0,X1) ),
inference(cnf_transformation,[],[f92]) ).
cnf(c_60,plain,
( ~ relation(X0)
| in(sK0(X0,X1),X1)
| is_connected_in(X0,X1) ),
inference(cnf_transformation,[],[f91]) ).
cnf(c_61,plain,
( ~ in(X0,X1)
| ~ in(X2,X1)
| ~ is_connected_in(X3,X1)
| ~ relation(X3)
| X0 = X2
| in(unordered_pair(unordered_pair(X0,X2),singleton(X0)),X3)
| in(unordered_pair(unordered_pair(X2,X0),singleton(X2)),X3) ),
inference(cnf_transformation,[],[f126]) ).
cnf(c_68,negated_conjecture,
( ~ in(unordered_pair(unordered_pair(sK5,sK4),singleton(sK5)),sK3)
| ~ connected(sK3) ),
inference(cnf_transformation,[],[f128]) ).
cnf(c_69,negated_conjecture,
( ~ in(unordered_pair(unordered_pair(sK4,sK5),singleton(sK4)),sK3)
| ~ connected(sK3) ),
inference(cnf_transformation,[],[f129]) ).
cnf(c_70,negated_conjecture,
( sK5 != sK4
| ~ connected(sK3) ),
inference(cnf_transformation,[],[f106]) ).
cnf(c_71,negated_conjecture,
( ~ connected(sK3)
| in(sK5,relation_field(sK3)) ),
inference(cnf_transformation,[],[f105]) ).
cnf(c_72,negated_conjecture,
( ~ connected(sK3)
| in(sK4,relation_field(sK3)) ),
inference(cnf_transformation,[],[f104]) ).
cnf(c_73,negated_conjecture,
( ~ in(X0,relation_field(sK3))
| ~ in(X1,relation_field(sK3))
| X0 = X1
| in(unordered_pair(unordered_pair(X0,X1),singleton(X0)),sK3)
| in(unordered_pair(unordered_pair(X1,X0),singleton(X1)),sK3)
| connected(sK3) ),
inference(cnf_transformation,[],[f130]) ).
cnf(c_74,negated_conjecture,
relation(sK3),
inference(cnf_transformation,[],[f102]) ).
cnf(c_354,plain,
( ~ in(unordered_pair(singleton(sK4),unordered_pair(sK5,sK4)),sK3)
| ~ connected(sK3) ),
inference(demodulation,[status(thm)],[c_69,c_51]) ).
cnf(c_359,plain,
( ~ in(unordered_pair(singleton(sK5),unordered_pair(sK5,sK4)),sK3)
| ~ connected(sK3) ),
inference(demodulation,[status(thm)],[c_68,c_51]) ).
cnf(c_374,plain,
( ~ in(unordered_pair(singleton(sK0(X0,X1)),unordered_pair(sK1(X0,X1),sK0(X0,X1))),X0)
| ~ relation(X0)
| is_connected_in(X0,X1) ),
inference(demodulation,[status(thm)],[c_57,c_51]) ).
cnf(c_381,plain,
( ~ in(unordered_pair(singleton(sK1(X0,X1)),unordered_pair(sK1(X0,X1),sK0(X0,X1))),X0)
| ~ relation(X0)
| is_connected_in(X0,X1) ),
inference(demodulation,[status(thm)],[c_56,c_51]) ).
cnf(c_388,plain,
( ~ in(X0,relation_field(sK3))
| ~ in(X1,relation_field(sK3))
| X0 = X1
| in(unordered_pair(singleton(X0),unordered_pair(X0,X1)),sK3)
| in(unordered_pair(singleton(X1),unordered_pair(X1,X0)),sK3)
| connected(sK3) ),
inference(demodulation,[status(thm)],[c_73,c_51]) ).
cnf(c_401,plain,
( ~ in(X0,X1)
| ~ in(X2,X1)
| ~ is_connected_in(X3,X1)
| ~ relation(X3)
| X0 = X2
| in(unordered_pair(singleton(X0),unordered_pair(X0,X2)),X3)
| in(unordered_pair(singleton(X2),unordered_pair(X2,X0)),X3) ),
inference(demodulation,[status(thm)],[c_61,c_51]) ).
cnf(c_927,plain,
( X0 != sK3
| ~ in(unordered_pair(singleton(sK1(X0,X1)),unordered_pair(sK1(X0,X1),sK0(X0,X1))),X0)
| is_connected_in(X0,X1) ),
inference(resolution_lifted,[status(thm)],[c_381,c_74]) ).
cnf(c_928,plain,
( ~ in(unordered_pair(singleton(sK1(sK3,X0)),unordered_pair(sK1(sK3,X0),sK0(sK3,X0))),sK3)
| is_connected_in(sK3,X0) ),
inference(unflattening,[status(thm)],[c_927]) ).
cnf(c_963,plain,
( sK1(X0,X1) != sK0(X0,X1)
| X0 != sK3
| is_connected_in(X0,X1) ),
inference(resolution_lifted,[status(thm)],[c_58,c_74]) ).
cnf(c_964,plain,
( sK1(sK3,X0) != sK0(sK3,X0)
| is_connected_in(sK3,X0) ),
inference(unflattening,[status(thm)],[c_963]) ).
cnf(c_2510,plain,
relation_field(sK3) = sP0_iProver_def,
definition ).
cnf(c_2511,negated_conjecture,
relation(sK3),
inference(demodulation,[status(thm)],[c_74]) ).
cnf(c_2512,negated_conjecture,
( ~ connected(sK3)
| in(sK4,sP0_iProver_def) ),
inference(demodulation,[status(thm)],[c_72,c_2510]) ).
cnf(c_2513,negated_conjecture,
( ~ connected(sK3)
| in(sK5,sP0_iProver_def) ),
inference(demodulation,[status(thm)],[c_71]) ).
cnf(c_2971,plain,
( ~ in(X0,sP0_iProver_def)
| ~ in(X1,sP0_iProver_def)
| X0 = X1
| in(unordered_pair(singleton(X0),unordered_pair(X0,X1)),sK3)
| in(unordered_pair(singleton(X1),unordered_pair(X1,X0)),sK3)
| connected(sK3) ),
inference(light_normalisation,[status(thm)],[c_388,c_2510]) ).
cnf(c_3037,plain,
( ~ in(X0,sP0_iProver_def)
| ~ in(X1,sP0_iProver_def)
| X0 = X1
| in(unordered_pair(singleton(X0),unordered_pair(X1,X0)),sK3)
| in(unordered_pair(singleton(X1),unordered_pair(X1,X0)),sK3)
| connected(sK3) ),
inference(superposition,[status(thm)],[c_51,c_2971]) ).
cnf(c_3086,plain,
( ~ is_connected_in(sK3,sP0_iProver_def)
| ~ relation(sK3)
| connected(sK3) ),
inference(superposition,[status(thm)],[c_2510,c_53]) ).
cnf(c_3087,plain,
( ~ is_connected_in(sK3,sP0_iProver_def)
| connected(sK3) ),
inference(forward_subsumption_resolution,[status(thm)],[c_3086,c_2511]) ).
cnf(c_3149,plain,
( ~ in(X0,sP0_iProver_def)
| ~ in(X1,sP0_iProver_def)
| X0 = X1
| in(unordered_pair(singleton(X0),unordered_pair(X1,X0)),sK3)
| in(unordered_pair(singleton(X1),unordered_pair(X0,X1)),sK3)
| connected(sK3) ),
inference(superposition,[status(thm)],[c_51,c_3037]) ).
cnf(c_3255,plain,
( ~ connected(sK3)
| ~ relation(sK3)
| is_connected_in(sK3,sP0_iProver_def) ),
inference(superposition,[status(thm)],[c_2510,c_54]) ).
cnf(c_3257,plain,
( ~ connected(sK3)
| is_connected_in(sK3,sP0_iProver_def) ),
inference(forward_subsumption_resolution,[status(thm)],[c_3255,c_2511]) ).
cnf(c_3486,plain,
( ~ in(sK1(sK3,X0),sP0_iProver_def)
| ~ in(sK0(sK3,X0),sP0_iProver_def)
| ~ relation(sK3)
| sK1(sK3,X0) = sK0(sK3,X0)
| in(unordered_pair(singleton(sK1(sK3,X0)),unordered_pair(sK1(sK3,X0),sK0(sK3,X0))),sK3)
| is_connected_in(sK3,X0)
| connected(sK3) ),
inference(superposition,[status(thm)],[c_3037,c_374]) ).
cnf(c_3487,plain,
( ~ in(sK1(sK3,X0),sP0_iProver_def)
| ~ in(sK0(sK3,X0),sP0_iProver_def)
| ~ relation(sK3)
| sK1(sK3,X0) = sK0(sK3,X0)
| in(unordered_pair(singleton(sK1(sK3,X0)),unordered_pair(sK0(sK3,X0),sK1(sK3,X0))),sK3)
| is_connected_in(sK3,X0)
| connected(sK3) ),
inference(superposition,[status(thm)],[c_3149,c_374]) ).
cnf(c_3488,plain,
( ~ in(sK1(sK3,X0),sP0_iProver_def)
| ~ in(sK0(sK3,X0),sP0_iProver_def)
| sK1(sK3,X0) = sK0(sK3,X0)
| in(unordered_pair(singleton(sK1(sK3,X0)),unordered_pair(sK0(sK3,X0),sK1(sK3,X0))),sK3)
| is_connected_in(sK3,X0)
| connected(sK3) ),
inference(forward_subsumption_resolution,[status(thm)],[c_3487,c_2511]) ).
cnf(c_3495,plain,
( ~ in(sK1(sK3,X0),sP0_iProver_def)
| ~ in(sK0(sK3,X0),sP0_iProver_def)
| sK1(sK3,X0) = sK0(sK3,X0)
| in(unordered_pair(singleton(sK1(sK3,X0)),unordered_pair(sK1(sK3,X0),sK0(sK3,X0))),sK3)
| is_connected_in(sK3,X0)
| connected(sK3) ),
inference(forward_subsumption_resolution,[status(thm)],[c_3486,c_2511]) ).
cnf(c_3566,plain,
( ~ in(X0,sP0_iProver_def)
| ~ is_connected_in(X1,sP0_iProver_def)
| ~ relation(X1)
| ~ connected(sK3)
| X0 = sK4
| in(unordered_pair(singleton(X0),unordered_pair(X0,sK4)),X1)
| in(unordered_pair(singleton(sK4),unordered_pair(sK4,X0)),X1) ),
inference(superposition,[status(thm)],[c_2512,c_401]) ).
cnf(c_3738,plain,
( ~ in(sK5,sP0_iProver_def)
| ~ is_connected_in(sK3,sP0_iProver_def)
| ~ connected(sK3)
| ~ relation(sK3)
| sK5 = sK4
| in(unordered_pair(singleton(sK4),unordered_pair(sK4,sK5)),sK3) ),
inference(superposition,[status(thm)],[c_3566,c_359]) ).
cnf(c_3746,plain,
( ~ in(sK5,sP0_iProver_def)
| ~ is_connected_in(sK3,sP0_iProver_def)
| ~ connected(sK3)
| sK5 = sK4
| in(unordered_pair(singleton(sK4),unordered_pair(sK4,sK5)),sK3) ),
inference(forward_subsumption_resolution,[status(thm)],[c_3738,c_2511]) ).
cnf(c_3854,plain,
( ~ connected(sK3)
| in(unordered_pair(singleton(sK4),unordered_pair(sK4,sK5)),sK3) ),
inference(global_subsumption_just,[status(thm)],[c_3746,c_70,c_2513,c_3257,c_3746]) ).
cnf(c_3856,plain,
( ~ connected(sK3)
| in(unordered_pair(singleton(sK4),unordered_pair(sK5,sK4)),sK3) ),
inference(demodulation,[status(thm)],[c_3854,c_51]) ).
cnf(c_3859,plain,
~ connected(sK3),
inference(forward_subsumption_resolution,[status(thm)],[c_3856,c_354]) ).
cnf(c_3870,plain,
~ is_connected_in(sK3,sP0_iProver_def),
inference(backward_subsumption_resolution,[status(thm)],[c_3087,c_3859]) ).
cnf(c_3938,plain,
( is_connected_in(sK3,X0)
| ~ in(sK0(sK3,X0),sP0_iProver_def)
| ~ in(sK1(sK3,X0),sP0_iProver_def) ),
inference(global_subsumption_just,[status(thm)],[c_3488,c_928,c_964,c_3257,c_3495,c_3870]) ).
cnf(c_3939,plain,
( ~ in(sK1(sK3,X0),sP0_iProver_def)
| ~ in(sK0(sK3,X0),sP0_iProver_def)
| is_connected_in(sK3,X0) ),
inference(renaming,[status(thm)],[c_3938]) ).
cnf(c_3947,plain,
( ~ in(sK1(sK3,sP0_iProver_def),sP0_iProver_def)
| ~ relation(sK3)
| is_connected_in(sK3,sP0_iProver_def) ),
inference(superposition,[status(thm)],[c_60,c_3939]) ).
cnf(c_3948,plain,
( ~ in(sK1(sK3,sP0_iProver_def),sP0_iProver_def)
| is_connected_in(sK3,sP0_iProver_def) ),
inference(forward_subsumption_resolution,[status(thm)],[c_3947,c_2511]) ).
cnf(c_3951,plain,
~ in(sK1(sK3,sP0_iProver_def),sP0_iProver_def),
inference(global_subsumption_just,[status(thm)],[c_3948,c_3870,c_3948]) ).
cnf(c_3953,plain,
( ~ relation(sK3)
| is_connected_in(sK3,sP0_iProver_def) ),
inference(superposition,[status(thm)],[c_59,c_3951]) ).
cnf(c_3954,plain,
is_connected_in(sK3,sP0_iProver_def),
inference(forward_subsumption_resolution,[status(thm)],[c_3953,c_2511]) ).
cnf(c_3955,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_3954,c_3870]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.09 % Problem : SEU242+1 : TPTP v8.1.2. Released v3.3.0.
% 0.05/0.09 % Command : run_iprover %s %d THM
% 0.09/0.29 % Computer : n025.cluster.edu
% 0.09/0.29 % Model : x86_64 x86_64
% 0.09/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.29 % Memory : 8042.1875MB
% 0.09/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.29 % CPULimit : 300
% 0.09/0.29 % WCLimit : 300
% 0.09/0.29 % DateTime : Thu May 2 18:00:28 EDT 2024
% 0.09/0.29 % CPUTime :
% 0.13/0.40 Running first-order theorem proving
% 0.13/0.40 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
% 3.46/1.10 % SZS status Started for theBenchmark.p
% 3.46/1.10 % SZS status Theorem for theBenchmark.p
% 3.46/1.10
% 3.46/1.10 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 3.46/1.10
% 3.46/1.10 ------ iProver source info
% 3.46/1.10
% 3.46/1.10 git: date: 2024-05-02 19:28:25 +0000
% 3.46/1.10 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 3.46/1.10 git: non_committed_changes: false
% 3.46/1.10
% 3.46/1.10 ------ Parsing...
% 3.46/1.10 ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.46/1.10
% 3.46/1.10 ------ Preprocessing... sup_sim: 7 sf_s rm: 6 0s sf_e pe_s pe:1:0s pe_e sup_sim: 0 sf_s rm: 3 0s sf_e pe_s pe_e
% 3.46/1.10
% 3.46/1.10 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.46/1.10
% 3.46/1.10 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.46/1.10 ------ Proving...
% 3.46/1.10 ------ Problem Properties
% 3.46/1.10
% 3.46/1.10
% 3.46/1.10 clauses 36
% 3.46/1.10 conjectures 4
% 3.46/1.10 EPR 15
% 3.46/1.10 Horn 31
% 3.46/1.10 unary 14
% 3.46/1.10 binary 12
% 3.46/1.10 lits 75
% 3.46/1.10 lits eq 12
% 3.46/1.10 fd_pure 0
% 3.46/1.10 fd_pseudo 0
% 3.46/1.10 fd_cond 1
% 3.46/1.10 fd_pseudo_cond 3
% 3.46/1.10 AC symbols 0
% 3.46/1.10
% 3.46/1.10 ------ Schedule dynamic 5 is on
% 3.46/1.10
% 3.46/1.10 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.46/1.10
% 3.46/1.10
% 3.46/1.10 ------
% 3.46/1.10 Current options:
% 3.46/1.10 ------
% 3.46/1.10
% 3.46/1.10
% 3.46/1.10
% 3.46/1.10
% 3.46/1.10 ------ Proving...
% 3.46/1.10
% 3.46/1.10
% 3.46/1.10 % SZS status Theorem for theBenchmark.p
% 3.46/1.10
% 3.46/1.10 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.46/1.10
% 3.46/1.10
%------------------------------------------------------------------------------