TSTP Solution File: KRS129+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : KRS129+1 : TPTP v8.1.2. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n027.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:33:42 EDT 2024
% Result : Theorem 0.41s 1.11s
% Output : CNFRefutation 0.41s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 9
% Syntax : Number of formulae : 61 ( 11 unt; 0 def)
% Number of atoms : 183 ( 4 equ)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 215 ( 93 ~; 82 |; 27 &)
% ( 9 <=>; 3 =>; 0 <=; 1 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-1 aty)
% Number of variables : 67 ( 5 sgn 34 !; 11 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f13,axiom,
! [X3] :
( ~ cowlNothing(X3)
& cowlThing(X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_0) ).
fof(f14,axiom,
! [X3] :
( xsd_string(X3)
<=> ~ xsd_integer(X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1) ).
fof(f16,axiom,
! [X3] :
( cEuroMP(X3)
<=> ? [X4] :
( cowlThing(X4)
& risEuroMPFrom(X3,X4) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_3) ).
fof(f18,axiom,
! [X3,X4] :
( risEuroMPFrom(X3,X4)
<=> rhasEuroMP(X4,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_5) ).
fof(f26,axiom,
rhasEuroMP(iUK,iKinnock),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_13) ).
fof(f27,conjecture,
( cEuroMP(iKinnock)
& ! [X3] :
( xsd_string(X3)
<=> ~ xsd_integer(X3) )
& ! [X3] :
( ~ cowlNothing(X3)
& cowlThing(X3) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',the_axiom) ).
fof(f28,negated_conjecture,
~ ( cEuroMP(iKinnock)
& ! [X3] :
( xsd_string(X3)
<=> ~ xsd_integer(X3) )
& ! [X3] :
( ~ cowlNothing(X3)
& cowlThing(X3) ) ),
inference(negated_conjecture,[],[f27]) ).
fof(f29,plain,
! [X0] :
( ~ cowlNothing(X0)
& cowlThing(X0) ),
inference(rectify,[],[f13]) ).
fof(f30,plain,
! [X0] :
( xsd_string(X0)
<=> ~ xsd_integer(X0) ),
inference(rectify,[],[f14]) ).
fof(f32,plain,
! [X0] :
( cEuroMP(X0)
<=> ? [X1] :
( cowlThing(X1)
& risEuroMPFrom(X0,X1) ) ),
inference(rectify,[],[f16]) ).
fof(f34,plain,
! [X0,X1] :
( risEuroMPFrom(X0,X1)
<=> rhasEuroMP(X1,X0) ),
inference(rectify,[],[f18]) ).
fof(f35,plain,
~ ( cEuroMP(iKinnock)
& ! [X0] :
( xsd_string(X0)
<=> ~ xsd_integer(X0) )
& ! [X1] :
( ~ cowlNothing(X1)
& cowlThing(X1) ) ),
inference(rectify,[],[f28]) ).
fof(f61,plain,
( ~ cEuroMP(iKinnock)
| ? [X0] :
( xsd_string(X0)
<~> ~ xsd_integer(X0) )
| ? [X1] :
( cowlNothing(X1)
| ~ cowlThing(X1) ) ),
inference(ennf_transformation,[],[f35]) ).
fof(f62,plain,
! [X0] :
( ( xsd_string(X0)
| xsd_integer(X0) )
& ( ~ xsd_integer(X0)
| ~ xsd_string(X0) ) ),
inference(nnf_transformation,[],[f30]) ).
fof(f65,plain,
! [X0] :
( ( cEuroMP(X0)
| ! [X1] :
( ~ cowlThing(X1)
| ~ risEuroMPFrom(X0,X1) ) )
& ( ? [X1] :
( cowlThing(X1)
& risEuroMPFrom(X0,X1) )
| ~ cEuroMP(X0) ) ),
inference(nnf_transformation,[],[f32]) ).
fof(f66,plain,
! [X0] :
( ( cEuroMP(X0)
| ! [X1] :
( ~ cowlThing(X1)
| ~ risEuroMPFrom(X0,X1) ) )
& ( ? [X2] :
( cowlThing(X2)
& risEuroMPFrom(X0,X2) )
| ~ cEuroMP(X0) ) ),
inference(rectify,[],[f65]) ).
fof(f67,plain,
! [X0] :
( ? [X2] :
( cowlThing(X2)
& risEuroMPFrom(X0,X2) )
=> ( cowlThing(sK0(X0))
& risEuroMPFrom(X0,sK0(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f68,plain,
! [X0] :
( ( cEuroMP(X0)
| ! [X1] :
( ~ cowlThing(X1)
| ~ risEuroMPFrom(X0,X1) ) )
& ( ( cowlThing(sK0(X0))
& risEuroMPFrom(X0,sK0(X0)) )
| ~ cEuroMP(X0) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f66,f67]) ).
fof(f69,plain,
! [X0,X1] :
( ( risEuroMPFrom(X0,X1)
| ~ rhasEuroMP(X1,X0) )
& ( rhasEuroMP(X1,X0)
| ~ risEuroMPFrom(X0,X1) ) ),
inference(nnf_transformation,[],[f34]) ).
fof(f70,plain,
( ~ cEuroMP(iKinnock)
| ? [X0] :
( ( xsd_integer(X0)
| ~ xsd_string(X0) )
& ( ~ xsd_integer(X0)
| xsd_string(X0) ) )
| ? [X1] :
( cowlNothing(X1)
| ~ cowlThing(X1) ) ),
inference(nnf_transformation,[],[f61]) ).
fof(f71,plain,
( ? [X0] :
( ( xsd_integer(X0)
| ~ xsd_string(X0) )
& ( ~ xsd_integer(X0)
| xsd_string(X0) ) )
=> ( ( xsd_integer(sK1)
| ~ xsd_string(sK1) )
& ( ~ xsd_integer(sK1)
| xsd_string(sK1) ) ) ),
introduced(choice_axiom,[]) ).
fof(f72,plain,
( ? [X1] :
( cowlNothing(X1)
| ~ cowlThing(X1) )
=> ( cowlNothing(sK2)
| ~ cowlThing(sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f73,plain,
( ~ cEuroMP(iKinnock)
| ( ( xsd_integer(sK1)
| ~ xsd_string(sK1) )
& ( ~ xsd_integer(sK1)
| xsd_string(sK1) ) )
| cowlNothing(sK2)
| ~ cowlThing(sK2) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2])],[f70,f72,f71]) ).
fof(f86,plain,
! [X0] : cowlThing(X0),
inference(cnf_transformation,[],[f29]) ).
fof(f87,plain,
! [X0] : ~ cowlNothing(X0),
inference(cnf_transformation,[],[f29]) ).
fof(f88,plain,
! [X0] :
( ~ xsd_integer(X0)
| ~ xsd_string(X0) ),
inference(cnf_transformation,[],[f62]) ).
fof(f89,plain,
! [X0] :
( xsd_string(X0)
| xsd_integer(X0) ),
inference(cnf_transformation,[],[f62]) ).
fof(f99,plain,
! [X0,X1] :
( cEuroMP(X0)
| ~ cowlThing(X1)
| ~ risEuroMPFrom(X0,X1) ),
inference(cnf_transformation,[],[f68]) ).
fof(f102,plain,
! [X0,X1] :
( risEuroMPFrom(X0,X1)
| ~ rhasEuroMP(X1,X0) ),
inference(cnf_transformation,[],[f69]) ).
fof(f110,plain,
rhasEuroMP(iUK,iKinnock),
inference(cnf_transformation,[],[f26]) ).
fof(f111,plain,
( ~ cEuroMP(iKinnock)
| ~ xsd_integer(sK1)
| xsd_string(sK1)
| cowlNothing(sK2)
| ~ cowlThing(sK2) ),
inference(cnf_transformation,[],[f73]) ).
fof(f112,plain,
( ~ cEuroMP(iKinnock)
| xsd_integer(sK1)
| ~ xsd_string(sK1)
| cowlNothing(sK2)
| ~ cowlThing(sK2) ),
inference(cnf_transformation,[],[f73]) ).
cnf(c_49,plain,
~ cowlNothing(X0),
inference(cnf_transformation,[],[f87]) ).
cnf(c_50,plain,
cowlThing(X0),
inference(cnf_transformation,[],[f86]) ).
cnf(c_51,plain,
( xsd_string(X0)
| xsd_integer(X0) ),
inference(cnf_transformation,[],[f89]) ).
cnf(c_52,plain,
( ~ xsd_string(X0)
| ~ xsd_integer(X0) ),
inference(cnf_transformation,[],[f88]) ).
cnf(c_60,plain,
( ~ risEuroMPFrom(X0,X1)
| ~ cowlThing(X1)
| cEuroMP(X0) ),
inference(cnf_transformation,[],[f99]) ).
cnf(c_64,plain,
( ~ rhasEuroMP(X0,X1)
| risEuroMPFrom(X1,X0) ),
inference(cnf_transformation,[],[f102]) ).
cnf(c_73,plain,
rhasEuroMP(iUK,iKinnock),
inference(cnf_transformation,[],[f110]) ).
cnf(c_74,negated_conjecture,
( ~ cowlThing(sK2)
| ~ xsd_string(sK1)
| ~ cEuroMP(iKinnock)
| cowlNothing(sK2)
| xsd_integer(sK1) ),
inference(cnf_transformation,[],[f112]) ).
cnf(c_75,negated_conjecture,
( ~ cowlThing(sK2)
| ~ xsd_integer(sK1)
| ~ cEuroMP(iKinnock)
| cowlNothing(sK2)
| xsd_string(sK1) ),
inference(cnf_transformation,[],[f111]) ).
cnf(c_87,plain,
( ~ xsd_integer(X0)
| ~ xsd_string(X0) ),
inference(prop_impl_just,[status(thm)],[c_52]) ).
cnf(c_88,plain,
( ~ xsd_string(X0)
| ~ xsd_integer(X0) ),
inference(renaming,[status(thm)],[c_87]) ).
cnf(c_89,plain,
( xsd_integer(X0)
| xsd_string(X0) ),
inference(prop_impl_just,[status(thm)],[c_51]) ).
cnf(c_90,plain,
( xsd_string(X0)
| xsd_integer(X0) ),
inference(renaming,[status(thm)],[c_89]) ).
cnf(c_101,plain,
( ~ rhasEuroMP(X0,X1)
| risEuroMPFrom(X1,X0) ),
inference(prop_impl_just,[status(thm)],[c_64]) ).
cnf(c_159,plain,
( ~ risEuroMPFrom(X0,X1)
| cEuroMP(X0) ),
inference(backward_subsumption_resolution,[status(thm)],[c_60,c_50]) ).
cnf(c_160,plain,
( ~ xsd_integer(sK1)
| ~ cEuroMP(iKinnock)
| cowlNothing(sK2)
| xsd_string(sK1) ),
inference(backward_subsumption_resolution,[status(thm)],[c_75,c_50]) ).
cnf(c_161,plain,
( ~ xsd_string(sK1)
| ~ cEuroMP(iKinnock)
| cowlNothing(sK2)
| xsd_integer(sK1) ),
inference(backward_subsumption_resolution,[status(thm)],[c_74,c_50]) ).
cnf(c_191,plain,
( ~ xsd_string(sK1)
| ~ cEuroMP(iKinnock)
| xsd_integer(sK1) ),
inference(backward_subsumption_resolution,[status(thm)],[c_161,c_49]) ).
cnf(c_192,plain,
( ~ xsd_integer(sK1)
| ~ cEuroMP(iKinnock)
| xsd_string(sK1) ),
inference(backward_subsumption_resolution,[status(thm)],[c_160,c_49]) ).
cnf(c_198,plain,
( ~ cEuroMP(iKinnock)
| xsd_integer(sK1) ),
inference(backward_subsumption_resolution,[status(thm)],[c_191,c_90]) ).
cnf(c_200,plain,
( ~ cEuroMP(iKinnock)
| xsd_string(sK1) ),
inference(backward_subsumption_resolution,[status(thm)],[c_192,c_90]) ).
cnf(c_308,plain,
( X0 != sK1
| ~ xsd_integer(X0)
| ~ cEuroMP(iKinnock) ),
inference(resolution_lifted,[status(thm)],[c_88,c_200]) ).
cnf(c_309,plain,
( ~ xsd_integer(sK1)
| ~ cEuroMP(iKinnock) ),
inference(unflattening,[status(thm)],[c_308]) ).
cnf(c_310,plain,
~ cEuroMP(iKinnock),
inference(global_subsumption_just,[status(thm)],[c_309,c_198,c_309]) ).
cnf(c_325,plain,
( X0 != iKinnock
| ~ risEuroMPFrom(X0,X1) ),
inference(resolution_lifted,[status(thm)],[c_159,c_310]) ).
cnf(c_326,plain,
~ risEuroMPFrom(iKinnock,X0),
inference(unflattening,[status(thm)],[c_325]) ).
cnf(c_344,plain,
( X0 != iUK
| X1 != iKinnock
| risEuroMPFrom(X1,X0) ),
inference(resolution_lifted,[status(thm)],[c_101,c_73]) ).
cnf(c_345,plain,
risEuroMPFrom(iKinnock,iUK),
inference(unflattening,[status(thm)],[c_344]) ).
cnf(c_348,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_345,c_326]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.10 % Problem : KRS129+1 : TPTP v8.1.2. Released v3.1.0.
% 0.09/0.11 % Command : run_iprover %s %d THM
% 0.11/0.31 % Computer : n027.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 300
% 0.11/0.31 % WCLimit : 300
% 0.11/0.31 % DateTime : Thu May 2 23:08:05 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.16/0.42 Running first-order theorem proving
% 0.16/0.42 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.41/1.11 % SZS status Started for theBenchmark.p
% 0.41/1.11 % SZS status Theorem for theBenchmark.p
% 0.41/1.11
% 0.41/1.11 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.41/1.11
% 0.41/1.11 ------ iProver source info
% 0.41/1.11
% 0.41/1.11 git: date: 2024-05-02 19:28:25 +0000
% 0.41/1.11 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 0.41/1.11 git: non_committed_changes: false
% 0.41/1.11
% 0.41/1.11 ------ Parsing...
% 0.41/1.11 ------ Clausification by vclausify_rel & Parsing by iProver...
% 0.41/1.11
% 0.41/1.11 ------ Preprocessing... sup_sim: 0 sf_s rm: 12 0s sf_e pe_s pe:1:0s pe:2:0s
% 0.41/1.11
% 0.41/1.11 % SZS status Theorem for theBenchmark.p
% 0.41/1.11
% 0.41/1.11 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.41/1.11
% 0.41/1.11
%------------------------------------------------------------------------------