TSTP Solution File: CSR018+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : CSR018+1 : TPTP v8.1.2. Bugfixed v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n007.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:11:05 EDT 2024
% Result : Theorem 4.26s 1.22s
% Output : CNFRefutation 4.26s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named f322)
% Comments :
%------------------------------------------------------------------------------
fof(f9,axiom,
! [X3,X4,X1] :
( ( initiates(X3,X1,X4)
& happens(X3,X4) )
=> holdsAt(X1,plus(X4,n1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',happens_holds) ).
fof(f13,axiom,
! [X3,X1,X4] :
( initiates(X3,X1,X4)
<=> ( ( happens(push,X4)
& spinning = X1
& pull = X3 )
| ( ~ happens(push,X4)
& backwards = X1
& pull = X3 )
| ( ~ happens(pull,X4)
& forwards = X1
& push = X3 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',initiates_all_defn) ).
fof(f16,axiom,
! [X3,X4] :
( happens(X3,X4)
<=> ( ( n2 = X4
& push = X3 )
| ( n2 = X4
& pull = X3 )
| ( n1 = X4
& pull = X3 )
| ( n0 = X4
& push = X3 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',happens_all_defn) ).
fof(f17,axiom,
push != pull,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',push_not_pull) ).
fof(f25,axiom,
n2 = plus(n1,n1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',plus1_1) ).
fof(f32,axiom,
! [X8,X9] :
( less_or_equal(X8,X9)
<=> ( X8 = X9
| less(X8,X9) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less_or_equal) ).
fof(f34,axiom,
! [X8] :
( less(X8,n1)
<=> less_or_equal(X8,n0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less1) ).
fof(f35,axiom,
! [X8] :
( less(X8,n2)
<=> less_or_equal(X8,n1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less2) ).
fof(f43,axiom,
! [X8,X9] :
( less(X8,X9)
<=> ( X8 != X9
& ~ less(X9,X8) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less_property) ).
fof(f48,conjecture,
holdsAt(backwards,n2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',backwards_2) ).
fof(f49,negated_conjecture,
~ holdsAt(backwards,n2),
inference(negated_conjecture,[],[f48]) ).
fof(f57,plain,
! [X0,X1,X2] :
( ( initiates(X0,X2,X1)
& happens(X0,X1) )
=> holdsAt(X2,plus(X1,n1)) ),
inference(rectify,[],[f9]) ).
fof(f61,plain,
! [X0,X1,X2] :
( initiates(X0,X1,X2)
<=> ( ( happens(push,X2)
& spinning = X1
& pull = X0 )
| ( ~ happens(push,X2)
& backwards = X1
& pull = X0 )
| ( ~ happens(pull,X2)
& forwards = X1
& push = X0 ) ) ),
inference(rectify,[],[f13]) ).
fof(f64,plain,
! [X0,X1] :
( happens(X0,X1)
<=> ( ( n2 = X1
& push = X0 )
| ( n2 = X1
& pull = X0 )
| ( n1 = X1
& pull = X0 )
| ( n0 = X1
& push = X0 ) ) ),
inference(rectify,[],[f16]) ).
fof(f66,plain,
! [X0,X1] :
( less_or_equal(X0,X1)
<=> ( X0 = X1
| less(X0,X1) ) ),
inference(rectify,[],[f32]) ).
fof(f68,plain,
! [X0] :
( less(X0,n1)
<=> less_or_equal(X0,n0) ),
inference(rectify,[],[f34]) ).
fof(f69,plain,
! [X0] :
( less(X0,n2)
<=> less_or_equal(X0,n1) ),
inference(rectify,[],[f35]) ).
fof(f77,plain,
! [X0,X1] :
( less(X0,X1)
<=> ( X0 != X1
& ~ less(X1,X0) ) ),
inference(rectify,[],[f43]) ).
fof(f79,plain,
~ holdsAt(backwards,n2),
inference(flattening,[],[f49]) ).
fof(f94,plain,
! [X0,X1,X2] :
( holdsAt(X2,plus(X1,n1))
| ~ initiates(X0,X2,X1)
| ~ happens(X0,X1) ),
inference(ennf_transformation,[],[f57]) ).
fof(f95,plain,
! [X0,X1,X2] :
( holdsAt(X2,plus(X1,n1))
| ~ initiates(X0,X2,X1)
| ~ happens(X0,X1) ),
inference(flattening,[],[f94]) ).
fof(f103,plain,
! [X2,X1,X0] :
( sP0(X2,X1,X0)
<=> ( ~ happens(pull,X2)
& forwards = X1
& push = X0 ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP0])]) ).
fof(f104,plain,
! [X2,X1,X0] :
( sP1(X2,X1,X0)
<=> ( ~ happens(push,X2)
& backwards = X1
& pull = X0 ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP1])]) ).
fof(f105,plain,
! [X0,X1,X2] :
( initiates(X0,X1,X2)
<=> ( ( happens(push,X2)
& spinning = X1
& pull = X0 )
| sP1(X2,X1,X0)
| sP0(X2,X1,X0) ) ),
inference(definition_folding,[],[f61,f104,f103]) ).
fof(f113,plain,
! [X1,X0] :
( sP8(X1,X0)
<=> ( n0 = X1
& push = X0 ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP8])]) ).
fof(f114,plain,
! [X1,X0] :
( sP9(X1,X0)
<=> ( ( n2 = X1
& push = X0 )
| ( n2 = X1
& pull = X0 )
| ( n1 = X1
& pull = X0 )
| sP8(X1,X0) ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP9])]) ).
fof(f115,plain,
! [X0,X1] :
( happens(X0,X1)
<=> sP9(X1,X0) ),
inference(definition_folding,[],[f64,f114,f113]) ).
fof(f124,plain,
! [X2,X1,X0] :
( ( sP1(X2,X1,X0)
| happens(push,X2)
| backwards != X1
| pull != X0 )
& ( ( ~ happens(push,X2)
& backwards = X1
& pull = X0 )
| ~ sP1(X2,X1,X0) ) ),
inference(nnf_transformation,[],[f104]) ).
fof(f125,plain,
! [X2,X1,X0] :
( ( sP1(X2,X1,X0)
| happens(push,X2)
| backwards != X1
| pull != X0 )
& ( ( ~ happens(push,X2)
& backwards = X1
& pull = X0 )
| ~ sP1(X2,X1,X0) ) ),
inference(flattening,[],[f124]) ).
fof(f126,plain,
! [X0,X1,X2] :
( ( sP1(X0,X1,X2)
| happens(push,X0)
| backwards != X1
| pull != X2 )
& ( ( ~ happens(push,X0)
& backwards = X1
& pull = X2 )
| ~ sP1(X0,X1,X2) ) ),
inference(rectify,[],[f125]) ).
fof(f130,plain,
! [X0,X1,X2] :
( ( initiates(X0,X1,X2)
| ( ( ~ happens(push,X2)
| spinning != X1
| pull != X0 )
& ~ sP1(X2,X1,X0)
& ~ sP0(X2,X1,X0) ) )
& ( ( happens(push,X2)
& spinning = X1
& pull = X0 )
| sP1(X2,X1,X0)
| sP0(X2,X1,X0)
| ~ initiates(X0,X1,X2) ) ),
inference(nnf_transformation,[],[f105]) ).
fof(f131,plain,
! [X0,X1,X2] :
( ( initiates(X0,X1,X2)
| ( ( ~ happens(push,X2)
| spinning != X1
| pull != X0 )
& ~ sP1(X2,X1,X0)
& ~ sP0(X2,X1,X0) ) )
& ( ( happens(push,X2)
& spinning = X1
& pull = X0 )
| sP1(X2,X1,X0)
| sP0(X2,X1,X0)
| ~ initiates(X0,X1,X2) ) ),
inference(flattening,[],[f130]) ).
fof(f151,plain,
! [X1,X0] :
( ( sP9(X1,X0)
| ( ( n2 != X1
| push != X0 )
& ( n2 != X1
| pull != X0 )
& ( n1 != X1
| pull != X0 )
& ~ sP8(X1,X0) ) )
& ( ( n2 = X1
& push = X0 )
| ( n2 = X1
& pull = X0 )
| ( n1 = X1
& pull = X0 )
| sP8(X1,X0)
| ~ sP9(X1,X0) ) ),
inference(nnf_transformation,[],[f114]) ).
fof(f152,plain,
! [X1,X0] :
( ( sP9(X1,X0)
| ( ( n2 != X1
| push != X0 )
& ( n2 != X1
| pull != X0 )
& ( n1 != X1
| pull != X0 )
& ~ sP8(X1,X0) ) )
& ( ( n2 = X1
& push = X0 )
| ( n2 = X1
& pull = X0 )
| ( n1 = X1
& pull = X0 )
| sP8(X1,X0)
| ~ sP9(X1,X0) ) ),
inference(flattening,[],[f151]) ).
fof(f153,plain,
! [X0,X1] :
( ( sP9(X0,X1)
| ( ( n2 != X0
| push != X1 )
& ( n2 != X0
| pull != X1 )
& ( n1 != X0
| pull != X1 )
& ~ sP8(X0,X1) ) )
& ( ( n2 = X0
& push = X1 )
| ( n2 = X0
& pull = X1 )
| ( n1 = X0
& pull = X1 )
| sP8(X0,X1)
| ~ sP9(X0,X1) ) ),
inference(rectify,[],[f152]) ).
fof(f154,plain,
! [X1,X0] :
( ( sP8(X1,X0)
| n0 != X1
| push != X0 )
& ( ( n0 = X1
& push = X0 )
| ~ sP8(X1,X0) ) ),
inference(nnf_transformation,[],[f113]) ).
fof(f155,plain,
! [X1,X0] :
( ( sP8(X1,X0)
| n0 != X1
| push != X0 )
& ( ( n0 = X1
& push = X0 )
| ~ sP8(X1,X0) ) ),
inference(flattening,[],[f154]) ).
fof(f156,plain,
! [X0,X1] :
( ( sP8(X0,X1)
| n0 != X0
| push != X1 )
& ( ( n0 = X0
& push = X1 )
| ~ sP8(X0,X1) ) ),
inference(rectify,[],[f155]) ).
fof(f157,plain,
! [X0,X1] :
( ( happens(X0,X1)
| ~ sP9(X1,X0) )
& ( sP9(X1,X0)
| ~ happens(X0,X1) ) ),
inference(nnf_transformation,[],[f115]) ).
fof(f158,plain,
! [X0,X1] :
( ( less_or_equal(X0,X1)
| ( X0 != X1
& ~ less(X0,X1) ) )
& ( X0 = X1
| less(X0,X1)
| ~ less_or_equal(X0,X1) ) ),
inference(nnf_transformation,[],[f66]) ).
fof(f159,plain,
! [X0,X1] :
( ( less_or_equal(X0,X1)
| ( X0 != X1
& ~ less(X0,X1) ) )
& ( X0 = X1
| less(X0,X1)
| ~ less_or_equal(X0,X1) ) ),
inference(flattening,[],[f158]) ).
fof(f160,plain,
! [X0] :
( ( less(X0,n1)
| ~ less_or_equal(X0,n0) )
& ( less_or_equal(X0,n0)
| ~ less(X0,n1) ) ),
inference(nnf_transformation,[],[f68]) ).
fof(f161,plain,
! [X0] :
( ( less(X0,n2)
| ~ less_or_equal(X0,n1) )
& ( less_or_equal(X0,n1)
| ~ less(X0,n2) ) ),
inference(nnf_transformation,[],[f69]) ).
fof(f169,plain,
! [X0,X1] :
( ( less(X0,X1)
| X0 = X1
| less(X1,X0) )
& ( ( X0 != X1
& ~ less(X1,X0) )
| ~ less(X0,X1) ) ),
inference(nnf_transformation,[],[f77]) ).
fof(f170,plain,
! [X0,X1] :
( ( less(X0,X1)
| X0 = X1
| less(X1,X0) )
& ( ( X0 != X1
& ~ less(X1,X0) )
| ~ less(X0,X1) ) ),
inference(flattening,[],[f169]) ).
fof(f179,plain,
! [X2,X0,X1] :
( holdsAt(X2,plus(X1,n1))
| ~ initiates(X0,X2,X1)
| ~ happens(X0,X1) ),
inference(cnf_transformation,[],[f95]) ).
fof(f187,plain,
! [X2,X0,X1] :
( sP1(X0,X1,X2)
| happens(push,X0)
| backwards != X1
| pull != X2 ),
inference(cnf_transformation,[],[f126]) ).
fof(f196,plain,
! [X2,X0,X1] :
( initiates(X0,X1,X2)
| ~ sP1(X2,X1,X0) ),
inference(cnf_transformation,[],[f131]) ).
fof(f235,plain,
! [X0,X1] :
( n2 = X0
| pull = X1
| n1 = X0
| sP8(X0,X1)
| ~ sP9(X0,X1) ),
inference(cnf_transformation,[],[f153]) ).
fof(f239,plain,
! [X0,X1] :
( sP9(X0,X1)
| n1 != X0
| pull != X1 ),
inference(cnf_transformation,[],[f153]) ).
fof(f243,plain,
! [X0,X1] :
( n0 = X0
| ~ sP8(X0,X1) ),
inference(cnf_transformation,[],[f156]) ).
fof(f245,plain,
! [X0,X1] :
( sP9(X1,X0)
| ~ happens(X0,X1) ),
inference(cnf_transformation,[],[f157]) ).
fof(f246,plain,
! [X0,X1] :
( happens(X0,X1)
| ~ sP9(X1,X0) ),
inference(cnf_transformation,[],[f157]) ).
fof(f247,plain,
push != pull,
inference(cnf_transformation,[],[f17]) ).
fof(f255,plain,
n2 = plus(n1,n1),
inference(cnf_transformation,[],[f25]) ).
fof(f264,plain,
! [X0,X1] :
( less_or_equal(X0,X1)
| X0 != X1 ),
inference(cnf_transformation,[],[f159]) ).
fof(f267,plain,
! [X0] :
( less(X0,n1)
| ~ less_or_equal(X0,n0) ),
inference(cnf_transformation,[],[f160]) ).
fof(f268,plain,
! [X0] :
( less_or_equal(X0,n1)
| ~ less(X0,n2) ),
inference(cnf_transformation,[],[f161]) ).
fof(f269,plain,
! [X0] :
( less(X0,n2)
| ~ less_or_equal(X0,n1) ),
inference(cnf_transformation,[],[f161]) ).
fof(f285,plain,
! [X0,X1] :
( X0 != X1
| ~ less(X0,X1) ),
inference(cnf_transformation,[],[f170]) ).
fof(f291,plain,
~ holdsAt(backwards,n2),
inference(cnf_transformation,[],[f79]) ).
fof(f292,plain,
! [X2,X0] :
( sP1(X0,backwards,X2)
| happens(push,X0)
| pull != X2 ),
inference(equality_resolution,[],[f187]) ).
fof(f293,plain,
! [X0] :
( sP1(X0,backwards,pull)
| happens(push,X0) ),
inference(equality_resolution,[],[f292]) ).
fof(f314,plain,
! [X1] :
( sP9(n1,X1)
| pull != X1 ),
inference(equality_resolution,[],[f239]) ).
fof(f315,plain,
sP9(n1,pull),
inference(equality_resolution,[],[f314]) ).
fof(f318,plain,
! [X1] : less_or_equal(X1,X1),
inference(equality_resolution,[],[f264]) ).
fof(f319,plain,
! [X1] : ~ less(X1,X1),
inference(equality_resolution,[],[f285]) ).
cnf(c_57,plain,
( ~ initiates(X0,X1,X2)
| ~ happens(X0,X2)
| holdsAt(X1,plus(X2,n1)) ),
inference(cnf_transformation,[],[f179]) ).
cnf(c_62,plain,
( sP1(X0,backwards,pull)
| happens(push,X0) ),
inference(cnf_transformation,[],[f293]) ).
cnf(c_71,plain,
( ~ sP1(X0,X1,X2)
| initiates(X2,X1,X0) ),
inference(cnf_transformation,[],[f196]) ).
cnf(c_110,plain,
sP9(n1,pull),
inference(cnf_transformation,[],[f315]) ).
cnf(c_114,plain,
( ~ sP9(X0,X1)
| X0 = n1
| X0 = n2
| X1 = pull
| sP8(X0,X1) ),
inference(cnf_transformation,[],[f235]) ).
cnf(c_115,plain,
( ~ sP9(X0,X1)
| X0 = n2
| X1 = pull
| sP8(X0,X1) ),
inference(cnf_transformation,[],[f322]) ).
cnf(c_121,plain,
( ~ sP8(X0,X1)
| X0 = n0 ),
inference(cnf_transformation,[],[f243]) ).
cnf(c_123,plain,
( ~ sP9(X0,X1)
| happens(X1,X0) ),
inference(cnf_transformation,[],[f246]) ).
cnf(c_124,plain,
( ~ happens(X0,X1)
| sP9(X1,X0) ),
inference(cnf_transformation,[],[f245]) ).
cnf(c_125,plain,
pull != push,
inference(cnf_transformation,[],[f247]) ).
cnf(c_133,plain,
plus(n1,n1) = n2,
inference(cnf_transformation,[],[f255]) ).
cnf(c_140,plain,
less_or_equal(X0,X0),
inference(cnf_transformation,[],[f318]) ).
cnf(c_144,plain,
( ~ less_or_equal(X0,n0)
| less(X0,n1) ),
inference(cnf_transformation,[],[f267]) ).
cnf(c_146,plain,
( ~ less_or_equal(X0,n1)
| less(X0,n2) ),
inference(cnf_transformation,[],[f269]) ).
cnf(c_147,plain,
( ~ less(X0,n2)
| less_or_equal(X0,n1) ),
inference(cnf_transformation,[],[f268]) ).
cnf(c_163,plain,
~ less(X0,X0),
inference(cnf_transformation,[],[f319]) ).
cnf(c_169,negated_conjecture,
~ holdsAt(backwards,n2),
inference(cnf_transformation,[],[f291]) ).
cnf(c_170,plain,
less_or_equal(n1,n1),
inference(instantiation,[status(thm)],[c_140]) ).
cnf(c_172,plain,
~ less(n1,n1),
inference(instantiation,[status(thm)],[c_163]) ).
cnf(c_189,plain,
( ~ less_or_equal(n1,n1)
| less(n1,n2) ),
inference(instantiation,[status(thm)],[c_146]) ).
cnf(c_277,plain,
( ~ sP9(X0,X1)
| X0 = n2
| X1 = pull
| sP8(X0,X1) ),
inference(global_subsumption_just,[status(thm)],[c_114,c_115]) ).
cnf(c_290,plain,
( less(X0,n1)
| ~ less_or_equal(X0,n0) ),
inference(prop_impl_just,[status(thm)],[c_144]) ).
cnf(c_291,plain,
( ~ less_or_equal(X0,n0)
| less(X0,n1) ),
inference(renaming,[status(thm)],[c_290]) ).
cnf(c_296,plain,
( ~ less(X0,n2)
| less_or_equal(X0,n1) ),
inference(prop_impl_just,[status(thm)],[c_147]) ).
cnf(c_330,plain,
( ~ happens(X0,X1)
| sP9(X1,X0) ),
inference(prop_impl_just,[status(thm)],[c_124]) ).
cnf(c_342,plain,
( happens(push,X0)
| sP1(X0,backwards,pull) ),
inference(prop_impl_just,[status(thm)],[c_62]) ).
cnf(c_343,plain,
( sP1(X0,backwards,pull)
| happens(push,X0) ),
inference(renaming,[status(thm)],[c_342]) ).
cnf(c_358,plain,
( ~ sP1(X0,X1,X2)
| initiates(X2,X1,X0) ),
inference(prop_impl_just,[status(thm)],[c_71]) ).
cnf(c_436,plain,
( ~ sP9(X0,X1)
| happens(X1,X0) ),
inference(prop_impl_just,[status(thm)],[c_123]) ).
cnf(c_442,plain,
( ~ sP8(X0,X1)
| X0 = n0 ),
inference(prop_impl_just,[status(thm)],[c_121]) ).
cnf(c_1561,plain,
( X0 != X1
| X2 != X3
| ~ sP9(X0,X2)
| X0 = n2
| X1 = n0
| X2 = pull ),
inference(resolution_lifted,[status(thm)],[c_277,c_442]) ).
cnf(c_1562,plain,
( ~ sP9(X0,X1)
| X0 = n2
| X0 = n0
| X1 = pull ),
inference(unflattening,[status(thm)],[c_1561]) ).
cnf(c_1726,plain,
( X0 != X1
| X2 != backwards
| X3 != pull
| initiates(X3,X2,X1)
| happens(push,X0) ),
inference(resolution_lifted,[status(thm)],[c_343,c_358]) ).
cnf(c_1727,plain,
( initiates(pull,backwards,X0)
| happens(push,X0) ),
inference(unflattening,[status(thm)],[c_1726]) ).
cnf(c_2535,plain,
( X0 != n1
| X1 != pull
| happens(X1,X0) ),
inference(resolution_lifted,[status(thm)],[c_110,c_436]) ).
cnf(c_2536,plain,
happens(pull,n1),
inference(unflattening,[status(thm)],[c_2535]) ).
cnf(c_2570,plain,
( X0 != X1
| X2 != X3
| ~ happens(X3,X1)
| X0 = n2
| X0 = n0
| X2 = pull ),
inference(resolution_lifted,[status(thm)],[c_1562,c_330]) ).
cnf(c_2571,plain,
( ~ happens(X0,X1)
| X0 = pull
| X1 = n2
| X1 = n0 ),
inference(unflattening,[status(thm)],[c_2570]) ).
cnf(c_3369,plain,
( X0 != X1
| n1 != n0
| ~ less(X1,n2)
| less(X0,n1) ),
inference(resolution_lifted,[status(thm)],[c_291,c_296]) ).
cnf(c_3370,plain,
( n1 != n0
| ~ less(X0,n2)
| less(X0,n1) ),
inference(unflattening,[status(thm)],[c_3369]) ).
cnf(c_3371,plain,
( n1 != n0
| ~ less(n1,n2)
| less(n1,n1) ),
inference(instantiation,[status(thm)],[c_3370]) ).
cnf(c_4678,plain,
( happens(push,X0)
| initiates(pull,backwards,X0) ),
inference(prop_impl_just,[status(thm)],[c_1727]) ).
cnf(c_4679,plain,
( initiates(pull,backwards,X0)
| happens(push,X0) ),
inference(renaming,[status(thm)],[c_4678]) ).
cnf(c_9307,plain,
less(n1,n2),
inference(superposition,[status(thm)],[c_140,c_146]) ).
cnf(c_9415,plain,
( ~ happens(pull,X0)
| holdsAt(backwards,plus(X0,n1))
| happens(push,X0) ),
inference(superposition,[status(thm)],[c_4679,c_57]) ).
cnf(c_9647,plain,
( ~ happens(pull,n1)
| holdsAt(backwards,n2)
| happens(push,n1) ),
inference(superposition,[status(thm)],[c_133,c_9415]) ).
cnf(c_9744,plain,
happens(push,n1),
inference(global_subsumption_just,[status(thm)],[c_9647,c_169,c_2536,c_9647]) ).
cnf(c_9748,plain,
( n1 = n2
| n1 = n0
| pull = push ),
inference(superposition,[status(thm)],[c_9744,c_2571]) ).
cnf(c_9956,plain,
n1 = n2,
inference(global_subsumption_just,[status(thm)],[c_9748,c_170,c_172,c_125,c_189,c_3371,c_9748]) ).
cnf(c_9967,plain,
less(n1,n1),
inference(superposition,[status(thm)],[c_9956,c_9307]) ).
cnf(c_9973,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_9967,c_172]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : CSR018+1 : TPTP v8.1.2. Bugfixed v3.1.0.
% 0.11/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n007.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Thu May 2 23:03:20 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.20/0.47 Running first-order theorem proving
% 0.20/0.47 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 4.26/1.22 % SZS status Started for theBenchmark.p
% 4.26/1.22 % SZS status Theorem for theBenchmark.p
% 4.26/1.22
% 4.26/1.22 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 4.26/1.22
% 4.26/1.22 ------ iProver source info
% 4.26/1.22
% 4.26/1.22 git: date: 2024-05-02 19:28:25 +0000
% 4.26/1.22 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 4.26/1.22 git: non_committed_changes: false
% 4.26/1.22
% 4.26/1.22 ------ Parsing...
% 4.26/1.22 ------ Clausification by vclausify_rel & Parsing by iProver...
% 4.26/1.22
% 4.26/1.22 ------ Preprocessing... sup_sim: 2 sf_s rm: 3 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: 10 0s sf_e pe_s pe_e
% 4.26/1.22
% 4.26/1.22 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 4.26/1.22
% 4.26/1.22 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 4.26/1.22 ------ Proving...
% 4.26/1.22 ------ Problem Properties
% 4.26/1.22
% 4.26/1.22
% 4.26/1.22 clauses 82
% 4.26/1.22 conjectures 1
% 4.26/1.22 EPR 65
% 4.26/1.22 Horn 56
% 4.26/1.22 unary 27
% 4.26/1.22 binary 31
% 4.26/1.22 lits 177
% 4.26/1.22 lits eq 54
% 4.26/1.22 fd_pure 0
% 4.26/1.22 fd_pseudo 0
% 4.26/1.22 fd_cond 18
% 4.26/1.22 fd_pseudo_cond 2
% 4.26/1.22 AC symbols 0
% 4.26/1.22
% 4.26/1.22 ------ Input Options Time Limit: Unbounded
% 4.26/1.22
% 4.26/1.22
% 4.26/1.22 ------
% 4.26/1.22 Current options:
% 4.26/1.22 ------
% 4.26/1.22
% 4.26/1.22
% 4.26/1.22
% 4.26/1.22
% 4.26/1.22 ------ Proving...
% 4.26/1.22
% 4.26/1.22
% 4.26/1.22 ------ Proving...
% 4.26/1.22
% 4.26/1.22
% 4.26/1.22 ------ Proving...
% 4.26/1.22
% 4.26/1.22
% 4.26/1.22 % SZS status Theorem for theBenchmark.p
% 4.26/1.22
% 4.26/1.22 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.26/1.22
% 4.26/1.23
%------------------------------------------------------------------------------