TSTP Solution File: RNG102+2 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : RNG102+2 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% Computer : n023.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:10 EDT 2023
% Result : Theorem 0.50s 0.58s
% Output : CNFRefutation 0.50s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 49
% Syntax : Number of formulae : 56 ( 3 unt; 47 typ; 0 def)
% Number of atoms : 25 ( 9 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 21 ( 5 ~; 2 |; 14 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 2 ( 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 : 36 ( 36 usr; 9 con; 0-4 aty)
% Number of variables : 6 ( 0 sgn; 1 !; 4 ?; 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,
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 ).
fof(m__,conjecture,
? [X1] :
( aElement0(X1)
& sdtasdt0(xc,X1) = xy ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
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/sandbox2/benchmark/theBenchmark.p',m__1933) ).
fof(c_0_2,negated_conjecture,
~ ? [X1] :
( aElement0(X1)
& sdtasdt0(xc,X1) = xy ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_3,negated_conjecture,
! [X112] :
( ~ aElement0(X112)
| sdtasdt0(xc,X112) != xy ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])]) ).
fof(c_0_4,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_5,negated_conjecture,
( ~ aElement0(X1)
| sdtasdt0(xc,X1) != xy ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_6,hypothesis,
sdtasdt0(xc,esk22_0) = xy,
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,hypothesis,
aElement0(esk22_0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_6]),c_0_7])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : RNG102+2 : TPTP v8.1.2. Released v4.0.0.
% 0.03/0.12 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.12/0.33 % Computer : n023.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:50:56 EDT 2023
% 0.12/0.33 % CPUTime :
% 0.18/0.55 start to proof: theBenchmark
% 0.50/0.58 % Version : CSE_E---1.5
% 0.50/0.58 % Problem : theBenchmark.p
% 0.50/0.58 % Proof found
% 0.50/0.58 % SZS status Theorem for theBenchmark.p
% 0.50/0.58 % SZS output start Proof
% See solution above
% 0.50/0.59 % Total time : 0.019000 s
% 0.50/0.59 % SZS output end Proof
% 0.50/0.59 % Total time : 0.022000 s
%------------------------------------------------------------------------------