TSTP Solution File: CSR015+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : CSR015+1 : TPTP v8.1.2. Bugfixed v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n002.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 3.91s 1.03s
% Output : CNFRefutation 3.91s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 14
% Syntax : Number of formulae : 98 ( 18 unt; 0 def)
% Number of atoms : 422 ( 174 equ)
% Maximal formula atoms : 19 ( 4 avg)
% Number of connectives : 503 ( 179 ~; 187 |; 121 &)
% ( 14 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 13 ( 11 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 8 con; 0-2 aty)
% Number of variables : 197 ( 0 sgn 130 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f10,axiom,
! [X3,X4,X1] :
( ( terminates(X3,X1,X4)
& happens(X3,X4) )
=> ~ holdsAt(X1,plus(X4,n1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',happens_terminates_not_holds) ).
fof(f14,axiom,
! [X3,X1,X4] :
( terminates(X3,X1,X4)
<=> ( ( ~ happens(push,X4)
& spinning = X1
& pull = X3 )
| ( ~ happens(pull,X4)
& spinning = X1
& push = X3 )
| ( happens(push,X4)
& backwards = X1
& pull = X3 )
| ( happens(push,X4)
& forwards = X1
& pull = X3 )
| ( ~ happens(push,X4)
& forwards = X1
& pull = X3 )
| ( ~ happens(pull,X4)
& backwards = X1
& push = X3 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',terminates_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(f22,axiom,
n1 = plus(n0,n1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',plus0_1) ).
fof(f31,axiom,
! [X8,X9] : plus(X8,X9) = plus(X9,X8),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',symmetry_of_plus) ).
fof(f48,conjecture,
~ holdsAt(backwards,n1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',not_backwards_1) ).
fof(f49,negated_conjecture,
~ ~ holdsAt(backwards,n1),
inference(negated_conjecture,[],[f48]) ).
fof(f58,plain,
! [X0,X1,X2] :
( ( terminates(X0,X2,X1)
& happens(X0,X1) )
=> ~ holdsAt(X2,plus(X1,n1)) ),
inference(rectify,[],[f10]) ).
fof(f62,plain,
! [X0,X1,X2] :
( terminates(X0,X1,X2)
<=> ( ( ~ happens(push,X2)
& spinning = X1
& pull = X0 )
| ( ~ happens(pull,X2)
& spinning = X1
& push = X0 )
| ( happens(push,X2)
& backwards = X1
& pull = X0 )
| ( happens(push,X2)
& forwards = X1
& pull = X0 )
| ( ~ happens(push,X2)
& forwards = X1
& pull = X0 )
| ( ~ happens(pull,X2)
& backwards = X1
& push = X0 ) ) ),
inference(rectify,[],[f14]) ).
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(f65,plain,
! [X0,X1] : plus(X0,X1) = plus(X1,X0),
inference(rectify,[],[f31]) ).
fof(f79,plain,
holdsAt(backwards,n1),
inference(flattening,[],[f49]) ).
fof(f96,plain,
! [X0,X1,X2] :
( ~ holdsAt(X2,plus(X1,n1))
| ~ terminates(X0,X2,X1)
| ~ happens(X0,X1) ),
inference(ennf_transformation,[],[f58]) ).
fof(f97,plain,
! [X0,X1,X2] :
( ~ holdsAt(X2,plus(X1,n1))
| ~ terminates(X0,X2,X1)
| ~ happens(X0,X1) ),
inference(flattening,[],[f96]) ).
fof(f106,plain,
! [X2,X1,X0] :
( sP2(X2,X1,X0)
<=> ( ~ happens(pull,X2)
& backwards = X1
& push = X0 ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP2])]) ).
fof(f107,plain,
! [X2,X1,X0] :
( sP3(X2,X1,X0)
<=> ( ~ happens(push,X2)
& forwards = X1
& pull = X0 ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP3])]) ).
fof(f108,plain,
! [X2,X1,X0] :
( sP4(X2,X1,X0)
<=> ( happens(push,X2)
& forwards = X1
& pull = X0 ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP4])]) ).
fof(f109,plain,
! [X2,X1,X0] :
( sP5(X2,X1,X0)
<=> ( happens(push,X2)
& backwards = X1
& pull = X0 ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP5])]) ).
fof(f110,plain,
! [X2,X1,X0] :
( sP6(X2,X1,X0)
<=> ( ~ happens(pull,X2)
& spinning = X1
& push = X0 ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP6])]) ).
fof(f111,plain,
! [X2,X1,X0] :
( sP7(X2,X1,X0)
<=> ( ( ~ happens(push,X2)
& spinning = X1
& pull = X0 )
| sP6(X2,X1,X0)
| sP5(X2,X1,X0)
| sP4(X2,X1,X0)
| sP3(X2,X1,X0)
| sP2(X2,X1,X0) ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP7])]) ).
fof(f112,plain,
! [X0,X1,X2] :
( terminates(X0,X1,X2)
<=> sP7(X2,X1,X0) ),
inference(definition_folding,[],[f62,f111,f110,f109,f108,f107,f106]) ).
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(f132,plain,
! [X2,X1,X0] :
( ( sP7(X2,X1,X0)
| ( ( happens(push,X2)
| spinning != X1
| pull != X0 )
& ~ sP6(X2,X1,X0)
& ~ sP5(X2,X1,X0)
& ~ sP4(X2,X1,X0)
& ~ sP3(X2,X1,X0)
& ~ sP2(X2,X1,X0) ) )
& ( ( ~ happens(push,X2)
& spinning = X1
& pull = X0 )
| sP6(X2,X1,X0)
| sP5(X2,X1,X0)
| sP4(X2,X1,X0)
| sP3(X2,X1,X0)
| sP2(X2,X1,X0)
| ~ sP7(X2,X1,X0) ) ),
inference(nnf_transformation,[],[f111]) ).
fof(f133,plain,
! [X2,X1,X0] :
( ( sP7(X2,X1,X0)
| ( ( happens(push,X2)
| spinning != X1
| pull != X0 )
& ~ sP6(X2,X1,X0)
& ~ sP5(X2,X1,X0)
& ~ sP4(X2,X1,X0)
& ~ sP3(X2,X1,X0)
& ~ sP2(X2,X1,X0) ) )
& ( ( ~ happens(push,X2)
& spinning = X1
& pull = X0 )
| sP6(X2,X1,X0)
| sP5(X2,X1,X0)
| sP4(X2,X1,X0)
| sP3(X2,X1,X0)
| sP2(X2,X1,X0)
| ~ sP7(X2,X1,X0) ) ),
inference(flattening,[],[f132]) ).
fof(f134,plain,
! [X0,X1,X2] :
( ( sP7(X0,X1,X2)
| ( ( happens(push,X0)
| spinning != X1
| pull != X2 )
& ~ sP6(X0,X1,X2)
& ~ sP5(X0,X1,X2)
& ~ sP4(X0,X1,X2)
& ~ sP3(X0,X1,X2)
& ~ sP2(X0,X1,X2) ) )
& ( ( ~ happens(push,X0)
& spinning = X1
& pull = X2 )
| sP6(X0,X1,X2)
| sP5(X0,X1,X2)
| sP4(X0,X1,X2)
| sP3(X0,X1,X2)
| sP2(X0,X1,X2)
| ~ sP7(X0,X1,X2) ) ),
inference(rectify,[],[f133]) ).
fof(f138,plain,
! [X2,X1,X0] :
( ( sP5(X2,X1,X0)
| ~ happens(push,X2)
| backwards != X1
| pull != X0 )
& ( ( happens(push,X2)
& backwards = X1
& pull = X0 )
| ~ sP5(X2,X1,X0) ) ),
inference(nnf_transformation,[],[f109]) ).
fof(f139,plain,
! [X2,X1,X0] :
( ( sP5(X2,X1,X0)
| ~ happens(push,X2)
| backwards != X1
| pull != X0 )
& ( ( happens(push,X2)
& backwards = X1
& pull = X0 )
| ~ sP5(X2,X1,X0) ) ),
inference(flattening,[],[f138]) ).
fof(f140,plain,
! [X0,X1,X2] :
( ( sP5(X0,X1,X2)
| ~ happens(push,X0)
| backwards != X1
| pull != X2 )
& ( ( happens(push,X0)
& backwards = X1
& pull = X2 )
| ~ sP5(X0,X1,X2) ) ),
inference(rectify,[],[f139]) ).
fof(f147,plain,
! [X2,X1,X0] :
( ( sP2(X2,X1,X0)
| happens(pull,X2)
| backwards != X1
| push != X0 )
& ( ( ~ happens(pull,X2)
& backwards = X1
& push = X0 )
| ~ sP2(X2,X1,X0) ) ),
inference(nnf_transformation,[],[f106]) ).
fof(f148,plain,
! [X2,X1,X0] :
( ( sP2(X2,X1,X0)
| happens(pull,X2)
| backwards != X1
| push != X0 )
& ( ( ~ happens(pull,X2)
& backwards = X1
& push = X0 )
| ~ sP2(X2,X1,X0) ) ),
inference(flattening,[],[f147]) ).
fof(f149,plain,
! [X0,X1,X2] :
( ( sP2(X0,X1,X2)
| happens(pull,X0)
| backwards != X1
| push != X2 )
& ( ( ~ happens(pull,X0)
& backwards = X1
& push = X2 )
| ~ sP2(X0,X1,X2) ) ),
inference(rectify,[],[f148]) ).
fof(f150,plain,
! [X0,X1,X2] :
( ( terminates(X0,X1,X2)
| ~ sP7(X2,X1,X0) )
& ( sP7(X2,X1,X0)
| ~ terminates(X0,X1,X2) ) ),
inference(nnf_transformation,[],[f112]) ).
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(f180,plain,
! [X2,X0,X1] :
( ~ holdsAt(X2,plus(X1,n1))
| ~ terminates(X0,X2,X1)
| ~ happens(X0,X1) ),
inference(cnf_transformation,[],[f97]) ).
fof(f201,plain,
! [X2,X0,X1] :
( sP7(X0,X1,X2)
| ~ sP2(X0,X1,X2) ),
inference(cnf_transformation,[],[f134]) ).
fof(f204,plain,
! [X2,X0,X1] :
( sP7(X0,X1,X2)
| ~ sP5(X0,X1,X2) ),
inference(cnf_transformation,[],[f134]) ).
fof(f214,plain,
! [X2,X0,X1] :
( sP5(X0,X1,X2)
| ~ happens(push,X0)
| backwards != X1
| pull != X2 ),
inference(cnf_transformation,[],[f140]) ).
fof(f226,plain,
! [X2,X0,X1] :
( sP2(X0,X1,X2)
| happens(pull,X0)
| backwards != X1
| push != X2 ),
inference(cnf_transformation,[],[f149]) ).
fof(f228,plain,
! [X2,X0,X1] :
( terminates(X0,X1,X2)
| ~ sP7(X2,X1,X0) ),
inference(cnf_transformation,[],[f150]) ).
fof(f238,plain,
! [X0,X1] :
( sP9(X0,X1)
| ~ sP8(X0,X1) ),
inference(cnf_transformation,[],[f153]) ).
fof(f244,plain,
! [X0,X1] :
( sP8(X0,X1)
| n0 != X0
| push != X1 ),
inference(cnf_transformation,[],[f156]) ).
fof(f246,plain,
! [X0,X1] :
( happens(X0,X1)
| ~ sP9(X1,X0) ),
inference(cnf_transformation,[],[f157]) ).
fof(f252,plain,
n1 = plus(n0,n1),
inference(cnf_transformation,[],[f22]) ).
fof(f261,plain,
! [X0,X1] : plus(X0,X1) = plus(X1,X0),
inference(cnf_transformation,[],[f65]) ).
fof(f291,plain,
holdsAt(backwards,n1),
inference(cnf_transformation,[],[f79]) ).
fof(f302,plain,
! [X2,X0] :
( sP5(X0,backwards,X2)
| ~ happens(push,X0)
| pull != X2 ),
inference(equality_resolution,[],[f214]) ).
fof(f303,plain,
! [X0] :
( sP5(X0,backwards,pull)
| ~ happens(push,X0) ),
inference(equality_resolution,[],[f302]) ).
fof(f308,plain,
! [X2,X0] :
( sP2(X0,backwards,X2)
| happens(pull,X0)
| push != X2 ),
inference(equality_resolution,[],[f226]) ).
fof(f309,plain,
! [X0] :
( sP2(X0,backwards,push)
| happens(pull,X0) ),
inference(equality_resolution,[],[f308]) ).
fof(f316,plain,
! [X1] :
( sP8(n0,X1)
| push != X1 ),
inference(equality_resolution,[],[f244]) ).
fof(f317,plain,
sP8(n0,push),
inference(equality_resolution,[],[f316]) ).
cnf(c_58,plain,
( ~ holdsAt(X0,plus(X1,n1))
| ~ terminates(X2,X0,X1)
| ~ happens(X2,X1) ),
inference(cnf_transformation,[],[f180]) ).
cnf(c_78,plain,
( ~ sP5(X0,X1,X2)
| sP7(X0,X1,X2) ),
inference(cnf_transformation,[],[f204]) ).
cnf(c_81,plain,
( ~ sP2(X0,X1,X2)
| sP7(X0,X1,X2) ),
inference(cnf_transformation,[],[f201]) ).
cnf(c_89,plain,
( ~ happens(push,X0)
| sP5(X0,backwards,pull) ),
inference(cnf_transformation,[],[f303]) ).
cnf(c_101,plain,
( sP2(X0,backwards,push)
| happens(pull,X0) ),
inference(cnf_transformation,[],[f309]) ).
cnf(c_105,plain,
( ~ sP7(X0,X1,X2)
| terminates(X2,X1,X0) ),
inference(cnf_transformation,[],[f228]) ).
cnf(c_111,plain,
( ~ sP8(X0,X1)
| sP9(X0,X1) ),
inference(cnf_transformation,[],[f238]) ).
cnf(c_120,plain,
sP8(n0,push),
inference(cnf_transformation,[],[f317]) ).
cnf(c_123,plain,
( ~ sP9(X0,X1)
| happens(X1,X0) ),
inference(cnf_transformation,[],[f246]) ).
cnf(c_130,plain,
plus(n0,n1) = n1,
inference(cnf_transformation,[],[f252]) ).
cnf(c_139,plain,
plus(X0,X1) = plus(X1,X0),
inference(cnf_transformation,[],[f261]) ).
cnf(c_169,negated_conjecture,
holdsAt(backwards,n1),
inference(cnf_transformation,[],[f291]) ).
cnf(c_338,plain,
( ~ happens(push,X0)
| sP5(X0,backwards,pull) ),
inference(prop_impl_just,[status(thm)],[c_89]) ).
cnf(c_370,plain,
( happens(pull,X0)
| sP2(X0,backwards,push) ),
inference(prop_impl_just,[status(thm)],[c_101]) ).
cnf(c_371,plain,
( sP2(X0,backwards,push)
| happens(pull,X0) ),
inference(renaming,[status(thm)],[c_370]) ).
cnf(c_380,plain,
( ~ sP7(X0,X1,X2)
| terminates(X2,X1,X0) ),
inference(prop_impl_just,[status(thm)],[c_105]) ).
cnf(c_396,plain,
( ~ sP5(X0,X1,X2)
| sP7(X0,X1,X2) ),
inference(prop_impl_just,[status(thm)],[c_78]) ).
cnf(c_420,plain,
( ~ sP2(X0,X1,X2)
| sP7(X0,X1,X2) ),
inference(prop_impl_just,[status(thm)],[c_81]) ).
cnf(c_436,plain,
( ~ sP9(X0,X1)
| happens(X1,X0) ),
inference(prop_impl_just,[status(thm)],[c_123]) ).
cnf(c_438,plain,
( ~ sP8(X0,X1)
| sP9(X0,X1) ),
inference(prop_impl_just,[status(thm)],[c_111]) ).
cnf(c_1237,plain,
plus(n1,n0) = n1,
inference(demodulation,[status(thm)],[c_130,c_139]) ).
cnf(c_1537,plain,
( X0 != X1
| X2 != X3
| X4 != X5
| ~ holdsAt(X0,plus(X2,n1))
| ~ sP7(X3,X1,X5)
| ~ happens(X4,X2) ),
inference(resolution_lifted,[status(thm)],[c_58,c_380]) ).
cnf(c_1538,plain,
( ~ holdsAt(X0,plus(X1,n1))
| ~ sP7(X1,X0,X2)
| ~ happens(X2,X1) ),
inference(unflattening,[status(thm)],[c_1537]) ).
cnf(c_1614,plain,
( X0 != n0
| X1 != push
| sP9(X0,X1) ),
inference(resolution_lifted,[status(thm)],[c_438,c_120]) ).
cnf(c_1615,plain,
sP9(n0,push),
inference(unflattening,[status(thm)],[c_1614]) ).
cnf(c_2062,plain,
( X0 != X1
| X2 != backwards
| X3 != pull
| ~ happens(push,X1)
| sP7(X0,X2,X3) ),
inference(resolution_lifted,[status(thm)],[c_396,c_338]) ).
cnf(c_2063,plain,
( ~ happens(push,X0)
| sP7(X0,backwards,pull) ),
inference(unflattening,[status(thm)],[c_2062]) ).
cnf(c_2302,plain,
( X0 != X1
| X2 != backwards
| X3 != push
| sP7(X0,X2,X3)
| happens(pull,X1) ),
inference(resolution_lifted,[status(thm)],[c_420,c_371]) ).
cnf(c_2303,plain,
( sP7(X0,backwards,push)
| happens(pull,X0) ),
inference(unflattening,[status(thm)],[c_2302]) ).
cnf(c_2607,plain,
( X0 != n0
| X1 != push
| happens(X1,X0) ),
inference(resolution_lifted,[status(thm)],[c_436,c_1615]) ).
cnf(c_2608,plain,
happens(push,n0),
inference(unflattening,[status(thm)],[c_2607]) ).
cnf(c_4674,plain,
( ~ happens(push,X0)
| sP7(X0,backwards,pull) ),
inference(prop_impl_just,[status(thm)],[c_2063]) ).
cnf(c_4686,plain,
( happens(pull,X0)
| sP7(X0,backwards,push) ),
inference(prop_impl_just,[status(thm)],[c_2303]) ).
cnf(c_4687,plain,
( sP7(X0,backwards,push)
| happens(pull,X0) ),
inference(renaming,[status(thm)],[c_4686]) ).
cnf(c_8923,plain,
( ~ holdsAt(X0,plus(n1,X1))
| ~ sP7(X1,X0,X2)
| ~ happens(X2,X1) ),
inference(superposition,[status(thm)],[c_139,c_1538]) ).
cnf(c_9091,plain,
( ~ sP7(n0,X0,X1)
| ~ holdsAt(X0,n1)
| ~ happens(X1,n0) ),
inference(superposition,[status(thm)],[c_1237,c_8923]) ).
cnf(c_9144,plain,
( ~ holdsAt(backwards,n1)
| ~ happens(pull,n0)
| ~ happens(push,n0) ),
inference(superposition,[status(thm)],[c_4674,c_9091]) ).
cnf(c_9145,plain,
( ~ holdsAt(backwards,n1)
| ~ happens(push,n0)
| happens(pull,n0) ),
inference(superposition,[status(thm)],[c_4687,c_9091]) ).
cnf(c_9146,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_9144,c_9145,c_2608,c_169]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : CSR015+1 : TPTP v8.1.2. Bugfixed v3.1.0.
% 0.10/0.11 % Command : run_iprover %s %d THM
% 0.10/0.32 % Computer : n002.cluster.edu
% 0.10/0.32 % Model : x86_64 x86_64
% 0.10/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.32 % Memory : 8042.1875MB
% 0.10/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.32 % CPULimit : 300
% 0.10/0.32 % WCLimit : 300
% 0.10/0.32 % DateTime : Thu May 2 23:15:42 EDT 2024
% 0.10/0.32 % CPUTime :
% 0.16/0.40 Running first-order theorem proving
% 0.16/0.40 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
% 3.91/1.03 % SZS status Started for theBenchmark.p
% 3.91/1.03 % SZS status Theorem for theBenchmark.p
% 3.91/1.03
% 3.91/1.03 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 3.91/1.03
% 3.91/1.03 ------ iProver source info
% 3.91/1.03
% 3.91/1.03 git: date: 2024-05-02 19:28:25 +0000
% 3.91/1.03 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 3.91/1.03 git: non_committed_changes: false
% 3.91/1.03
% 3.91/1.03 ------ Parsing...
% 3.91/1.03 ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.91/1.03
% 3.91/1.03 ------ 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
% 3.91/1.03
% 3.91/1.03 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.91/1.03
% 3.91/1.03 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.91/1.03 ------ Proving...
% 3.91/1.03 ------ Problem Properties
% 3.91/1.03
% 3.91/1.03
% 3.91/1.03 clauses 82
% 3.91/1.03 conjectures 1
% 3.91/1.03 EPR 65
% 3.91/1.03 Horn 56
% 3.91/1.03 unary 27
% 3.91/1.03 binary 31
% 3.91/1.03 lits 177
% 3.91/1.04 lits eq 54
% 3.91/1.04 fd_pure 0
% 3.91/1.04 fd_pseudo 0
% 3.91/1.04 fd_cond 18
% 3.91/1.04 fd_pseudo_cond 2
% 3.91/1.04 AC symbols 0
% 3.91/1.04
% 3.91/1.04 ------ Input Options Time Limit: Unbounded
% 3.91/1.04
% 3.91/1.04
% 3.91/1.04 ------
% 3.91/1.04 Current options:
% 3.91/1.04 ------
% 3.91/1.04
% 3.91/1.04
% 3.91/1.04
% 3.91/1.04
% 3.91/1.04 ------ Proving...
% 3.91/1.04
% 3.91/1.04
% 3.91/1.04 ------ Proving...
% 3.91/1.04
% 3.91/1.04
% 3.91/1.04 ------ Proving...
% 3.91/1.04
% 3.91/1.04
% 3.91/1.04 % SZS status Theorem for theBenchmark.p
% 3.91/1.04
% 3.91/1.04 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.91/1.04
% 3.91/1.04
%------------------------------------------------------------------------------