TSTP Solution File: RNG120+1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : RNG120+1 : 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 : n009.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:18 EDT 2023
% Result : Theorem 0.50s 0.61s
% Output : CNFRefutation 0.50s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 60
% Syntax : Number of formulae : 86 ( 12 unt; 50 typ; 0 def)
% Number of atoms : 119 ( 14 equ)
% Maximal formula atoms : 29 ( 3 avg)
% Number of connectives : 137 ( 54 ~; 48 |; 24 &)
% ( 1 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 80 ( 38 >; 42 *; 0 +; 0 <<)
% Number of predicates : 13 ( 11 usr; 1 prp; 0-3 aty)
% Number of functors : 39 ( 39 usr; 12 con; 0-4 aty)
% Number of variables : 36 ( 0 sgn; 24 !; 0 ?; 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,
xq: $i ).
tff(decl_48,type,
xr: $i ).
tff(decl_49,type,
esk1_2: ( $i * $i ) > $i ).
tff(decl_50,type,
esk2_2: ( $i * $i ) > $i ).
tff(decl_51,type,
esk3_4: ( $i * $i * $i * $i ) > $i ).
tff(decl_52,type,
esk4_4: ( $i * $i * $i * $i ) > $i ).
tff(decl_53,type,
esk5_3: ( $i * $i * $i ) > $i ).
tff(decl_54,type,
esk6_3: ( $i * $i * $i ) > $i ).
tff(decl_55,type,
esk7_3: ( $i * $i * $i ) > $i ).
tff(decl_56,type,
esk8_3: ( $i * $i * $i ) > $i ).
tff(decl_57,type,
esk9_1: $i > $i ).
tff(decl_58,type,
esk10_1: $i > $i ).
tff(decl_59,type,
esk11_1: $i > $i ).
tff(decl_60,type,
esk12_2: ( $i * $i ) > $i ).
tff(decl_61,type,
esk13_4: ( $i * $i * $i * $i ) > $i ).
tff(decl_62,type,
esk14_2: ( $i * $i ) > $i ).
tff(decl_63,type,
esk15_2: ( $i * $i ) > $i ).
tff(decl_64,type,
esk16_2: ( $i * $i ) > $i ).
tff(decl_65,type,
esk17_3: ( $i * $i * $i ) > $i ).
tff(decl_66,type,
esk18_3: ( $i * $i * $i ) > $i ).
tff(decl_67,type,
esk19_2: ( $i * $i ) > $i ).
tff(decl_68,type,
esk20_2: ( $i * $i ) > $i ).
tff(decl_69,type,
esk21_0: $i ).
tff(decl_70,type,
esk22_0: $i ).
tff(decl_71,type,
esk23_0: $i ).
fof(mDefIdeal,axiom,
! [X1] :
( aIdeal0(X1)
<=> ( aSet0(X1)
& ! [X2] :
( aElementOf0(X2,X1)
=> ( ! [X3] :
( aElementOf0(X3,X1)
=> aElementOf0(sdtpldt0(X2,X3),X1) )
& ! [X3] :
( aElement0(X3)
=> aElementOf0(sdtasdt0(X3,X2),X1) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDefIdeal) ).
fof(mMulMnOne,axiom,
! [X1] :
( aElement0(X1)
=> ( sdtasdt0(smndt0(sz10),X1) = smndt0(X1)
& smndt0(X1) = sdtasdt0(X1,smndt0(sz10)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mMulMnOne) ).
fof(m__,conjecture,
aElementOf0(smndt0(sdtasdt0(xq,xu)),xI),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(m__2174,hypothesis,
( aIdeal0(xI)
& xI = sdtpldt1(slsdtgt0(xa),slsdtgt0(xb)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2174) ).
fof(mSortsU,axiom,
! [X1] :
( aElement0(X1)
=> aElement0(smndt0(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSortsU) ).
fof(m__2273,hypothesis,
( aElementOf0(xu,xI)
& xu != sz00
& ! [X1] :
( ( aElementOf0(X1,xI)
& X1 != sz00 )
=> ~ iLess0(sbrdtbr0(X1),sbrdtbr0(xu)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2273) ).
fof(mSortsC_01,axiom,
aElement0(sz10),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSortsC_01) ).
fof(mEOfElem,axiom,
! [X1] :
( aSet0(X1)
=> ! [X2] :
( aElementOf0(X2,X1)
=> aElement0(X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mEOfElem) ).
fof(m__2666,hypothesis,
( aElement0(xq)
& aElement0(xr)
& xb = sdtpldt0(sdtasdt0(xq,xu),xr)
& ( xr = sz00
| iLess0(sbrdtbr0(xr),sbrdtbr0(xu)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2666) ).
fof(mSortsB_02,axiom,
! [X1,X2] :
( ( aElement0(X1)
& aElement0(X2) )
=> aElement0(sdtasdt0(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSortsB_02) ).
fof(c_0_10,plain,
! [X60,X61,X62,X63,X64] :
( ( aSet0(X60)
| ~ aIdeal0(X60) )
& ( ~ aElementOf0(X62,X60)
| aElementOf0(sdtpldt0(X61,X62),X60)
| ~ aElementOf0(X61,X60)
| ~ aIdeal0(X60) )
& ( ~ aElement0(X63)
| aElementOf0(sdtasdt0(X63,X61),X60)
| ~ aElementOf0(X61,X60)
| ~ aIdeal0(X60) )
& ( aElementOf0(esk9_1(X64),X64)
| ~ aSet0(X64)
| aIdeal0(X64) )
& ( aElement0(esk11_1(X64))
| aElementOf0(esk10_1(X64),X64)
| ~ aSet0(X64)
| aIdeal0(X64) )
& ( ~ aElementOf0(sdtasdt0(esk11_1(X64),esk9_1(X64)),X64)
| aElementOf0(esk10_1(X64),X64)
| ~ aSet0(X64)
| aIdeal0(X64) )
& ( aElement0(esk11_1(X64))
| ~ aElementOf0(sdtpldt0(esk9_1(X64),esk10_1(X64)),X64)
| ~ aSet0(X64)
| aIdeal0(X64) )
& ( ~ aElementOf0(sdtasdt0(esk11_1(X64),esk9_1(X64)),X64)
| ~ aElementOf0(sdtpldt0(esk9_1(X64),esk10_1(X64)),X64)
| ~ aSet0(X64)
| aIdeal0(X64) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[mDefIdeal])])])])])]) ).
fof(c_0_11,plain,
! [X28] :
( ( sdtasdt0(smndt0(sz10),X28) = smndt0(X28)
| ~ aElement0(X28) )
& ( smndt0(X28) = sdtasdt0(X28,smndt0(sz10))
| ~ aElement0(X28) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mMulMnOne])])]) ).
fof(c_0_12,negated_conjecture,
~ aElementOf0(smndt0(sdtasdt0(xq,xu)),xI),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[m__])]) ).
cnf(c_0_13,plain,
( aElementOf0(sdtasdt0(X1,X2),X3)
| ~ aElement0(X1)
| ~ aElementOf0(X2,X3)
| ~ aIdeal0(X3) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,plain,
( sdtasdt0(smndt0(sz10),X1) = smndt0(X1)
| ~ aElement0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_15,negated_conjecture,
~ aElementOf0(smndt0(sdtasdt0(xq,xu)),xI),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_16,plain,
( aElementOf0(smndt0(X1),X2)
| ~ aIdeal0(X2)
| ~ aElementOf0(X1,X2)
| ~ aElement0(smndt0(sz10))
| ~ aElement0(X1) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,hypothesis,
aIdeal0(xI),
inference(split_conjunct,[status(thm)],[m__2174]) ).
fof(c_0_18,plain,
! [X7] :
( ~ aElement0(X7)
| aElement0(smndt0(X7)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSortsU])]) ).
fof(c_0_19,hypothesis,
( aElementOf0(xu,xI)
& xu != sz00
& ! [X1] :
( ( aElementOf0(X1,xI)
& X1 != sz00 )
=> ~ iLess0(sbrdtbr0(X1),sbrdtbr0(xu)) ) ),
inference(fof_simplification,[status(thm)],[m__2273]) ).
cnf(c_0_20,negated_conjecture,
( ~ aElementOf0(sdtasdt0(xq,xu),xI)
| ~ aElement0(sdtasdt0(xq,xu))
| ~ aElement0(smndt0(sz10)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17])]) ).
cnf(c_0_21,plain,
( aElement0(smndt0(X1))
| ~ aElement0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_22,plain,
aElement0(sz10),
inference(split_conjunct,[status(thm)],[mSortsC_01]) ).
fof(c_0_23,hypothesis,
! [X112] :
( aElementOf0(xu,xI)
& xu != sz00
& ( ~ aElementOf0(X112,xI)
| X112 = sz00
| ~ iLess0(sbrdtbr0(X112),sbrdtbr0(xu)) ) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_19])])]) ).
fof(c_0_24,plain,
! [X32,X33] :
( ~ aSet0(X32)
| ~ aElementOf0(X33,X32)
| aElement0(X33) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mEOfElem])])]) ).
cnf(c_0_25,plain,
( aSet0(X1)
| ~ aIdeal0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_26,negated_conjecture,
( ~ aElementOf0(sdtasdt0(xq,xu),xI)
| ~ aElement0(sdtasdt0(xq,xu)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22])]) ).
cnf(c_0_27,hypothesis,
aElementOf0(xu,xI),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_28,hypothesis,
aElement0(xq),
inference(split_conjunct,[status(thm)],[m__2666]) ).
fof(c_0_29,plain,
! [X10,X11] :
( ~ aElement0(X10)
| ~ aElement0(X11)
| aElement0(sdtasdt0(X10,X11)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSortsB_02])]) ).
cnf(c_0_30,plain,
( aElement0(X2)
| ~ aSet0(X1)
| ~ aElementOf0(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_31,hypothesis,
aSet0(xI),
inference(spm,[status(thm)],[c_0_25,c_0_17]) ).
cnf(c_0_32,negated_conjecture,
~ aElement0(sdtasdt0(xq,xu)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_13]),c_0_17]),c_0_27]),c_0_28])]) ).
cnf(c_0_33,plain,
( aElement0(sdtasdt0(X1,X2))
| ~ aElement0(X1)
| ~ aElement0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_34,hypothesis,
aElement0(xu),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_27]),c_0_31])]) ).
cnf(c_0_35,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34]),c_0_28])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : RNG120+1 : TPTP v8.1.2. Released v4.0.0.
% 0.03/0.12 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.12/0.33 % Computer : n009.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Sun Aug 27 02:14:20 EDT 2023
% 0.12/0.33 % CPUTime :
% 0.18/0.55 start to proof: theBenchmark
% 0.50/0.61 % Version : CSE_E---1.5
% 0.50/0.61 % Problem : theBenchmark.p
% 0.50/0.61 % Proof found
% 0.50/0.61 % SZS status Theorem for theBenchmark.p
% 0.50/0.61 % SZS output start Proof
% See solution above
% 0.50/0.62 % Total time : 0.052000 s
% 0.50/0.62 % SZS output end Proof
% 0.50/0.62 % Total time : 0.056000 s
%------------------------------------------------------------------------------