TSTP Solution File: PHI009+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : PHI009+1 : TPTP v8.1.2. Released v7.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n017.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 02:53:37 EDT 2024
% Result : Theorem 0.48s 1.16s
% Output : CNFRefutation 0.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 8
% Syntax : Number of formulae : 69 ( 12 unt; 0 def)
% Number of atoms : 345 ( 38 equ)
% Maximal formula atoms : 16 ( 5 avg)
% Number of connectives : 449 ( 173 ~; 165 |; 87 &)
% ( 5 <=>; 19 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 3 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 153 ( 4 sgn 82 !; 26 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1,X2] :
( ( object(X2)
& property(X1)
& property(X0) )
=> ( ( exemplifies_property(X1,X2)
& is_the(X2,X0) )
<=> ? [X3] :
( exemplifies_property(X1,X3)
& ! [X4] :
( object(X4)
=> ( exemplifies_property(X0,X4)
=> X3 = X4 ) )
& exemplifies_property(X0,X3)
& object(X3) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',description_axiom_schema_instance) ).
fof(f2,conjecture,
! [X0] :
( property(X0)
=> ( ? [X3] :
( ! [X4] :
( object(X4)
=> ( exemplifies_property(X0,X4)
=> X3 = X4 ) )
& exemplifies_property(X0,X3)
& object(X3) )
=> ? [X5] :
( is_the(X5,X0)
& object(X5) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',description_theorem_1) ).
fof(f3,negated_conjecture,
~ ! [X0] :
( property(X0)
=> ( ? [X3] :
( ! [X4] :
( object(X4)
=> ( exemplifies_property(X0,X4)
=> X3 = X4 ) )
& exemplifies_property(X0,X3)
& object(X3) )
=> ? [X5] :
( is_the(X5,X0)
& object(X5) ) ) ),
inference(negated_conjecture,[],[f2]) ).
fof(f4,plain,
~ ! [X0] :
( property(X0)
=> ( ? [X1] :
( ! [X2] :
( object(X2)
=> ( exemplifies_property(X0,X2)
=> X1 = X2 ) )
& exemplifies_property(X0,X1)
& object(X1) )
=> ? [X3] :
( is_the(X3,X0)
& object(X3) ) ) ),
inference(rectify,[],[f3]) ).
fof(f5,plain,
! [X0,X1,X2] :
( ( ( exemplifies_property(X1,X2)
& is_the(X2,X0) )
<=> ? [X3] :
( exemplifies_property(X1,X3)
& ! [X4] :
( X3 = X4
| ~ exemplifies_property(X0,X4)
| ~ object(X4) )
& exemplifies_property(X0,X3)
& object(X3) ) )
| ~ object(X2)
| ~ property(X1)
| ~ property(X0) ),
inference(ennf_transformation,[],[f1]) ).
fof(f6,plain,
! [X0,X1,X2] :
( ( ( exemplifies_property(X1,X2)
& is_the(X2,X0) )
<=> ? [X3] :
( exemplifies_property(X1,X3)
& ! [X4] :
( X3 = X4
| ~ exemplifies_property(X0,X4)
| ~ object(X4) )
& exemplifies_property(X0,X3)
& object(X3) ) )
| ~ object(X2)
| ~ property(X1)
| ~ property(X0) ),
inference(flattening,[],[f5]) ).
fof(f7,plain,
? [X0] :
( ! [X3] :
( ~ is_the(X3,X0)
| ~ object(X3) )
& ? [X1] :
( ! [X2] :
( X1 = X2
| ~ exemplifies_property(X0,X2)
| ~ object(X2) )
& exemplifies_property(X0,X1)
& object(X1) )
& property(X0) ),
inference(ennf_transformation,[],[f4]) ).
fof(f8,plain,
? [X0] :
( ! [X3] :
( ~ is_the(X3,X0)
| ~ object(X3) )
& ? [X1] :
( ! [X2] :
( X1 = X2
| ~ exemplifies_property(X0,X2)
| ~ object(X2) )
& exemplifies_property(X0,X1)
& object(X1) )
& property(X0) ),
inference(flattening,[],[f7]) ).
fof(f9,plain,
! [X1,X0] :
( sP0(X1,X0)
<=> ? [X3] :
( exemplifies_property(X1,X3)
& ! [X4] :
( X3 = X4
| ~ exemplifies_property(X0,X4)
| ~ object(X4) )
& exemplifies_property(X0,X3)
& object(X3) ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP0])]) ).
fof(f10,plain,
! [X0,X1,X2] :
( ( ( exemplifies_property(X1,X2)
& is_the(X2,X0) )
<=> sP0(X1,X0) )
| ~ sP1(X0,X1,X2) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP1])]) ).
fof(f11,plain,
! [X0,X1,X2] :
( sP1(X0,X1,X2)
| ~ object(X2)
| ~ property(X1)
| ~ property(X0) ),
inference(definition_folding,[],[f6,f10,f9]) ).
fof(f12,plain,
! [X0,X1,X2] :
( ( ( ( exemplifies_property(X1,X2)
& is_the(X2,X0) )
| ~ sP0(X1,X0) )
& ( sP0(X1,X0)
| ~ exemplifies_property(X1,X2)
| ~ is_the(X2,X0) ) )
| ~ sP1(X0,X1,X2) ),
inference(nnf_transformation,[],[f10]) ).
fof(f13,plain,
! [X0,X1,X2] :
( ( ( ( exemplifies_property(X1,X2)
& is_the(X2,X0) )
| ~ sP0(X1,X0) )
& ( sP0(X1,X0)
| ~ exemplifies_property(X1,X2)
| ~ is_the(X2,X0) ) )
| ~ sP1(X0,X1,X2) ),
inference(flattening,[],[f12]) ).
fof(f14,plain,
! [X1,X0] :
( ( sP0(X1,X0)
| ! [X3] :
( ~ exemplifies_property(X1,X3)
| ? [X4] :
( X3 != X4
& exemplifies_property(X0,X4)
& object(X4) )
| ~ exemplifies_property(X0,X3)
| ~ object(X3) ) )
& ( ? [X3] :
( exemplifies_property(X1,X3)
& ! [X4] :
( X3 = X4
| ~ exemplifies_property(X0,X4)
| ~ object(X4) )
& exemplifies_property(X0,X3)
& object(X3) )
| ~ sP0(X1,X0) ) ),
inference(nnf_transformation,[],[f9]) ).
fof(f15,plain,
! [X0,X1] :
( ( sP0(X0,X1)
| ! [X2] :
( ~ exemplifies_property(X0,X2)
| ? [X3] :
( X2 != X3
& exemplifies_property(X1,X3)
& object(X3) )
| ~ exemplifies_property(X1,X2)
| ~ object(X2) ) )
& ( ? [X4] :
( exemplifies_property(X0,X4)
& ! [X5] :
( X4 = X5
| ~ exemplifies_property(X1,X5)
| ~ object(X5) )
& exemplifies_property(X1,X4)
& object(X4) )
| ~ sP0(X0,X1) ) ),
inference(rectify,[],[f14]) ).
fof(f16,plain,
! [X1,X2] :
( ? [X3] :
( X2 != X3
& exemplifies_property(X1,X3)
& object(X3) )
=> ( sK2(X1,X2) != X2
& exemplifies_property(X1,sK2(X1,X2))
& object(sK2(X1,X2)) ) ),
introduced(choice_axiom,[]) ).
fof(f17,plain,
! [X0,X1] :
( ? [X4] :
( exemplifies_property(X0,X4)
& ! [X5] :
( X4 = X5
| ~ exemplifies_property(X1,X5)
| ~ object(X5) )
& exemplifies_property(X1,X4)
& object(X4) )
=> ( exemplifies_property(X0,sK3(X0,X1))
& ! [X5] :
( sK3(X0,X1) = X5
| ~ exemplifies_property(X1,X5)
| ~ object(X5) )
& exemplifies_property(X1,sK3(X0,X1))
& object(sK3(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f18,plain,
! [X0,X1] :
( ( sP0(X0,X1)
| ! [X2] :
( ~ exemplifies_property(X0,X2)
| ( sK2(X1,X2) != X2
& exemplifies_property(X1,sK2(X1,X2))
& object(sK2(X1,X2)) )
| ~ exemplifies_property(X1,X2)
| ~ object(X2) ) )
& ( ( exemplifies_property(X0,sK3(X0,X1))
& ! [X5] :
( sK3(X0,X1) = X5
| ~ exemplifies_property(X1,X5)
| ~ object(X5) )
& exemplifies_property(X1,sK3(X0,X1))
& object(sK3(X0,X1)) )
| ~ sP0(X0,X1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3])],[f15,f17,f16]) ).
fof(f19,plain,
? [X0] :
( ! [X1] :
( ~ is_the(X1,X0)
| ~ object(X1) )
& ? [X2] :
( ! [X3] :
( X2 = X3
| ~ exemplifies_property(X0,X3)
| ~ object(X3) )
& exemplifies_property(X0,X2)
& object(X2) )
& property(X0) ),
inference(rectify,[],[f8]) ).
fof(f20,plain,
( ? [X0] :
( ! [X1] :
( ~ is_the(X1,X0)
| ~ object(X1) )
& ? [X2] :
( ! [X3] :
( X2 = X3
| ~ exemplifies_property(X0,X3)
| ~ object(X3) )
& exemplifies_property(X0,X2)
& object(X2) )
& property(X0) )
=> ( ! [X1] :
( ~ is_the(X1,sK4)
| ~ object(X1) )
& ? [X2] :
( ! [X3] :
( X2 = X3
| ~ exemplifies_property(sK4,X3)
| ~ object(X3) )
& exemplifies_property(sK4,X2)
& object(X2) )
& property(sK4) ) ),
introduced(choice_axiom,[]) ).
fof(f21,plain,
( ? [X2] :
( ! [X3] :
( X2 = X3
| ~ exemplifies_property(sK4,X3)
| ~ object(X3) )
& exemplifies_property(sK4,X2)
& object(X2) )
=> ( ! [X3] :
( sK5 = X3
| ~ exemplifies_property(sK4,X3)
| ~ object(X3) )
& exemplifies_property(sK4,sK5)
& object(sK5) ) ),
introduced(choice_axiom,[]) ).
fof(f22,plain,
( ! [X1] :
( ~ is_the(X1,sK4)
| ~ object(X1) )
& ! [X3] :
( sK5 = X3
| ~ exemplifies_property(sK4,X3)
| ~ object(X3) )
& exemplifies_property(sK4,sK5)
& object(sK5)
& property(sK4) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK4,sK5])],[f19,f21,f20]) ).
fof(f24,plain,
! [X2,X0,X1] :
( is_the(X2,X0)
| ~ sP0(X1,X0)
| ~ sP1(X0,X1,X2) ),
inference(cnf_transformation,[],[f13]) ).
fof(f30,plain,
! [X2,X0,X1] :
( sP0(X0,X1)
| ~ exemplifies_property(X0,X2)
| object(sK2(X1,X2))
| ~ exemplifies_property(X1,X2)
| ~ object(X2) ),
inference(cnf_transformation,[],[f18]) ).
fof(f31,plain,
! [X2,X0,X1] :
( sP0(X0,X1)
| ~ exemplifies_property(X0,X2)
| exemplifies_property(X1,sK2(X1,X2))
| ~ exemplifies_property(X1,X2)
| ~ object(X2) ),
inference(cnf_transformation,[],[f18]) ).
fof(f32,plain,
! [X2,X0,X1] :
( sP0(X0,X1)
| ~ exemplifies_property(X0,X2)
| sK2(X1,X2) != X2
| ~ exemplifies_property(X1,X2)
| ~ object(X2) ),
inference(cnf_transformation,[],[f18]) ).
fof(f33,plain,
! [X2,X0,X1] :
( sP1(X0,X1,X2)
| ~ object(X2)
| ~ property(X1)
| ~ property(X0) ),
inference(cnf_transformation,[],[f11]) ).
fof(f34,plain,
property(sK4),
inference(cnf_transformation,[],[f22]) ).
fof(f35,plain,
object(sK5),
inference(cnf_transformation,[],[f22]) ).
fof(f36,plain,
exemplifies_property(sK4,sK5),
inference(cnf_transformation,[],[f22]) ).
fof(f37,plain,
! [X3] :
( sK5 = X3
| ~ exemplifies_property(sK4,X3)
| ~ object(X3) ),
inference(cnf_transformation,[],[f22]) ).
fof(f38,plain,
! [X1] :
( ~ is_the(X1,sK4)
| ~ object(X1) ),
inference(cnf_transformation,[],[f22]) ).
cnf(c_50,plain,
( ~ sP1(X0,X1,X2)
| ~ sP0(X1,X0)
| is_the(X2,X0) ),
inference(cnf_transformation,[],[f24]) ).
cnf(c_52,plain,
( sK2(X0,X1) != X1
| ~ exemplifies_property(X0,X1)
| ~ exemplifies_property(X2,X1)
| ~ object(X1)
| sP0(X2,X0) ),
inference(cnf_transformation,[],[f32]) ).
cnf(c_53,plain,
( ~ exemplifies_property(X0,X1)
| ~ exemplifies_property(X2,X1)
| ~ object(X1)
| exemplifies_property(X0,sK2(X0,X1))
| sP0(X2,X0) ),
inference(cnf_transformation,[],[f31]) ).
cnf(c_54,plain,
( ~ exemplifies_property(X0,X1)
| ~ exemplifies_property(X2,X1)
| ~ object(X1)
| object(sK2(X0,X1))
| sP0(X2,X0) ),
inference(cnf_transformation,[],[f30]) ).
cnf(c_59,plain,
( ~ object(X0)
| ~ property(X1)
| ~ property(X2)
| sP1(X2,X1,X0) ),
inference(cnf_transformation,[],[f33]) ).
cnf(c_60,negated_conjecture,
( ~ is_the(X0,sK4)
| ~ object(X0) ),
inference(cnf_transformation,[],[f38]) ).
cnf(c_61,negated_conjecture,
( ~ exemplifies_property(sK4,X0)
| ~ object(X0)
| X0 = sK5 ),
inference(cnf_transformation,[],[f37]) ).
cnf(c_62,negated_conjecture,
exemplifies_property(sK4,sK5),
inference(cnf_transformation,[],[f36]) ).
cnf(c_63,negated_conjecture,
object(sK5),
inference(cnf_transformation,[],[f35]) ).
cnf(c_64,negated_conjecture,
property(sK4),
inference(cnf_transformation,[],[f34]) ).
cnf(c_321,plain,
( X0 != X1
| X2 != X3
| X4 != X5
| ~ sP0(X2,X0)
| ~ object(X5)
| ~ property(X1)
| ~ property(X3)
| is_the(X4,X0) ),
inference(resolution_lifted,[status(thm)],[c_50,c_59]) ).
cnf(c_322,plain,
( ~ sP0(X0,X1)
| ~ object(X2)
| ~ property(X0)
| ~ property(X1)
| is_the(X2,X1) ),
inference(unflattening,[status(thm)],[c_321]) ).
cnf(c_396,plain,
( X0 != X1
| X2 != sK4
| ~ sP0(X3,X2)
| ~ object(X0)
| ~ object(X1)
| ~ property(X2)
| ~ property(X3) ),
inference(resolution_lifted,[status(thm)],[c_60,c_322]) ).
cnf(c_397,plain,
( ~ sP0(X0,sK4)
| ~ object(X1)
| ~ property(X0)
| ~ property(sK4) ),
inference(unflattening,[status(thm)],[c_396]) ).
cnf(c_399,plain,
( ~ property(X0)
| ~ object(X1)
| ~ sP0(X0,sK4) ),
inference(global_subsumption_just,[status(thm)],[c_397,c_64,c_397]) ).
cnf(c_400,plain,
( ~ sP0(X0,sK4)
| ~ object(X1)
| ~ property(X0) ),
inference(renaming,[status(thm)],[c_399]) ).
cnf(c_603,plain,
( ~ object(X0)
| ~ sP0_iProver_def ),
inference(splitting,[splitting(split),new_symbols(definition,[sP0_iProver_def])],[c_400]) ).
cnf(c_604,plain,
( ~ sP0(X0,sK4)
| ~ property(X0)
| ~ sP1_iProver_def ),
inference(splitting,[splitting(split),new_symbols(definition,[sP1_iProver_def])],[c_400]) ).
cnf(c_605,plain,
( sP0_iProver_def
| sP1_iProver_def ),
inference(splitting,[splitting(split),new_symbols(definition,[])],[c_400]) ).
cnf(c_607,negated_conjecture,
object(sK5),
inference(demodulation,[status(thm)],[c_63]) ).
cnf(c_608,negated_conjecture,
exemplifies_property(sK4,sK5),
inference(demodulation,[status(thm)],[c_62]) ).
cnf(c_609,negated_conjecture,
( ~ exemplifies_property(sK4,X0)
| ~ object(X0)
| X0 = sK5 ),
inference(demodulation,[status(thm)],[c_61]) ).
cnf(c_620,plain,
( ~ sP0(sK4,sK4)
| ~ property(sK4)
| ~ sP1_iProver_def ),
inference(instantiation,[status(thm)],[c_604]) ).
cnf(c_903,plain,
~ sP0_iProver_def,
inference(superposition,[status(thm)],[c_607,c_603]) ).
cnf(c_904,plain,
sP1_iProver_def,
inference(backward_subsumption_resolution,[status(thm)],[c_605,c_903]) ).
cnf(c_1001,plain,
( ~ exemplifies_property(X0,sK5)
| ~ object(sK5)
| object(sK2(X0,sK5))
| sP0(sK4,X0) ),
inference(superposition,[status(thm)],[c_608,c_54]) ).
cnf(c_1002,plain,
( ~ exemplifies_property(X0,sK5)
| object(sK2(X0,sK5))
| sP0(sK4,X0) ),
inference(forward_subsumption_resolution,[status(thm)],[c_1001,c_607]) ).
cnf(c_1016,plain,
( ~ exemplifies_property(sK4,sK5)
| object(sK2(sK4,sK5))
| sP0(sK4,sK4) ),
inference(instantiation,[status(thm)],[c_1002]) ).
cnf(c_1035,plain,
( ~ exemplifies_property(X0,sK5)
| ~ object(sK5)
| exemplifies_property(X0,sK2(X0,sK5))
| sP0(sK4,X0) ),
inference(superposition,[status(thm)],[c_608,c_53]) ).
cnf(c_1036,plain,
( ~ exemplifies_property(X0,sK5)
| exemplifies_property(X0,sK2(X0,sK5))
| sP0(sK4,X0) ),
inference(forward_subsumption_resolution,[status(thm)],[c_1035,c_607]) ).
cnf(c_1060,plain,
( ~ object(sK2(sK4,sK5))
| ~ exemplifies_property(sK4,sK5)
| sK2(sK4,sK5) = sK5
| sP0(sK4,sK4) ),
inference(superposition,[status(thm)],[c_1036,c_609]) ).
cnf(c_1061,plain,
( ~ object(sK2(sK4,sK5))
| sK2(sK4,sK5) = sK5
| sP0(sK4,sK4) ),
inference(forward_subsumption_resolution,[status(thm)],[c_1060,c_608]) ).
cnf(c_1084,plain,
sK2(sK4,sK5) = sK5,
inference(global_subsumption_just,[status(thm)],[c_1061,c_64,c_62,c_620,c_904,c_1016,c_1061]) ).
cnf(c_1086,plain,
( ~ exemplifies_property(X0,sK5)
| ~ exemplifies_property(sK4,sK5)
| ~ object(sK5)
| sP0(X0,sK4) ),
inference(superposition,[status(thm)],[c_1084,c_52]) ).
cnf(c_1089,plain,
( ~ exemplifies_property(X0,sK5)
| sP0(X0,sK4) ),
inference(forward_subsumption_resolution,[status(thm)],[c_1086,c_607,c_608]) ).
cnf(c_1092,plain,
( ~ exemplifies_property(sK4,sK5)
| sP0(sK4,sK4) ),
inference(instantiation,[status(thm)],[c_1089]) ).
cnf(c_1093,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_1092,c_904,c_620,c_62,c_64]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : PHI009+1 : TPTP v8.1.2. Released v7.2.0.
% 0.07/0.13 % Command : run_iprover %s %d THM
% 0.13/0.35 % Computer : n017.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 : Thu May 2 21:13:21 EDT 2024
% 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 --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.48/1.16 % SZS status Started for theBenchmark.p
% 0.48/1.16 % SZS status Theorem for theBenchmark.p
% 0.48/1.16
% 0.48/1.16 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.48/1.16
% 0.48/1.16 ------ iProver source info
% 0.48/1.16
% 0.48/1.16 git: date: 2024-05-02 19:28:25 +0000
% 0.48/1.16 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 0.48/1.16 git: non_committed_changes: false
% 0.48/1.16
% 0.48/1.16 ------ Parsing...
% 0.48/1.16 ------ Clausification by vclausify_rel & Parsing by iProver...
% 0.48/1.16
% 0.48/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
% 0.48/1.16
% 0.48/1.16 ------ Preprocessing... gs_s sp: 2 0s gs_e snvd_s sp: 0 0s snvd_e
% 0.48/1.16
% 0.48/1.16 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 0.48/1.16 ------ Proving...
% 0.48/1.16 ------ Problem Properties
% 0.48/1.16
% 0.48/1.16
% 0.48/1.16 clauses 16
% 0.48/1.16 conjectures 4
% 0.48/1.16 EPR 9
% 0.48/1.16 Horn 13
% 0.48/1.16 unary 3
% 0.48/1.16 binary 5
% 0.48/1.16 lits 50
% 0.48/1.16 lits eq 3
% 0.48/1.16 fd_pure 0
% 0.48/1.16 fd_pseudo 0
% 0.48/1.16 fd_cond 1
% 0.48/1.16 fd_pseudo_cond 1
% 0.48/1.16 AC symbols 0
% 0.48/1.16
% 0.48/1.16 ------ Schedule dynamic 5 is on
% 0.48/1.16
% 0.48/1.16 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 0.48/1.16
% 0.48/1.16
% 0.48/1.16 ------
% 0.48/1.16 Current options:
% 0.48/1.16 ------
% 0.48/1.16
% 0.48/1.16
% 0.48/1.16
% 0.48/1.16
% 0.48/1.16 ------ Proving...
% 0.48/1.16
% 0.48/1.16
% 0.48/1.16 % SZS status Theorem for theBenchmark.p
% 0.48/1.16
% 0.48/1.16 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.48/1.16
% 0.48/1.16
%------------------------------------------------------------------------------