TSTP Solution File: KRS003_1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : KRS003_1 : TPTP v8.1.2. Released v5.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n005.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:25 EDT 2024
% Result : Theorem 0.73s 1.12s
% Output : CNFRefutation 0.73s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 9
% Syntax : Number of formulae : 52 ( 5 unt; 0 typ; 0 def)
% Number of atoms : 135 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 123 ( 60 ~; 49 |; 6 &)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of FOOLs : 20 ( 20 fml; 0 var)
% Number of types : 0 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 14 ( 13 usr; 4 prp; 0-2 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 50 ( 0 sgn 36 !; 0 ?; 36 :)
% Comments :
%------------------------------------------------------------------------------
tff(f1,axiom,
! [X0: unreal] :
( c(X0)
=> s2least(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_3) ).
tff(f3,axiom,
! [X0: unreal] :
~ ( equalish(u1r2(X0),u1r1(X0))
& s2least(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_5) ).
tff(f4,axiom,
! [X0: unreal] :
( s2least(X0)
=> s(X0,u1r1(X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_6) ).
tff(f5,axiom,
! [X0: unreal] :
( s2least(X0)
=> s(X0,u1r2(X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_7) ).
tff(f7,axiom,
! [X0: unreal] :
( d(X0)
=> s1most(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_9) ).
tff(f9,axiom,
! [X1: real,X2: real,X0: unreal] :
( ( s(X0,X1)
& s(X0,X2)
& s1most(X0) )
=> equalish(X2,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_11) ).
tff(f13,axiom,
! [X0: unreal] :
( e(X0)
=> c(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_15) ).
tff(f14,axiom,
! [X0: unreal] :
( f(X0)
=> d(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_16) ).
tff(f15,conjecture,
( ~ f(exist)
| ~ e(exist) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_1__clause_2) ).
tff(f16,negated_conjecture,
~ ( ~ f(exist)
| ~ e(exist) ),
inference(negated_conjecture,[],[f15]) ).
tff(f18,plain,
! [X0: real,X1: real,X2: unreal] :
( ( s(X2,X0)
& s(X2,X1)
& s1most(X2) )
=> equalish(X1,X0) ),
inference(rectify,[],[f9]) ).
tff(f19,plain,
! [X0: unreal] :
( s2least(X0)
| ~ c(X0) ),
inference(ennf_transformation,[],[f1]) ).
tff(f21,plain,
! [X0: unreal] :
( ~ equalish(u1r2(X0),u1r1(X0))
| ~ s2least(X0) ),
inference(ennf_transformation,[],[f3]) ).
tff(f22,plain,
! [X0: unreal] :
( s(X0,u1r1(X0))
| ~ s2least(X0) ),
inference(ennf_transformation,[],[f4]) ).
tff(f23,plain,
! [X0: unreal] :
( s(X0,u1r2(X0))
| ~ s2least(X0) ),
inference(ennf_transformation,[],[f5]) ).
tff(f26,plain,
! [X0: unreal] :
( s1most(X0)
| ~ d(X0) ),
inference(ennf_transformation,[],[f7]) ).
tff(f28,plain,
! [X0: real,X1: real,X2: unreal] :
( equalish(X1,X0)
| ~ s(X2,X0)
| ~ s(X2,X1)
| ~ s1most(X2) ),
inference(ennf_transformation,[],[f18]) ).
tff(f29,plain,
! [X0: real,X1: real,X2: unreal] :
( equalish(X1,X0)
| ~ s(X2,X0)
| ~ s(X2,X1)
| ~ s1most(X2) ),
inference(flattening,[],[f28]) ).
tff(f31,plain,
! [X0: unreal] :
( c(X0)
| ~ e(X0) ),
inference(ennf_transformation,[],[f13]) ).
tff(f32,plain,
! [X0: unreal] :
( d(X0)
| ~ f(X0) ),
inference(ennf_transformation,[],[f14]) ).
tff(f33,plain,
( f(exist)
& e(exist) ),
inference(ennf_transformation,[],[f16]) ).
tff(f34,plain,
! [X0: unreal] :
( s2least(X0)
| ~ c(X0) ),
inference(cnf_transformation,[],[f19]) ).
tff(f36,plain,
! [X0: unreal] :
( ~ equalish(u1r2(X0),u1r1(X0))
| ~ s2least(X0) ),
inference(cnf_transformation,[],[f21]) ).
tff(f37,plain,
! [X0: unreal] :
( s(X0,u1r1(X0))
| ~ s2least(X0) ),
inference(cnf_transformation,[],[f22]) ).
tff(f38,plain,
! [X0: unreal] :
( s(X0,u1r2(X0))
| ~ s2least(X0) ),
inference(cnf_transformation,[],[f23]) ).
tff(f40,plain,
! [X0: unreal] :
( s1most(X0)
| ~ d(X0) ),
inference(cnf_transformation,[],[f26]) ).
tff(f42,plain,
! [X2: unreal,X0: real,X1: real] :
( equalish(X1,X0)
| ~ s(X2,X0)
| ~ s(X2,X1)
| ~ s1most(X2) ),
inference(cnf_transformation,[],[f29]) ).
tff(f46,plain,
! [X0: unreal] :
( c(X0)
| ~ e(X0) ),
inference(cnf_transformation,[],[f31]) ).
tff(f47,plain,
! [X0: unreal] :
( d(X0)
| ~ f(X0) ),
inference(cnf_transformation,[],[f32]) ).
tff(f48,plain,
e(exist),
inference(cnf_transformation,[],[f33]) ).
tff(f49,plain,
f(exist),
inference(cnf_transformation,[],[f33]) ).
cnf(c_49,plain,
( ~ c(X0_13)
| s2least(X0_13) ),
inference(cnf_transformation,[],[f34]) ).
cnf(c_51,plain,
( ~ equalish(u1r2(X0_13),u1r1(X0_13))
| ~ s2least(X0_13) ),
inference(cnf_transformation,[],[f36]) ).
cnf(c_52,plain,
( ~ s2least(X0_13)
| s(X0_13,u1r1(X0_13)) ),
inference(cnf_transformation,[],[f37]) ).
cnf(c_53,plain,
( ~ s2least(X0_13)
| s(X0_13,u1r2(X0_13)) ),
inference(cnf_transformation,[],[f38]) ).
cnf(c_55,plain,
( ~ d(X0_13)
| s1most(X0_13) ),
inference(cnf_transformation,[],[f40]) ).
cnf(c_57,plain,
( ~ s(X0_13,X0_14)
| ~ s(X0_13,X1_14)
| ~ s1most(X0_13)
| equalish(X1_14,X0_14) ),
inference(cnf_transformation,[],[f42]) ).
cnf(c_61,plain,
( ~ e(X0_13)
| c(X0_13) ),
inference(cnf_transformation,[],[f46]) ).
cnf(c_62,plain,
( ~ f(X0_13)
| d(X0_13) ),
inference(cnf_transformation,[],[f47]) ).
cnf(c_63,negated_conjecture,
f(exist),
inference(cnf_transformation,[],[f49]) ).
cnf(c_64,negated_conjecture,
e(exist),
inference(cnf_transformation,[],[f48]) ).
cnf(c_65,plain,
( ~ f(exist)
| d(exist) ),
inference(instantiation,[status(thm)],[c_62]) ).
cnf(c_66,plain,
( ~ e(exist)
| c(exist) ),
inference(instantiation,[status(thm)],[c_61]) ).
cnf(c_68,plain,
( ~ d(exist)
| s1most(exist) ),
inference(instantiation,[status(thm)],[c_55]) ).
cnf(c_70,plain,
( ~ c(exist)
| s2least(exist) ),
inference(instantiation,[status(thm)],[c_49]) ).
cnf(c_73,plain,
( ~ s2least(exist)
| s(exist,u1r2(exist)) ),
inference(instantiation,[status(thm)],[c_53]) ).
cnf(c_74,plain,
( ~ s2least(exist)
| s(exist,u1r1(exist)) ),
inference(instantiation,[status(thm)],[c_52]) ).
cnf(c_87,plain,
( ~ s2least(X0_13)
| ~ equalish(u1r2(X0_13),u1r1(X0_13)) ),
inference(prop_impl_just,[status(thm)],[c_51]) ).
cnf(c_88,plain,
( ~ equalish(u1r2(X0_13),u1r1(X0_13))
| ~ s2least(X0_13) ),
inference(renaming,[status(thm)],[c_87]) ).
cnf(c_360,plain,
( ~ s(X0_13,u1r1(X1_13))
| ~ s(X0_13,u1r2(X1_13))
| ~ s1most(X0_13)
| ~ s2least(X1_13) ),
inference(resolution,[status(thm)],[c_88,c_57]) ).
cnf(c_361,plain,
( ~ s(exist,u1r1(exist))
| ~ s(exist,u1r2(exist))
| ~ s1most(exist)
| ~ s2least(exist) ),
inference(instantiation,[status(thm)],[c_360]) ).
cnf(c_362,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_361,c_74,c_73,c_70,c_68,c_66,c_65,c_63,c_64]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : KRS003_1 : TPTP v8.1.2. Released v5.0.0.
% 0.00/0.11 % Command : run_iprover %s %d THM
% 0.11/0.31 % Computer : n005.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 22:38:26 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.17/0.42 Running first-order theorem proving
% 0.17/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.73/1.12 % SZS status Started for theBenchmark.p
% 0.73/1.12 % SZS status Theorem for theBenchmark.p
% 0.73/1.12
% 0.73/1.12 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.73/1.12
% 0.73/1.12 ------ iProver source info
% 0.73/1.12
% 0.73/1.12 git: date: 2024-05-02 19:28:25 +0000
% 0.73/1.12 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 0.73/1.12 git: non_committed_changes: false
% 0.73/1.12
% 0.73/1.12 ------ Parsing...
% 0.73/1.12 ------ Clausification by vclausify_rel & Parsing by iProver...------ preprocesses with Global Options Modified: tff_prep: switching off prep_sem_filter, sub_typing, pure_diseq_elim
% 0.73/1.12
% 0.73/1.12
% 0.73/1.12 ------ Preprocessing... pe_s pe:1:0s pe:2:0s pe:4:0s
% 0.73/1.12
% 0.73/1.12 % SZS status Theorem for theBenchmark.p
% 0.73/1.12
% 0.73/1.12 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.73/1.12
% 0.73/1.12
%------------------------------------------------------------------------------