TSTP Solution File: RNG108+4 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : RNG108+4 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n015.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 13:55:20 EDT 2023
% Result : Theorem 3.69s 1.16s
% Output : CNFRefutation 3.69s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 11
% Syntax : Number of formulae : 63 ( 20 unt; 0 def)
% Number of atoms : 315 ( 87 equ)
% Maximal formula atoms : 28 ( 5 avg)
% Number of connectives : 375 ( 123 ~; 113 |; 119 &)
% ( 9 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 5 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 5 con; 0-2 aty)
% Number of variables : 118 ( 0 sgn; 73 !; 36 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
aElement0(sz00),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSortsC) ).
fof(f3,axiom,
aElement0(sz10),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSortsC_01) ).
fof(f13,axiom,
! [X0] :
( aElement0(X0)
=> ( sdtasdt0(sz10,X0) = X0
& sdtasdt0(X0,sz10) = X0 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mMulUnit) ).
fof(f16,axiom,
! [X0] :
( aElement0(X0)
=> ( sz00 = sdtasdt0(sz00,X0)
& sz00 = sdtasdt0(X0,sz00) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mMulZero) ).
fof(f39,axiom,
( aElement0(xb)
& aElement0(xa) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2091) ).
fof(f42,axiom,
( xI = sdtpldt1(slsdtgt0(xa),slsdtgt0(xb))
& ! [X0] :
( aElementOf0(X0,xI)
<=> ? [X1,X2] :
( sdtpldt0(X1,X2) = X0
& aElementOf0(X2,slsdtgt0(xb))
& aElementOf0(X1,slsdtgt0(xa)) ) )
& ! [X0] :
( aElementOf0(X0,slsdtgt0(xb))
<=> ? [X1] :
( sdtasdt0(xb,X1) = X0
& aElement0(X1) ) )
& ! [X0] :
( aElementOf0(X0,slsdtgt0(xa))
<=> ? [X1] :
( sdtasdt0(xa,X1) = X0
& aElement0(X1) ) )
& aIdeal0(xI)
& ! [X0] :
( aElementOf0(X0,xI)
=> ( ! [X1] :
( aElement0(X1)
=> aElementOf0(sdtasdt0(X1,X0),xI) )
& ! [X1] :
( aElementOf0(X1,xI)
=> aElementOf0(sdtpldt0(X0,X1),xI) ) ) )
& aSet0(xI) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2174) ).
fof(f43,conjecture,
( ( aElementOf0(xb,slsdtgt0(xb))
| ? [X0] :
( xb = sdtasdt0(xb,X0)
& aElement0(X0) ) )
& ( aElementOf0(sz00,slsdtgt0(xb))
| ? [X0] :
( sz00 = sdtasdt0(xb,X0)
& aElement0(X0) ) )
& ( aElementOf0(xa,slsdtgt0(xa))
| ? [X0] :
( xa = sdtasdt0(xa,X0)
& aElement0(X0) ) )
& ( aElementOf0(sz00,slsdtgt0(xa))
| ? [X0] :
( sz00 = sdtasdt0(xa,X0)
& aElement0(X0) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(f44,negated_conjecture,
~ ( ( aElementOf0(xb,slsdtgt0(xb))
| ? [X0] :
( xb = sdtasdt0(xb,X0)
& aElement0(X0) ) )
& ( aElementOf0(sz00,slsdtgt0(xb))
| ? [X0] :
( sz00 = sdtasdt0(xb,X0)
& aElement0(X0) ) )
& ( aElementOf0(xa,slsdtgt0(xa))
| ? [X0] :
( xa = sdtasdt0(xa,X0)
& aElement0(X0) ) )
& ( aElementOf0(sz00,slsdtgt0(xa))
| ? [X0] :
( sz00 = sdtasdt0(xa,X0)
& aElement0(X0) ) ) ),
inference(negated_conjecture,[],[f43]) ).
fof(f53,plain,
( xI = sdtpldt1(slsdtgt0(xa),slsdtgt0(xb))
& ! [X0] :
( aElementOf0(X0,xI)
<=> ? [X1,X2] :
( sdtpldt0(X1,X2) = X0
& aElementOf0(X2,slsdtgt0(xb))
& aElementOf0(X1,slsdtgt0(xa)) ) )
& ! [X3] :
( aElementOf0(X3,slsdtgt0(xb))
<=> ? [X4] :
( sdtasdt0(xb,X4) = X3
& aElement0(X4) ) )
& ! [X5] :
( aElementOf0(X5,slsdtgt0(xa))
<=> ? [X6] :
( sdtasdt0(xa,X6) = X5
& aElement0(X6) ) )
& aIdeal0(xI)
& ! [X7] :
( aElementOf0(X7,xI)
=> ( ! [X8] :
( aElement0(X8)
=> aElementOf0(sdtasdt0(X8,X7),xI) )
& ! [X9] :
( aElementOf0(X9,xI)
=> aElementOf0(sdtpldt0(X7,X9),xI) ) ) )
& aSet0(xI) ),
inference(rectify,[],[f42]) ).
fof(f54,plain,
~ ( ( aElementOf0(xb,slsdtgt0(xb))
| ? [X0] :
( xb = sdtasdt0(xb,X0)
& aElement0(X0) ) )
& ( aElementOf0(sz00,slsdtgt0(xb))
| ? [X1] :
( sz00 = sdtasdt0(xb,X1)
& aElement0(X1) ) )
& ( aElementOf0(xa,slsdtgt0(xa))
| ? [X2] :
( xa = sdtasdt0(xa,X2)
& aElement0(X2) ) )
& ( aElementOf0(sz00,slsdtgt0(xa))
| ? [X3] :
( sz00 = sdtasdt0(xa,X3)
& aElement0(X3) ) ) ),
inference(rectify,[],[f44]) ).
fof(f72,plain,
! [X0] :
( ( sdtasdt0(sz10,X0) = X0
& sdtasdt0(X0,sz10) = X0 )
| ~ aElement0(X0) ),
inference(ennf_transformation,[],[f13]) ).
fof(f76,plain,
! [X0] :
( ( sz00 = sdtasdt0(sz00,X0)
& sz00 = sdtasdt0(X0,sz00) )
| ~ aElement0(X0) ),
inference(ennf_transformation,[],[f16]) ).
fof(f108,plain,
( xI = sdtpldt1(slsdtgt0(xa),slsdtgt0(xb))
& ! [X0] :
( aElementOf0(X0,xI)
<=> ? [X1,X2] :
( sdtpldt0(X1,X2) = X0
& aElementOf0(X2,slsdtgt0(xb))
& aElementOf0(X1,slsdtgt0(xa)) ) )
& ! [X3] :
( aElementOf0(X3,slsdtgt0(xb))
<=> ? [X4] :
( sdtasdt0(xb,X4) = X3
& aElement0(X4) ) )
& ! [X5] :
( aElementOf0(X5,slsdtgt0(xa))
<=> ? [X6] :
( sdtasdt0(xa,X6) = X5
& aElement0(X6) ) )
& aIdeal0(xI)
& ! [X7] :
( ( ! [X8] :
( aElementOf0(sdtasdt0(X8,X7),xI)
| ~ aElement0(X8) )
& ! [X9] :
( aElementOf0(sdtpldt0(X7,X9),xI)
| ~ aElementOf0(X9,xI) ) )
| ~ aElementOf0(X7,xI) )
& aSet0(xI) ),
inference(ennf_transformation,[],[f53]) ).
fof(f109,plain,
( ( ~ aElementOf0(xb,slsdtgt0(xb))
& ! [X0] :
( xb != sdtasdt0(xb,X0)
| ~ aElement0(X0) ) )
| ( ~ aElementOf0(sz00,slsdtgt0(xb))
& ! [X1] :
( sz00 != sdtasdt0(xb,X1)
| ~ aElement0(X1) ) )
| ( ~ aElementOf0(xa,slsdtgt0(xa))
& ! [X2] :
( xa != sdtasdt0(xa,X2)
| ~ aElement0(X2) ) )
| ( ~ aElementOf0(sz00,slsdtgt0(xa))
& ! [X3] :
( sz00 != sdtasdt0(xa,X3)
| ~ aElement0(X3) ) ) ),
inference(ennf_transformation,[],[f54]) ).
fof(f116,plain,
( ( ~ aElementOf0(sz00,slsdtgt0(xa))
& ! [X3] :
( sz00 != sdtasdt0(xa,X3)
| ~ aElement0(X3) ) )
| ~ sP4 ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP4])]) ).
fof(f117,plain,
( ( ~ aElementOf0(xb,slsdtgt0(xb))
& ! [X0] :
( xb != sdtasdt0(xb,X0)
| ~ aElement0(X0) ) )
| ( ~ aElementOf0(sz00,slsdtgt0(xb))
& ! [X1] :
( sz00 != sdtasdt0(xb,X1)
| ~ aElement0(X1) ) )
| ( ~ aElementOf0(xa,slsdtgt0(xa))
& ! [X2] :
( xa != sdtasdt0(xa,X2)
| ~ aElement0(X2) ) )
| sP4 ),
inference(definition_folding,[],[f109,f116]) ).
fof(f175,plain,
( xI = sdtpldt1(slsdtgt0(xa),slsdtgt0(xb))
& ! [X0] :
( ( aElementOf0(X0,xI)
| ! [X1,X2] :
( sdtpldt0(X1,X2) != X0
| ~ aElementOf0(X2,slsdtgt0(xb))
| ~ aElementOf0(X1,slsdtgt0(xa)) ) )
& ( ? [X1,X2] :
( sdtpldt0(X1,X2) = X0
& aElementOf0(X2,slsdtgt0(xb))
& aElementOf0(X1,slsdtgt0(xa)) )
| ~ aElementOf0(X0,xI) ) )
& ! [X3] :
( ( aElementOf0(X3,slsdtgt0(xb))
| ! [X4] :
( sdtasdt0(xb,X4) != X3
| ~ aElement0(X4) ) )
& ( ? [X4] :
( sdtasdt0(xb,X4) = X3
& aElement0(X4) )
| ~ aElementOf0(X3,slsdtgt0(xb)) ) )
& ! [X5] :
( ( aElementOf0(X5,slsdtgt0(xa))
| ! [X6] :
( sdtasdt0(xa,X6) != X5
| ~ aElement0(X6) ) )
& ( ? [X6] :
( sdtasdt0(xa,X6) = X5
& aElement0(X6) )
| ~ aElementOf0(X5,slsdtgt0(xa)) ) )
& aIdeal0(xI)
& ! [X7] :
( ( ! [X8] :
( aElementOf0(sdtasdt0(X8,X7),xI)
| ~ aElement0(X8) )
& ! [X9] :
( aElementOf0(sdtpldt0(X7,X9),xI)
| ~ aElementOf0(X9,xI) ) )
| ~ aElementOf0(X7,xI) )
& aSet0(xI) ),
inference(nnf_transformation,[],[f108]) ).
fof(f176,plain,
( xI = sdtpldt1(slsdtgt0(xa),slsdtgt0(xb))
& ! [X0] :
( ( aElementOf0(X0,xI)
| ! [X1,X2] :
( sdtpldt0(X1,X2) != X0
| ~ aElementOf0(X2,slsdtgt0(xb))
| ~ aElementOf0(X1,slsdtgt0(xa)) ) )
& ( ? [X3,X4] :
( sdtpldt0(X3,X4) = X0
& aElementOf0(X4,slsdtgt0(xb))
& aElementOf0(X3,slsdtgt0(xa)) )
| ~ aElementOf0(X0,xI) ) )
& ! [X5] :
( ( aElementOf0(X5,slsdtgt0(xb))
| ! [X6] :
( sdtasdt0(xb,X6) != X5
| ~ aElement0(X6) ) )
& ( ? [X7] :
( sdtasdt0(xb,X7) = X5
& aElement0(X7) )
| ~ aElementOf0(X5,slsdtgt0(xb)) ) )
& ! [X8] :
( ( aElementOf0(X8,slsdtgt0(xa))
| ! [X9] :
( sdtasdt0(xa,X9) != X8
| ~ aElement0(X9) ) )
& ( ? [X10] :
( sdtasdt0(xa,X10) = X8
& aElement0(X10) )
| ~ aElementOf0(X8,slsdtgt0(xa)) ) )
& aIdeal0(xI)
& ! [X11] :
( ( ! [X12] :
( aElementOf0(sdtasdt0(X12,X11),xI)
| ~ aElement0(X12) )
& ! [X13] :
( aElementOf0(sdtpldt0(X11,X13),xI)
| ~ aElementOf0(X13,xI) ) )
| ~ aElementOf0(X11,xI) )
& aSet0(xI) ),
inference(rectify,[],[f175]) ).
fof(f177,plain,
! [X0] :
( ? [X3,X4] :
( sdtpldt0(X3,X4) = X0
& aElementOf0(X4,slsdtgt0(xb))
& aElementOf0(X3,slsdtgt0(xa)) )
=> ( sdtpldt0(sK28(X0),sK29(X0)) = X0
& aElementOf0(sK29(X0),slsdtgt0(xb))
& aElementOf0(sK28(X0),slsdtgt0(xa)) ) ),
introduced(choice_axiom,[]) ).
fof(f178,plain,
! [X5] :
( ? [X7] :
( sdtasdt0(xb,X7) = X5
& aElement0(X7) )
=> ( sdtasdt0(xb,sK30(X5)) = X5
& aElement0(sK30(X5)) ) ),
introduced(choice_axiom,[]) ).
fof(f179,plain,
! [X8] :
( ? [X10] :
( sdtasdt0(xa,X10) = X8
& aElement0(X10) )
=> ( sdtasdt0(xa,sK31(X8)) = X8
& aElement0(sK31(X8)) ) ),
introduced(choice_axiom,[]) ).
fof(f180,plain,
( xI = sdtpldt1(slsdtgt0(xa),slsdtgt0(xb))
& ! [X0] :
( ( aElementOf0(X0,xI)
| ! [X1,X2] :
( sdtpldt0(X1,X2) != X0
| ~ aElementOf0(X2,slsdtgt0(xb))
| ~ aElementOf0(X1,slsdtgt0(xa)) ) )
& ( ( sdtpldt0(sK28(X0),sK29(X0)) = X0
& aElementOf0(sK29(X0),slsdtgt0(xb))
& aElementOf0(sK28(X0),slsdtgt0(xa)) )
| ~ aElementOf0(X0,xI) ) )
& ! [X5] :
( ( aElementOf0(X5,slsdtgt0(xb))
| ! [X6] :
( sdtasdt0(xb,X6) != X5
| ~ aElement0(X6) ) )
& ( ( sdtasdt0(xb,sK30(X5)) = X5
& aElement0(sK30(X5)) )
| ~ aElementOf0(X5,slsdtgt0(xb)) ) )
& ! [X8] :
( ( aElementOf0(X8,slsdtgt0(xa))
| ! [X9] :
( sdtasdt0(xa,X9) != X8
| ~ aElement0(X9) ) )
& ( ( sdtasdt0(xa,sK31(X8)) = X8
& aElement0(sK31(X8)) )
| ~ aElementOf0(X8,slsdtgt0(xa)) ) )
& aIdeal0(xI)
& ! [X11] :
( ( ! [X12] :
( aElementOf0(sdtasdt0(X12,X11),xI)
| ~ aElement0(X12) )
& ! [X13] :
( aElementOf0(sdtpldt0(X11,X13),xI)
| ~ aElementOf0(X13,xI) ) )
| ~ aElementOf0(X11,xI) )
& aSet0(xI) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK28,sK29,sK30,sK31])],[f176,f179,f178,f177]) ).
fof(f181,plain,
( ( ~ aElementOf0(sz00,slsdtgt0(xa))
& ! [X3] :
( sz00 != sdtasdt0(xa,X3)
| ~ aElement0(X3) ) )
| ~ sP4 ),
inference(nnf_transformation,[],[f116]) ).
fof(f182,plain,
( ( ~ aElementOf0(sz00,slsdtgt0(xa))
& ! [X0] :
( sz00 != sdtasdt0(xa,X0)
| ~ aElement0(X0) ) )
| ~ sP4 ),
inference(rectify,[],[f181]) ).
fof(f183,plain,
aElement0(sz00),
inference(cnf_transformation,[],[f2]) ).
fof(f184,plain,
aElement0(sz10),
inference(cnf_transformation,[],[f3]) ).
fof(f196,plain,
! [X0] :
( sdtasdt0(X0,sz10) = X0
| ~ aElement0(X0) ),
inference(cnf_transformation,[],[f72]) ).
fof(f202,plain,
! [X0] :
( sz00 = sdtasdt0(X0,sz00)
| ~ aElement0(X0) ),
inference(cnf_transformation,[],[f76]) ).
fof(f273,plain,
aElement0(xa),
inference(cnf_transformation,[],[f39]) ).
fof(f274,plain,
aElement0(xb),
inference(cnf_transformation,[],[f39]) ).
fof(f302,plain,
! [X8,X9] :
( aElementOf0(X8,slsdtgt0(xa))
| sdtasdt0(xa,X9) != X8
| ~ aElement0(X9) ),
inference(cnf_transformation,[],[f180]) ).
fof(f312,plain,
( ~ aElementOf0(sz00,slsdtgt0(xa))
| ~ sP4 ),
inference(cnf_transformation,[],[f182]) ).
fof(f313,plain,
! [X2,X0,X1] :
( xb != sdtasdt0(xb,X0)
| ~ aElement0(X0)
| sz00 != sdtasdt0(xb,X1)
| ~ aElement0(X1)
| xa != sdtasdt0(xa,X2)
| ~ aElement0(X2)
| sP4 ),
inference(cnf_transformation,[],[f117]) ).
fof(f335,plain,
! [X9] :
( aElementOf0(sdtasdt0(xa,X9),slsdtgt0(xa))
| ~ aElement0(X9) ),
inference(equality_resolution,[],[f302]) ).
cnf(c_49,plain,
aElement0(sz00),
inference(cnf_transformation,[],[f183]) ).
cnf(c_50,plain,
aElement0(sz10),
inference(cnf_transformation,[],[f184]) ).
cnf(c_63,plain,
( ~ aElement0(X0)
| sdtasdt0(X0,sz10) = X0 ),
inference(cnf_transformation,[],[f196]) ).
cnf(c_69,plain,
( ~ aElement0(X0)
| sdtasdt0(X0,sz00) = sz00 ),
inference(cnf_transformation,[],[f202]) ).
cnf(c_139,plain,
aElement0(xb),
inference(cnf_transformation,[],[f274]) ).
cnf(c_140,plain,
aElement0(xa),
inference(cnf_transformation,[],[f273]) ).
cnf(c_170,plain,
( ~ aElement0(X0)
| aElementOf0(sdtasdt0(xa,X0),slsdtgt0(xa)) ),
inference(cnf_transformation,[],[f335]) ).
cnf(c_177,plain,
( ~ aElementOf0(sz00,slsdtgt0(xa))
| ~ sP4 ),
inference(cnf_transformation,[],[f312]) ).
cnf(c_186,negated_conjecture,
( sdtasdt0(xb,X0) != sz00
| sdtasdt0(xb,X1) != xb
| sdtasdt0(xa,X2) != xa
| ~ aElement0(X0)
| ~ aElement0(X1)
| ~ aElement0(X2)
| sP4 ),
inference(cnf_transformation,[],[f313]) ).
cnf(c_8062,negated_conjecture,
( ~ aElement0(X0)
| sdtasdt0(xb,X0) != xb
| ~ sP0_iProver_split ),
inference(splitting,[splitting(split),new_symbols(definition,[sP0_iProver_split])],[c_186]) ).
cnf(c_8063,negated_conjecture,
( ~ aElement0(X0)
| sdtasdt0(xa,X0) != xa
| ~ sP1_iProver_split ),
inference(splitting,[splitting(split),new_symbols(definition,[sP1_iProver_split])],[c_186]) ).
cnf(c_8064,negated_conjecture,
( ~ aElement0(X0)
| sdtasdt0(xb,X0) != sz00
| ~ sP2_iProver_split ),
inference(splitting,[splitting(split),new_symbols(definition,[sP2_iProver_split])],[c_186]) ).
cnf(c_8065,negated_conjecture,
( sP4
| sP0_iProver_split
| sP1_iProver_split
| sP2_iProver_split ),
inference(splitting,[splitting(split),new_symbols(definition,[])],[c_186]) ).
cnf(c_10238,plain,
sdtasdt0(xb,sz10) = xb,
inference(superposition,[status(thm)],[c_139,c_63]) ).
cnf(c_10239,plain,
sdtasdt0(xa,sz10) = xa,
inference(superposition,[status(thm)],[c_140,c_63]) ).
cnf(c_10278,plain,
sdtasdt0(xb,sz00) = sz00,
inference(superposition,[status(thm)],[c_139,c_69]) ).
cnf(c_10279,plain,
sdtasdt0(xa,sz00) = sz00,
inference(superposition,[status(thm)],[c_140,c_69]) ).
cnf(c_10292,plain,
( ~ aElement0(sz10)
| ~ sP0_iProver_split ),
inference(superposition,[status(thm)],[c_10238,c_8062]) ).
cnf(c_10293,plain,
~ sP0_iProver_split,
inference(forward_subsumption_resolution,[status(thm)],[c_10292,c_50]) ).
cnf(c_10300,plain,
( sP4
| sP1_iProver_split
| sP2_iProver_split ),
inference(backward_subsumption_resolution,[status(thm)],[c_8065,c_10293]) ).
cnf(c_10331,plain,
( ~ aElement0(sz10)
| ~ sP1_iProver_split ),
inference(superposition,[status(thm)],[c_10239,c_8063]) ).
cnf(c_10332,plain,
~ sP1_iProver_split,
inference(forward_subsumption_resolution,[status(thm)],[c_10331,c_50]) ).
cnf(c_10333,plain,
( sP4
| sP2_iProver_split ),
inference(backward_subsumption_resolution,[status(thm)],[c_10300,c_10332]) ).
cnf(c_10508,plain,
( ~ aElement0(sz00)
| ~ sP2_iProver_split ),
inference(superposition,[status(thm)],[c_10278,c_8064]) ).
cnf(c_10509,plain,
~ sP2_iProver_split,
inference(forward_subsumption_resolution,[status(thm)],[c_10508,c_49]) ).
cnf(c_10511,plain,
sP4,
inference(backward_subsumption_resolution,[status(thm)],[c_10333,c_10509]) ).
cnf(c_10512,plain,
~ aElementOf0(sz00,slsdtgt0(xa)),
inference(backward_subsumption_resolution,[status(thm)],[c_177,c_10511]) ).
cnf(c_10521,plain,
( ~ aElement0(sz00)
| aElementOf0(sz00,slsdtgt0(xa)) ),
inference(superposition,[status(thm)],[c_10279,c_170]) ).
cnf(c_10522,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_10521,c_10512,c_49]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : RNG108+4 : TPTP v8.1.2. Released v4.0.0.
% 0.06/0.13 % Command : run_iprover %s %d THM
% 0.13/0.33 % Computer : n015.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Sun Aug 27 02:01:38 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.19/0.46 Running first-order theorem proving
% 0.19/0.46 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 3.69/1.16 % SZS status Started for theBenchmark.p
% 3.69/1.16 % SZS status Theorem for theBenchmark.p
% 3.69/1.16
% 3.69/1.16 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 3.69/1.16
% 3.69/1.16 ------ iProver source info
% 3.69/1.16
% 3.69/1.16 git: date: 2023-05-31 18:12:56 +0000
% 3.69/1.16 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 3.69/1.16 git: non_committed_changes: false
% 3.69/1.16 git: last_make_outside_of_git: false
% 3.69/1.16
% 3.69/1.16 ------ Parsing...
% 3.69/1.16 ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.69/1.16
% 3.69/1.16 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe:2:0s pe_e sup_sim: 0 sf_s rm: 2 0s sf_e pe_s pe_e
% 3.69/1.16
% 3.69/1.16 ------ Preprocessing... gs_s sp: 12 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.69/1.16
% 3.69/1.16 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.69/1.16 ------ Proving...
% 3.69/1.16 ------ Problem Properties
% 3.69/1.16
% 3.69/1.16
% 3.69/1.16 clauses 135
% 3.69/1.16 conjectures 11
% 3.69/1.16 EPR 31
% 3.69/1.16 Horn 102
% 3.69/1.16 unary 18
% 3.69/1.16 binary 29
% 3.69/1.16 lits 436
% 3.69/1.16 lits eq 57
% 3.69/1.16 fd_pure 0
% 3.69/1.16 fd_pseudo 0
% 3.69/1.16 fd_cond 3
% 3.69/1.16 fd_pseudo_cond 11
% 3.69/1.16 AC symbols 0
% 3.69/1.16
% 3.69/1.16 ------ Schedule dynamic 5 is on
% 3.69/1.16
% 3.69/1.16 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.69/1.16
% 3.69/1.16
% 3.69/1.16 ------
% 3.69/1.16 Current options:
% 3.69/1.16 ------
% 3.69/1.16
% 3.69/1.16
% 3.69/1.16
% 3.69/1.16
% 3.69/1.16 ------ Proving...
% 3.69/1.16
% 3.69/1.16
% 3.69/1.16 % SZS status Theorem for theBenchmark.p
% 3.69/1.16
% 3.69/1.16 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.69/1.16
% 3.69/1.17
%------------------------------------------------------------------------------