TSTP Solution File: RNG105+2 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : RNG105+2 : 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 : n017.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:11 EDT 2023
% Result : Theorem 0.20s 0.60s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 56
% Syntax : Number of formulae : 73 ( 9 unt; 48 typ; 0 def)
% Number of atoms : 78 ( 21 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 84 ( 31 ~; 26 |; 25 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 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 : 37 ( 37 usr; 10 con; 0-4 aty)
% Number of variables : 23 ( 0 sgn; 10 !; 6 ?; 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,
xc: $i ).
tff(decl_43,type,
xx: $i ).
tff(decl_44,type,
xy: $i ).
tff(decl_45,type,
xz: $i ).
tff(decl_46,type,
xu: $i ).
tff(decl_47,type,
xv: $i ).
tff(decl_48,type,
esk1_2: ( $i * $i ) > $i ).
tff(decl_49,type,
esk2_2: ( $i * $i ) > $i ).
tff(decl_50,type,
esk3_4: ( $i * $i * $i * $i ) > $i ).
tff(decl_51,type,
esk4_4: ( $i * $i * $i * $i ) > $i ).
tff(decl_52,type,
esk5_3: ( $i * $i * $i ) > $i ).
tff(decl_53,type,
esk6_3: ( $i * $i * $i ) > $i ).
tff(decl_54,type,
esk7_3: ( $i * $i * $i ) > $i ).
tff(decl_55,type,
esk8_3: ( $i * $i * $i ) > $i ).
tff(decl_56,type,
esk9_1: $i > $i ).
tff(decl_57,type,
esk10_1: $i > $i ).
tff(decl_58,type,
esk11_1: $i > $i ).
tff(decl_59,type,
esk12_2: ( $i * $i ) > $i ).
tff(decl_60,type,
esk13_4: ( $i * $i * $i * $i ) > $i ).
tff(decl_61,type,
esk14_2: ( $i * $i ) > $i ).
tff(decl_62,type,
esk15_2: ( $i * $i ) > $i ).
tff(decl_63,type,
esk16_2: ( $i * $i ) > $i ).
tff(decl_64,type,
esk17_3: ( $i * $i * $i ) > $i ).
tff(decl_65,type,
esk18_3: ( $i * $i * $i ) > $i ).
tff(decl_66,type,
esk19_2: ( $i * $i ) > $i ).
tff(decl_67,type,
esk20_2: ( $i * $i ) > $i ).
tff(decl_68,type,
esk21_0: $i ).
tff(decl_69,type,
esk22_0: $i ).
fof(m__,conjecture,
( ( ? [X1] :
( aElement0(X1)
& sdtasdt0(xc,X1) = sdtpldt0(xx,xy) )
| aElementOf0(sdtpldt0(xx,xy),slsdtgt0(xc)) )
& ( ? [X1] :
( aElement0(X1)
& sdtasdt0(xc,X1) = sdtasdt0(xz,xx) )
| aElementOf0(sdtasdt0(xz,xx),slsdtgt0(xc)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(m__2010,hypothesis,
sdtpldt0(xx,xy) = sdtasdt0(xc,sdtpldt0(xu,xv)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2010) ).
fof(m__2043,hypothesis,
sdtasdt0(xz,xx) = sdtasdt0(xc,sdtasdt0(xu,xz)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2043) ).
fof(mSortsB,axiom,
! [X1,X2] :
( ( aElement0(X1)
& aElement0(X2) )
=> aElement0(sdtpldt0(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSortsB) ).
fof(m__1979,hypothesis,
( aElement0(xv)
& sdtasdt0(xc,xv) = xy ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1979) ).
fof(m__1956,hypothesis,
( aElement0(xu)
& sdtasdt0(xc,xu) = xx ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1956) ).
fof(mSortsB_02,axiom,
! [X1,X2] :
( ( aElement0(X1)
& aElement0(X2) )
=> aElement0(sdtasdt0(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSortsB_02) ).
fof(m__1933,hypothesis,
( ? [X1] :
( aElement0(X1)
& sdtasdt0(xc,X1) = xx )
& aElementOf0(xx,slsdtgt0(xc))
& ? [X1] :
( aElement0(X1)
& sdtasdt0(xc,X1) = xy )
& aElementOf0(xy,slsdtgt0(xc))
& aElement0(xz) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1933) ).
fof(c_0_8,negated_conjecture,
~ ( ( ? [X1] :
( aElement0(X1)
& sdtasdt0(xc,X1) = sdtpldt0(xx,xy) )
| aElementOf0(sdtpldt0(xx,xy),slsdtgt0(xc)) )
& ( ? [X1] :
( aElement0(X1)
& sdtasdt0(xc,X1) = sdtasdt0(xz,xx) )
| aElementOf0(sdtasdt0(xz,xx),slsdtgt0(xc)) ) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_9,negated_conjecture,
! [X112,X113] :
( ( ~ aElement0(X113)
| sdtasdt0(xc,X113) != sdtasdt0(xz,xx)
| ~ aElement0(X112)
| sdtasdt0(xc,X112) != sdtpldt0(xx,xy) )
& ( ~ aElementOf0(sdtasdt0(xz,xx),slsdtgt0(xc))
| ~ aElement0(X112)
| sdtasdt0(xc,X112) != sdtpldt0(xx,xy) )
& ( ~ aElement0(X113)
| sdtasdt0(xc,X113) != sdtasdt0(xz,xx)
| ~ aElementOf0(sdtpldt0(xx,xy),slsdtgt0(xc)) )
& ( ~ aElementOf0(sdtasdt0(xz,xx),slsdtgt0(xc))
| ~ aElementOf0(sdtpldt0(xx,xy),slsdtgt0(xc)) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])])]) ).
cnf(c_0_10,negated_conjecture,
( ~ aElement0(X1)
| sdtasdt0(xc,X1) != sdtasdt0(xz,xx)
| ~ aElement0(X2)
| sdtasdt0(xc,X2) != sdtpldt0(xx,xy) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_11,hypothesis,
sdtpldt0(xx,xy) = sdtasdt0(xc,sdtpldt0(xu,xv)),
inference(split_conjunct,[status(thm)],[m__2010]) ).
cnf(c_0_12,hypothesis,
( sdtasdt0(xc,X1) != sdtasdt0(xz,xx)
| ~ aElement0(sdtpldt0(xu,xv))
| ~ aElement0(X1) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_13,hypothesis,
sdtasdt0(xz,xx) = sdtasdt0(xc,sdtasdt0(xu,xz)),
inference(split_conjunct,[status(thm)],[m__2043]) ).
fof(c_0_14,plain,
! [X8,X9] :
( ~ aElement0(X8)
| ~ aElement0(X9)
| aElement0(sdtpldt0(X8,X9)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSortsB])]) ).
cnf(c_0_15,hypothesis,
( ~ aElement0(sdtpldt0(xu,xv))
| ~ aElement0(sdtasdt0(xu,xz)) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,plain,
( aElement0(sdtpldt0(X1,X2))
| ~ aElement0(X1)
| ~ aElement0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_17,hypothesis,
aElement0(xv),
inference(split_conjunct,[status(thm)],[m__1979]) ).
cnf(c_0_18,hypothesis,
aElement0(xu),
inference(split_conjunct,[status(thm)],[m__1956]) ).
fof(c_0_19,plain,
! [X10,X11] :
( ~ aElement0(X10)
| ~ aElement0(X11)
| aElement0(sdtasdt0(X10,X11)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSortsB_02])]) ).
fof(c_0_20,hypothesis,
( aElement0(esk21_0)
& sdtasdt0(xc,esk21_0) = xx
& aElementOf0(xx,slsdtgt0(xc))
& aElement0(esk22_0)
& sdtasdt0(xc,esk22_0) = xy
& aElementOf0(xy,slsdtgt0(xc))
& aElement0(xz) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[m__1933])]) ).
cnf(c_0_21,hypothesis,
~ aElement0(sdtasdt0(xu,xz)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]),c_0_18])]) ).
cnf(c_0_22,plain,
( aElement0(sdtasdt0(X1,X2))
| ~ aElement0(X1)
| ~ aElement0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_23,hypothesis,
aElement0(xz),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_24,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]),c_0_18])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : RNG105+2 : TPTP v8.1.2. Released v4.0.0.
% 0.11/0.13 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.14/0.34 % Computer : n017.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Sun Aug 27 02:14:56 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.20/0.57 start to proof: theBenchmark
% 0.20/0.60 % Version : CSE_E---1.5
% 0.20/0.60 % Problem : theBenchmark.p
% 0.20/0.60 % Proof found
% 0.20/0.60 % SZS status Theorem for theBenchmark.p
% 0.20/0.60 % SZS output start Proof
% See solution above
% 0.20/0.61 % Total time : 0.022000 s
% 0.20/0.61 % SZS output end Proof
% 0.20/0.61 % Total time : 0.026000 s
%------------------------------------------------------------------------------