TSTP Solution File: RNG116+4 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : RNG116+4 : 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 : n002.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.19s 0.62s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 71
% Syntax : Number of formulae : 82 ( 6 unt; 69 typ; 0 def)
% Number of atoms : 34 ( 14 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 30 ( 9 ~; 5 |; 16 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 3 ( 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 : 56 ( 56 usr; 22 con; 0-4 aty)
% Number of variables : 11 ( 0 sgn; 2 !; 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,
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,
xk: $i ).
tff(decl_48,type,
xl: $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_1: $i > $i ).
tff(decl_72,type,
esk24_1: $i > $i ).
tff(decl_73,type,
esk25_1: $i > $i ).
tff(decl_74,type,
esk26_1: $i > $i ).
tff(decl_75,type,
esk27_1: $i > $i ).
tff(decl_76,type,
esk28_0: $i ).
tff(decl_77,type,
esk29_0: $i ).
tff(decl_78,type,
esk30_0: $i ).
tff(decl_79,type,
esk31_0: $i ).
tff(decl_80,type,
esk32_0: $i ).
tff(decl_81,type,
esk33_1: $i > $i ).
tff(decl_82,type,
esk34_1: $i > $i ).
tff(decl_83,type,
esk35_0: $i ).
tff(decl_84,type,
esk36_0: $i ).
tff(decl_85,type,
esk37_0: $i ).
tff(decl_86,type,
esk38_0: $i ).
tff(decl_87,type,
esk39_0: $i ).
tff(decl_88,type,
esk40_0: $i ).
tff(decl_89,type,
epred1_0: $o ).
tff(decl_90,type,
epred2_0: $o ).
fof(m__,conjecture,
? [X1,X2] :
( aElement0(X1)
& aElement0(X2)
& xu = sdtpldt0(sdtasdt0(xa,X1),sdtasdt0(xb,X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(m__2456,hypothesis,
( ? [X1] :
( aElement0(X1)
& sdtasdt0(xa,X1) = xk )
& aElementOf0(xk,slsdtgt0(xa))
& ? [X1] :
( aElement0(X1)
& sdtasdt0(xb,X1) = xl )
& aElementOf0(xl,slsdtgt0(xb))
& xu = sdtpldt0(xk,xl) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2456) ).
fof(c_0_2,negated_conjecture,
~ ? [X1,X2] :
( aElement0(X1)
& aElement0(X2)
& xu = sdtpldt0(sdtasdt0(xa,X1),sdtasdt0(xb,X2)) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_3,negated_conjecture,
! [X156,X157] :
( ~ aElement0(X156)
| ~ aElement0(X157)
| xu != sdtpldt0(sdtasdt0(xa,X156),sdtasdt0(xb,X157)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])]) ).
fof(c_0_4,hypothesis,
( aElement0(esk39_0)
& sdtasdt0(xa,esk39_0) = xk
& aElementOf0(xk,slsdtgt0(xa))
& aElement0(esk40_0)
& sdtasdt0(xb,esk40_0) = xl
& aElementOf0(xl,slsdtgt0(xb))
& xu = sdtpldt0(xk,xl) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[m__2456])]) ).
cnf(c_0_5,negated_conjecture,
( ~ aElement0(X1)
| ~ aElement0(X2)
| xu != sdtpldt0(sdtasdt0(xa,X1),sdtasdt0(xb,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_6,hypothesis,
sdtasdt0(xa,esk39_0) = xk,
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,hypothesis,
aElement0(esk39_0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,negated_conjecture,
( sdtpldt0(xk,sdtasdt0(xb,X1)) != xu
| ~ aElement0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_6]),c_0_7])]) ).
cnf(c_0_9,hypothesis,
sdtasdt0(xb,esk40_0) = xl,
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_10,hypothesis,
xu = sdtpldt0(xk,xl),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_11,hypothesis,
aElement0(esk40_0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_12,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10]),c_0_11])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : RNG116+4 : TPTP v8.1.2. Released v4.0.0.
% 0.10/0.13 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.13/0.34 % Computer : n002.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 : Sun Aug 27 02:33:33 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.19/0.57 start to proof: theBenchmark
% 0.19/0.62 % Version : CSE_E---1.5
% 0.19/0.62 % Problem : theBenchmark.p
% 0.19/0.62 % Proof found
% 0.19/0.62 % SZS status Theorem for theBenchmark.p
% 0.19/0.62 % SZS output start Proof
% See solution above
% 0.19/0.63 % Total time : 0.048000 s
% 0.19/0.63 % SZS output end Proof
% 0.19/0.63 % Total time : 0.052000 s
%------------------------------------------------------------------------------