%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : ITP006+2 : TPTP v9.3.1. Bugfixed v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n012.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 01:47:34 PM UTC 2026
% Result : Theorem 8.24s 12.40s
% Output : CNFRefutation 8.24s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named f129ERROR: Could not build tree for root c_13154ERROR: MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
fof(f4,axiom,
! [X0,X1,X2] :
( mem(X2,arr(X0,X1))
=> ! [X3] :
( mem(X3,X0)
=> mem(ap(X2,X3),X1) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/ITP001/ITP001+2.ax',ap_tp) ).
fof(f52,conjecture,
! [X0] :
( ne(X0)
=> ! [X1] :
( ne(X1)
=> ! [X2] :
( mem(X2,arr(X1,X0))
=> ! [X3] :
( mem(X3,arr(X0,bool))
=> ! [X4] :
( mem(X4,arr(X0,bool))
=> ( ! [X5] :
( mem(X5,X0)
=> ( p(ap(X4,X5))
=> p(ap(X3,X5)) ) )
=> ( p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X1,X0),X2),X3))
=> p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X1,X0),X2),X4)) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_thm_2EquantHeuristics_2EGUESS__RULES__WEAKEN__FORALL__POINT) ).
fof(f53,negated_conjecture,
~ ! [X0] :
( ne(X0)
=> ! [X1] :
( ne(X1)
=> ! [X2] :
( mem(X2,arr(X1,X0))
=> ! [X3] :
( mem(X3,arr(X0,bool))
=> ! [X4] :
( mem(X4,arr(X0,bool))
=> ( ! [X5] :
( mem(X5,X0)
=> ( p(ap(X4,X5))
=> p(ap(X3,X5)) ) )
=> ( p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X1,X0),X2),X3))
=> p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X1,X0),X2),X4)) ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f52]) ).
fof(f67,plain,
? [X0] :
( ne(X0)
& ? [X1] :
( ne(X1)
& ? [X2] :
( mem(X2,arr(X1,X0))
& ? [X3] :
( mem(X3,arr(X0,bool))
& ? [X4] :
( mem(X4,arr(X0,bool))
& ! [X5] :
( ~ mem(X5,X0)
| ~ p(ap(X4,X5))
| p(ap(X3,X5)) )
& p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X1,X0),X2),X3))
& ~ p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X1,X0),X2),X4)) ) ) ) ) ),
inference(ennf_transformation,[],[f53]) ).
fof(f68,plain,
? [X0] :
( ne(X0)
& ? [X1] :
( ne(X1)
& ? [X2] :
( mem(X2,arr(X1,X0))
& ? [X3] :
( mem(X3,arr(X0,bool))
& ? [X4] :
( mem(X4,arr(X0,bool))
& ! [X5] :
( ~ mem(X5,X0)
| ~ p(ap(X4,X5))
| p(ap(X3,X5)) )
& p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X1,X0),X2),X3))
& ~ p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X1,X0),X2),X4)) ) ) ) ) ),
inference(flattening,[],[f67]) ).
fof(f92,plain,
! [X0,X1,X2] :
( ~ mem(X2,arr(X0,X1))
| ! [X3] :
( ~ mem(X3,X0)
| mem(ap(X2,X3),X1) ) ),
inference(ennf_transformation,[],[f4]) ).
fof(f131,plain,
( ne(sK19)
& ne(sK20)
& mem(sK21,arr(sK20,sK19))
& mem(sK22,arr(sK19,bool))
& mem(sK23,arr(sK19,bool))
& ! [X5] :
( ~ mem(X5,sK19)
| ~ p(ap(sK23,X5))
| p(ap(sK22,X5)) )
& p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(sK20,sK19),sK21),sK22))
& ~ p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(sK20,sK19),sK21),sK23)) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK19,sK20,sK21,sK22,sK23]),skolemize(X0,sK19),skolemize(X1,sK20),skolemize(X2,sK21),skolemize(X3,sK22),skolemize(X4,sK23)],[f68]) ).
fof(f182,plain,
! [X0,X1] :
( ~ sP18(X0,X1)
| ! [X11] :
( ~ mem(X11,arr(X0,X1))
| ! [X12] :
( ~ mem(X12,arr(X1,bool))
| ( ( ~ p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X0,X1),X11),X12))
| ! [X13] :
( ~ mem(X13,X0)
| ~ p(ap(X12,ap(X11,X13))) ) )
& ( ? [X13] :
( mem(X13,X0)
& p(ap(X12,ap(X11,X13))) )
| p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X0,X1),X11),X12)) ) ) ) ) ),
inference(nnf_transformation,[],[f129]) ).
fof(f183,plain,
! [X0,X1] :
( ~ sP18(X0,X1)
| ! [X2] :
( ~ mem(X2,arr(X0,X1))
| ! [X3] :
( ~ mem(X3,arr(X1,bool))
| ( ( ~ p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X0,X1),X2),X3))
| ! [X5] :
( ~ mem(X5,X0)
| ~ p(ap(X3,ap(X2,X5))) ) )
& ( ? [X4] :
( mem(X4,X0)
& p(ap(X3,ap(X2,X4))) )
| p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X0,X1),X2),X3)) ) ) ) ) ),
inference(rectify,[],[f182]) ).
fof(f184,plain,
! [X0,X1] :
( ~ sP18(X0,X1)
| ! [X2] :
( ~ mem(X2,arr(X0,X1))
| ! [X3] :
( ~ mem(X3,arr(X1,bool))
| ( ( ~ p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X0,X1),X2),X3))
| ! [X5] :
( ~ mem(X5,X0)
| ~ p(ap(X3,ap(X2,X5))) ) )
& ( ( mem(sK24(X0,X2,X3),X0)
& p(ap(X3,ap(X2,sK24(X0,X2,X3)))) )
| p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X0,X1),X2),X3)) ) ) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK24]),skolemize(X4,sK24(X0,X2,X3))],[f183]) ).
fof(f197,plain,
! [X0] :
( ~ ne(X0)
| ! [X1] :
( ~ ne(X1)
| ! [X2] :
( ~ mem(X2,arr(X0,X1))
| ! [X3] :
( ~ mem(X3,arr(X1,bool))
| ( sP14(X0,X1)
& sP15(X0,X1)
& sP18(X0,X1)
& ! [X8] :
( ~ mem(X8,arr(X0,X1))
| ! [X9] :
( ~ mem(X9,arr(X1,bool))
| ( ( ~ p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS__POINT(X0,X1),X8),X9))
| ! [X10] :
( ~ mem(X10,X0)
| p(ap(X9,ap(X8,X10))) ) )
& ( ? [X10] :
( mem(X10,X0)
& ~ p(ap(X9,ap(X8,X10))) )
| p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS__POINT(X0,X1),X8),X9)) ) ) ) )
& sP16(X0,X2,X3,X1)
& sP17(X0,X2,X3,X1) ) ) ) ) ),
inference(nnf_transformation,[],[f130]) ).
fof(f198,plain,
! [X0] :
( ~ ne(X0)
| ! [X1] :
( ~ ne(X1)
| ! [X2] :
( ~ mem(X2,arr(X0,X1))
| ! [X3] :
( ~ mem(X3,arr(X1,bool))
| ( sP14(X0,X1)
& sP15(X0,X1)
& sP18(X0,X1)
& ! [X4] :
( ~ mem(X4,arr(X0,X1))
| ! [X5] :
( ~ mem(X5,arr(X1,bool))
| ( ( ~ p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS__POINT(X0,X1),X4),X5))
| ! [X7] :
( ~ mem(X7,X0)
| p(ap(X5,ap(X4,X7))) ) )
& ( ? [X6] :
( mem(X6,X0)
& ~ p(ap(X5,ap(X4,X6))) )
| p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS__POINT(X0,X1),X4),X5)) ) ) ) )
& sP16(X0,X2,X3,X1)
& sP17(X0,X2,X3,X1) ) ) ) ) ),
inference(rectify,[],[f197]) ).
fof(f199,plain,
! [X0] :
( ~ ne(X0)
| ! [X1] :
( ~ ne(X1)
| ! [X2] :
( ~ mem(X2,arr(X0,X1))
| ! [X3] :
( ~ mem(X3,arr(X1,bool))
| ( sP14(X0,X1)
& sP15(X0,X1)
& sP18(X0,X1)
& ! [X4] :
( ~ mem(X4,arr(X0,X1))
| ! [X5] :
( ~ mem(X5,arr(X1,bool))
| ( ( ~ p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS__POINT(X0,X1),X4),X5))
| ! [X7] :
( ~ mem(X7,X0)
| p(ap(X5,ap(X4,X7))) ) )
& ( ( mem(sK33(X0,X4,X5),X0)
& ~ p(ap(X5,ap(X4,sK33(X0,X4,X5)))) )
| p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS__POINT(X0,X1),X4),X5)) ) ) ) )
& sP16(X0,X2,X3,X1)
& sP17(X0,X2,X3,X1) ) ) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK33]),skolemize(X6,sK33(X0,X4,X5))],[f198]) ).
fof(f203,plain,
ne(sK19),
inference(cnf_transformation,[],[f131]) ).
fof(f204,plain,
ne(sK20),
inference(cnf_transformation,[],[f131]) ).
fof(f205,plain,
mem(sK21,arr(sK20,sK19)),
inference(cnf_transformation,[],[f131]) ).
fof(f206,plain,
mem(sK22,arr(sK19,bool)),
inference(cnf_transformation,[],[f131]) ).
fof(f207,plain,
mem(sK23,arr(sK19,bool)),
inference(cnf_transformation,[],[f131]) ).
fof(f208,plain,
! [X5] :
( ~ mem(X5,sK19)
| ~ p(ap(sK23,X5))
| p(ap(sK22,X5)) ),
inference(cnf_transformation,[],[f131]) ).
fof(f209,plain,
p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(sK20,sK19),sK21),sK22)),
inference(cnf_transformation,[],[f131]) ).
fof(f210,plain,
~ p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(sK20,sK19),sK21),sK23)),
inference(cnf_transformation,[],[f131]) ).
fof(f333,plain,
! [X2,X3,X0,X1] :
( ~ mem(X2,arr(X0,X1))
| ~ mem(X3,X0)
| mem(ap(X2,X3),X1) ),
inference(cnf_transformation,[],[f92]) ).
fof(f334,plain,
! [X2,X3,X0,X1,X5] :
( ~ sP18(X0,X1)
| ~ mem(X2,arr(X0,X1))
| ~ mem(X3,arr(X1,bool))
| ~ p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X0,X1),X2),X3))
| ~ mem(X5,X0)
| ~ p(ap(X3,ap(X2,X5))) ),
inference(cnf_transformation,[],[f184]) ).
fof(f335,plain,
! [X2,X3,X0,X1] :
( ~ sP18(X0,X1)
| ~ mem(X2,arr(X0,X1))
| ~ mem(X3,arr(X1,bool))
| mem(sK24(X0,X2,X3),X0)
| p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X0,X1),X2),X3)) ),
inference(cnf_transformation,[],[f184]) ).
fof(f336,plain,
! [X2,X3,X0,X1] :
( ~ sP18(X0,X1)
| ~ mem(X2,arr(X0,X1))
| ~ mem(X3,arr(X1,bool))
| p(ap(X3,ap(X2,sK24(X0,X2,X3))))
| p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X0,X1),X2),X3)) ),
inference(cnf_transformation,[],[f184]) ).
fof(f359,plain,
! [X2,X3,X0,X1] :
( ~ ne(X0)
| ~ ne(X1)
| ~ mem(X2,arr(X0,X1))
| ~ mem(X3,arr(X1,bool))
| sP18(X0,X1) ),
inference(cnf_transformation,[],[f199]) ).
tcf(c_49,negated_conjecture,
~ p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(sK20,sK19),sK21),sK23)),
inference(cnf_transformation,[],[f210]) ).
tcf(c_50,negated_conjecture,
p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(sK20,sK19),sK21),sK22)),
inference(cnf_transformation,[],[f209]) ).
tcf(c_51,negated_conjecture,
! [X0: $i] :
( p(ap(sK22,X0))
| ~ mem(X0,sK19)
| ~ p(ap(sK23,X0)) ),
inference(cnf_transformation,[],[f208]) ).
tcf(c_52,negated_conjecture,
mem(sK23,arr(sK19,bool)),
inference(cnf_transformation,[],[f207]) ).
tcf(c_53,negated_conjecture,
mem(sK22,arr(sK19,bool)),
inference(cnf_transformation,[],[f206]) ).
tcf(c_54,negated_conjecture,
mem(sK21,arr(sK20,sK19)),
inference(cnf_transformation,[],[f205]) ).
tcf(c_55,negated_conjecture,
ne(sK20),
inference(cnf_transformation,[],[f204]) ).
tcf(c_56,negated_conjecture,
ne(sK19),
inference(cnf_transformation,[],[f203]) ).
tcf(c_141,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( mem(ap(X0,X3),X2)
| ~ mem(X3,X1)
| ~ mem(X0,arr(X1,X2)) ),
inference(cnf_transformation,[],[f333]) ).
tcf(c_142,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X1,X2),X0),X3))
| p(ap(X3,ap(X0,sK24(X1,X0,X3))))
| ~ sP18(X1,X2)
| ~ mem(X3,arr(X2,bool))
| ~ mem(X0,arr(X1,X2)) ),
inference(cnf_transformation,[],[f336]) ).
tcf(c_143,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( mem(sK24(X1,X0,X3),X1)
| p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X1,X2),X0),X3))
| ~ sP18(X1,X2)
| ~ mem(X3,arr(X2,bool))
| ~ mem(X0,arr(X1,X2)) ),
inference(cnf_transformation,[],[f335]) ).
tcf(c_144,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] :
( ~ sP18(X0,X1)
| ~ mem(X4,X0)
| ~ mem(X3,arr(X1,bool))
| ~ mem(X2,arr(X0,X1))
| ~ p(ap(X3,ap(X2,X4)))
| ~ p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X0,X1),X2),X3)) ),
inference(cnf_transformation,[],[f334]) ).
tcf(c_170,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( sP18(X1,X2)
| ~ ne(X2)
| ~ ne(X1)
| ~ mem(X3,arr(X2,bool))
| ~ mem(X0,arr(X1,X2)) ),
inference(cnf_transformation,[],[f359]) ).
tcf(c_6437,plain,
( p(ap(sK23,ap(sK21,sK24(sK20,sK21,sK23))))
| ~ sP18(sK20,sK19)
| ~ mem(sK23,arr(sK19,bool))
| ~ mem(sK21,arr(sK20,sK19)) ),
inference(superposition,[status(thm)],[c_142,c_49]) ).
tcf(c_6439,plain,
( p(ap(sK23,ap(sK21,sK24(sK20,sK21,sK23))))
| ~ sP18(sK20,sK19) ),
inference(forward_subsumption_resolution,[status(thm)],[c_6437,c_52,c_54]) ).
tcf(c_6463,plain,
! [X0: $i] :
( mem(ap(sK21,X0),sK19)
| ~ mem(X0,sK20) ),
inference(superposition,[status(thm)],[c_54,c_141]) ).
tcf(c_6513,plain,
( p(ap(sK22,ap(sK21,sK24(sK20,sK21,sK23))))
| ~ sP18(sK20,sK19)
| ~ mem(ap(sK21,sK24(sK20,sK21,sK23)),sK19) ),
inference(superposition,[status(thm)],[c_6439,c_51]) ).
tcf(c_6663,plain,
( mem(sK24(sK20,sK21,sK23),sK20)
| ~ sP18(sK20,sK19)
| ~ mem(sK23,arr(sK19,bool))
| ~ mem(sK21,arr(sK20,sK19)) ),
inference(superposition,[status(thm)],[c_143,c_49]) ).
tcf(c_6664,plain,
( mem(sK24(sK20,sK21,sK23),sK20)
| ~ sP18(sK20,sK19) ),
inference(forward_subsumption_resolution,[status(thm)],[c_6663,c_52,c_54]) ).
tcf(c_7204,plain,
! [X0: $i] :
( sP18(sK20,sK19)
| ~ ne(sK19)
| ~ ne(sK20)
| ~ mem(X0,arr(sK19,bool)) ),
inference(superposition,[status(thm)],[c_54,c_170]) ).
tcf(c_7215,plain,
! [X0: $i] :
( sP18(sK20,sK19)
| ~ mem(X0,arr(sK19,bool)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_7204,c_56,c_55]) ).
tcf(c_7346,plain,
sP18(sK20,sK19),
inference(superposition,[status(thm)],[c_52,c_7215]) ).
tcf(c_7352,plain,
mem(sK24(sK20,sK21,sK23),sK20),
inference(backward_subsumption_resolution,[status(thm)],[c_6664,c_7346]) ).
tcf(c_7353,plain,
( p(ap(sK22,ap(sK21,sK24(sK20,sK21,sK23))))
| ~ mem(ap(sK21,sK24(sK20,sK21,sK23)),sK19) ),
inference(backward_subsumption_resolution,[status(thm)],[c_6513,c_7346]) ).
tcf(c_12837,plain,
! [X0: $i] :
( ~ sP18(sK20,sK19)
| ~ mem(X0,sK20)
| ~ mem(sK22,arr(sK19,bool))
| ~ mem(sK21,arr(sK20,sK19))
| ~ p(ap(sK22,ap(sK21,X0))) ),
inference(superposition,[status(thm)],[c_50,c_144]) ).
tcf(c_12848,plain,
! [X0: $i] :
( ~ mem(X0,sK20)
| ~ p(ap(sK22,ap(sK21,X0))) ),
inference(forward_subsumption_resolution,[status(thm)],[c_12837,c_7346,c_53,c_54]) ).
tcf(c_13033,plain,
( ~ mem(sK24(sK20,sK21,sK23),sK20)
| ~ mem(ap(sK21,sK24(sK20,sK21,sK23)),sK19) ),
inference(superposition,[status(thm)],[c_7353,c_12848]) ).
tcf(c_13046,plain,
~ mem(ap(sK21,sK24(sK20,sK21,sK23)),sK19),
inference(forward_subsumption_resolution,[status(thm)],[c_13033,c_7352]) ).
tcf(c_13153,plain,
~ mem(sK24(sK20,sK21,sK23),sK20),
inference(superposition,[status(thm)],[c_6463,c_13046]) ).
tcf(c_13154,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_13153,c_7352]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : ITP006+2 : TPTP v9.3.1. Bugfixed v7.5.0.
% 0.00/0.02 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.06/11.17 % Computer : n012.cluster.edu
% 0.06/11.17 % Model : x86_64 x86_64
% 0.06/11.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/11.17 % Memory : 8046.5625MB
% 0.06/11.17 % OS : Linux 6.8.0-71-generic
% 0.06/11.17 % CPULimit : 300
% 0.06/11.17 % WCLimit : 300
% 0.06/11.17 % DateTime : Wed Sep 23 17:30:37 UTC 2026
% 0.06/11.18 % CPUTime :
% 0.06/11.18 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.08/11.20 Running first-order theorem proving
% 0.08/11.20 Running: /export/starexec/sandbox/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.08/11.21
% 0.08/11.21 % ======== iProver multi-core TPTP/SMT =========
% 0.08/11.21
% 0.08/11.21 % Detected problem language: tptp
% 0.08/11.21 % Proving...
% 8.24/12.40 % SZS status Started for theBenchmark.p
% 8.24/12.40 % SZS status Theorem for theBenchmark.p
% 8.24/12.40
% 8.24/12.40 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 8.24/12.40
% 8.24/12.40 % ------ iProver source info
% 8.24/12.40
% 8.24/12.40 % git: date: 2026-07-19 20:42:38 +0200
% 8.24/12.40 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 8.24/12.40 % git: non_committed_changes: false
% 8.24/12.40
% 8.24/12.40 % ------ Parsing...
% 8.24/12.40 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 8.24/12.40
% 8.24/12.40 % ------ Preprocessing... sup_sim: 0 sf_s rm: 2 0s sf_e pe_s pe:1:0s pe:2:0s pe:4:0s pe:8:0s pe_e sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e %
% 8.24/12.40
% 8.24/12.40 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 8.24/12.40
% 8.24/12.40 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 8.24/12.40 % ------ Proving...
% 8.24/12.40 % ------ Problem Properties
% 8.24/12.40
% 8.24/12.40 %
% 8.24/12.40 % clauses 52
% 8.24/12.40 % conjectures 8
% 8.24/12.40 % EPR 5
% 8.24/12.40 % Horn 37
% 8.24/12.40 % unary 8
% 8.24/12.40 % binary 0
% 8.24/12.40 % lits 219
% 8.24/12.40 % lits eq 9
% 8.24/12.40 % fd_pure 0
% 8.24/12.40 % fd_pseudo 0
% 8.24/12.40 % fd_cond 0
% 8.24/12.40 % fd_pseudo_cond 4
% 8.24/12.40 % AC symbols 0
% 8.24/12.40
% 8.24/12.40 % ------ Schedule dynamic 5 is on
% 8.24/12.40
% 8.24/12.40 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 8.24/12.40
% 8.24/12.40
% 8.24/12.40 % ------
% 8.24/12.40 % Current options:
% 8.24/12.40 % ------
% 8.24/12.40
% 8.24/12.40
% 8.24/12.40 %
% 8.24/12.40
% 8.24/12.40 % ------ Proving...
% 8.24/12.40 %
% 8.24/12.40
% 8.24/12.40 % SZS status Theorem for theBenchmark.p
% 8.24/12.40
% 8.24/12.40 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 8.24/12.40
% 8.24/12.40
%------------------------------------------------------------------------------