TSTP Solution File: SWW102+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SWW102+1 : TPTP v8.1.2. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n006.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:24:22 EDT 2024
% Result : Theorem 7.62s 1.63s
% Output : CNFRefutation 7.62s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named definition)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] :
( bool(X0)
<=> ( true = X0
| false = X0 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',def_bool) ).
fof(f2,axiom,
( false != err
& true != err
& false != true ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',distinct_false_true_err) ).
fof(f3,axiom,
( d(err)
& d(false)
& d(true) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',false_true_err_in_d) ).
fof(f4,axiom,
! [X0,X1] :
( forallprefers(X0,X1)
<=> ( ( true = X1
& false = X0 )
| ( bool(X1)
& ~ bool(X0)
& d(X1)
& d(X0) )
| ( d(X1)
& ~ d(X0) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',def_forallprefers) ).
fof(f6,axiom,
! [X0] :
( ( err = phi(X0)
& ~ d(X0) )
| ( phi(X0) = X0
& d(X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',def_phi) ).
fof(f7,axiom,
! [X0] :
( true = prop(X0)
<=> bool(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prop_true) ).
fof(f8,axiom,
! [X0] :
( false = prop(X0)
<=> ~ bool(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prop_false) ).
fof(f9,axiom,
! [X2,X3] :
( ~ bool(X2)
=> impl(X2,X3) = phi(X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',impl_axiom1) ).
fof(f11,axiom,
! [X3] :
( bool(X3)
=> true = impl(false,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',impl_axiom3) ).
fof(f12,axiom,
! [X3] :
( bool(X3)
=> impl(true,X3) = X3 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',impl_axiom4) ).
fof(f14,axiom,
! [X3] : true = lazy_impl(false,X3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',lazy_impl_axiom2) ).
fof(f15,axiom,
! [X3] : phi(X3) = lazy_impl(true,X3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',lazy_impl_axiom3) ).
fof(f38,axiom,
false = false1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',def_false1) ).
fof(f39,axiom,
! [X4] : f7(X4) = lazy_impl(prop(X4),X4),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',def_f7) ).
fof(f40,axiom,
? [X4] :
( ~ ? [X9] : forallprefers(f7(X9),f7(X4))
& false2 = phi(f7(X4)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',def_false2) ).
fof(f41,axiom,
! [X2] :
( ~ bool(X2)
=> phi(X2) = not1(X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',not1_axiom1) ).
fof(f42,axiom,
true = not1(false),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',not1_axiom2) ).
fof(f43,axiom,
false = not1(true),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',not1_axiom3) ).
fof(f44,axiom,
! [X4] : not2(X4) = impl(X4,false2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',def_not2) ).
fof(f45,conjecture,
! [X4] : not2(X4) = not1(X4),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',not1_not2) ).
fof(f46,negated_conjecture,
~ ! [X4] : not2(X4) = not1(X4),
inference(negated_conjecture,[],[f45]) ).
fof(f47,plain,
! [X0,X1] :
( ~ bool(X0)
=> phi(X0) = impl(X0,X1) ),
inference(rectify,[],[f9]) ).
fof(f49,plain,
! [X0] :
( bool(X0)
=> true = impl(false,X0) ),
inference(rectify,[],[f11]) ).
fof(f50,plain,
! [X0] :
( bool(X0)
=> impl(true,X0) = X0 ),
inference(rectify,[],[f12]) ).
fof(f52,plain,
! [X0] : true = lazy_impl(false,X0),
inference(rectify,[],[f14]) ).
fof(f53,plain,
! [X0] : phi(X0) = lazy_impl(true,X0),
inference(rectify,[],[f15]) ).
fof(f76,plain,
! [X0] : f7(X0) = lazy_impl(prop(X0),X0),
inference(rectify,[],[f39]) ).
fof(f77,plain,
? [X0] :
( ~ ? [X1] : forallprefers(f7(X1),f7(X0))
& false2 = phi(f7(X0)) ),
inference(rectify,[],[f40]) ).
fof(f78,plain,
! [X0] :
( ~ bool(X0)
=> phi(X0) = not1(X0) ),
inference(rectify,[],[f41]) ).
fof(f79,plain,
! [X0] : not2(X0) = impl(X0,false2),
inference(rectify,[],[f44]) ).
fof(f80,plain,
~ ! [X0] : not1(X0) = not2(X0),
inference(rectify,[],[f46]) ).
fof(f82,plain,
! [X0,X1] :
( ( ( true = X1
& false = X0 )
| ( bool(X1)
& ~ bool(X0)
& d(X1)
& d(X0) )
| ( d(X1)
& ~ d(X0) ) )
=> forallprefers(X0,X1) ),
inference(unused_predicate_definition_removal,[],[f4]) ).
fof(f83,plain,
! [X0,X1] :
( forallprefers(X0,X1)
| ( ( true != X1
| false != X0 )
& ( ~ bool(X1)
| bool(X0)
| ~ d(X1)
| ~ d(X0) )
& ( ~ d(X1)
| d(X0) ) ) ),
inference(ennf_transformation,[],[f82]) ).
fof(f85,plain,
! [X0,X1] :
( phi(X0) = impl(X0,X1)
| bool(X0) ),
inference(ennf_transformation,[],[f47]) ).
fof(f88,plain,
! [X0] :
( true = impl(false,X0)
| ~ bool(X0) ),
inference(ennf_transformation,[],[f49]) ).
fof(f89,plain,
! [X0] :
( impl(true,X0) = X0
| ~ bool(X0) ),
inference(ennf_transformation,[],[f50]) ).
fof(f108,plain,
? [X0] :
( ! [X1] : ~ forallprefers(f7(X1),f7(X0))
& false2 = phi(f7(X0)) ),
inference(ennf_transformation,[],[f77]) ).
fof(f109,plain,
! [X0] :
( phi(X0) = not1(X0)
| bool(X0) ),
inference(ennf_transformation,[],[f78]) ).
fof(f110,plain,
? [X0] : not1(X0) != not2(X0),
inference(ennf_transformation,[],[f80]) ).
fof(f111,plain,
! [X0] :
( ( bool(X0)
| ( true != X0
& false != X0 ) )
& ( true = X0
| false = X0
| ~ bool(X0) ) ),
inference(nnf_transformation,[],[f1]) ).
fof(f112,plain,
! [X0] :
( ( bool(X0)
| ( true != X0
& false != X0 ) )
& ( true = X0
| false = X0
| ~ bool(X0) ) ),
inference(flattening,[],[f111]) ).
fof(f113,plain,
! [X0] :
( ( true = prop(X0)
| ~ bool(X0) )
& ( bool(X0)
| true != prop(X0) ) ),
inference(nnf_transformation,[],[f7]) ).
fof(f114,plain,
! [X0] :
( ( false = prop(X0)
| bool(X0) )
& ( ~ bool(X0)
| false != prop(X0) ) ),
inference(nnf_transformation,[],[f8]) ).
fof(f127,plain,
( ? [X0] :
( ! [X1] : ~ forallprefers(f7(X1),f7(X0))
& false2 = phi(f7(X0)) )
=> ( ! [X1] : ~ forallprefers(f7(X1),f7(sK6))
& false2 = phi(f7(sK6)) ) ),
introduced(choice_axiom,[]) ).
fof(f128,plain,
( ! [X1] : ~ forallprefers(f7(X1),f7(sK6))
& false2 = phi(f7(sK6)) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK6])],[f108,f127]) ).
fof(f129,plain,
( ? [X0] : not1(X0) != not2(X0)
=> not1(sK7) != not2(sK7) ),
introduced(choice_axiom,[]) ).
fof(f130,plain,
not1(sK7) != not2(sK7),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK7])],[f110,f129]) ).
fof(f131,plain,
! [X0] :
( true = X0
| false = X0
| ~ bool(X0) ),
inference(cnf_transformation,[],[f112]) ).
fof(f132,plain,
! [X0] :
( bool(X0)
| false != X0 ),
inference(cnf_transformation,[],[f112]) ).
fof(f136,plain,
false != err,
inference(cnf_transformation,[],[f2]) ).
fof(f137,plain,
d(true),
inference(cnf_transformation,[],[f3]) ).
fof(f138,plain,
d(false),
inference(cnf_transformation,[],[f3]) ).
fof(f142,plain,
! [X0,X1] :
( forallprefers(X0,X1)
| true != X1
| false != X0 ),
inference(cnf_transformation,[],[f83]) ).
fof(f147,plain,
! [X0] :
( ~ d(X0)
| phi(X0) = X0 ),
inference(cnf_transformation,[],[f6]) ).
fof(f149,plain,
! [X0] :
( err = phi(X0)
| phi(X0) = X0 ),
inference(cnf_transformation,[],[f6]) ).
fof(f150,plain,
! [X0] :
( bool(X0)
| true != prop(X0) ),
inference(cnf_transformation,[],[f113]) ).
fof(f151,plain,
! [X0] :
( true = prop(X0)
| ~ bool(X0) ),
inference(cnf_transformation,[],[f113]) ).
fof(f153,plain,
! [X0] :
( false = prop(X0)
| bool(X0) ),
inference(cnf_transformation,[],[f114]) ).
fof(f154,plain,
! [X0,X1] :
( phi(X0) = impl(X0,X1)
| bool(X0) ),
inference(cnf_transformation,[],[f85]) ).
fof(f156,plain,
! [X0] :
( true = impl(false,X0)
| ~ bool(X0) ),
inference(cnf_transformation,[],[f88]) ).
fof(f157,plain,
! [X0] :
( impl(true,X0) = X0
| ~ bool(X0) ),
inference(cnf_transformation,[],[f89]) ).
fof(f159,plain,
! [X0] : true = lazy_impl(false,X0),
inference(cnf_transformation,[],[f52]) ).
fof(f160,plain,
! [X0] : phi(X0) = lazy_impl(true,X0),
inference(cnf_transformation,[],[f53]) ).
fof(f189,plain,
false = false1,
inference(cnf_transformation,[],[f38]) ).
fof(f190,plain,
! [X0] : f7(X0) = lazy_impl(prop(X0),X0),
inference(cnf_transformation,[],[f76]) ).
fof(f191,plain,
false2 = phi(f7(sK6)),
inference(cnf_transformation,[],[f128]) ).
fof(f192,plain,
! [X1] : ~ forallprefers(f7(X1),f7(sK6)),
inference(cnf_transformation,[],[f128]) ).
fof(f193,plain,
! [X0] :
( phi(X0) = not1(X0)
| bool(X0) ),
inference(cnf_transformation,[],[f109]) ).
fof(f194,plain,
true = not1(false),
inference(cnf_transformation,[],[f42]) ).
fof(f195,plain,
false = not1(true),
inference(cnf_transformation,[],[f43]) ).
fof(f196,plain,
! [X0] : not2(X0) = impl(X0,false2),
inference(cnf_transformation,[],[f79]) ).
fof(f197,plain,
not1(sK7) != not2(sK7),
inference(cnf_transformation,[],[f130]) ).
fof(f205,plain,
! [X0] :
( bool(X0)
| false1 != X0 ),
inference(definition_unfolding,[],[f132,f189]) ).
fof(f206,plain,
! [X0] :
( true = X0
| false1 = X0
| ~ bool(X0) ),
inference(definition_unfolding,[],[f131,f189]) ).
fof(f207,plain,
err != false1,
inference(definition_unfolding,[],[f136,f189]) ).
fof(f209,plain,
d(false1),
inference(definition_unfolding,[],[f138,f189]) ).
fof(f210,plain,
! [X0,X1] :
( forallprefers(X0,X1)
| true != X1
| false1 != X0 ),
inference(definition_unfolding,[],[f142,f189]) ).
fof(f212,plain,
! [X0] :
( err = lazy_impl(true,X0)
| lazy_impl(true,X0) = X0 ),
inference(definition_unfolding,[],[f149,f160,f160]) ).
fof(f214,plain,
! [X0] :
( ~ d(X0)
| lazy_impl(true,X0) = X0 ),
inference(definition_unfolding,[],[f147,f160]) ).
fof(f215,plain,
! [X0] :
( prop(X0) = false1
| bool(X0) ),
inference(definition_unfolding,[],[f153,f189]) ).
fof(f217,plain,
! [X0,X1] :
( impl(X0,X1) = lazy_impl(true,X0)
| bool(X0) ),
inference(definition_unfolding,[],[f154,f160]) ).
fof(f219,plain,
! [X0] :
( true = impl(false1,X0)
| ~ bool(X0) ),
inference(definition_unfolding,[],[f156,f189]) ).
fof(f221,plain,
! [X0] : true = lazy_impl(false1,X0),
inference(definition_unfolding,[],[f159,f189]) ).
fof(f236,plain,
! [X1] : ~ forallprefers(lazy_impl(prop(X1),X1),lazy_impl(prop(sK6),sK6)),
inference(definition_unfolding,[],[f192,f190,f190]) ).
fof(f237,plain,
false2 = lazy_impl(true,lazy_impl(prop(sK6),sK6)),
inference(definition_unfolding,[],[f191,f160,f190]) ).
fof(f238,plain,
! [X0] :
( lazy_impl(true,X0) = not1(X0)
| bool(X0) ),
inference(definition_unfolding,[],[f193,f160]) ).
fof(f239,plain,
true = not1(false1),
inference(definition_unfolding,[],[f194,f189]) ).
fof(f240,plain,
false1 = not1(true),
inference(definition_unfolding,[],[f195,f189]) ).
fof(f241,plain,
not1(sK7) != impl(sK7,false2),
inference(definition_unfolding,[],[f197,f196]) ).
fof(f243,plain,
bool(false1),
inference(equality_resolution,[],[f205]) ).
fof(f244,plain,
! [X0] :
( forallprefers(X0,true)
| false1 != X0 ),
inference(equality_resolution,[],[f210]) ).
fof(f245,plain,
forallprefers(false1,true),
inference(equality_resolution,[],[f244]) ).
cnf(c_50,plain,
bool(false1),
inference(cnf_transformation,[],[f243]) ).
cnf(c_51,plain,
( ~ bool(X0)
| X0 = true
| X0 = false1 ),
inference(cnf_transformation,[],[f206]) ).
cnf(c_52,plain,
false1 != err,
inference(cnf_transformation,[],[f207]) ).
cnf(c_56,plain,
d(false1),
inference(cnf_transformation,[],[f209]) ).
cnf(c_57,plain,
d(true),
inference(cnf_transformation,[],[f137]) ).
cnf(c_58,plain,
forallprefers(false1,true),
inference(cnf_transformation,[],[f245]) ).
cnf(c_64,plain,
( lazy_impl(true,X0) = X0
| lazy_impl(true,X0) = err ),
inference(cnf_transformation,[],[f212]) ).
cnf(c_66,plain,
( ~ d(X0)
| lazy_impl(true,X0) = X0 ),
inference(cnf_transformation,[],[f214]) ).
cnf(c_67,plain,
( ~ bool(X0)
| prop(X0) = true ),
inference(cnf_transformation,[],[f151]) ).
cnf(c_68,plain,
( prop(X0) != true
| bool(X0) ),
inference(cnf_transformation,[],[f150]) ).
cnf(c_69,plain,
( prop(X0) = false1
| bool(X0) ),
inference(cnf_transformation,[],[f215]) ).
cnf(c_71,plain,
( impl(X0,X1) = lazy_impl(true,X0)
| bool(X0) ),
inference(cnf_transformation,[],[f217]) ).
cnf(c_73,plain,
( ~ bool(X0)
| impl(false1,X0) = true ),
inference(cnf_transformation,[],[f219]) ).
cnf(c_74,plain,
( ~ bool(X0)
| impl(true,X0) = X0 ),
inference(cnf_transformation,[],[f157]) ).
cnf(c_76,plain,
lazy_impl(false1,X0) = true,
inference(cnf_transformation,[],[f221]) ).
cnf(c_94,plain,
~ forallprefers(lazy_impl(prop(X0),X0),lazy_impl(prop(sK6),sK6)),
inference(cnf_transformation,[],[f236]) ).
cnf(c_95,plain,
lazy_impl(true,lazy_impl(prop(sK6),sK6)) = false2,
inference(cnf_transformation,[],[f237]) ).
cnf(c_96,plain,
( lazy_impl(true,X0) = not1(X0)
| bool(X0) ),
inference(cnf_transformation,[],[f238]) ).
cnf(c_97,plain,
not1(false1) = true,
inference(cnf_transformation,[],[f239]) ).
cnf(c_98,plain,
not1(true) = false1,
inference(cnf_transformation,[],[f240]) ).
cnf(c_99,negated_conjecture,
impl(sK7,false2) != not1(sK7),
inference(cnf_transformation,[],[f241]) ).
cnf(c_822,plain,
impl(sK7,false2) = sP0_iProver_def,
definition ).
cnf(c_823,plain,
not1(sK7) = sP1_iProver_def,
definition ).
cnf(c_824,negated_conjecture,
sP0_iProver_def != sP1_iProver_def,
inference(demodulation,[status(thm)],[c_99,c_823,c_822]) ).
cnf(c_1744,plain,
prop(false1) = true,
inference(superposition,[status(thm)],[c_50,c_67]) ).
cnf(c_1745,plain,
( prop(X0) = true
| prop(X0) = false1 ),
inference(superposition,[status(thm)],[c_69,c_67]) ).
cnf(c_1768,plain,
lazy_impl(true,false1) = false1,
inference(superposition,[status(thm)],[c_56,c_66]) ).
cnf(c_1769,plain,
lazy_impl(true,true) = true,
inference(superposition,[status(thm)],[c_57,c_66]) ).
cnf(c_1852,plain,
( lazy_impl(true,X0) = not1(X0)
| prop(X0) = true ),
inference(superposition,[status(thm)],[c_96,c_67]) ).
cnf(c_1877,plain,
( impl(X0,X1) = lazy_impl(true,X0)
| prop(X0) = true ),
inference(superposition,[status(thm)],[c_71,c_67]) ).
cnf(c_2009,plain,
~ forallprefers(lazy_impl(true,false1),lazy_impl(prop(sK6),sK6)),
inference(superposition,[status(thm)],[c_1744,c_94]) ).
cnf(c_2011,plain,
~ forallprefers(false1,lazy_impl(prop(sK6),sK6)),
inference(light_normalisation,[status(thm)],[c_2009,c_1768]) ).
cnf(c_2077,plain,
( lazy_impl(true,lazy_impl(prop(sK6),sK6)) = err
| lazy_impl(prop(sK6),sK6) = false2 ),
inference(superposition,[status(thm)],[c_64,c_95]) ).
cnf(c_2084,plain,
( lazy_impl(prop(sK6),sK6) = false2
| err = false2 ),
inference(light_normalisation,[status(thm)],[c_2077,c_95]) ).
cnf(c_2140,plain,
( ~ forallprefers(false1,lazy_impl(false1,sK6))
| prop(sK6) = true ),
inference(superposition,[status(thm)],[c_1745,c_2011]) ).
cnf(c_3549,plain,
( ~ forallprefers(false1,true)
| prop(sK6) = true ),
inference(demodulation,[status(thm)],[c_2140,c_76]) ).
cnf(c_3550,plain,
prop(sK6) = true,
inference(forward_subsumption_resolution,[status(thm)],[c_3549,c_58]) ).
cnf(c_3551,plain,
( lazy_impl(true,sK6) = false2
| err = false2 ),
inference(demodulation,[status(thm)],[c_2084,c_3550]) ).
cnf(c_3554,plain,
~ forallprefers(false1,lazy_impl(true,sK6)),
inference(demodulation,[status(thm)],[c_2011,c_3550]) ).
cnf(c_3556,plain,
lazy_impl(true,lazy_impl(true,sK6)) = false2,
inference(demodulation,[status(thm)],[c_95,c_3550]) ).
cnf(c_3571,plain,
bool(sK6),
inference(superposition,[status(thm)],[c_3550,c_68]) ).
cnf(c_3581,plain,
( true = sK6
| false1 = sK6 ),
inference(superposition,[status(thm)],[c_3571,c_51]) ).
cnf(c_3586,plain,
impl(true,sK6) = sK6,
inference(superposition,[status(thm)],[c_3571,c_74]) ).
cnf(c_3587,plain,
impl(false1,sK6) = true,
inference(superposition,[status(thm)],[c_3571,c_73]) ).
cnf(c_3667,plain,
( lazy_impl(true,sK6) = err
| sK6 = false2 ),
inference(superposition,[status(thm)],[c_64,c_3556]) ).
cnf(c_3696,plain,
( lazy_impl(true,lazy_impl(true,false1)) = false2
| true = sK6 ),
inference(superposition,[status(thm)],[c_3581,c_3556]) ).
cnf(c_3713,plain,
( true = sK6
| false1 = false2 ),
inference(light_normalisation,[status(thm)],[c_3696,c_1768]) ).
cnf(c_4055,plain,
( lazy_impl(true,false1) = err
| true = sK6
| sK6 = false2 ),
inference(superposition,[status(thm)],[c_3581,c_3667]) ).
cnf(c_4057,plain,
( err = false2
| sK6 = false2 ),
inference(superposition,[status(thm)],[c_3667,c_3551]) ).
cnf(c_4078,plain,
( true = sK6
| false1 = err
| sK6 = false2 ),
inference(light_normalisation,[status(thm)],[c_4055,c_1768]) ).
cnf(c_4079,plain,
( true = sK6
| sK6 = false2 ),
inference(forward_subsumption_resolution,[status(thm)],[c_4078,c_52]) ).
cnf(c_4118,plain,
( impl(sK7,sK6) = sP0_iProver_def
| err = false2 ),
inference(superposition,[status(thm)],[c_4057,c_822]) ).
cnf(c_4164,plain,
( impl(sK7,sK6) = sP0_iProver_def
| true = sK6 ),
inference(superposition,[status(thm)],[c_4079,c_822]) ).
cnf(c_10163,plain,
( lazy_impl(true,sK7) = sP0_iProver_def
| prop(sK7) = true ),
inference(superposition,[status(thm)],[c_1877,c_822]) ).
cnf(c_10271,plain,
( prop(sK7) = true
| not1(sK7) = sP0_iProver_def ),
inference(superposition,[status(thm)],[c_10163,c_1852]) ).
cnf(c_10274,plain,
( prop(sK7) = true
| sP0_iProver_def = sP1_iProver_def ),
inference(light_normalisation,[status(thm)],[c_10271,c_823]) ).
cnf(c_10275,plain,
prop(sK7) = true,
inference(forward_subsumption_resolution,[status(thm)],[c_10274,c_824]) ).
cnf(c_10401,plain,
bool(sK7),
inference(superposition,[status(thm)],[c_10275,c_68]) ).
cnf(c_10472,plain,
( true = sK7
| false1 = sK7 ),
inference(superposition,[status(thm)],[c_10401,c_51]) ).
cnf(c_11327,plain,
( impl(false1,sK6) = sP0_iProver_def
| true = sK7
| err = false2 ),
inference(superposition,[status(thm)],[c_10472,c_4118]) ).
cnf(c_11329,plain,
( not1(false1) = sP1_iProver_def
| true = sK7 ),
inference(superposition,[status(thm)],[c_10472,c_823]) ).
cnf(c_11331,plain,
( true = sK7
| true = sP1_iProver_def ),
inference(light_normalisation,[status(thm)],[c_11329,c_97]) ).
cnf(c_11345,plain,
( true = sK7
| true = sP0_iProver_def
| err = false2 ),
inference(light_normalisation,[status(thm)],[c_11327,c_3587]) ).
cnf(c_17169,plain,
$false,
inference(smt_impl_just,[status(thm)],[c_11345,c_11331,c_4164,c_4079,c_3713,c_3586,c_3554,c_1769,c_824,c_823,c_98,c_58,c_52]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.11 % Problem : SWW102+1 : TPTP v8.1.2. Released v5.2.0.
% 0.09/0.12 % Command : run_iprover %s %d THM
% 0.11/0.32 % Computer : n006.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Thu May 2 22:13:19 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.17/0.44 Running first-order theorem proving
% 0.17/0.44 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
% 7.62/1.63 % SZS status Started for theBenchmark.p
% 7.62/1.63 % SZS status Theorem for theBenchmark.p
% 7.62/1.63
% 7.62/1.63 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 7.62/1.63
% 7.62/1.63 ------ iProver source info
% 7.62/1.63
% 7.62/1.63 git: date: 2024-05-02 19:28:25 +0000
% 7.62/1.63 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 7.62/1.63 git: non_committed_changes: false
% 7.62/1.63
% 7.62/1.63 ------ Parsing...
% 7.62/1.63 ------ Clausification by vclausify_rel & Parsing by iProver...
% 7.62/1.63
% 7.62/1.63 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e
% 7.62/1.63
% 7.62/1.63 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 7.62/1.63
% 7.62/1.63 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 7.62/1.63 ------ Proving...
% 7.62/1.63 ------ Problem Properties
% 7.62/1.63
% 7.62/1.63
% 7.62/1.63 clauses 53
% 7.62/1.63 conjectures 1
% 7.62/1.63 EPR 16
% 7.62/1.63 Horn 36
% 7.62/1.63 unary 26
% 7.62/1.63 binary 19
% 7.62/1.63 lits 90
% 7.62/1.63 lits eq 37
% 7.62/1.63 fd_pure 0
% 7.62/1.63 fd_pseudo 0
% 7.62/1.63 fd_cond 1
% 7.62/1.63 fd_pseudo_cond 0
% 7.62/1.63 AC symbols 0
% 7.62/1.63
% 7.62/1.63 ------ Schedule dynamic 5 is on
% 7.62/1.63
% 7.62/1.63 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 7.62/1.63
% 7.62/1.63
% 7.62/1.63 ------
% 7.62/1.63 Current options:
% 7.62/1.63 ------
% 7.62/1.63
% 7.62/1.63
% 7.62/1.63
% 7.62/1.63
% 7.62/1.63 ------ Proving...
% 7.62/1.63
% 7.62/1.63
% 7.62/1.63 % SZS status Theorem for theBenchmark.p
% 7.62/1.63
% 7.62/1.63 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 7.62/1.63
% 7.62/1.64
%------------------------------------------------------------------------------