TSTP Solution File: KRS163+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : KRS163+1 : TPTP v8.1.2. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n022.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:49 EDT 2024
% Result : Theorem 0.87s 1.19s
% Output : CNFRefutation 0.87s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 8
% Syntax : Number of formulae : 47 ( 15 unt; 0 def)
% Number of atoms : 145 ( 17 equ)
% Maximal formula atoms : 9 ( 3 avg)
% Number of connectives : 174 ( 76 ~; 66 |; 24 &)
% ( 5 <=>; 2 =>; 0 <=; 1 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 32 ( 2 sgn 19 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f7,axiom,
! [X2] :
( ~ cowlNothing(X2)
& cowlThing(X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_0) ).
fof(f8,axiom,
! [X2] :
( xsd_string(X2)
<=> ~ xsd_integer(X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1) ).
fof(f9,axiom,
cA(ia),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_2) ).
fof(f11,axiom,
cB(ib),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_4) ).
fof(f13,axiom,
! [X2] :
~ ( cA(X2)
& cB(X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_6) ).
fof(f14,conjecture,
( ia != ib
& cowlThing(ib)
& cowlThing(ia)
& ! [X2] :
( xsd_string(X2)
<=> ~ xsd_integer(X2) )
& ! [X2] :
( ~ cowlNothing(X2)
& cowlThing(X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',the_axiom) ).
fof(f15,negated_conjecture,
~ ( ia != ib
& cowlThing(ib)
& cowlThing(ia)
& ! [X2] :
( xsd_string(X2)
<=> ~ xsd_integer(X2) )
& ! [X2] :
( ~ cowlNothing(X2)
& cowlThing(X2) ) ),
inference(negated_conjecture,[],[f14]) ).
fof(f16,plain,
! [X0] :
( ~ cowlNothing(X0)
& cowlThing(X0) ),
inference(rectify,[],[f7]) ).
fof(f17,plain,
! [X0] :
( xsd_string(X0)
<=> ~ xsd_integer(X0) ),
inference(rectify,[],[f8]) ).
fof(f18,plain,
! [X0] :
~ ( cA(X0)
& cB(X0) ),
inference(rectify,[],[f13]) ).
fof(f19,plain,
~ ( ia != ib
& cowlThing(ib)
& cowlThing(ia)
& ! [X0] :
( xsd_string(X0)
<=> ~ xsd_integer(X0) )
& ! [X1] :
( ~ cowlNothing(X1)
& cowlThing(X1) ) ),
inference(rectify,[],[f15]) ).
fof(f32,plain,
! [X0] :
( ~ cA(X0)
| ~ cB(X0) ),
inference(ennf_transformation,[],[f18]) ).
fof(f33,plain,
( ia = ib
| ~ cowlThing(ib)
| ~ cowlThing(ia)
| ? [X0] :
( xsd_string(X0)
<~> ~ xsd_integer(X0) )
| ? [X1] :
( cowlNothing(X1)
| ~ cowlThing(X1) ) ),
inference(ennf_transformation,[],[f19]) ).
fof(f34,plain,
! [X0] :
( ( xsd_string(X0)
| xsd_integer(X0) )
& ( ~ xsd_integer(X0)
| ~ xsd_string(X0) ) ),
inference(nnf_transformation,[],[f17]) ).
fof(f35,plain,
( ia = ib
| ~ cowlThing(ib)
| ~ cowlThing(ia)
| ? [X0] :
( ( xsd_integer(X0)
| ~ xsd_string(X0) )
& ( ~ xsd_integer(X0)
| xsd_string(X0) ) )
| ? [X1] :
( cowlNothing(X1)
| ~ cowlThing(X1) ) ),
inference(nnf_transformation,[],[f33]) ).
fof(f36,plain,
( ? [X0] :
( ( xsd_integer(X0)
| ~ xsd_string(X0) )
& ( ~ xsd_integer(X0)
| xsd_string(X0) ) )
=> ( ( xsd_integer(sK0)
| ~ xsd_string(sK0) )
& ( ~ xsd_integer(sK0)
| xsd_string(sK0) ) ) ),
introduced(choice_axiom,[]) ).
fof(f37,plain,
( ? [X1] :
( cowlNothing(X1)
| ~ cowlThing(X1) )
=> ( cowlNothing(sK1)
| ~ cowlThing(sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f38,plain,
( ia = ib
| ~ cowlThing(ib)
| ~ cowlThing(ia)
| ( ( xsd_integer(sK0)
| ~ xsd_string(sK0) )
& ( ~ xsd_integer(sK0)
| xsd_string(sK0) ) )
| cowlNothing(sK1)
| ~ cowlThing(sK1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f35,f37,f36]) ).
fof(f45,plain,
! [X0] : cowlThing(X0),
inference(cnf_transformation,[],[f16]) ).
fof(f46,plain,
! [X0] : ~ cowlNothing(X0),
inference(cnf_transformation,[],[f16]) ).
fof(f47,plain,
! [X0] :
( ~ xsd_integer(X0)
| ~ xsd_string(X0) ),
inference(cnf_transformation,[],[f34]) ).
fof(f48,plain,
! [X0] :
( xsd_string(X0)
| xsd_integer(X0) ),
inference(cnf_transformation,[],[f34]) ).
fof(f49,plain,
cA(ia),
inference(cnf_transformation,[],[f9]) ).
fof(f51,plain,
cB(ib),
inference(cnf_transformation,[],[f11]) ).
fof(f53,plain,
! [X0] :
( ~ cA(X0)
| ~ cB(X0) ),
inference(cnf_transformation,[],[f32]) ).
fof(f54,plain,
( ia = ib
| ~ cowlThing(ib)
| ~ cowlThing(ia)
| ~ xsd_integer(sK0)
| xsd_string(sK0)
| cowlNothing(sK1)
| ~ cowlThing(sK1) ),
inference(cnf_transformation,[],[f38]) ).
fof(f55,plain,
( ia = ib
| ~ cowlThing(ib)
| ~ cowlThing(ia)
| xsd_integer(sK0)
| ~ xsd_string(sK0)
| cowlNothing(sK1)
| ~ cowlThing(sK1) ),
inference(cnf_transformation,[],[f38]) ).
cnf(c_49,plain,
~ cowlNothing(X0),
inference(cnf_transformation,[],[f46]) ).
cnf(c_50,plain,
cowlThing(X0),
inference(cnf_transformation,[],[f45]) ).
cnf(c_51,plain,
( xsd_string(X0)
| xsd_integer(X0) ),
inference(cnf_transformation,[],[f48]) ).
cnf(c_52,plain,
( ~ xsd_string(X0)
| ~ xsd_integer(X0) ),
inference(cnf_transformation,[],[f47]) ).
cnf(c_53,plain,
cA(ia),
inference(cnf_transformation,[],[f49]) ).
cnf(c_55,plain,
cB(ib),
inference(cnf_transformation,[],[f51]) ).
cnf(c_57,plain,
( ~ cA(X0)
| ~ cB(X0) ),
inference(cnf_transformation,[],[f53]) ).
cnf(c_58,negated_conjecture,
( ~ cowlThing(ia)
| ~ cowlThing(ib)
| ~ cowlThing(sK1)
| ~ xsd_string(sK0)
| ia = ib
| cowlNothing(sK1)
| xsd_integer(sK0) ),
inference(cnf_transformation,[],[f55]) ).
cnf(c_59,negated_conjecture,
( ~ cowlThing(ia)
| ~ cowlThing(ib)
| ~ cowlThing(sK1)
| ~ xsd_integer(sK0)
| ia = ib
| cowlNothing(sK1)
| xsd_string(sK0) ),
inference(cnf_transformation,[],[f54]) ).
cnf(c_74,plain,
( ~ xsd_string(sK0)
| ia = ib
| xsd_integer(sK0) ),
inference(forward_subsumption_resolution,[status(thm)],[c_58,c_49,c_50,c_50,c_50]) ).
cnf(c_78,plain,
( ia = ib
| xsd_integer(sK0) ),
inference(forward_subsumption_resolution,[status(thm)],[c_74,c_51]) ).
cnf(c_81,plain,
( ~ xsd_integer(sK0)
| ia = ib
| xsd_string(sK0) ),
inference(forward_subsumption_resolution,[status(thm)],[c_59,c_49,c_50,c_50,c_50]) ).
cnf(c_85,plain,
( ia = ib
| xsd_string(sK0) ),
inference(forward_subsumption_resolution,[status(thm)],[c_81,c_51]) ).
cnf(c_95,plain,
( X0 != ia
| ~ cB(X0) ),
inference(resolution_lifted,[status(thm)],[c_53,c_57]) ).
cnf(c_96,plain,
~ cB(ia),
inference(unflattening,[status(thm)],[c_95]) ).
cnf(c_101,plain,
ia != ib,
inference(resolution_lifted,[status(thm)],[c_55,c_96]) ).
cnf(c_107,plain,
xsd_string(sK0),
inference(backward_subsumption_resolution,[status(thm)],[c_85,c_101]) ).
cnf(c_110,plain,
( X0 != sK0
| ~ xsd_integer(X0) ),
inference(resolution_lifted,[status(thm)],[c_52,c_107]) ).
cnf(c_111,plain,
~ xsd_integer(sK0),
inference(unflattening,[status(thm)],[c_110]) ).
cnf(c_112,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_111,c_101,c_78]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : KRS163+1 : TPTP v8.1.2. Released v3.1.0.
% 0.04/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n022.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 22:37:12 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.20/0.47 Running first-order theorem proving
% 0.20/0.47 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.87/1.19 % SZS status Started for theBenchmark.p
% 0.87/1.19 % SZS status Theorem for theBenchmark.p
% 0.87/1.19
% 0.87/1.19 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.87/1.19
% 0.87/1.19 ------ iProver source info
% 0.87/1.19
% 0.87/1.19 git: date: 2024-05-02 19:28:25 +0000
% 0.87/1.19 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 0.87/1.19 git: non_committed_changes: false
% 0.87/1.19
% 0.87/1.19 ------ Parsing...
% 0.87/1.19 ------ Clausification by vclausify_rel & Parsing by iProver...------ preprocesses with Option_epr_non_horn_eq
% 0.87/1.19
% 0.87/1.19
% 0.87/1.19 ------ Preprocessing... sup_sim: 4 sf_s rm: 3 0s sf_e pe_s pe:1:0s pe:2:0s
% 0.87/1.19
% 0.87/1.19 % SZS status Theorem for theBenchmark.p
% 0.87/1.19
% 0.87/1.19 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.87/1.19
% 0.87/1.19
%------------------------------------------------------------------------------