TSTP Solution File: SWV132+1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : SWV132+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% Computer : n018.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 : Thu Aug 31 21:36:42 EDT 2023
% Result : Theorem 0.21s 0.59s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 70
% Syntax : Number of formulae : 80 ( 4 unt; 68 typ; 0 def)
% Number of atoms : 129 ( 0 equ)
% Maximal formula atoms : 38 ( 10 avg)
% Number of connectives : 165 ( 48 ~; 28 |; 49 &)
% ( 1 <=>; 39 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 7 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 144 ( 50 >; 94 *; 0 +; 0 <<)
% Number of predicates : 8 ( 7 usr; 3 prp; 0-4 aty)
% Number of functors : 61 ( 61 usr; 16 con; 0-7 aty)
% Number of variables : 0 ( 0 sgn; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
gt: ( $i * $i ) > $o ).
tff(decl_23,type,
leq: ( $i * $i ) > $o ).
tff(decl_24,type,
lt: ( $i * $i ) > $o ).
tff(decl_25,type,
geq: ( $i * $i ) > $o ).
tff(decl_26,type,
pred: $i > $i ).
tff(decl_27,type,
succ: $i > $i ).
tff(decl_28,type,
n0: $i ).
tff(decl_29,type,
uniform_int_rnd: ( $i * $i ) > $i ).
tff(decl_30,type,
dim: ( $i * $i ) > $i ).
tff(decl_31,type,
tptp_const_array1: ( $i * $i ) > $i ).
tff(decl_32,type,
a_select2: ( $i * $i ) > $i ).
tff(decl_33,type,
tptp_const_array2: ( $i * $i * $i ) > $i ).
tff(decl_34,type,
a_select3: ( $i * $i * $i ) > $i ).
tff(decl_35,type,
trans: $i > $i ).
tff(decl_36,type,
inv: $i > $i ).
tff(decl_37,type,
tptp_update3: ( $i * $i * $i * $i ) > $i ).
tff(decl_38,type,
tptp_madd: ( $i * $i ) > $i ).
tff(decl_39,type,
tptp_msub: ( $i * $i ) > $i ).
tff(decl_40,type,
tptp_mmul: ( $i * $i ) > $i ).
tff(decl_41,type,
tptp_minus_1: $i ).
tff(decl_42,type,
sum: ( $i * $i * $i ) > $i ).
tff(decl_43,type,
tptp_float_0_0: $i ).
tff(decl_44,type,
n1: $i ).
tff(decl_45,type,
plus: ( $i * $i ) > $i ).
tff(decl_46,type,
n2: $i ).
tff(decl_47,type,
n3: $i ).
tff(decl_48,type,
n4: $i ).
tff(decl_49,type,
n5: $i ).
tff(decl_50,type,
minus: ( $i * $i ) > $i ).
tff(decl_51,type,
tptp_update2: ( $i * $i * $i ) > $i ).
tff(decl_52,type,
true: $o ).
tff(decl_53,type,
def: $i ).
tff(decl_54,type,
use: $i ).
tff(decl_55,type,
tptp_float_0_001: $i ).
tff(decl_56,type,
pv1341: $i ).
tff(decl_57,type,
s_best7: $i ).
tff(decl_58,type,
s_sworst7: $i ).
tff(decl_59,type,
s_worst7: $i ).
tff(decl_60,type,
loopcounter: $i ).
tff(decl_61,type,
epred1_4: ( $i * $i * $i * $i ) > $o ).
tff(decl_62,type,
epred2_0: $o ).
tff(decl_63,type,
esk1_2: ( $i * $i ) > $i ).
tff(decl_64,type,
esk2_2: ( $i * $i ) > $i ).
tff(decl_65,type,
esk3_2: ( $i * $i ) > $i ).
tff(decl_66,type,
esk4_2: ( $i * $i ) > $i ).
tff(decl_67,type,
esk5_2: ( $i * $i ) > $i ).
tff(decl_68,type,
esk6_2: ( $i * $i ) > $i ).
tff(decl_69,type,
esk7_3: ( $i * $i * $i ) > $i ).
tff(decl_70,type,
esk8_3: ( $i * $i * $i ) > $i ).
tff(decl_71,type,
esk9_3: ( $i * $i * $i ) > $i ).
tff(decl_72,type,
esk10_3: ( $i * $i * $i ) > $i ).
tff(decl_73,type,
esk11_3: ( $i * $i * $i ) > $i ).
tff(decl_74,type,
esk12_3: ( $i * $i * $i ) > $i ).
tff(decl_75,type,
esk13_3: ( $i * $i * $i ) > $i ).
tff(decl_76,type,
esk14_3: ( $i * $i * $i ) > $i ).
tff(decl_77,type,
esk15_3: ( $i * $i * $i ) > $i ).
tff(decl_78,type,
esk16_3: ( $i * $i * $i ) > $i ).
tff(decl_79,type,
esk17_3: ( $i * $i * $i ) > $i ).
tff(decl_80,type,
esk18_3: ( $i * $i * $i ) > $i ).
tff(decl_81,type,
esk19_7: ( $i * $i * $i * $i * $i * $i * $i ) > $i ).
tff(decl_82,type,
esk20_7: ( $i * $i * $i * $i * $i * $i * $i ) > $i ).
tff(decl_83,type,
esk21_6: ( $i * $i * $i * $i * $i * $i ) > $i ).
tff(decl_84,type,
esk22_6: ( $i * $i * $i * $i * $i * $i ) > $i ).
tff(decl_85,type,
esk23_4: ( $i * $i * $i * $i ) > $i ).
tff(decl_86,type,
esk24_4: ( $i * $i * $i * $i ) > $i ).
tff(decl_87,type,
esk25_4: ( $i * $i * $i * $i ) > $i ).
tff(decl_88,type,
esk26_4: ( $i * $i * $i * $i ) > $i ).
tff(decl_89,type,
esk27_4: ( $i * $i * $i * $i ) > $i ).
fof(gauss_array_0002,conjecture,
( ( ~ leq(tptp_float_0_001,pv1341)
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_best7) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_sworst7) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_worst7) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_best7,n3) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_sworst7,n3) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_worst7,n3) )
& ( gt(loopcounter,n0)
=> leq(n0,s_best7) )
& ( gt(loopcounter,n0)
=> leq(n0,s_sworst7) )
& ( gt(loopcounter,n0)
=> leq(n0,s_worst7) )
& ( gt(loopcounter,n0)
=> leq(s_best7,n3) )
& ( gt(loopcounter,n0)
=> leq(s_sworst7,n3) )
& ( gt(loopcounter,n0)
=> leq(s_worst7,n3) ) )
=> leq(s_best7,n3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',gauss_array_0002) ).
fof(c_0_1,plain,
( epred2_0
<=> ( ~ leq(tptp_float_0_001,pv1341)
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_best7) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_sworst7) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_worst7) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_best7,n3) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_sworst7,n3) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_worst7,n3) )
& ( gt(loopcounter,n0)
=> leq(n0,s_best7) )
& ( gt(loopcounter,n0)
=> leq(n0,s_sworst7) )
& ( gt(loopcounter,n0)
=> leq(n0,s_worst7) )
& ( gt(loopcounter,n0)
=> leq(s_best7,n3) )
& ( gt(loopcounter,n0)
=> leq(s_sworst7,n3) )
& ( gt(loopcounter,n0)
=> leq(s_worst7,n3) ) ) ),
introduced(definition) ).
fof(c_0_2,plain,
( epred2_0
=> ( ~ leq(tptp_float_0_001,pv1341)
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_best7) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_sworst7) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_worst7) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_best7,n3) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_sworst7,n3) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_worst7,n3) )
& ( gt(loopcounter,n0)
=> leq(n0,s_best7) )
& ( gt(loopcounter,n0)
=> leq(n0,s_sworst7) )
& ( gt(loopcounter,n0)
=> leq(n0,s_worst7) )
& ( gt(loopcounter,n0)
=> leq(s_best7,n3) )
& ( gt(loopcounter,n0)
=> leq(s_sworst7,n3) )
& ( gt(loopcounter,n0)
=> leq(s_worst7,n3) ) ) ),
inference(split_equiv,[status(thm)],[c_0_1]) ).
fof(c_0_3,negated_conjecture,
~ ( epred2_0
=> leq(s_best7,n3) ),
inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[gauss_array_0002])]),c_0_1]) ).
fof(c_0_4,plain,
( ( ~ leq(tptp_float_0_001,pv1341)
| ~ epred2_0 )
& ( leq(tptp_float_0_001,pv1341)
| leq(n0,s_best7)
| ~ epred2_0 )
& ( leq(tptp_float_0_001,pv1341)
| leq(n0,s_sworst7)
| ~ epred2_0 )
& ( leq(tptp_float_0_001,pv1341)
| leq(n0,s_worst7)
| ~ epred2_0 )
& ( leq(tptp_float_0_001,pv1341)
| leq(s_best7,n3)
| ~ epred2_0 )
& ( leq(tptp_float_0_001,pv1341)
| leq(s_sworst7,n3)
| ~ epred2_0 )
& ( leq(tptp_float_0_001,pv1341)
| leq(s_worst7,n3)
| ~ epred2_0 )
& ( ~ gt(loopcounter,n0)
| leq(n0,s_best7)
| ~ epred2_0 )
& ( ~ gt(loopcounter,n0)
| leq(n0,s_sworst7)
| ~ epred2_0 )
& ( ~ gt(loopcounter,n0)
| leq(n0,s_worst7)
| ~ epred2_0 )
& ( ~ gt(loopcounter,n0)
| leq(s_best7,n3)
| ~ epred2_0 )
& ( ~ gt(loopcounter,n0)
| leq(s_sworst7,n3)
| ~ epred2_0 )
& ( ~ gt(loopcounter,n0)
| leq(s_worst7,n3)
| ~ epred2_0 ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])]) ).
fof(c_0_5,negated_conjecture,
( epred2_0
& ~ leq(s_best7,n3) ),
inference(fof_nnf,[status(thm)],[c_0_3]) ).
cnf(c_0_6,plain,
( ~ leq(tptp_float_0_001,pv1341)
| ~ epred2_0 ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,negated_conjecture,
epred2_0,
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,plain,
( leq(tptp_float_0_001,pv1341)
| leq(s_best7,n3)
| ~ epred2_0 ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_9,plain,
~ leq(tptp_float_0_001,pv1341),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_6,c_0_7])]) ).
cnf(c_0_10,negated_conjecture,
~ leq(s_best7,n3),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_11,plain,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_7])]),c_0_9]),c_0_10]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWV132+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% 0.00/0.13 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.13/0.34 % Computer : n018.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 : Tue Aug 29 10:46:32 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.21/0.56 start to proof: theBenchmark
% 0.21/0.59 % Version : CSE_E---1.5
% 0.21/0.59 % Problem : theBenchmark.p
% 0.21/0.59 % Proof found
% 0.21/0.59 % SZS status Theorem for theBenchmark.p
% 0.21/0.59 % SZS output start Proof
% See solution above
% 0.21/0.59 % Total time : 0.017000 s
% 0.21/0.59 % SZS output end Proof
% 0.21/0.59 % Total time : 0.022000 s
%------------------------------------------------------------------------------