TSTP Solution File: KRS139+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : KRS139+1 : TPTP v8.1.2. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n023.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:45 EDT 2024
% Result : Theorem 0.45s 1.13s
% Output : CNFRefutation 0.45s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 9
% Syntax : Number of formulae : 52 ( 16 unt; 0 def)
% Number of atoms : 164 ( 0 equ)
% Maximal formula atoms : 9 ( 3 avg)
% Number of connectives : 199 ( 87 ~; 83 |; 21 &)
% ( 4 <=>; 3 =>; 0 <=; 1 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 35 ( 2 sgn 19 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] :
( ~ cowlNothing(X0)
& cowlThing(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_0) ).
fof(f2,axiom,
! [X0] :
( xsd_string(X0)
<=> ~ xsd_integer(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1) ).
fof(f3,axiom,
! [X0,X1] :
( rpath(X0,X1)
=> rpath(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_2) ).
fof(f4,axiom,
cowlThing(iAntwerp),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_3) ).
fof(f5,axiom,
cowlThing(iGhent),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_4) ).
fof(f6,axiom,
rpath(iGhent,iAntwerp),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_5) ).
fof(f7,conjecture,
( cowlThing(iGhent)
& rpath(iAntwerp,iGhent)
& cowlThing(iAntwerp)
& ! [X0] :
( xsd_string(X0)
<=> ~ xsd_integer(X0) )
& ! [X0] :
( ~ cowlNothing(X0)
& cowlThing(X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',the_axiom) ).
fof(f8,negated_conjecture,
~ ( cowlThing(iGhent)
& rpath(iAntwerp,iGhent)
& cowlThing(iAntwerp)
& ! [X0] :
( xsd_string(X0)
<=> ~ xsd_integer(X0) )
& ! [X0] :
( ~ cowlNothing(X0)
& cowlThing(X0) ) ),
inference(negated_conjecture,[],[f7]) ).
fof(f9,plain,
~ ( cowlThing(iGhent)
& rpath(iAntwerp,iGhent)
& cowlThing(iAntwerp)
& ! [X0] :
( xsd_string(X0)
<=> ~ xsd_integer(X0) )
& ! [X1] :
( ~ cowlNothing(X1)
& cowlThing(X1) ) ),
inference(rectify,[],[f8]) ).
fof(f10,plain,
! [X0,X1] :
( rpath(X1,X0)
| ~ rpath(X0,X1) ),
inference(ennf_transformation,[],[f3]) ).
fof(f11,plain,
( ~ cowlThing(iGhent)
| ~ rpath(iAntwerp,iGhent)
| ~ cowlThing(iAntwerp)
| ? [X0] :
( xsd_string(X0)
<~> ~ xsd_integer(X0) )
| ? [X1] :
( cowlNothing(X1)
| ~ cowlThing(X1) ) ),
inference(ennf_transformation,[],[f9]) ).
fof(f12,plain,
! [X0] :
( ( xsd_string(X0)
| xsd_integer(X0) )
& ( ~ xsd_integer(X0)
| ~ xsd_string(X0) ) ),
inference(nnf_transformation,[],[f2]) ).
fof(f13,plain,
( ~ cowlThing(iGhent)
| ~ rpath(iAntwerp,iGhent)
| ~ cowlThing(iAntwerp)
| ? [X0] :
( ( xsd_integer(X0)
| ~ xsd_string(X0) )
& ( ~ xsd_integer(X0)
| xsd_string(X0) ) )
| ? [X1] :
( cowlNothing(X1)
| ~ cowlThing(X1) ) ),
inference(nnf_transformation,[],[f11]) ).
fof(f14,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(f15,plain,
( ? [X1] :
( cowlNothing(X1)
| ~ cowlThing(X1) )
=> ( cowlNothing(sK1)
| ~ cowlThing(sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f16,plain,
( ~ cowlThing(iGhent)
| ~ rpath(iAntwerp,iGhent)
| ~ cowlThing(iAntwerp)
| ( ( 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])],[f13,f15,f14]) ).
fof(f17,plain,
! [X0] : cowlThing(X0),
inference(cnf_transformation,[],[f1]) ).
fof(f18,plain,
! [X0] : ~ cowlNothing(X0),
inference(cnf_transformation,[],[f1]) ).
fof(f19,plain,
! [X0] :
( ~ xsd_integer(X0)
| ~ xsd_string(X0) ),
inference(cnf_transformation,[],[f12]) ).
fof(f20,plain,
! [X0] :
( xsd_string(X0)
| xsd_integer(X0) ),
inference(cnf_transformation,[],[f12]) ).
fof(f21,plain,
! [X0,X1] :
( rpath(X1,X0)
| ~ rpath(X0,X1) ),
inference(cnf_transformation,[],[f10]) ).
fof(f22,plain,
cowlThing(iAntwerp),
inference(cnf_transformation,[],[f4]) ).
fof(f23,plain,
cowlThing(iGhent),
inference(cnf_transformation,[],[f5]) ).
fof(f24,plain,
rpath(iGhent,iAntwerp),
inference(cnf_transformation,[],[f6]) ).
fof(f25,plain,
( ~ cowlThing(iGhent)
| ~ rpath(iAntwerp,iGhent)
| ~ cowlThing(iAntwerp)
| ~ xsd_integer(sK0)
| xsd_string(sK0)
| cowlNothing(sK1)
| ~ cowlThing(sK1) ),
inference(cnf_transformation,[],[f16]) ).
fof(f26,plain,
( ~ cowlThing(iGhent)
| ~ rpath(iAntwerp,iGhent)
| ~ cowlThing(iAntwerp)
| xsd_integer(sK0)
| ~ xsd_string(sK0)
| cowlNothing(sK1)
| ~ cowlThing(sK1) ),
inference(cnf_transformation,[],[f16]) ).
cnf(c_49,plain,
~ cowlNothing(X0),
inference(cnf_transformation,[],[f18]) ).
cnf(c_50,plain,
cowlThing(X0),
inference(cnf_transformation,[],[f17]) ).
cnf(c_51,plain,
( xsd_string(X0)
| xsd_integer(X0) ),
inference(cnf_transformation,[],[f20]) ).
cnf(c_52,plain,
( ~ xsd_string(X0)
| ~ xsd_integer(X0) ),
inference(cnf_transformation,[],[f19]) ).
cnf(c_53,plain,
( ~ rpath(X0,X1)
| rpath(X1,X0) ),
inference(cnf_transformation,[],[f21]) ).
cnf(c_54,plain,
cowlThing(iAntwerp),
inference(cnf_transformation,[],[f22]) ).
cnf(c_55,plain,
cowlThing(iGhent),
inference(cnf_transformation,[],[f23]) ).
cnf(c_56,plain,
rpath(iGhent,iAntwerp),
inference(cnf_transformation,[],[f24]) ).
cnf(c_57,negated_conjecture,
( ~ rpath(iAntwerp,iGhent)
| ~ cowlThing(iAntwerp)
| ~ cowlThing(iGhent)
| ~ cowlThing(sK1)
| ~ xsd_string(sK0)
| cowlNothing(sK1)
| xsd_integer(sK0) ),
inference(cnf_transformation,[],[f26]) ).
cnf(c_58,negated_conjecture,
( ~ rpath(iAntwerp,iGhent)
| ~ cowlThing(iAntwerp)
| ~ cowlThing(iGhent)
| ~ cowlThing(sK1)
| ~ xsd_integer(sK0)
| cowlNothing(sK1)
| xsd_string(sK0) ),
inference(cnf_transformation,[],[f25]) ).
cnf(c_62,negated_conjecture,
( ~ rpath(iAntwerp,iGhent)
| ~ cowlThing(sK1)
| ~ xsd_integer(sK0)
| cowlNothing(sK1)
| xsd_string(sK0) ),
inference(global_subsumption_just,[status(thm)],[c_58,c_55,c_54,c_58]) ).
cnf(c_64,negated_conjecture,
( ~ rpath(iAntwerp,iGhent)
| ~ cowlThing(sK1)
| ~ xsd_string(sK0)
| cowlNothing(sK1)
| xsd_integer(sK0) ),
inference(global_subsumption_just,[status(thm)],[c_57,c_55,c_54,c_57]) ).
cnf(c_66,plain,
( ~ xsd_integer(X0)
| ~ xsd_string(X0) ),
inference(prop_impl_just,[status(thm)],[c_52]) ).
cnf(c_67,plain,
( ~ xsd_string(X0)
| ~ xsd_integer(X0) ),
inference(renaming,[status(thm)],[c_66]) ).
cnf(c_68,plain,
( xsd_integer(X0)
| xsd_string(X0) ),
inference(prop_impl_just,[status(thm)],[c_51]) ).
cnf(c_69,plain,
( xsd_string(X0)
| xsd_integer(X0) ),
inference(renaming,[status(thm)],[c_68]) ).
cnf(c_96,plain,
( ~ rpath(iAntwerp,iGhent)
| ~ xsd_string(sK0)
| cowlNothing(sK1)
| xsd_integer(sK0) ),
inference(backward_subsumption_resolution,[status(thm)],[c_64,c_50]) ).
cnf(c_97,plain,
( ~ rpath(iAntwerp,iGhent)
| ~ xsd_integer(sK0)
| cowlNothing(sK1)
| xsd_string(sK0) ),
inference(backward_subsumption_resolution,[status(thm)],[c_62,c_50]) ).
cnf(c_100,plain,
( ~ rpath(iAntwerp,iGhent)
| ~ xsd_integer(sK0)
| xsd_string(sK0) ),
inference(backward_subsumption_resolution,[status(thm)],[c_97,c_49]) ).
cnf(c_101,plain,
( ~ rpath(iAntwerp,iGhent)
| ~ xsd_string(sK0)
| xsd_integer(sK0) ),
inference(backward_subsumption_resolution,[status(thm)],[c_96,c_49]) ).
cnf(c_107,plain,
( ~ rpath(iAntwerp,iGhent)
| xsd_integer(sK0) ),
inference(backward_subsumption_resolution,[status(thm)],[c_101,c_69]) ).
cnf(c_109,plain,
( ~ rpath(iAntwerp,iGhent)
| xsd_string(sK0) ),
inference(backward_subsumption_resolution,[status(thm)],[c_100,c_69]) ).
cnf(c_127,plain,
( ~ rpath(iAntwerp,iGhent)
| ~ xsd_integer(sK0) ),
inference(resolution,[status(thm)],[c_67,c_109]) ).
cnf(c_128,plain,
~ rpath(iAntwerp,iGhent),
inference(global_subsumption_just,[status(thm)],[c_127,c_107,c_127]) ).
cnf(c_142,plain,
rpath(iAntwerp,iGhent),
inference(resolution,[status(thm)],[c_53,c_56]) ).
cnf(c_143,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_142,c_128]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : KRS139+1 : TPTP v8.1.2. Released v3.1.0.
% 0.11/0.12 % Command : run_iprover %s %d THM
% 0.11/0.32 % Computer : n023.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:53:54 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.18/0.44 Running first-order theorem proving
% 0.18/0.44 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
% 0.45/1.13 % SZS status Started for theBenchmark.p
% 0.45/1.13 % SZS status Theorem for theBenchmark.p
% 0.45/1.13
% 0.45/1.13 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.45/1.13
% 0.45/1.13 ------ iProver source info
% 0.45/1.13
% 0.45/1.13 git: date: 2024-05-02 19:28:25 +0000
% 0.45/1.13 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 0.45/1.13 git: non_committed_changes: false
% 0.45/1.13
% 0.45/1.13 ------ Parsing...
% 0.45/1.13 ------ Clausification by vclausify_rel & Parsing by iProver...------ preprocesses with Option_epr_non_horn_non_eq
% 0.45/1.13
% 0.45/1.13
% 0.45/1.13 ------ Preprocessing... sf_s rm: 2 0s sf_e pe_s pe:1:0s pe:2:0s pe_e sf_s rm: 0 0s sf_e pe_s pe_e
% 0.45/1.13
% 0.45/1.13 ------ Preprocessing...------ preprocesses with Option_epr_horn
% 0.45/1.13 gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 0.45/1.13 ------ Proving...
% 0.45/1.13 ------ Problem Properties
% 0.45/1.13
% 0.45/1.13
% 0.45/1.13 clauses 3
% 0.45/1.13 conjectures 0
% 0.45/1.13 EPR 3
% 0.45/1.13 Horn 3
% 0.45/1.13 unary 2
% 0.45/1.13 binary 1
% 0.45/1.13 lits 4
% 0.45/1.13 lits eq 0
% 0.45/1.13 fd_pure 0
% 0.45/1.13 fd_pseudo 0
% 0.45/1.13 fd_cond 0
% 0.45/1.13 fd_pseudo_cond 0
% 0.45/1.13 AC symbols 0
% 0.45/1.13
% 0.45/1.13 ------ Schedule EPR Horn non eq is on
% 0.45/1.13
% 0.45/1.13 ------ no conjectures: strip conj schedule
% 0.45/1.13
% 0.45/1.13 ------ no equalities: superposition off
% 0.45/1.13
% 0.45/1.13 ------ Option_epr_horn stripped conjectures Time Limit: Unbounded
% 0.45/1.13
% 0.45/1.13
% 0.45/1.13 ------
% 0.45/1.13 Current options:
% 0.45/1.13 ------
% 0.45/1.13
% 0.45/1.13
% 0.45/1.13
% 0.45/1.13
% 0.45/1.13 ------ Proving...
% 0.45/1.13
% 0.45/1.13
% 0.45/1.13 % SZS status Theorem for theBenchmark.p
% 0.45/1.13
% 0.45/1.13 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.45/1.13
% 0.45/1.14
%------------------------------------------------------------------------------