TSTP Solution File: NUM557+1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : NUM557+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 : n016.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 10:38:40 EDT 2023
% Result : Theorem 0.22s 0.66s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 42
% Syntax : Number of formulae : 53 ( 9 unt; 37 typ; 0 def)
% Number of atoms : 73 ( 18 equ)
% Maximal formula atoms : 39 ( 4 avg)
% Number of connectives : 98 ( 41 ~; 42 |; 12 &)
% ( 2 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 45 ( 27 >; 18 *; 0 +; 0 <<)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-2 aty)
% Number of functors : 29 ( 29 usr; 10 con; 0-3 aty)
% Number of variables : 17 ( 0 sgn; 10 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
aSet0: $i > $o ).
tff(decl_23,type,
aElement0: $i > $o ).
tff(decl_24,type,
aElementOf0: ( $i * $i ) > $o ).
tff(decl_25,type,
isFinite0: $i > $o ).
tff(decl_26,type,
slcrc0: $i ).
tff(decl_27,type,
isCountable0: $i > $o ).
tff(decl_28,type,
aSubsetOf0: ( $i * $i ) > $o ).
tff(decl_29,type,
sdtpldt0: ( $i * $i ) > $i ).
tff(decl_30,type,
sdtmndt0: ( $i * $i ) > $i ).
tff(decl_31,type,
szNzAzT0: $i ).
tff(decl_32,type,
sz00: $i ).
tff(decl_33,type,
szszuzczcdt0: $i > $i ).
tff(decl_34,type,
sdtlseqdt0: ( $i * $i ) > $o ).
tff(decl_35,type,
iLess0: ( $i * $i ) > $o ).
tff(decl_36,type,
sbrdtbr0: $i > $i ).
tff(decl_37,type,
szmzizndt0: $i > $i ).
tff(decl_38,type,
szmzazxdt0: $i > $i ).
tff(decl_39,type,
slbdtrb0: $i > $i ).
tff(decl_40,type,
slbdtsldtrb0: ( $i * $i ) > $i ).
tff(decl_41,type,
xk: $i ).
tff(decl_42,type,
xS: $i ).
tff(decl_43,type,
xT: $i ).
tff(decl_44,type,
xx: $i ).
tff(decl_45,type,
xQ: $i ).
tff(decl_46,type,
xy: $i ).
tff(decl_47,type,
xP: $i ).
tff(decl_48,type,
esk1_1: $i > $i ).
tff(decl_49,type,
esk2_2: ( $i * $i ) > $i ).
tff(decl_50,type,
esk3_3: ( $i * $i * $i ) > $i ).
tff(decl_51,type,
esk4_3: ( $i * $i * $i ) > $i ).
tff(decl_52,type,
esk5_1: $i > $i ).
tff(decl_53,type,
esk6_2: ( $i * $i ) > $i ).
tff(decl_54,type,
esk7_2: ( $i * $i ) > $i ).
tff(decl_55,type,
esk8_2: ( $i * $i ) > $i ).
tff(decl_56,type,
esk9_2: ( $i * $i ) > $i ).
tff(decl_57,type,
esk10_1: $i > $i ).
tff(decl_58,type,
esk11_3: ( $i * $i * $i ) > $i ).
fof(mDefSel,axiom,
! [X1,X2] :
( ( aSet0(X1)
& aElementOf0(X2,szNzAzT0) )
=> ! [X3] :
( X3 = slbdtsldtrb0(X1,X2)
<=> ( aSet0(X3)
& ! [X4] :
( aElementOf0(X4,X3)
<=> ( aSubsetOf0(X4,X1)
& sbrdtbr0(X4) = X2 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDefSel) ).
fof(m__,conjecture,
aElementOf0(xP,slbdtsldtrb0(xS,xk)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(m__2431,hypothesis,
( aSubsetOf0(xP,xS)
& sbrdtbr0(xP) = xk ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2431) ).
fof(m__2202,hypothesis,
aElementOf0(xk,szNzAzT0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2202) ).
fof(m__2202_02,hypothesis,
( aSet0(xS)
& aSet0(xT)
& xk != sz00 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2202_02) ).
fof(c_0_5,plain,
! [X110,X111,X112,X113,X114,X115] :
( ( aSet0(X112)
| X112 != slbdtsldtrb0(X110,X111)
| ~ aSet0(X110)
| ~ aElementOf0(X111,szNzAzT0) )
& ( aSubsetOf0(X113,X110)
| ~ aElementOf0(X113,X112)
| X112 != slbdtsldtrb0(X110,X111)
| ~ aSet0(X110)
| ~ aElementOf0(X111,szNzAzT0) )
& ( sbrdtbr0(X113) = X111
| ~ aElementOf0(X113,X112)
| X112 != slbdtsldtrb0(X110,X111)
| ~ aSet0(X110)
| ~ aElementOf0(X111,szNzAzT0) )
& ( ~ aSubsetOf0(X114,X110)
| sbrdtbr0(X114) != X111
| aElementOf0(X114,X112)
| X112 != slbdtsldtrb0(X110,X111)
| ~ aSet0(X110)
| ~ aElementOf0(X111,szNzAzT0) )
& ( ~ aElementOf0(esk11_3(X110,X111,X115),X115)
| ~ aSubsetOf0(esk11_3(X110,X111,X115),X110)
| sbrdtbr0(esk11_3(X110,X111,X115)) != X111
| ~ aSet0(X115)
| X115 = slbdtsldtrb0(X110,X111)
| ~ aSet0(X110)
| ~ aElementOf0(X111,szNzAzT0) )
& ( aSubsetOf0(esk11_3(X110,X111,X115),X110)
| aElementOf0(esk11_3(X110,X111,X115),X115)
| ~ aSet0(X115)
| X115 = slbdtsldtrb0(X110,X111)
| ~ aSet0(X110)
| ~ aElementOf0(X111,szNzAzT0) )
& ( sbrdtbr0(esk11_3(X110,X111,X115)) = X111
| aElementOf0(esk11_3(X110,X111,X115),X115)
| ~ aSet0(X115)
| X115 = slbdtsldtrb0(X110,X111)
| ~ aSet0(X110)
| ~ aElementOf0(X111,szNzAzT0) ) ),
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)],[mDefSel])])])])])]) ).
cnf(c_0_6,plain,
( aElementOf0(X1,X4)
| ~ aSubsetOf0(X1,X2)
| sbrdtbr0(X1) != X3
| X4 != slbdtsldtrb0(X2,X3)
| ~ aSet0(X2)
| ~ aElementOf0(X3,szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_7,negated_conjecture,
~ aElementOf0(xP,slbdtsldtrb0(xS,xk)),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[m__])]) ).
cnf(c_0_8,plain,
( aElementOf0(X1,slbdtsldtrb0(X2,sbrdtbr0(X1)))
| ~ aSubsetOf0(X1,X2)
| ~ aElementOf0(sbrdtbr0(X1),szNzAzT0)
| ~ aSet0(X2) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_6])]) ).
cnf(c_0_9,hypothesis,
sbrdtbr0(xP) = xk,
inference(split_conjunct,[status(thm)],[m__2431]) ).
cnf(c_0_10,hypothesis,
aElementOf0(xk,szNzAzT0),
inference(split_conjunct,[status(thm)],[m__2202]) ).
cnf(c_0_11,negated_conjecture,
~ aElementOf0(xP,slbdtsldtrb0(xS,xk)),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,hypothesis,
( aElementOf0(xP,slbdtsldtrb0(X1,xk))
| ~ aSubsetOf0(xP,X1)
| ~ aSet0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10])]) ).
cnf(c_0_13,hypothesis,
aSubsetOf0(xP,xS),
inference(split_conjunct,[status(thm)],[m__2431]) ).
cnf(c_0_14,hypothesis,
aSet0(xS),
inference(split_conjunct,[status(thm)],[m__2202_02]) ).
cnf(c_0_15,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13]),c_0_14])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : NUM557+1 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.15 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.15/0.36 % Computer : n016.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Fri Aug 25 13:41:25 EDT 2023
% 0.15/0.36 % CPUTime :
% 0.22/0.60 start to proof: theBenchmark
% 0.22/0.66 % Version : CSE_E---1.5
% 0.22/0.66 % Problem : theBenchmark.p
% 0.22/0.66 % Proof found
% 0.22/0.66 % SZS status Theorem for theBenchmark.p
% 0.22/0.66 % SZS output start Proof
% See solution above
% 0.22/0.67 % Total time : 0.045000 s
% 0.22/0.67 % SZS output end Proof
% 0.22/0.67 % Total time : 0.049000 s
%------------------------------------------------------------------------------