TSTP Solution File: KRS135+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : KRS135+1 : TPTP v8.1.2. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n028.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:44 EDT 2024
% Result : Theorem 0.44s 1.15s
% Output : CNFRefutation 0.44s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 7
% Syntax : Number of formulae : 51 ( 8 unt; 0 def)
% Number of atoms : 174 ( 0 equ)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 207 ( 84 ~; 90 |; 20 &)
% ( 4 <=>; 8 =>; 0 <=; 1 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 46 ( 4 sgn 25 !; 12 ?)
% 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] :
( cowlThing(X0)
=> ! [X1] :
( rprop(X0,X1)
=> cA(X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_2) ).
fof(f4,conjecture,
( ! [X0,X1] :
( rprop(X0,X1)
=> cA(X1) )
& ! [X0] :
( xsd_string(X0)
<=> ~ xsd_integer(X0) )
& ! [X0] :
( ~ cowlNothing(X0)
& cowlThing(X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',the_axiom) ).
fof(f5,negated_conjecture,
~ ( ! [X0,X1] :
( rprop(X0,X1)
=> cA(X1) )
& ! [X0] :
( xsd_string(X0)
<=> ~ xsd_integer(X0) )
& ! [X0] :
( ~ cowlNothing(X0)
& cowlThing(X0) ) ),
inference(negated_conjecture,[],[f4]) ).
fof(f6,plain,
~ ( ! [X0,X1] :
( rprop(X0,X1)
=> cA(X1) )
& ! [X2] :
( xsd_string(X2)
<=> ~ xsd_integer(X2) )
& ! [X3] :
( ~ cowlNothing(X3)
& cowlThing(X3) ) ),
inference(rectify,[],[f5]) ).
fof(f7,plain,
! [X0] :
( ! [X1] :
( cA(X1)
| ~ rprop(X0,X1) )
| ~ cowlThing(X0) ),
inference(ennf_transformation,[],[f3]) ).
fof(f8,plain,
( ? [X0,X1] :
( ~ cA(X1)
& rprop(X0,X1) )
| ? [X2] :
( xsd_string(X2)
<~> ~ xsd_integer(X2) )
| ? [X3] :
( cowlNothing(X3)
| ~ cowlThing(X3) ) ),
inference(ennf_transformation,[],[f6]) ).
fof(f9,plain,
! [X0] :
( ( xsd_string(X0)
| xsd_integer(X0) )
& ( ~ xsd_integer(X0)
| ~ xsd_string(X0) ) ),
inference(nnf_transformation,[],[f2]) ).
fof(f10,plain,
( ? [X0,X1] :
( ~ cA(X1)
& rprop(X0,X1) )
| ? [X2] :
( ( xsd_integer(X2)
| ~ xsd_string(X2) )
& ( ~ xsd_integer(X2)
| xsd_string(X2) ) )
| ? [X3] :
( cowlNothing(X3)
| ~ cowlThing(X3) ) ),
inference(nnf_transformation,[],[f8]) ).
fof(f11,plain,
( ? [X0,X1] :
( ~ cA(X1)
& rprop(X0,X1) )
=> ( ~ cA(sK1)
& rprop(sK0,sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f12,plain,
( ? [X2] :
( ( xsd_integer(X2)
| ~ xsd_string(X2) )
& ( ~ xsd_integer(X2)
| xsd_string(X2) ) )
=> ( ( xsd_integer(sK2)
| ~ xsd_string(sK2) )
& ( ~ xsd_integer(sK2)
| xsd_string(sK2) ) ) ),
introduced(choice_axiom,[]) ).
fof(f13,plain,
( ? [X3] :
( cowlNothing(X3)
| ~ cowlThing(X3) )
=> ( cowlNothing(sK3)
| ~ cowlThing(sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f14,plain,
( ( ~ cA(sK1)
& rprop(sK0,sK1) )
| ( ( xsd_integer(sK2)
| ~ xsd_string(sK2) )
& ( ~ xsd_integer(sK2)
| xsd_string(sK2) ) )
| cowlNothing(sK3)
| ~ cowlThing(sK3) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f10,f13,f12,f11]) ).
fof(f15,plain,
! [X0] : cowlThing(X0),
inference(cnf_transformation,[],[f1]) ).
fof(f16,plain,
! [X0] : ~ cowlNothing(X0),
inference(cnf_transformation,[],[f1]) ).
fof(f17,plain,
! [X0] :
( ~ xsd_integer(X0)
| ~ xsd_string(X0) ),
inference(cnf_transformation,[],[f9]) ).
fof(f18,plain,
! [X0] :
( xsd_string(X0)
| xsd_integer(X0) ),
inference(cnf_transformation,[],[f9]) ).
fof(f19,plain,
! [X0,X1] :
( cA(X1)
| ~ rprop(X0,X1)
| ~ cowlThing(X0) ),
inference(cnf_transformation,[],[f7]) ).
fof(f20,plain,
( rprop(sK0,sK1)
| ~ xsd_integer(sK2)
| xsd_string(sK2)
| cowlNothing(sK3)
| ~ cowlThing(sK3) ),
inference(cnf_transformation,[],[f14]) ).
fof(f21,plain,
( rprop(sK0,sK1)
| xsd_integer(sK2)
| ~ xsd_string(sK2)
| cowlNothing(sK3)
| ~ cowlThing(sK3) ),
inference(cnf_transformation,[],[f14]) ).
fof(f22,plain,
( ~ cA(sK1)
| ~ xsd_integer(sK2)
| xsd_string(sK2)
| cowlNothing(sK3)
| ~ cowlThing(sK3) ),
inference(cnf_transformation,[],[f14]) ).
fof(f23,plain,
( ~ cA(sK1)
| xsd_integer(sK2)
| ~ xsd_string(sK2)
| cowlNothing(sK3)
| ~ cowlThing(sK3) ),
inference(cnf_transformation,[],[f14]) ).
cnf(c_49,plain,
~ cowlNothing(X0),
inference(cnf_transformation,[],[f16]) ).
cnf(c_50,plain,
cowlThing(X0),
inference(cnf_transformation,[],[f15]) ).
cnf(c_51,plain,
( xsd_string(X0)
| xsd_integer(X0) ),
inference(cnf_transformation,[],[f18]) ).
cnf(c_52,plain,
( ~ xsd_string(X0)
| ~ xsd_integer(X0) ),
inference(cnf_transformation,[],[f17]) ).
cnf(c_53,plain,
( ~ rprop(X0,X1)
| ~ cowlThing(X0)
| cA(X1) ),
inference(cnf_transformation,[],[f19]) ).
cnf(c_54,negated_conjecture,
( ~ cowlThing(sK3)
| ~ xsd_string(sK2)
| ~ cA(sK1)
| cowlNothing(sK3)
| xsd_integer(sK2) ),
inference(cnf_transformation,[],[f23]) ).
cnf(c_55,negated_conjecture,
( ~ cowlThing(sK3)
| ~ xsd_integer(sK2)
| ~ cA(sK1)
| cowlNothing(sK3)
| xsd_string(sK2) ),
inference(cnf_transformation,[],[f22]) ).
cnf(c_56,negated_conjecture,
( ~ cowlThing(sK3)
| ~ xsd_string(sK2)
| rprop(sK0,sK1)
| cowlNothing(sK3)
| xsd_integer(sK2) ),
inference(cnf_transformation,[],[f21]) ).
cnf(c_57,negated_conjecture,
( ~ cowlThing(sK3)
| ~ xsd_integer(sK2)
| rprop(sK0,sK1)
| cowlNothing(sK3)
| xsd_string(sK2) ),
inference(cnf_transformation,[],[f20]) ).
cnf(c_60,plain,
( xsd_string(sK2)
| xsd_integer(sK2) ),
inference(instantiation,[status(thm)],[c_51]) ).
cnf(c_61,plain,
( ~ xsd_string(sK2)
| ~ xsd_integer(sK2) ),
inference(instantiation,[status(thm)],[c_52]) ).
cnf(c_66,negated_conjecture,
( ~ cowlThing(sK3)
| rprop(sK0,sK1)
| cowlNothing(sK3)
| xsd_string(sK2) ),
inference(global_subsumption_just,[status(thm)],[c_57,c_60,c_61,c_57,c_56]) ).
cnf(c_68,plain,
( cowlNothing(sK3)
| rprop(sK0,sK1)
| ~ cowlThing(sK3) ),
inference(global_subsumption_just,[status(thm)],[c_66,c_61,c_56,c_66]) ).
cnf(c_69,negated_conjecture,
( ~ cowlThing(sK3)
| rprop(sK0,sK1)
| cowlNothing(sK3) ),
inference(renaming,[status(thm)],[c_68]) ).
cnf(c_70,plain,
( cowlNothing(sK3)
| rprop(sK0,sK1)
| ~ cowlThing(sK3) ),
inference(global_subsumption_just,[status(thm)],[c_56,c_69]) ).
cnf(c_71,negated_conjecture,
( ~ cowlThing(sK3)
| rprop(sK0,sK1)
| cowlNothing(sK3) ),
inference(renaming,[status(thm)],[c_70]) ).
cnf(c_72,negated_conjecture,
( ~ cowlThing(sK3)
| ~ cA(sK1)
| cowlNothing(sK3)
| xsd_string(sK2) ),
inference(global_subsumption_just,[status(thm)],[c_55,c_60,c_61,c_55,c_54]) ).
cnf(c_74,plain,
( cowlNothing(sK3)
| ~ cA(sK1)
| ~ cowlThing(sK3) ),
inference(global_subsumption_just,[status(thm)],[c_72,c_61,c_54,c_72]) ).
cnf(c_75,negated_conjecture,
( ~ cowlThing(sK3)
| ~ cA(sK1)
| cowlNothing(sK3) ),
inference(renaming,[status(thm)],[c_74]) ).
cnf(c_76,plain,
( cowlNothing(sK3)
| ~ cA(sK1)
| ~ cowlThing(sK3) ),
inference(global_subsumption_just,[status(thm)],[c_54,c_75]) ).
cnf(c_77,negated_conjecture,
( ~ cowlThing(sK3)
| ~ cA(sK1)
| cowlNothing(sK3) ),
inference(renaming,[status(thm)],[c_76]) ).
cnf(c_82,plain,
( ~ rprop(X0,X1)
| cA(X1) ),
inference(prop_impl_just,[status(thm)],[c_50,c_53]) ).
cnf(c_102,plain,
( ~ cA(sK1)
| cowlNothing(sK3) ),
inference(backward_subsumption_resolution,[status(thm)],[c_77,c_50]) ).
cnf(c_103,plain,
( rprop(sK0,sK1)
| cowlNothing(sK3) ),
inference(backward_subsumption_resolution,[status(thm)],[c_71,c_50]) ).
cnf(c_106,plain,
~ cA(sK1),
inference(backward_subsumption_resolution,[status(thm)],[c_102,c_49]) ).
cnf(c_107,plain,
rprop(sK0,sK1),
inference(backward_subsumption_resolution,[status(thm)],[c_103,c_49]) ).
cnf(c_124,plain,
~ rprop(X0,sK1),
inference(resolution,[status(thm)],[c_82,c_106]) ).
cnf(c_130,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_107,c_124]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : KRS135+1 : TPTP v8.1.2. Released v3.1.0.
% 0.07/0.14 % Command : run_iprover %s %d THM
% 0.13/0.35 % Computer : n028.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Thu May 2 23:01:18 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.19/0.48 Running first-order theorem proving
% 0.19/0.48 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.44/1.15 % SZS status Started for theBenchmark.p
% 0.44/1.15 % SZS status Theorem for theBenchmark.p
% 0.44/1.15
% 0.44/1.15 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.44/1.15
% 0.44/1.15 ------ iProver source info
% 0.44/1.15
% 0.44/1.15 git: date: 2024-05-02 19:28:25 +0000
% 0.44/1.15 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 0.44/1.15 git: non_committed_changes: false
% 0.44/1.15
% 0.44/1.15 ------ Parsing...
% 0.44/1.15 ------ Clausification by vclausify_rel & Parsing by iProver...------ preprocesses with Option_epr_non_horn_non_eq
% 0.44/1.15
% 0.44/1.15
% 0.44/1.15 ------ Preprocessing... sf_s rm: 4 0s sf_e pe_s pe:1:0s
% 0.44/1.15
% 0.44/1.15 % SZS status Theorem for theBenchmark.p
% 0.44/1.15
% 0.44/1.15 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.44/1.15
% 0.44/1.15
%------------------------------------------------------------------------------