TSTP Solution File: RNG115+4 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : RNG115+4 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% Computer : n015.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 13:49:16 EDT 2023
% Result : Theorem 0.20s 0.59s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 67
% Syntax : Number of formulae : 76 ( 4 unt; 65 typ; 0 def)
% Number of atoms : 72 ( 29 equ)
% Maximal formula atoms : 16 ( 6 avg)
% Number of connectives : 94 ( 33 ~; 26 |; 33 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 7 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 87 ( 45 >; 42 *; 0 +; 0 <<)
% Number of predicates : 15 ( 13 usr; 3 prp; 0-3 aty)
% Number of functors : 52 ( 52 usr; 18 con; 0-4 aty)
% Number of variables : 27 ( 0 sgn; 9 !; 16 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
aElement0: $i > $o ).
tff(decl_23,type,
sz00: $i ).
tff(decl_24,type,
sz10: $i ).
tff(decl_25,type,
smndt0: $i > $i ).
tff(decl_26,type,
sdtpldt0: ( $i * $i ) > $i ).
tff(decl_27,type,
sdtasdt0: ( $i * $i ) > $i ).
tff(decl_28,type,
aSet0: $i > $o ).
tff(decl_29,type,
aElementOf0: ( $i * $i ) > $o ).
tff(decl_30,type,
sdtpldt1: ( $i * $i ) > $i ).
tff(decl_31,type,
sdtasasdt0: ( $i * $i ) > $i ).
tff(decl_32,type,
aIdeal0: $i > $o ).
tff(decl_33,type,
sdteqdtlpzmzozddtrp0: ( $i * $i * $i ) > $o ).
tff(decl_34,type,
aNaturalNumber0: $i > $o ).
tff(decl_35,type,
sbrdtbr0: $i > $i ).
tff(decl_36,type,
iLess0: ( $i * $i ) > $o ).
tff(decl_37,type,
doDivides0: ( $i * $i ) > $o ).
tff(decl_38,type,
aDivisorOf0: ( $i * $i ) > $o ).
tff(decl_39,type,
aGcdOfAnd0: ( $i * $i * $i ) > $o ).
tff(decl_40,type,
misRelativelyPrime0: ( $i * $i ) > $o ).
tff(decl_41,type,
slsdtgt0: $i > $i ).
tff(decl_42,type,
xa: $i ).
tff(decl_43,type,
xb: $i ).
tff(decl_44,type,
xc: $i ).
tff(decl_45,type,
xI: $i ).
tff(decl_46,type,
xu: $i ).
tff(decl_47,type,
esk1_2: ( $i * $i ) > $i ).
tff(decl_48,type,
esk2_2: ( $i * $i ) > $i ).
tff(decl_49,type,
esk3_4: ( $i * $i * $i * $i ) > $i ).
tff(decl_50,type,
esk4_4: ( $i * $i * $i * $i ) > $i ).
tff(decl_51,type,
esk5_3: ( $i * $i * $i ) > $i ).
tff(decl_52,type,
esk6_3: ( $i * $i * $i ) > $i ).
tff(decl_53,type,
esk7_3: ( $i * $i * $i ) > $i ).
tff(decl_54,type,
esk8_3: ( $i * $i * $i ) > $i ).
tff(decl_55,type,
esk9_1: $i > $i ).
tff(decl_56,type,
esk10_1: $i > $i ).
tff(decl_57,type,
esk11_1: $i > $i ).
tff(decl_58,type,
esk12_2: ( $i * $i ) > $i ).
tff(decl_59,type,
esk13_4: ( $i * $i * $i * $i ) > $i ).
tff(decl_60,type,
esk14_2: ( $i * $i ) > $i ).
tff(decl_61,type,
esk15_2: ( $i * $i ) > $i ).
tff(decl_62,type,
esk16_2: ( $i * $i ) > $i ).
tff(decl_63,type,
esk17_3: ( $i * $i * $i ) > $i ).
tff(decl_64,type,
esk18_3: ( $i * $i * $i ) > $i ).
tff(decl_65,type,
esk19_2: ( $i * $i ) > $i ).
tff(decl_66,type,
esk20_2: ( $i * $i ) > $i ).
tff(decl_67,type,
esk21_0: $i ).
tff(decl_68,type,
esk22_0: $i ).
tff(decl_69,type,
esk23_1: $i > $i ).
tff(decl_70,type,
esk24_1: $i > $i ).
tff(decl_71,type,
esk25_1: $i > $i ).
tff(decl_72,type,
esk26_1: $i > $i ).
tff(decl_73,type,
esk27_1: $i > $i ).
tff(decl_74,type,
esk28_0: $i ).
tff(decl_75,type,
esk29_0: $i ).
tff(decl_76,type,
esk30_0: $i ).
tff(decl_77,type,
esk31_0: $i ).
tff(decl_78,type,
esk32_0: $i ).
tff(decl_79,type,
esk33_1: $i > $i ).
tff(decl_80,type,
esk34_1: $i > $i ).
tff(decl_81,type,
esk35_0: $i ).
tff(decl_82,type,
esk36_0: $i ).
tff(decl_83,type,
esk37_0: $i ).
tff(decl_84,type,
esk38_0: $i ).
tff(decl_85,type,
epred1_0: $o ).
tff(decl_86,type,
epred2_0: $o ).
fof(m__,conjecture,
? [X1,X2] :
( ( ? [X3] :
( aElement0(X3)
& sdtasdt0(xa,X3) = X1 )
| aElementOf0(X1,slsdtgt0(xa)) )
& ( ? [X3] :
( aElement0(X3)
& sdtasdt0(xb,X3) = X2 )
| aElementOf0(X2,slsdtgt0(xb)) )
& xu = sdtpldt0(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(m__2273,hypothesis,
( ? [X1,X2] :
( aElementOf0(X1,slsdtgt0(xa))
& aElementOf0(X2,slsdtgt0(xb))
& sdtpldt0(X1,X2) = xu )
& aElementOf0(xu,xI)
& xu != sz00
& ! [X1] :
( ( ( ? [X2,X3] :
( aElementOf0(X2,slsdtgt0(xa))
& aElementOf0(X3,slsdtgt0(xb))
& sdtpldt0(X2,X3) = X1 )
| aElementOf0(X1,xI) )
& X1 != sz00 )
=> ~ iLess0(sbrdtbr0(X1),sbrdtbr0(xu)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2273) ).
fof(c_0_2,negated_conjecture,
~ ? [X1,X2] :
( ( ? [X3] :
( aElement0(X3)
& sdtasdt0(xa,X3) = X1 )
| aElementOf0(X1,slsdtgt0(xa)) )
& ( ? [X3] :
( aElement0(X3)
& sdtasdt0(xb,X3) = X2 )
| aElementOf0(X2,slsdtgt0(xb)) )
& xu = sdtpldt0(X1,X2) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_3,hypothesis,
( ? [X1,X2] :
( aElementOf0(X1,slsdtgt0(xa))
& aElementOf0(X2,slsdtgt0(xb))
& sdtpldt0(X1,X2) = xu )
& aElementOf0(xu,xI)
& xu != sz00
& ! [X1] :
( ( ( ? [X2,X3] :
( aElementOf0(X2,slsdtgt0(xa))
& aElementOf0(X3,slsdtgt0(xb))
& sdtpldt0(X2,X3) = X1 )
| aElementOf0(X1,xI) )
& X1 != sz00 )
=> ~ iLess0(sbrdtbr0(X1),sbrdtbr0(xu)) ) ),
inference(fof_simplification,[status(thm)],[m__2273]) ).
fof(c_0_4,negated_conjecture,
! [X154,X155,X156,X157] :
( ( ~ aElement0(X157)
| sdtasdt0(xb,X157) != X155
| ~ aElement0(X156)
| sdtasdt0(xa,X156) != X154
| xu != sdtpldt0(X154,X155) )
& ( ~ aElementOf0(X155,slsdtgt0(xb))
| ~ aElement0(X156)
| sdtasdt0(xa,X156) != X154
| xu != sdtpldt0(X154,X155) )
& ( ~ aElement0(X157)
| sdtasdt0(xb,X157) != X155
| ~ aElementOf0(X154,slsdtgt0(xa))
| xu != sdtpldt0(X154,X155) )
& ( ~ aElementOf0(X155,slsdtgt0(xb))
| ~ aElementOf0(X154,slsdtgt0(xa))
| xu != sdtpldt0(X154,X155) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])])]) ).
fof(c_0_5,hypothesis,
! [X149,X150,X151] :
( aElementOf0(esk37_0,slsdtgt0(xa))
& aElementOf0(esk38_0,slsdtgt0(xb))
& sdtpldt0(esk37_0,esk38_0) = xu
& aElementOf0(xu,xI)
& xu != sz00
& ( ~ aElementOf0(X150,slsdtgt0(xa))
| ~ aElementOf0(X151,slsdtgt0(xb))
| sdtpldt0(X150,X151) != X149
| X149 = sz00
| ~ iLess0(sbrdtbr0(X149),sbrdtbr0(xu)) )
& ( ~ aElementOf0(X149,xI)
| X149 = sz00
| ~ iLess0(sbrdtbr0(X149),sbrdtbr0(xu)) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])])]) ).
cnf(c_0_6,negated_conjecture,
( ~ aElementOf0(X1,slsdtgt0(xb))
| ~ aElementOf0(X2,slsdtgt0(xa))
| xu != sdtpldt0(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,hypothesis,
sdtpldt0(esk37_0,esk38_0) = xu,
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,hypothesis,
aElementOf0(esk37_0,slsdtgt0(xa)),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,hypothesis,
aElementOf0(esk38_0,slsdtgt0(xb)),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_8]),c_0_9])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : RNG115+4 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.13 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.17/0.35 % Computer : n015.cluster.edu
% 0.17/0.35 % Model : x86_64 x86_64
% 0.17/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.35 % Memory : 8042.1875MB
% 0.17/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.35 % CPULimit : 300
% 0.17/0.35 % WCLimit : 300
% 0.17/0.35 % DateTime : Sun Aug 27 01:45:08 EDT 2023
% 0.17/0.35 % CPUTime :
% 0.20/0.56 start to proof: theBenchmark
% 0.20/0.59 % Version : CSE_E---1.5
% 0.20/0.59 % Problem : theBenchmark.p
% 0.20/0.59 % Proof found
% 0.20/0.59 % SZS status Theorem for theBenchmark.p
% 0.20/0.59 % SZS output start Proof
% See solution above
% 0.20/0.60 % Total time : 0.023000 s
% 0.20/0.60 % SZS output end Proof
% 0.20/0.60 % Total time : 0.027000 s
%------------------------------------------------------------------------------