TSTP Solution File: SET944+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SET944+1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n021.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:10:46 EDT 2023
% Result : Theorem 3.47s 1.17s
% Output : CNFRefutation 3.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 10
% Syntax : Number of formulae : 65 ( 9 unt; 0 def)
% Number of atoms : 267 ( 26 equ)
% Maximal formula atoms : 14 ( 4 avg)
% Number of connectives : 336 ( 134 ~; 132 |; 57 &)
% ( 6 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 6 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 2 con; 0-3 aty)
% Number of variables : 165 ( 2 sgn; 112 !; 23 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X0)
=> in(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_tarski) ).
fof(f4,axiom,
! [X0,X1,X2] :
( set_intersection2(X0,X1) = X2
<=> ! [X3] :
( in(X3,X2)
<=> ( in(X3,X1)
& in(X3,X0) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_xboole_0) ).
fof(f5,axiom,
! [X0,X1] :
( union(X0) = X1
<=> ! [X2] :
( in(X2,X1)
<=> ? [X3] :
( in(X3,X0)
& in(X2,X3) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d4_tarski) ).
fof(f10,conjecture,
! [X0,X1] : subset(union(set_intersection2(X0,X1)),set_intersection2(union(X0),union(X1))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t97_zfmisc_1) ).
fof(f11,negated_conjecture,
~ ! [X0,X1] : subset(union(set_intersection2(X0,X1)),set_intersection2(union(X0),union(X1))),
inference(negated_conjecture,[],[f10]) ).
fof(f15,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) ) ),
inference(ennf_transformation,[],[f3]) ).
fof(f16,plain,
? [X0,X1] : ~ subset(union(set_intersection2(X0,X1)),set_intersection2(union(X0),union(X1))),
inference(ennf_transformation,[],[f11]) ).
fof(f17,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ? [X2] :
( ~ in(X2,X1)
& in(X2,X0) ) )
& ( ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) )
| ~ subset(X0,X1) ) ),
inference(nnf_transformation,[],[f15]) ).
fof(f18,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ? [X2] :
( ~ in(X2,X1)
& in(X2,X0) ) )
& ( ! [X3] :
( in(X3,X1)
| ~ in(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(rectify,[],[f17]) ).
fof(f19,plain,
! [X0,X1] :
( ? [X2] :
( ~ in(X2,X1)
& in(X2,X0) )
=> ( ~ in(sK0(X0,X1),X1)
& in(sK0(X0,X1),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f20,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ( ~ in(sK0(X0,X1),X1)
& in(sK0(X0,X1),X0) ) )
& ( ! [X3] :
( in(X3,X1)
| ~ in(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f18,f19]) ).
fof(f21,plain,
! [X0,X1,X2] :
( ( set_intersection2(X0,X1) = X2
| ? [X3] :
( ( ~ in(X3,X1)
| ~ in(X3,X0)
| ~ in(X3,X2) )
& ( ( in(X3,X1)
& in(X3,X0) )
| in(X3,X2) ) ) )
& ( ! [X3] :
( ( in(X3,X2)
| ~ in(X3,X1)
| ~ in(X3,X0) )
& ( ( in(X3,X1)
& in(X3,X0) )
| ~ in(X3,X2) ) )
| set_intersection2(X0,X1) != X2 ) ),
inference(nnf_transformation,[],[f4]) ).
fof(f22,plain,
! [X0,X1,X2] :
( ( set_intersection2(X0,X1) = X2
| ? [X3] :
( ( ~ in(X3,X1)
| ~ in(X3,X0)
| ~ in(X3,X2) )
& ( ( in(X3,X1)
& in(X3,X0) )
| in(X3,X2) ) ) )
& ( ! [X3] :
( ( in(X3,X2)
| ~ in(X3,X1)
| ~ in(X3,X0) )
& ( ( in(X3,X1)
& in(X3,X0) )
| ~ in(X3,X2) ) )
| set_intersection2(X0,X1) != X2 ) ),
inference(flattening,[],[f21]) ).
fof(f23,plain,
! [X0,X1,X2] :
( ( set_intersection2(X0,X1) = X2
| ? [X3] :
( ( ~ in(X3,X1)
| ~ in(X3,X0)
| ~ in(X3,X2) )
& ( ( in(X3,X1)
& in(X3,X0) )
| in(X3,X2) ) ) )
& ( ! [X4] :
( ( in(X4,X2)
| ~ in(X4,X1)
| ~ in(X4,X0) )
& ( ( in(X4,X1)
& in(X4,X0) )
| ~ in(X4,X2) ) )
| set_intersection2(X0,X1) != X2 ) ),
inference(rectify,[],[f22]) ).
fof(f24,plain,
! [X0,X1,X2] :
( ? [X3] :
( ( ~ in(X3,X1)
| ~ in(X3,X0)
| ~ in(X3,X2) )
& ( ( in(X3,X1)
& in(X3,X0) )
| in(X3,X2) ) )
=> ( ( ~ in(sK1(X0,X1,X2),X1)
| ~ in(sK1(X0,X1,X2),X0)
| ~ in(sK1(X0,X1,X2),X2) )
& ( ( in(sK1(X0,X1,X2),X1)
& in(sK1(X0,X1,X2),X0) )
| in(sK1(X0,X1,X2),X2) ) ) ),
introduced(choice_axiom,[]) ).
fof(f25,plain,
! [X0,X1,X2] :
( ( set_intersection2(X0,X1) = X2
| ( ( ~ in(sK1(X0,X1,X2),X1)
| ~ in(sK1(X0,X1,X2),X0)
| ~ in(sK1(X0,X1,X2),X2) )
& ( ( in(sK1(X0,X1,X2),X1)
& in(sK1(X0,X1,X2),X0) )
| in(sK1(X0,X1,X2),X2) ) ) )
& ( ! [X4] :
( ( in(X4,X2)
| ~ in(X4,X1)
| ~ in(X4,X0) )
& ( ( in(X4,X1)
& in(X4,X0) )
| ~ in(X4,X2) ) )
| set_intersection2(X0,X1) != X2 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1])],[f23,f24]) ).
fof(f26,plain,
! [X0,X1] :
( ( union(X0) = X1
| ? [X2] :
( ( ! [X3] :
( ~ in(X3,X0)
| ~ in(X2,X3) )
| ~ in(X2,X1) )
& ( ? [X3] :
( in(X3,X0)
& in(X2,X3) )
| in(X2,X1) ) ) )
& ( ! [X2] :
( ( in(X2,X1)
| ! [X3] :
( ~ in(X3,X0)
| ~ in(X2,X3) ) )
& ( ? [X3] :
( in(X3,X0)
& in(X2,X3) )
| ~ in(X2,X1) ) )
| union(X0) != X1 ) ),
inference(nnf_transformation,[],[f5]) ).
fof(f27,plain,
! [X0,X1] :
( ( union(X0) = X1
| ? [X2] :
( ( ! [X3] :
( ~ in(X3,X0)
| ~ in(X2,X3) )
| ~ in(X2,X1) )
& ( ? [X4] :
( in(X4,X0)
& in(X2,X4) )
| in(X2,X1) ) ) )
& ( ! [X5] :
( ( in(X5,X1)
| ! [X6] :
( ~ in(X6,X0)
| ~ in(X5,X6) ) )
& ( ? [X7] :
( in(X7,X0)
& in(X5,X7) )
| ~ in(X5,X1) ) )
| union(X0) != X1 ) ),
inference(rectify,[],[f26]) ).
fof(f28,plain,
! [X0,X1] :
( ? [X2] :
( ( ! [X3] :
( ~ in(X3,X0)
| ~ in(X2,X3) )
| ~ in(X2,X1) )
& ( ? [X4] :
( in(X4,X0)
& in(X2,X4) )
| in(X2,X1) ) )
=> ( ( ! [X3] :
( ~ in(X3,X0)
| ~ in(sK2(X0,X1),X3) )
| ~ in(sK2(X0,X1),X1) )
& ( ? [X4] :
( in(X4,X0)
& in(sK2(X0,X1),X4) )
| in(sK2(X0,X1),X1) ) ) ),
introduced(choice_axiom,[]) ).
fof(f29,plain,
! [X0,X1] :
( ? [X4] :
( in(X4,X0)
& in(sK2(X0,X1),X4) )
=> ( in(sK3(X0,X1),X0)
& in(sK2(X0,X1),sK3(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f30,plain,
! [X0,X5] :
( ? [X7] :
( in(X7,X0)
& in(X5,X7) )
=> ( in(sK4(X0,X5),X0)
& in(X5,sK4(X0,X5)) ) ),
introduced(choice_axiom,[]) ).
fof(f31,plain,
! [X0,X1] :
( ( union(X0) = X1
| ( ( ! [X3] :
( ~ in(X3,X0)
| ~ in(sK2(X0,X1),X3) )
| ~ in(sK2(X0,X1),X1) )
& ( ( in(sK3(X0,X1),X0)
& in(sK2(X0,X1),sK3(X0,X1)) )
| in(sK2(X0,X1),X1) ) ) )
& ( ! [X5] :
( ( in(X5,X1)
| ! [X6] :
( ~ in(X6,X0)
| ~ in(X5,X6) ) )
& ( ( in(sK4(X0,X5),X0)
& in(X5,sK4(X0,X5)) )
| ~ in(X5,X1) ) )
| union(X0) != X1 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3,sK4])],[f27,f30,f29,f28]) ).
fof(f36,plain,
( ? [X0,X1] : ~ subset(union(set_intersection2(X0,X1)),set_intersection2(union(X0),union(X1)))
=> ~ subset(union(set_intersection2(sK7,sK8)),set_intersection2(union(sK7),union(sK8))) ),
introduced(choice_axiom,[]) ).
fof(f37,plain,
~ subset(union(set_intersection2(sK7,sK8)),set_intersection2(union(sK7),union(sK8))),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK7,sK8])],[f16,f36]) ).
fof(f41,plain,
! [X0,X1] :
( subset(X0,X1)
| in(sK0(X0,X1),X0) ),
inference(cnf_transformation,[],[f20]) ).
fof(f42,plain,
! [X0,X1] :
( subset(X0,X1)
| ~ in(sK0(X0,X1),X1) ),
inference(cnf_transformation,[],[f20]) ).
fof(f43,plain,
! [X2,X0,X1,X4] :
( in(X4,X0)
| ~ in(X4,X2)
| set_intersection2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f25]) ).
fof(f44,plain,
! [X2,X0,X1,X4] :
( in(X4,X1)
| ~ in(X4,X2)
| set_intersection2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f25]) ).
fof(f45,plain,
! [X2,X0,X1,X4] :
( in(X4,X2)
| ~ in(X4,X1)
| ~ in(X4,X0)
| set_intersection2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f25]) ).
fof(f49,plain,
! [X0,X1,X5] :
( in(X5,sK4(X0,X5))
| ~ in(X5,X1)
| union(X0) != X1 ),
inference(cnf_transformation,[],[f31]) ).
fof(f50,plain,
! [X0,X1,X5] :
( in(sK4(X0,X5),X0)
| ~ in(X5,X1)
| union(X0) != X1 ),
inference(cnf_transformation,[],[f31]) ).
fof(f51,plain,
! [X0,X1,X6,X5] :
( in(X5,X1)
| ~ in(X6,X0)
| ~ in(X5,X6)
| union(X0) != X1 ),
inference(cnf_transformation,[],[f31]) ).
fof(f59,plain,
~ subset(union(set_intersection2(sK7,sK8)),set_intersection2(union(sK7),union(sK8))),
inference(cnf_transformation,[],[f37]) ).
fof(f60,plain,
! [X0,X1,X4] :
( in(X4,set_intersection2(X0,X1))
| ~ in(X4,X1)
| ~ in(X4,X0) ),
inference(equality_resolution,[],[f45]) ).
fof(f61,plain,
! [X0,X1,X4] :
( in(X4,X1)
| ~ in(X4,set_intersection2(X0,X1)) ),
inference(equality_resolution,[],[f44]) ).
fof(f62,plain,
! [X0,X1,X4] :
( in(X4,X0)
| ~ in(X4,set_intersection2(X0,X1)) ),
inference(equality_resolution,[],[f43]) ).
fof(f63,plain,
! [X0,X6,X5] :
( in(X5,union(X0))
| ~ in(X6,X0)
| ~ in(X5,X6) ),
inference(equality_resolution,[],[f51]) ).
fof(f64,plain,
! [X0,X5] :
( in(sK4(X0,X5),X0)
| ~ in(X5,union(X0)) ),
inference(equality_resolution,[],[f50]) ).
fof(f65,plain,
! [X0,X5] :
( in(X5,sK4(X0,X5))
| ~ in(X5,union(X0)) ),
inference(equality_resolution,[],[f49]) ).
cnf(c_51,plain,
( ~ in(sK0(X0,X1),X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f42]) ).
cnf(c_52,plain,
( in(sK0(X0,X1),X0)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f41]) ).
cnf(c_57,plain,
( ~ in(X0,X1)
| ~ in(X0,X2)
| in(X0,set_intersection2(X2,X1)) ),
inference(cnf_transformation,[],[f60]) ).
cnf(c_58,plain,
( ~ in(X0,set_intersection2(X1,X2))
| in(X0,X2) ),
inference(cnf_transformation,[],[f61]) ).
cnf(c_59,plain,
( ~ in(X0,set_intersection2(X1,X2))
| in(X0,X1) ),
inference(cnf_transformation,[],[f62]) ).
cnf(c_63,plain,
( ~ in(X0,X1)
| ~ in(X1,X2)
| in(X0,union(X2)) ),
inference(cnf_transformation,[],[f63]) ).
cnf(c_64,plain,
( ~ in(X0,union(X1))
| in(sK4(X1,X0),X1) ),
inference(cnf_transformation,[],[f64]) ).
cnf(c_65,plain,
( ~ in(X0,union(X1))
| in(X0,sK4(X1,X0)) ),
inference(cnf_transformation,[],[f65]) ).
cnf(c_70,negated_conjecture,
~ subset(union(set_intersection2(sK7,sK8)),set_intersection2(union(sK7),union(sK8))),
inference(cnf_transformation,[],[f59]) ).
cnf(c_213,plain,
( set_intersection2(union(sK7),union(sK8)) != X1
| union(set_intersection2(sK7,sK8)) != X0
| in(sK0(X0,X1),X0) ),
inference(resolution_lifted,[status(thm)],[c_52,c_70]) ).
cnf(c_214,plain,
in(sK0(union(set_intersection2(sK7,sK8)),set_intersection2(union(sK7),union(sK8))),union(set_intersection2(sK7,sK8))),
inference(unflattening,[status(thm)],[c_213]) ).
cnf(c_218,plain,
( set_intersection2(union(sK7),union(sK8)) != X1
| union(set_intersection2(sK7,sK8)) != X0
| ~ in(sK0(X0,X1),X1) ),
inference(resolution_lifted,[status(thm)],[c_51,c_70]) ).
cnf(c_219,plain,
~ in(sK0(union(set_intersection2(sK7,sK8)),set_intersection2(union(sK7),union(sK8))),set_intersection2(union(sK7),union(sK8))),
inference(unflattening,[status(thm)],[c_218]) ).
cnf(c_689,plain,
( ~ in(sK0(union(set_intersection2(sK7,sK8)),set_intersection2(union(sK7),union(sK8))),union(set_intersection2(sK7,sK8)))
| in(sK4(set_intersection2(sK7,sK8),sK0(union(set_intersection2(sK7,sK8)),set_intersection2(union(sK7),union(sK8)))),set_intersection2(sK7,sK8)) ),
inference(instantiation,[status(thm)],[c_64]) ).
cnf(c_690,plain,
( ~ in(sK0(union(set_intersection2(sK7,sK8)),set_intersection2(union(sK7),union(sK8))),union(set_intersection2(sK7,sK8)))
| in(sK0(union(set_intersection2(sK7,sK8)),set_intersection2(union(sK7),union(sK8))),sK4(set_intersection2(sK7,sK8),sK0(union(set_intersection2(sK7,sK8)),set_intersection2(union(sK7),union(sK8))))) ),
inference(instantiation,[status(thm)],[c_65]) ).
cnf(c_715,plain,
( ~ in(sK0(union(set_intersection2(sK7,sK8)),set_intersection2(union(sK7),union(sK8))),sK4(set_intersection2(sK7,sK8),sK0(union(set_intersection2(sK7,sK8)),set_intersection2(union(sK7),union(sK8)))))
| ~ in(sK4(set_intersection2(sK7,sK8),sK0(union(set_intersection2(sK7,sK8)),set_intersection2(union(sK7),union(sK8)))),X0)
| in(sK0(union(set_intersection2(sK7,sK8)),set_intersection2(union(sK7),union(sK8))),union(X0)) ),
inference(instantiation,[status(thm)],[c_63]) ).
cnf(c_725,plain,
( ~ in(sK4(set_intersection2(sK7,sK8),sK0(union(set_intersection2(sK7,sK8)),set_intersection2(union(sK7),union(sK8)))),X0)
| in(sK0(union(set_intersection2(sK7,sK8)),set_intersection2(union(sK7),union(sK8))),union(X0)) ),
inference(global_subsumption_just,[status(thm)],[c_715,c_214,c_690,c_715]) ).
cnf(c_727,plain,
( ~ in(sK4(set_intersection2(sK7,sK8),sK0(union(set_intersection2(sK7,sK8)),set_intersection2(union(sK7),union(sK8)))),sK7)
| in(sK0(union(set_intersection2(sK7,sK8)),set_intersection2(union(sK7),union(sK8))),union(sK7)) ),
inference(instantiation,[status(thm)],[c_725]) ).
cnf(c_760,plain,
( ~ in(sK4(set_intersection2(sK7,sK8),sK0(union(set_intersection2(sK7,sK8)),set_intersection2(union(sK7),union(sK8)))),set_intersection2(sK7,sK8))
| in(sK4(set_intersection2(sK7,sK8),sK0(union(set_intersection2(sK7,sK8)),set_intersection2(union(sK7),union(sK8)))),sK8) ),
inference(instantiation,[status(thm)],[c_58]) ).
cnf(c_761,plain,
( ~ in(sK4(set_intersection2(sK7,sK8),sK0(union(set_intersection2(sK7,sK8)),set_intersection2(union(sK7),union(sK8)))),set_intersection2(sK7,sK8))
| in(sK4(set_intersection2(sK7,sK8),sK0(union(set_intersection2(sK7,sK8)),set_intersection2(union(sK7),union(sK8)))),sK7) ),
inference(instantiation,[status(thm)],[c_59]) ).
cnf(c_805,plain,
( ~ in(sK0(union(set_intersection2(sK7,sK8)),set_intersection2(union(sK7),union(sK8))),union(X0))
| ~ in(sK0(union(set_intersection2(sK7,sK8)),set_intersection2(union(sK7),union(sK8))),X1)
| in(sK0(union(set_intersection2(sK7,sK8)),set_intersection2(union(sK7),union(sK8))),set_intersection2(X1,union(X0))) ),
inference(instantiation,[status(thm)],[c_57]) ).
cnf(c_831,plain,
( ~ in(sK0(union(set_intersection2(sK7,sK8)),set_intersection2(union(sK7),union(sK8))),sK4(set_intersection2(sK7,sK8),sK0(union(set_intersection2(sK7,sK8)),set_intersection2(union(sK7),union(sK8)))))
| ~ in(sK4(set_intersection2(sK7,sK8),sK0(union(set_intersection2(sK7,sK8)),set_intersection2(union(sK7),union(sK8)))),X0)
| in(sK0(union(set_intersection2(sK7,sK8)),set_intersection2(union(sK7),union(sK8))),union(X0)) ),
inference(instantiation,[status(thm)],[c_63]) ).
cnf(c_838,plain,
( ~ in(sK4(set_intersection2(sK7,sK8),sK0(union(set_intersection2(sK7,sK8)),set_intersection2(union(sK7),union(sK8)))),X0)
| in(sK0(union(set_intersection2(sK7,sK8)),set_intersection2(union(sK7),union(sK8))),union(X0)) ),
inference(global_subsumption_just,[status(thm)],[c_831,c_725]) ).
cnf(c_904,plain,
( ~ in(sK0(union(set_intersection2(sK7,sK8)),set_intersection2(union(sK7),union(sK8))),union(sK7))
| ~ in(sK0(union(set_intersection2(sK7,sK8)),set_intersection2(union(sK7),union(sK8))),union(sK8))
| in(sK0(union(set_intersection2(sK7,sK8)),set_intersection2(union(sK7),union(sK8))),set_intersection2(union(sK7),union(sK8))) ),
inference(instantiation,[status(thm)],[c_805]) ).
cnf(c_1235,plain,
( ~ in(sK4(set_intersection2(sK7,sK8),sK0(union(set_intersection2(sK7,sK8)),set_intersection2(union(sK7),union(sK8)))),sK8)
| in(sK0(union(set_intersection2(sK7,sK8)),set_intersection2(union(sK7),union(sK8))),union(sK8)) ),
inference(instantiation,[status(thm)],[c_838]) ).
cnf(c_1239,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_1235,c_904,c_760,c_761,c_727,c_689,c_219,c_214]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SET944+1 : TPTP v8.1.2. Released v3.2.0.
% 0.00/0.14 % Command : run_iprover %s %d THM
% 0.13/0.35 % Computer : n021.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Sat Aug 26 10:41:41 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.48 Running first-order theorem proving
% 0.20/0.48 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 3.47/1.17 % SZS status Started for theBenchmark.p
% 3.47/1.17 % SZS status Theorem for theBenchmark.p
% 3.47/1.17
% 3.47/1.17 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 3.47/1.17
% 3.47/1.17 ------ iProver source info
% 3.47/1.17
% 3.47/1.17 git: date: 2023-05-31 18:12:56 +0000
% 3.47/1.17 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 3.47/1.17 git: non_committed_changes: false
% 3.47/1.17 git: last_make_outside_of_git: false
% 3.47/1.17
% 3.47/1.17 ------ Parsing...
% 3.47/1.17 ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.47/1.17
% 3.47/1.17 ------ 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
% 3.47/1.17
% 3.47/1.17 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.47/1.17
% 3.47/1.17 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.47/1.17 ------ Proving...
% 3.47/1.17 ------ Problem Properties
% 3.47/1.17
% 3.47/1.17
% 3.47/1.17 clauses 21
% 3.47/1.17 conjectures 1
% 3.47/1.17 EPR 4
% 3.47/1.17 Horn 16
% 3.47/1.17 unary 5
% 3.47/1.17 binary 7
% 3.47/1.17 lits 48
% 3.47/1.17 lits eq 9
% 3.47/1.17 fd_pure 0
% 3.47/1.17 fd_pseudo 0
% 3.47/1.17 fd_cond 0
% 3.47/1.17 fd_pseudo_cond 6
% 3.47/1.17 AC symbols 0
% 3.47/1.17
% 3.47/1.17 ------ Input Options Time Limit: Unbounded
% 3.47/1.17
% 3.47/1.17
% 3.47/1.17 ------
% 3.47/1.17 Current options:
% 3.47/1.17 ------
% 3.47/1.17
% 3.47/1.17
% 3.47/1.17
% 3.47/1.17
% 3.47/1.17 ------ Proving...
% 3.47/1.17
% 3.47/1.17
% 3.47/1.17 % SZS status Theorem for theBenchmark.p
% 3.47/1.17
% 3.47/1.17 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.47/1.17
% 3.47/1.17
%------------------------------------------------------------------------------